/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 -i ../../../trunk/examples/svcomp/pthread-wmm/mix026_power.opt_tso.opt.i -------------------------------------------------------------------------------- This is Ultimate 0.2.3-dev-ac9dbd0-m [2023-08-24 11:39:45,111 INFO L188 SettingsManager]: Resetting all preferences to default values... [2023-08-24 11:39:45,169 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-24 11:39:45,173 WARN L101 SettingsManager]: Preference file contains the following unknown settings: [2023-08-24 11:39:45,174 WARN L103 SettingsManager]: * de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.Checked method. Library mode if empty. [2023-08-24 11:39:45,197 INFO L130 SettingsManager]: Preferences different from defaults after loading the file: [2023-08-24 11:39:45,197 INFO L151 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2023-08-24 11:39:45,201 INFO L153 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2023-08-24 11:39:45,201 INFO L151 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2023-08-24 11:39:45,202 INFO L153 SettingsManager]: * Create parallel compositions if possible=false [2023-08-24 11:39:45,203 INFO L153 SettingsManager]: * Use SBE=true [2023-08-24 11:39:45,203 INFO L151 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2023-08-24 11:39:45,203 INFO L153 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2023-08-24 11:39:45,203 INFO L153 SettingsManager]: * sizeof long=4 [2023-08-24 11:39:45,203 INFO L153 SettingsManager]: * Overapproximate operations on floating types=true [2023-08-24 11:39:45,204 INFO L153 SettingsManager]: * sizeof POINTER=4 [2023-08-24 11:39:45,204 INFO L153 SettingsManager]: * Check division by zero=IGNORE [2023-08-24 11:39:45,204 INFO L153 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2023-08-24 11:39:45,204 INFO L153 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2023-08-24 11:39:45,204 INFO L153 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2023-08-24 11:39:45,205 INFO L153 SettingsManager]: * sizeof long double=12 [2023-08-24 11:39:45,207 INFO L153 SettingsManager]: * Check if freed pointer was valid=false [2023-08-24 11:39:45,207 INFO L153 SettingsManager]: * Use constant arrays=true [2023-08-24 11:39:45,208 INFO L151 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2023-08-24 11:39:45,208 INFO L153 SettingsManager]: * Size of a code block=SequenceOfStatements [2023-08-24 11:39:45,208 INFO L153 SettingsManager]: * To the following directory=./dump/ [2023-08-24 11:39:45,208 INFO L153 SettingsManager]: * SMT solver=External_DefaultMode [2023-08-24 11:39:45,208 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2023-08-24 11:39:45,209 INFO L151 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2023-08-24 11:39:45,209 INFO L153 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2023-08-24 11:39:45,209 INFO L153 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopsAndPotentialCycles [2023-08-24 11:39:45,209 INFO L153 SettingsManager]: * Trace refinement strategy=CAMEL [2023-08-24 11:39:45,209 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2023-08-24 11:39:45,209 INFO L153 SettingsManager]: * Automaton type used in concurrency analysis=PETRI_NET [2023-08-24 11:39:45,209 INFO L153 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2023-08-24 11:39:45,210 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 [2023-08-24 11:39:45,455 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2023-08-24 11:39:45,470 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2023-08-24 11:39:45,472 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2023-08-24 11:39:45,473 INFO L270 PluginConnector]: Initializing CDTParser... [2023-08-24 11:39:45,474 INFO L274 PluginConnector]: CDTParser initialized [2023-08-24 11:39:45,475 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-24 11:39:46,346 INFO L533 CDTParser]: Created temporary CDT project at NULL [2023-08-24 11:39:46,568 INFO L384 CDTParser]: Found 1 translation units. [2023-08-24 11:39:46,568 INFO L180 CDTParser]: Scanning /storage/repos/ultimate/trunk/examples/svcomp/pthread-wmm/mix026_power.opt_tso.opt.i [2023-08-24 11:39:46,587 INFO L427 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/8d03eed0d/8f7d479dfb8c470e86ed32ae6c4cb4cb/FLAG553f4ff31 [2023-08-24 11:39:46,595 INFO L435 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/8d03eed0d/8f7d479dfb8c470e86ed32ae6c4cb4cb [2023-08-24 11:39:46,604 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2023-08-24 11:39:46,605 INFO L133 ToolchainWalker]: Walking toolchain with 5 elements. [2023-08-24 11:39:46,606 INFO L112 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2023-08-24 11:39:46,606 INFO L270 PluginConnector]: Initializing CACSL2BoogieTranslator... [2023-08-24 11:39:46,607 INFO L274 PluginConnector]: CACSL2BoogieTranslator initialized [2023-08-24 11:39:46,608 INFO L184 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 24.08 11:39:46" (1/1) ... [2023-08-24 11:39:46,608 INFO L204 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@35143896 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 24.08 11:39:46, skipping insertion in model container [2023-08-24 11:39:46,608 INFO L184 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 24.08 11:39:46" (1/1) ... [2023-08-24 11:39:46,643 INFO L176 MainTranslator]: Built tables and reachable declarations [2023-08-24 11:39:46,762 WARN L240 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/trunk/examples/svcomp/pthread-wmm/mix026_power.opt_tso.opt.i[1001,1014] [2023-08-24 11:39:46,923 INFO L209 PostProcessor]: Analyzing one entry point: main [2023-08-24 11:39:46,934 INFO L201 MainTranslator]: Completed pre-run [2023-08-24 11:39:46,942 WARN L240 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/trunk/examples/svcomp/pthread-wmm/mix026_power.opt_tso.opt.i[1001,1014] [2023-08-24 11:39:46,961 WARN L75 lationResultReporter]: Unsoundness Warning: unspecified type, defaulting to int C: short [268] [2023-08-24 11:39:46,962 WARN L75 lationResultReporter]: Unsoundness Warning: unspecified type, defaulting to int C: short [268] [2023-08-24 11:39:46,997 INFO L209 PostProcessor]: Analyzing one entry point: main [2023-08-24 11:39:47,026 WARN L669 CHandler]: The function __VERIFIER_atomic_begin is called, but not defined or handled by StandardFunctionHandler. [2023-08-24 11:39:47,026 WARN L669 CHandler]: The function __VERIFIER_atomic_end is called, but not defined or handled by StandardFunctionHandler. [2023-08-24 11:39:47,031 INFO L206 MainTranslator]: Completed translation [2023-08-24 11:39:47,033 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 24.08 11:39:47 WrapperNode [2023-08-24 11:39:47,033 INFO L131 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2023-08-24 11:39:47,034 INFO L112 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2023-08-24 11:39:47,034 INFO L270 PluginConnector]: Initializing Boogie Procedure Inliner... [2023-08-24 11:39:47,034 INFO L274 PluginConnector]: Boogie Procedure Inliner initialized [2023-08-24 11:39:47,038 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 24.08 11:39:47" (1/1) ... [2023-08-24 11:39:47,062 INFO L184 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 24.08 11:39:47" (1/1) ... [2023-08-24 11:39:47,085 INFO L138 Inliner]: procedures = 177, calls = 69, calls flagged for inlining = 5, calls inlined = 5, statements flattened = 145 [2023-08-24 11:39:47,085 INFO L131 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2023-08-24 11:39:47,085 INFO L112 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2023-08-24 11:39:47,085 INFO L270 PluginConnector]: Initializing Boogie Preprocessor... [2023-08-24 11:39:47,086 INFO L274 PluginConnector]: Boogie Preprocessor initialized [2023-08-24 11:39:47,092 INFO L184 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 24.08 11:39:47" (1/1) ... [2023-08-24 11:39:47,092 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 24.08 11:39:47" (1/1) ... [2023-08-24 11:39:47,103 INFO L184 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 24.08 11:39:47" (1/1) ... [2023-08-24 11:39:47,103 INFO L184 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 24.08 11:39:47" (1/1) ... [2023-08-24 11:39:47,112 INFO L184 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 24.08 11:39:47" (1/1) ... [2023-08-24 11:39:47,113 INFO L184 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 24.08 11:39:47" (1/1) ... [2023-08-24 11:39:47,115 INFO L184 PluginConnector]: Executing the observer LTLStepAnnotator from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 24.08 11:39:47" (1/1) ... [2023-08-24 11:39:47,116 INFO L184 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 24.08 11:39:47" (1/1) ... [2023-08-24 11:39:47,118 INFO L131 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2023-08-24 11:39:47,119 INFO L112 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2023-08-24 11:39:47,119 INFO L270 PluginConnector]: Initializing RCFGBuilder... [2023-08-24 11:39:47,119 INFO L274 PluginConnector]: RCFGBuilder initialized [2023-08-24 11:39:47,119 INFO L184 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 24.08 11:39:47" (1/1) ... [2023-08-24 11:39:47,134 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2023-08-24 11:39:47,145 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2023-08-24 11:39:47,154 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-24 11:39:47,176 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-24 11:39:47,190 INFO L130 BoogieDeclarations]: Found specification of procedure write~int [2023-08-24 11:39:47,190 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_atomic_begin [2023-08-24 11:39:47,190 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2023-08-24 11:39:47,190 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnStack [2023-08-24 11:39:47,190 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.dealloc [2023-08-24 11:39:47,190 INFO L130 BoogieDeclarations]: Found specification of procedure P0 [2023-08-24 11:39:47,191 INFO L138 BoogieDeclarations]: Found implementation of procedure P0 [2023-08-24 11:39:47,191 INFO L130 BoogieDeclarations]: Found specification of procedure P1 [2023-08-24 11:39:47,191 INFO L138 BoogieDeclarations]: Found implementation of procedure P1 [2023-08-24 11:39:47,191 INFO L130 BoogieDeclarations]: Found specification of procedure P2 [2023-08-24 11:39:47,192 INFO L138 BoogieDeclarations]: Found implementation of procedure P2 [2023-08-24 11:39:47,192 INFO L130 BoogieDeclarations]: Found specification of procedure P3 [2023-08-24 11:39:47,192 INFO L138 BoogieDeclarations]: Found implementation of procedure P3 [2023-08-24 11:39:47,193 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int [2023-08-24 11:39:47,193 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_atomic_end [2023-08-24 11:39:47,193 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2023-08-24 11:39:47,193 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2023-08-24 11:39:47,194 WARN L210 CfgBuilder]: User set CodeBlockSize to SequenceOfStatements but program contains fork statements. Overwriting the user preferences and setting CodeBlockSize to OneNontrivialStatement [2023-08-24 11:39:47,303 INFO L236 CfgBuilder]: Building ICFG [2023-08-24 11:39:47,305 INFO L262 CfgBuilder]: Building CFG for each procedure with an implementation [2023-08-24 11:39:47,575 INFO L277 CfgBuilder]: Performing block encoding [2023-08-24 11:39:47,632 INFO L297 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2023-08-24 11:39:47,632 INFO L302 CfgBuilder]: Removed 0 assume(true) statements. [2023-08-24 11:39:47,634 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 24.08 11:39:47 BoogieIcfgContainer [2023-08-24 11:39:47,634 INFO L131 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2023-08-24 11:39:47,635 INFO L112 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2023-08-24 11:39:47,635 INFO L270 PluginConnector]: Initializing TraceAbstraction... [2023-08-24 11:39:47,637 INFO L274 PluginConnector]: TraceAbstraction initialized [2023-08-24 11:39:47,637 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 24.08 11:39:46" (1/3) ... [2023-08-24 11:39:47,638 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@6696f15c and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 24.08 11:39:47, skipping insertion in model container [2023-08-24 11:39:47,638 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 24.08 11:39:47" (2/3) ... [2023-08-24 11:39:47,638 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@6696f15c and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 24.08 11:39:47, skipping insertion in model container [2023-08-24 11:39:47,638 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 24.08 11:39:47" (3/3) ... [2023-08-24 11:39:47,640 INFO L112 eAbstractionObserver]: Analyzing ICFG mix026_power.opt_tso.opt.i [2023-08-24 11:39:47,650 INFO L203 ceAbstractionStarter]: Automizer settings: Hoare:false NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2023-08-24 11:39:47,650 INFO L162 ceAbstractionStarter]: Applying trace abstraction to program that has 2 error locations. [2023-08-24 11:39:47,651 INFO L515 ceAbstractionStarter]: Constructing petrified ICFG for 1 thread instances. [2023-08-24 11:39:47,686 INFO L144 ThreadInstanceAdder]: Constructed 0 joinOtherThreadTransitions. [2023-08-24 11:39:47,707 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 141 places, 130 transitions, 280 flow [2023-08-24 11:39:47,756 INFO L124 PetriNetUnfolderBase]: 2/126 cut-off events. [2023-08-24 11:39:47,756 INFO L125 PetriNetUnfolderBase]: For 0/0 co-relation queries the response was YES. [2023-08-24 11:39:47,761 INFO L83 FinitePrefix]: Finished finitePrefix Result has 139 conditions, 126 events. 2/126 cut-off events. For 0/0 co-relation queries the response was YES. Maximal size of possible extension queue 3. Compared 73 event pairs, 0 based on Foata normal form. 0/122 useless extension candidates. Maximal degree in co-relation 87. Up to 2 conditions per place. [2023-08-24 11:39:47,761 INFO L82 GeneralOperation]: Start removeDead. Operand has 141 places, 130 transitions, 280 flow [2023-08-24 11:39:47,766 INFO L88 GeneralOperation]: Finished RemoveDead, result has has 137 places, 126 transitions, 264 flow [2023-08-24 11:39:47,768 INFO L124 etLargeBlockEncoding]: Petri net LBE is using variable-based independence relation. [2023-08-24 11:39:47,796 INFO L131 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 137 places, 126 transitions, 264 flow [2023-08-24 11:39:47,798 INFO L113 LiptonReduction]: Starting Lipton reduction on Petri net that has 137 places, 126 transitions, 264 flow [2023-08-24 11:39:47,798 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 137 places, 126 transitions, 264 flow [2023-08-24 11:39:47,821 INFO L124 PetriNetUnfolderBase]: 2/126 cut-off events. [2023-08-24 11:39:47,822 INFO L125 PetriNetUnfolderBase]: For 0/0 co-relation queries the response was YES. [2023-08-24 11:39:47,823 INFO L83 FinitePrefix]: Finished finitePrefix Result has 139 conditions, 126 events. 2/126 cut-off events. For 0/0 co-relation queries the response was YES. Maximal size of possible extension queue 3. Compared 73 event pairs, 0 based on Foata normal form. 0/122 useless extension candidates. Maximal degree in co-relation 87. Up to 2 conditions per place. [2023-08-24 11:39:47,825 INFO L119 LiptonReduction]: Number of co-enabled transitions 3000 [2023-08-24 11:39:51,087 INFO L134 LiptonReduction]: Checked pairs total: 7767 [2023-08-24 11:39:51,088 INFO L136 LiptonReduction]: Total number of compositions: 107 [2023-08-24 11:39:51,096 INFO L356 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2023-08-24 11:39:51,100 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;@673313c5, mLbeIndependenceSettings=[IndependenceType=SYNTACTIC, AbstractionType=NONE, UseConditional=, UseSemiCommutativity=, Solver=, SolverTimeout=] [2023-08-24 11:39:51,100 INFO L358 AbstractCegarLoop]: Starting to check reachability of 7 error locations. [2023-08-24 11:39:51,103 INFO L185 PetriNetUnfolderBase]: Found word, exiting Unfolder. [2023-08-24 11:39:51,103 INFO L124 PetriNetUnfolderBase]: 0/6 cut-off events. [2023-08-24 11:39:51,104 INFO L125 PetriNetUnfolderBase]: For 0/0 co-relation queries the response was YES. [2023-08-24 11:39:51,104 INFO L200 CegarLoopForPetriNet]: Found error trace [2023-08-24 11:39:51,104 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1] [2023-08-24 11:39:51,104 INFO L420 AbstractCegarLoop]: === Iteration 1 === Targeting P1Err0ASSERT_VIOLATIONERROR_FUNCTION === [P1Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 4 more)] === [2023-08-24 11:39:51,107 INFO L145 PredicateUnifier]: Initialized classic predicate unifier [2023-08-24 11:39:51,107 INFO L85 PathProgramCache]: Analyzing trace with hash 514990672, now seen corresponding path program 1 times [2023-08-24 11:39:51,113 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-08-24 11:39:51,113 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2098203626] [2023-08-24 11:39:51,113 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-08-24 11:39:51,114 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-08-24 11:39:51,223 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-08-24 11:39:51,357 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-24 11:39:51,358 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-08-24 11:39:51,358 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2098203626] [2023-08-24 11:39:51,358 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2098203626] provided 1 perfect and 0 imperfect interpolant sequences [2023-08-24 11:39:51,358 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-08-24 11:39:51,358 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [1] imperfect sequences [] total 1 [2023-08-24 11:39:51,359 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1108609284] [2023-08-24 11:39:51,360 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-08-24 11:39:51,367 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2023-08-24 11:39:51,370 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-08-24 11:39:51,389 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2023-08-24 11:39:51,390 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2023-08-24 11:39:51,391 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 115 out of 237 [2023-08-24 11:39:51,393 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 42 places, 29 transitions, 70 flow. Second operand has 3 states, 3 states have (on average 116.66666666666667) internal successors, (350), 3 states have internal predecessors, (350), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-24 11:39:51,393 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2023-08-24 11:39:51,393 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 115 of 237 [2023-08-24 11:39:51,394 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2023-08-24 11:39:51,957 INFO L124 PetriNetUnfolderBase]: 3927/5792 cut-off events. [2023-08-24 11:39:51,957 INFO L125 PetriNetUnfolderBase]: For 76/76 co-relation queries the response was YES. [2023-08-24 11:39:51,969 INFO L83 FinitePrefix]: Finished finitePrefix Result has 11344 conditions, 5792 events. 3927/5792 cut-off events. For 76/76 co-relation queries the response was YES. Maximal size of possible extension queue 304. Compared 32920 event pairs, 717 based on Foata normal form. 0/5464 useless extension candidates. Maximal degree in co-relation 11332. Up to 4291 conditions per place. [2023-08-24 11:39:51,987 INFO L140 encePairwiseOnDemand]: 234/237 looper letters, 37 selfloop transitions, 2 changer transitions 2/45 dead transitions. [2023-08-24 11:39:51,987 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 43 places, 45 transitions, 190 flow [2023-08-24 11:39:51,989 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2023-08-24 11:39:51,991 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2023-08-24 11:39:51,998 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 387 transitions. [2023-08-24 11:39:52,001 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.5443037974683544 [2023-08-24 11:39:52,001 INFO L72 ComplementDD]: Start complementDD. Operand 3 states and 387 transitions. [2023-08-24 11:39:52,002 INFO L73 IsDeterministic]: Start isDeterministic. Operand 3 states and 387 transitions. [2023-08-24 11:39:52,004 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2023-08-24 11:39:52,005 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 3 states and 387 transitions. [2023-08-24 11:39:52,007 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 4 states, 3 states have (on average 129.0) internal successors, (387), 3 states have internal predecessors, (387), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-24 11:39:52,009 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 4 states, 4 states have (on average 237.0) internal successors, (948), 4 states have internal predecessors, (948), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-24 11:39:52,010 INFO L81 ComplementDD]: Finished complementDD. Result has 4 states, 4 states have (on average 237.0) internal successors, (948), 4 states have internal predecessors, (948), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-24 11:39:52,011 INFO L175 Difference]: Start difference. First operand has 42 places, 29 transitions, 70 flow. Second operand 3 states and 387 transitions. [2023-08-24 11:39:52,011 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 43 places, 45 transitions, 190 flow [2023-08-24 11:39:52,013 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 39 places, 45 transitions, 184 flow, removed 0 selfloop flow, removed 4 redundant places. [2023-08-24 11:39:52,014 INFO L231 Difference]: Finished difference. Result has 39 places, 27 transitions, 66 flow [2023-08-24 11:39:52,015 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=237, PETRI_DIFFERENCE_MINUEND_FLOW=64, PETRI_DIFFERENCE_MINUEND_PLACES=37, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=28, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=2, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=26, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=66, PETRI_PLACES=39, PETRI_TRANSITIONS=27} [2023-08-24 11:39:52,018 INFO L281 CegarLoopForPetriNet]: 42 programPoint places, -3 predicate places. [2023-08-24 11:39:52,018 INFO L495 AbstractCegarLoop]: Abstraction has has 39 places, 27 transitions, 66 flow [2023-08-24 11:39:52,018 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 116.66666666666667) internal successors, (350), 3 states have internal predecessors, (350), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-24 11:39:52,018 INFO L200 CegarLoopForPetriNet]: Found error trace [2023-08-24 11:39:52,018 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-08-24 11:39:52,019 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable0 [2023-08-24 11:39:52,019 INFO L420 AbstractCegarLoop]: === Iteration 2 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [P1Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 4 more)] === [2023-08-24 11:39:52,019 INFO L145 PredicateUnifier]: Initialized classic predicate unifier [2023-08-24 11:39:52,019 INFO L85 PathProgramCache]: Analyzing trace with hash 2000565703, now seen corresponding path program 1 times [2023-08-24 11:39:52,019 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-08-24 11:39:52,019 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1388215076] [2023-08-24 11:39:52,020 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-08-24 11:39:52,020 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-08-24 11:39:52,039 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-08-24 11:39:52,229 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-24 11:39:52,229 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-08-24 11:39:52,229 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1388215076] [2023-08-24 11:39:52,229 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1388215076] provided 1 perfect and 0 imperfect interpolant sequences [2023-08-24 11:39:52,229 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-08-24 11:39:52,230 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [1] imperfect sequences [] total 1 [2023-08-24 11:39:52,230 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [654002220] [2023-08-24 11:39:52,230 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-08-24 11:39:52,230 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2023-08-24 11:39:52,231 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-08-24 11:39:52,231 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2023-08-24 11:39:52,231 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2023-08-24 11:39:52,233 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 105 out of 237 [2023-08-24 11:39:52,233 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 39 places, 27 transitions, 66 flow. Second operand has 3 states, 3 states have (on average 108.66666666666667) internal successors, (326), 3 states have internal predecessors, (326), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-24 11:39:52,234 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2023-08-24 11:39:52,234 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 105 of 237 [2023-08-24 11:39:52,234 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2023-08-24 11:39:53,233 INFO L124 PetriNetUnfolderBase]: 11225/15342 cut-off events. [2023-08-24 11:39:53,234 INFO L125 PetriNetUnfolderBase]: For 792/792 co-relation queries the response was YES. [2023-08-24 11:39:53,244 INFO L83 FinitePrefix]: Finished finitePrefix Result has 31828 conditions, 15342 events. 11225/15342 cut-off events. For 792/792 co-relation queries the response was YES. Maximal size of possible extension queue 517. Compared 77111 event pairs, 3963 based on Foata normal form. 368/15710 useless extension candidates. Maximal degree in co-relation 31818. Up to 10655 conditions per place. [2023-08-24 11:39:53,288 INFO L140 encePairwiseOnDemand]: 229/237 looper letters, 44 selfloop transitions, 7 changer transitions 0/51 dead transitions. [2023-08-24 11:39:53,289 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 40 places, 51 transitions, 224 flow [2023-08-24 11:39:53,289 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2023-08-24 11:39:53,289 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2023-08-24 11:39:53,290 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 367 transitions. [2023-08-24 11:39:53,290 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.5161744022503516 [2023-08-24 11:39:53,290 INFO L72 ComplementDD]: Start complementDD. Operand 3 states and 367 transitions. [2023-08-24 11:39:53,290 INFO L73 IsDeterministic]: Start isDeterministic. Operand 3 states and 367 transitions. [2023-08-24 11:39:53,290 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2023-08-24 11:39:53,290 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 3 states and 367 transitions. [2023-08-24 11:39:53,291 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 4 states, 3 states have (on average 122.33333333333333) internal successors, (367), 3 states have internal predecessors, (367), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-24 11:39:53,292 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 4 states, 4 states have (on average 237.0) internal successors, (948), 4 states have internal predecessors, (948), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-24 11:39:53,293 INFO L81 ComplementDD]: Finished complementDD. Result has 4 states, 4 states have (on average 237.0) internal successors, (948), 4 states have internal predecessors, (948), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-24 11:39:53,293 INFO L175 Difference]: Start difference. First operand has 39 places, 27 transitions, 66 flow. Second operand 3 states and 367 transitions. [2023-08-24 11:39:53,293 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 40 places, 51 transitions, 224 flow [2023-08-24 11:39:53,294 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 38 places, 51 transitions, 218 flow, removed 0 selfloop flow, removed 2 redundant places. [2023-08-24 11:39:53,295 INFO L231 Difference]: Finished difference. Result has 40 places, 33 transitions, 116 flow [2023-08-24 11:39:53,295 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=237, PETRI_DIFFERENCE_MINUEND_FLOW=62, PETRI_DIFFERENCE_MINUEND_PLACES=36, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=27, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=1, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=20, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=116, PETRI_PLACES=40, PETRI_TRANSITIONS=33} [2023-08-24 11:39:53,295 INFO L281 CegarLoopForPetriNet]: 42 programPoint places, -2 predicate places. [2023-08-24 11:39:53,295 INFO L495 AbstractCegarLoop]: Abstraction has has 40 places, 33 transitions, 116 flow [2023-08-24 11:39:53,296 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 108.66666666666667) internal successors, (326), 3 states have internal predecessors, (326), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-24 11:39:53,296 INFO L200 CegarLoopForPetriNet]: Found error trace [2023-08-24 11:39:53,296 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-08-24 11:39:53,296 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1 [2023-08-24 11:39:53,296 INFO L420 AbstractCegarLoop]: === Iteration 3 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [P1Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 4 more)] === [2023-08-24 11:39:53,297 INFO L145 PredicateUnifier]: Initialized classic predicate unifier [2023-08-24 11:39:53,297 INFO L85 PathProgramCache]: Analyzing trace with hash 1887992981, now seen corresponding path program 1 times [2023-08-24 11:39:53,297 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-08-24 11:39:53,297 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [306770104] [2023-08-24 11:39:53,297 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-08-24 11:39:53,297 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-08-24 11:39:53,312 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-08-24 11:39:53,389 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-24 11:39:53,389 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-08-24 11:39:53,389 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [306770104] [2023-08-24 11:39:53,390 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [306770104] provided 1 perfect and 0 imperfect interpolant sequences [2023-08-24 11:39:53,390 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-08-24 11:39:53,390 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [1] imperfect sequences [] total 1 [2023-08-24 11:39:53,390 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1764817665] [2023-08-24 11:39:53,391 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-08-24 11:39:53,391 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2023-08-24 11:39:53,391 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-08-24 11:39:53,391 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2023-08-24 11:39:53,392 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2023-08-24 11:39:53,392 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 113 out of 237 [2023-08-24 11:39:53,392 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 40 places, 33 transitions, 116 flow. Second operand has 3 states, 3 states have (on average 117.0) internal successors, (351), 3 states have internal predecessors, (351), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-24 11:39:53,393 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2023-08-24 11:39:53,393 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 113 of 237 [2023-08-24 11:39:53,393 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2023-08-24 11:39:54,145 INFO L124 PetriNetUnfolderBase]: 8107/11650 cut-off events. [2023-08-24 11:39:54,145 INFO L125 PetriNetUnfolderBase]: For 3454/3506 co-relation queries the response was YES. [2023-08-24 11:39:54,159 INFO L83 FinitePrefix]: Finished finitePrefix Result has 27046 conditions, 11650 events. 8107/11650 cut-off events. For 3454/3506 co-relation queries the response was YES. Maximal size of possible extension queue 486. Compared 64474 event pairs, 2842 based on Foata normal form. 188/11707 useless extension candidates. Maximal degree in co-relation 27034. Up to 7144 conditions per place. [2023-08-24 11:39:54,192 INFO L140 encePairwiseOnDemand]: 234/237 looper letters, 36 selfloop transitions, 3 changer transitions 0/45 dead transitions. [2023-08-24 11:39:54,193 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 42 places, 45 transitions, 224 flow [2023-08-24 11:39:54,193 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2023-08-24 11:39:54,193 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2023-08-24 11:39:54,194 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 375 transitions. [2023-08-24 11:39:54,194 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.5274261603375527 [2023-08-24 11:39:54,194 INFO L72 ComplementDD]: Start complementDD. Operand 3 states and 375 transitions. [2023-08-24 11:39:54,194 INFO L73 IsDeterministic]: Start isDeterministic. Operand 3 states and 375 transitions. [2023-08-24 11:39:54,194 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2023-08-24 11:39:54,194 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 3 states and 375 transitions. [2023-08-24 11:39:54,195 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 4 states, 3 states have (on average 125.0) internal successors, (375), 3 states have internal predecessors, (375), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-24 11:39:54,196 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 4 states, 4 states have (on average 237.0) internal successors, (948), 4 states have internal predecessors, (948), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-24 11:39:54,196 INFO L81 ComplementDD]: Finished complementDD. Result has 4 states, 4 states have (on average 237.0) internal successors, (948), 4 states have internal predecessors, (948), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-24 11:39:54,196 INFO L175 Difference]: Start difference. First operand has 40 places, 33 transitions, 116 flow. Second operand 3 states and 375 transitions. [2023-08-24 11:39:54,197 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 42 places, 45 transitions, 224 flow [2023-08-24 11:39:54,209 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 40 places, 45 transitions, 208 flow, removed 0 selfloop flow, removed 2 redundant places. [2023-08-24 11:39:54,210 INFO L231 Difference]: Finished difference. Result has 41 places, 33 transitions, 113 flow [2023-08-24 11:39:54,210 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=237, PETRI_DIFFERENCE_MINUEND_FLOW=102, PETRI_DIFFERENCE_MINUEND_PLACES=38, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=33, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=3, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=30, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=113, PETRI_PLACES=41, PETRI_TRANSITIONS=33} [2023-08-24 11:39:54,210 INFO L281 CegarLoopForPetriNet]: 42 programPoint places, -1 predicate places. [2023-08-24 11:39:54,210 INFO L495 AbstractCegarLoop]: Abstraction has has 41 places, 33 transitions, 113 flow [2023-08-24 11:39:54,211 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 117.0) internal successors, (351), 3 states have internal predecessors, (351), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-24 11:39:54,211 INFO L200 CegarLoopForPetriNet]: Found error trace [2023-08-24 11:39:54,211 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-08-24 11:39:54,211 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2 [2023-08-24 11:39:54,211 INFO L420 AbstractCegarLoop]: === Iteration 4 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [P1Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 4 more)] === [2023-08-24 11:39:54,211 INFO L145 PredicateUnifier]: Initialized classic predicate unifier [2023-08-24 11:39:54,211 INFO L85 PathProgramCache]: Analyzing trace with hash -1640365980, now seen corresponding path program 1 times [2023-08-24 11:39:54,212 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-08-24 11:39:54,212 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1559402115] [2023-08-24 11:39:54,212 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-08-24 11:39:54,212 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-08-24 11:39:54,231 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-08-24 11:39:54,320 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-24 11:39:54,320 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-08-24 11:39:54,320 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1559402115] [2023-08-24 11:39:54,320 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1559402115] provided 1 perfect and 0 imperfect interpolant sequences [2023-08-24 11:39:54,321 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-08-24 11:39:54,321 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2023-08-24 11:39:54,321 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [856001822] [2023-08-24 11:39:54,321 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-08-24 11:39:54,321 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2023-08-24 11:39:54,321 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-08-24 11:39:54,322 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2023-08-24 11:39:54,322 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2023-08-24 11:39:54,322 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 108 out of 237 [2023-08-24 11:39:54,323 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 41 places, 33 transitions, 113 flow. Second operand has 4 states, 4 states have (on average 111.0) internal successors, (444), 4 states have internal predecessors, (444), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-24 11:39:54,323 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2023-08-24 11:39:54,323 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 108 of 237 [2023-08-24 11:39:54,323 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2023-08-24 11:39:54,943 INFO L292 olderBase$Statistics]: inserting event number 4 for the transition-marking pair ([395] L838-->L845: Formula: (let ((.cse3 (not (= (mod v_~x$r_buff1_thd4~0_20 256) 0))) (.cse4 (not (= (mod v_~x$w_buff0_used~0_99 256) 0))) (.cse5 (not (= (mod v_~x$r_buff0_thd4~0_24 256) 0)))) (let ((.cse0 (and .cse5 (not (= (mod v_~x$w_buff0_used~0_100 256) 0)))) (.cse2 (and .cse5 .cse4)) (.cse1 (and (not (= (mod v_~x$w_buff1_used~0_93 256) 0)) .cse3))) (and (= v_~x~0_38 (ite .cse0 v_~x$w_buff0~0_35 (ite .cse1 v_~x$w_buff1~0_28 v_~x~0_39))) (= (ite .cse2 0 v_~x$r_buff0_thd4~0_24) v_~x$r_buff0_thd4~0_23) (= v_~x$r_buff1_thd4~0_19 (ite (or (and (not (= (mod v_~x$w_buff1_used~0_92 256) 0)) .cse3) (and .cse4 (not (= (mod v_~x$r_buff0_thd4~0_23 256) 0)))) 0 v_~x$r_buff1_thd4~0_20)) (= (ite .cse0 0 v_~x$w_buff0_used~0_100) v_~x$w_buff0_used~0_99) (= v_~x$w_buff1_used~0_92 (ite (or .cse2 .cse1) 0 v_~x$w_buff1_used~0_93))))) InVars {~x$w_buff0~0=v_~x$w_buff0~0_35, ~x$w_buff1~0=v_~x$w_buff1~0_28, ~x$w_buff1_used~0=v_~x$w_buff1_used~0_93, ~x$r_buff0_thd4~0=v_~x$r_buff0_thd4~0_24, ~x~0=v_~x~0_39, ~x$r_buff1_thd4~0=v_~x$r_buff1_thd4~0_20, ~x$w_buff0_used~0=v_~x$w_buff0_used~0_100} OutVars{~x$w_buff0~0=v_~x$w_buff0~0_35, ~x$w_buff1~0=v_~x$w_buff1~0_28, ~x$w_buff1_used~0=v_~x$w_buff1_used~0_92, ~x$r_buff0_thd4~0=v_~x$r_buff0_thd4~0_23, ~x~0=v_~x~0_38, ~x$r_buff1_thd4~0=v_~x$r_buff1_thd4~0_19, ~x$w_buff0_used~0=v_~x$w_buff0_used~0_99} AuxVars[] AssignedVars[~x$w_buff1_used~0, ~x$r_buff0_thd4~0, ~x~0, ~x$r_buff1_thd4~0, ~x$w_buff0_used~0][71], [154#true, 32#L770true, P3Thread1of1ForFork0InUse, 47#L795true, P1Thread1of1ForFork1InUse, 43#P2EXITtrue, P0Thread1of1ForFork3InUse, 159#true, P2Thread1of1ForFork2InUse, Black: 150#(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))), 45#L873true, Black: 156#(= ~__unbuffered_p3_EAX~0 0), 92#L845true]) [2023-08-24 11:39:54,944 INFO L294 olderBase$Statistics]: this new event has 21 ancestors and is cut-off event [2023-08-24 11:39:54,944 INFO L297 olderBase$Statistics]: existing Event has 21 ancestors and is cut-off event [2023-08-24 11:39:54,944 INFO L297 olderBase$Statistics]: existing Event has 21 ancestors and is cut-off event [2023-08-24 11:39:54,944 INFO L297 olderBase$Statistics]: existing Event has 21 ancestors and is cut-off event [2023-08-24 11:39:54,997 INFO L292 olderBase$Statistics]: inserting event number 4 for the transition-marking pair ([395] L838-->L845: Formula: (let ((.cse3 (not (= (mod v_~x$r_buff1_thd4~0_20 256) 0))) (.cse4 (not (= (mod v_~x$w_buff0_used~0_99 256) 0))) (.cse5 (not (= (mod v_~x$r_buff0_thd4~0_24 256) 0)))) (let ((.cse0 (and .cse5 (not (= (mod v_~x$w_buff0_used~0_100 256) 0)))) (.cse2 (and .cse5 .cse4)) (.cse1 (and (not (= (mod v_~x$w_buff1_used~0_93 256) 0)) .cse3))) (and (= v_~x~0_38 (ite .cse0 v_~x$w_buff0~0_35 (ite .cse1 v_~x$w_buff1~0_28 v_~x~0_39))) (= (ite .cse2 0 v_~x$r_buff0_thd4~0_24) v_~x$r_buff0_thd4~0_23) (= v_~x$r_buff1_thd4~0_19 (ite (or (and (not (= (mod v_~x$w_buff1_used~0_92 256) 0)) .cse3) (and .cse4 (not (= (mod v_~x$r_buff0_thd4~0_23 256) 0)))) 0 v_~x$r_buff1_thd4~0_20)) (= (ite .cse0 0 v_~x$w_buff0_used~0_100) v_~x$w_buff0_used~0_99) (= v_~x$w_buff1_used~0_92 (ite (or .cse2 .cse1) 0 v_~x$w_buff1_used~0_93))))) InVars {~x$w_buff0~0=v_~x$w_buff0~0_35, ~x$w_buff1~0=v_~x$w_buff1~0_28, ~x$w_buff1_used~0=v_~x$w_buff1_used~0_93, ~x$r_buff0_thd4~0=v_~x$r_buff0_thd4~0_24, ~x~0=v_~x~0_39, ~x$r_buff1_thd4~0=v_~x$r_buff1_thd4~0_20, ~x$w_buff0_used~0=v_~x$w_buff0_used~0_100} OutVars{~x$w_buff0~0=v_~x$w_buff0~0_35, ~x$w_buff1~0=v_~x$w_buff1~0_28, ~x$w_buff1_used~0=v_~x$w_buff1_used~0_92, ~x$r_buff0_thd4~0=v_~x$r_buff0_thd4~0_23, ~x~0=v_~x~0_38, ~x$r_buff1_thd4~0=v_~x$r_buff1_thd4~0_19, ~x$w_buff0_used~0=v_~x$w_buff0_used~0_99} AuxVars[] AssignedVars[~x$w_buff1_used~0, ~x$r_buff0_thd4~0, ~x~0, ~x$r_buff1_thd4~0, ~x$w_buff0_used~0][71], [154#true, P3Thread1of1ForFork0InUse, 47#L795true, P1Thread1of1ForFork1InUse, 43#P2EXITtrue, 159#true, P0Thread1of1ForFork3InUse, P2Thread1of1ForFork2InUse, 112#P0EXITtrue, Black: 150#(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))), 45#L873true, Black: 156#(= ~__unbuffered_p3_EAX~0 0), 92#L845true]) [2023-08-24 11:39:54,997 INFO L294 olderBase$Statistics]: this new event has 22 ancestors and is cut-off event [2023-08-24 11:39:54,997 INFO L297 olderBase$Statistics]: existing Event has 22 ancestors and is cut-off event [2023-08-24 11:39:54,997 INFO L297 olderBase$Statistics]: existing Event has 22 ancestors and is cut-off event [2023-08-24 11:39:54,997 INFO L297 olderBase$Statistics]: existing Event has 22 ancestors and is cut-off event [2023-08-24 11:39:54,998 INFO L292 olderBase$Statistics]: inserting event number 4 for the transition-marking pair ([502] L880-->ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION: Formula: (and (= |v_ULTIMATE.start___VERIFIER_assert_#in~expression#1_15| |v_ULTIMATE.start___VERIFIER_assert_~expression#1_27|) (= v_~main$tmp_guard1~0_14 (ite (= (ite (not (and (= v_~z~0_16 2) (= v_~__unbuffered_p1_EAX~0_14 0) (= 0 v_~__unbuffered_p3_EBX~0_12) (= 2 v_~__unbuffered_p3_EAX~0_14) (= v_~__unbuffered_p0_EAX~0_22 0))) 1 0) 0) 0 1)) (= (mod v_~main$tmp_guard1~0_14 256) |v_ULTIMATE.start___VERIFIER_assert_#in~expression#1_15|) (= |v_ULTIMATE.start___VERIFIER_assert_~expression#1_27| 0)) InVars {~__unbuffered_p0_EAX~0=v_~__unbuffered_p0_EAX~0_22, ~__unbuffered_p1_EAX~0=v_~__unbuffered_p1_EAX~0_14, ~__unbuffered_p3_EAX~0=v_~__unbuffered_p3_EAX~0_14, ~z~0=v_~z~0_16, ~__unbuffered_p3_EBX~0=v_~__unbuffered_p3_EBX~0_12} OutVars{ULTIMATE.start___VERIFIER_assert_~expression#1=|v_ULTIMATE.start___VERIFIER_assert_~expression#1_27|, ~__unbuffered_p0_EAX~0=v_~__unbuffered_p0_EAX~0_22, ULTIMATE.start___VERIFIER_assert_#in~expression#1=|v_ULTIMATE.start___VERIFIER_assert_#in~expression#1_15|, ~__unbuffered_p1_EAX~0=v_~__unbuffered_p1_EAX~0_14, ~__unbuffered_p3_EAX~0=v_~__unbuffered_p3_EAX~0_14, ~main$tmp_guard1~0=v_~main$tmp_guard1~0_14, ~z~0=v_~z~0_16, ~__unbuffered_p3_EBX~0=v_~__unbuffered_p3_EBX~0_12} AuxVars[] AssignedVars[ULTIMATE.start___VERIFIER_assert_~expression#1, ULTIMATE.start___VERIFIER_assert_#in~expression#1, ~main$tmp_guard1~0][74], [154#true, 32#L770true, P3Thread1of1ForFork0InUse, 47#L795true, P1Thread1of1ForFork1InUse, 43#P2EXITtrue, P0Thread1of1ForFork3InUse, 159#true, P2Thread1of1ForFork2InUse, 125#L838true, Black: 150#(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))), 121#ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTIONtrue, Black: 156#(= ~__unbuffered_p3_EAX~0 0)]) [2023-08-24 11:39:54,998 INFO L294 olderBase$Statistics]: this new event has 22 ancestors and is cut-off event [2023-08-24 11:39:54,998 INFO L297 olderBase$Statistics]: existing Event has 22 ancestors and is cut-off event [2023-08-24 11:39:54,998 INFO L297 olderBase$Statistics]: existing Event has 22 ancestors and is cut-off event [2023-08-24 11:39:54,998 INFO L297 olderBase$Statistics]: existing Event has 22 ancestors and is cut-off event [2023-08-24 11:39:54,999 INFO L292 olderBase$Statistics]: inserting event number 4 for the transition-marking pair ([395] L838-->L845: Formula: (let ((.cse3 (not (= (mod v_~x$r_buff1_thd4~0_20 256) 0))) (.cse4 (not (= (mod v_~x$w_buff0_used~0_99 256) 0))) (.cse5 (not (= (mod v_~x$r_buff0_thd4~0_24 256) 0)))) (let ((.cse0 (and .cse5 (not (= (mod v_~x$w_buff0_used~0_100 256) 0)))) (.cse2 (and .cse5 .cse4)) (.cse1 (and (not (= (mod v_~x$w_buff1_used~0_93 256) 0)) .cse3))) (and (= v_~x~0_38 (ite .cse0 v_~x$w_buff0~0_35 (ite .cse1 v_~x$w_buff1~0_28 v_~x~0_39))) (= (ite .cse2 0 v_~x$r_buff0_thd4~0_24) v_~x$r_buff0_thd4~0_23) (= v_~x$r_buff1_thd4~0_19 (ite (or (and (not (= (mod v_~x$w_buff1_used~0_92 256) 0)) .cse3) (and .cse4 (not (= (mod v_~x$r_buff0_thd4~0_23 256) 0)))) 0 v_~x$r_buff1_thd4~0_20)) (= (ite .cse0 0 v_~x$w_buff0_used~0_100) v_~x$w_buff0_used~0_99) (= v_~x$w_buff1_used~0_92 (ite (or .cse2 .cse1) 0 v_~x$w_buff1_used~0_93))))) InVars {~x$w_buff0~0=v_~x$w_buff0~0_35, ~x$w_buff1~0=v_~x$w_buff1~0_28, ~x$w_buff1_used~0=v_~x$w_buff1_used~0_93, ~x$r_buff0_thd4~0=v_~x$r_buff0_thd4~0_24, ~x~0=v_~x~0_39, ~x$r_buff1_thd4~0=v_~x$r_buff1_thd4~0_20, ~x$w_buff0_used~0=v_~x$w_buff0_used~0_100} OutVars{~x$w_buff0~0=v_~x$w_buff0~0_35, ~x$w_buff1~0=v_~x$w_buff1~0_28, ~x$w_buff1_used~0=v_~x$w_buff1_used~0_92, ~x$r_buff0_thd4~0=v_~x$r_buff0_thd4~0_23, ~x~0=v_~x~0_38, ~x$r_buff1_thd4~0=v_~x$r_buff1_thd4~0_19, ~x$w_buff0_used~0=v_~x$w_buff0_used~0_99} AuxVars[] AssignedVars[~x$w_buff1_used~0, ~x$r_buff0_thd4~0, ~x~0, ~x$r_buff1_thd4~0, ~x$w_buff0_used~0][71], [154#true, 32#L770true, P3Thread1of1ForFork0InUse, 47#L795true, P1Thread1of1ForFork1InUse, 43#P2EXITtrue, P0Thread1of1ForFork3InUse, 159#true, P2Thread1of1ForFork2InUse, 34#L880true, Black: 150#(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: 156#(= ~__unbuffered_p3_EAX~0 0), 92#L845true]) [2023-08-24 11:39:54,999 INFO L294 olderBase$Statistics]: this new event has 22 ancestors and is cut-off event [2023-08-24 11:39:54,999 INFO L297 olderBase$Statistics]: existing Event has 22 ancestors and is cut-off event [2023-08-24 11:39:54,999 INFO L297 olderBase$Statistics]: existing Event has 22 ancestors and is cut-off event [2023-08-24 11:39:54,999 INFO L297 olderBase$Statistics]: existing Event has 22 ancestors and is cut-off event [2023-08-24 11:39:55,037 INFO L292 olderBase$Statistics]: inserting event number 4 for the transition-marking pair ([502] L880-->ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION: Formula: (and (= |v_ULTIMATE.start___VERIFIER_assert_#in~expression#1_15| |v_ULTIMATE.start___VERIFIER_assert_~expression#1_27|) (= v_~main$tmp_guard1~0_14 (ite (= (ite (not (and (= v_~z~0_16 2) (= v_~__unbuffered_p1_EAX~0_14 0) (= 0 v_~__unbuffered_p3_EBX~0_12) (= 2 v_~__unbuffered_p3_EAX~0_14) (= v_~__unbuffered_p0_EAX~0_22 0))) 1 0) 0) 0 1)) (= (mod v_~main$tmp_guard1~0_14 256) |v_ULTIMATE.start___VERIFIER_assert_#in~expression#1_15|) (= |v_ULTIMATE.start___VERIFIER_assert_~expression#1_27| 0)) InVars {~__unbuffered_p0_EAX~0=v_~__unbuffered_p0_EAX~0_22, ~__unbuffered_p1_EAX~0=v_~__unbuffered_p1_EAX~0_14, ~__unbuffered_p3_EAX~0=v_~__unbuffered_p3_EAX~0_14, ~z~0=v_~z~0_16, ~__unbuffered_p3_EBX~0=v_~__unbuffered_p3_EBX~0_12} OutVars{ULTIMATE.start___VERIFIER_assert_~expression#1=|v_ULTIMATE.start___VERIFIER_assert_~expression#1_27|, ~__unbuffered_p0_EAX~0=v_~__unbuffered_p0_EAX~0_22, ULTIMATE.start___VERIFIER_assert_#in~expression#1=|v_ULTIMATE.start___VERIFIER_assert_#in~expression#1_15|, ~__unbuffered_p1_EAX~0=v_~__unbuffered_p1_EAX~0_14, ~__unbuffered_p3_EAX~0=v_~__unbuffered_p3_EAX~0_14, ~main$tmp_guard1~0=v_~main$tmp_guard1~0_14, ~z~0=v_~z~0_16, ~__unbuffered_p3_EBX~0=v_~__unbuffered_p3_EBX~0_12} AuxVars[] AssignedVars[ULTIMATE.start___VERIFIER_assert_~expression#1, ULTIMATE.start___VERIFIER_assert_#in~expression#1, ~main$tmp_guard1~0][74], [154#true, P3Thread1of1ForFork0InUse, 47#L795true, P1Thread1of1ForFork1InUse, 43#P2EXITtrue, P0Thread1of1ForFork3InUse, 159#true, P2Thread1of1ForFork2InUse, 125#L838true, 112#P0EXITtrue, Black: 150#(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))), 121#ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTIONtrue, Black: 156#(= ~__unbuffered_p3_EAX~0 0)]) [2023-08-24 11:39:55,038 INFO L294 olderBase$Statistics]: this new event has 23 ancestors and is cut-off event [2023-08-24 11:39:55,038 INFO L297 olderBase$Statistics]: existing Event has 23 ancestors and is cut-off event [2023-08-24 11:39:55,038 INFO L297 olderBase$Statistics]: existing Event has 23 ancestors and is cut-off event [2023-08-24 11:39:55,038 INFO L297 olderBase$Statistics]: existing Event has 23 ancestors and is cut-off event [2023-08-24 11:39:55,038 INFO L292 olderBase$Statistics]: inserting event number 4 for the transition-marking pair ([395] L838-->L845: Formula: (let ((.cse3 (not (= (mod v_~x$r_buff1_thd4~0_20 256) 0))) (.cse4 (not (= (mod v_~x$w_buff0_used~0_99 256) 0))) (.cse5 (not (= (mod v_~x$r_buff0_thd4~0_24 256) 0)))) (let ((.cse0 (and .cse5 (not (= (mod v_~x$w_buff0_used~0_100 256) 0)))) (.cse2 (and .cse5 .cse4)) (.cse1 (and (not (= (mod v_~x$w_buff1_used~0_93 256) 0)) .cse3))) (and (= v_~x~0_38 (ite .cse0 v_~x$w_buff0~0_35 (ite .cse1 v_~x$w_buff1~0_28 v_~x~0_39))) (= (ite .cse2 0 v_~x$r_buff0_thd4~0_24) v_~x$r_buff0_thd4~0_23) (= v_~x$r_buff1_thd4~0_19 (ite (or (and (not (= (mod v_~x$w_buff1_used~0_92 256) 0)) .cse3) (and .cse4 (not (= (mod v_~x$r_buff0_thd4~0_23 256) 0)))) 0 v_~x$r_buff1_thd4~0_20)) (= (ite .cse0 0 v_~x$w_buff0_used~0_100) v_~x$w_buff0_used~0_99) (= v_~x$w_buff1_used~0_92 (ite (or .cse2 .cse1) 0 v_~x$w_buff1_used~0_93))))) InVars {~x$w_buff0~0=v_~x$w_buff0~0_35, ~x$w_buff1~0=v_~x$w_buff1~0_28, ~x$w_buff1_used~0=v_~x$w_buff1_used~0_93, ~x$r_buff0_thd4~0=v_~x$r_buff0_thd4~0_24, ~x~0=v_~x~0_39, ~x$r_buff1_thd4~0=v_~x$r_buff1_thd4~0_20, ~x$w_buff0_used~0=v_~x$w_buff0_used~0_100} OutVars{~x$w_buff0~0=v_~x$w_buff0~0_35, ~x$w_buff1~0=v_~x$w_buff1~0_28, ~x$w_buff1_used~0=v_~x$w_buff1_used~0_92, ~x$r_buff0_thd4~0=v_~x$r_buff0_thd4~0_23, ~x~0=v_~x~0_38, ~x$r_buff1_thd4~0=v_~x$r_buff1_thd4~0_19, ~x$w_buff0_used~0=v_~x$w_buff0_used~0_99} AuxVars[] AssignedVars[~x$w_buff1_used~0, ~x$r_buff0_thd4~0, ~x~0, ~x$r_buff1_thd4~0, ~x$w_buff0_used~0][71], [154#true, P3Thread1of1ForFork0InUse, 47#L795true, P1Thread1of1ForFork1InUse, 43#P2EXITtrue, P0Thread1of1ForFork3InUse, 159#true, P2Thread1of1ForFork2InUse, 34#L880true, 112#P0EXITtrue, Black: 150#(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))), 92#L845true, Black: 156#(= ~__unbuffered_p3_EAX~0 0)]) [2023-08-24 11:39:55,038 INFO L294 olderBase$Statistics]: this new event has 23 ancestors and is cut-off event [2023-08-24 11:39:55,038 INFO L297 olderBase$Statistics]: existing Event has 23 ancestors and is cut-off event [2023-08-24 11:39:55,038 INFO L297 olderBase$Statistics]: existing Event has 23 ancestors and is cut-off event [2023-08-24 11:39:55,038 INFO L297 olderBase$Statistics]: existing Event has 23 ancestors and is cut-off event [2023-08-24 11:39:55,073 INFO L124 PetriNetUnfolderBase]: 6614/9762 cut-off events. [2023-08-24 11:39:55,073 INFO L125 PetriNetUnfolderBase]: For 1817/1951 co-relation queries the response was YES. [2023-08-24 11:39:55,083 INFO L83 FinitePrefix]: Finished finitePrefix Result has 21949 conditions, 9762 events. 6614/9762 cut-off events. For 1817/1951 co-relation queries the response was YES. Maximal size of possible extension queue 601. Compared 58825 event pairs, 1247 based on Foata normal form. 723/10131 useless extension candidates. Maximal degree in co-relation 21936. Up to 6200 conditions per place. [2023-08-24 11:39:55,102 INFO L140 encePairwiseOnDemand]: 230/237 looper letters, 64 selfloop transitions, 10 changer transitions 0/82 dead transitions. [2023-08-24 11:39:55,102 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 45 places, 82 transitions, 389 flow [2023-08-24 11:39:55,103 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2023-08-24 11:39:55,103 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 5 states. [2023-08-24 11:39:55,104 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 608 transitions. [2023-08-24 11:39:55,104 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.5130801687763713 [2023-08-24 11:39:55,104 INFO L72 ComplementDD]: Start complementDD. Operand 5 states and 608 transitions. [2023-08-24 11:39:55,104 INFO L73 IsDeterministic]: Start isDeterministic. Operand 5 states and 608 transitions. [2023-08-24 11:39:55,105 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2023-08-24 11:39:55,105 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 5 states and 608 transitions. [2023-08-24 11:39:55,106 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 6 states, 5 states have (on average 121.6) internal successors, (608), 5 states have internal predecessors, (608), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-24 11:39:55,107 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 6 states, 6 states have (on average 237.0) internal successors, (1422), 6 states have internal predecessors, (1422), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-24 11:39:55,108 INFO L81 ComplementDD]: Finished complementDD. Result has 6 states, 6 states have (on average 237.0) internal successors, (1422), 6 states have internal predecessors, (1422), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-24 11:39:55,108 INFO L175 Difference]: Start difference. First operand has 41 places, 33 transitions, 113 flow. Second operand 5 states and 608 transitions. [2023-08-24 11:39:55,108 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 45 places, 82 transitions, 389 flow [2023-08-24 11:39:55,109 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 43 places, 82 transitions, 383 flow, removed 0 selfloop flow, removed 2 redundant places. [2023-08-24 11:39:55,110 INFO L231 Difference]: Finished difference. Result has 46 places, 42 transitions, 182 flow [2023-08-24 11:39:55,110 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=237, PETRI_DIFFERENCE_MINUEND_FLOW=107, PETRI_DIFFERENCE_MINUEND_PLACES=39, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=33, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=1, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=27, PETRI_DIFFERENCE_SUBTRAHEND_STATES=5, PETRI_FLOW=182, PETRI_PLACES=46, PETRI_TRANSITIONS=42} [2023-08-24 11:39:55,111 INFO L281 CegarLoopForPetriNet]: 42 programPoint places, 4 predicate places. [2023-08-24 11:39:55,111 INFO L495 AbstractCegarLoop]: Abstraction has has 46 places, 42 transitions, 182 flow [2023-08-24 11:39:55,111 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 111.0) internal successors, (444), 4 states have internal predecessors, (444), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-24 11:39:55,111 INFO L200 CegarLoopForPetriNet]: Found error trace [2023-08-24 11:39:55,111 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-08-24 11:39:55,111 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable3 [2023-08-24 11:39:55,111 INFO L420 AbstractCegarLoop]: === Iteration 5 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [P1Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 4 more)] === [2023-08-24 11:39:55,112 INFO L145 PredicateUnifier]: Initialized classic predicate unifier [2023-08-24 11:39:55,112 INFO L85 PathProgramCache]: Analyzing trace with hash 317217735, now seen corresponding path program 1 times [2023-08-24 11:39:55,112 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-08-24 11:39:55,112 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [420111558] [2023-08-24 11:39:55,112 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-08-24 11:39:55,112 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-08-24 11:39:55,155 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-08-24 11:39:55,312 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-24 11:39:55,312 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-08-24 11:39:55,312 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [420111558] [2023-08-24 11:39:55,313 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [420111558] provided 1 perfect and 0 imperfect interpolant sequences [2023-08-24 11:39:55,313 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-08-24 11:39:55,313 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2023-08-24 11:39:55,313 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [368513716] [2023-08-24 11:39:55,313 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-08-24 11:39:55,313 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2023-08-24 11:39:55,313 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-08-24 11:39:55,314 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2023-08-24 11:39:55,314 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=8, Invalid=12, Unknown=0, NotChecked=0, Total=20 [2023-08-24 11:39:55,314 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 108 out of 237 [2023-08-24 11:39:55,315 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 46 places, 42 transitions, 182 flow. Second operand has 5 states, 5 states have (on average 111.2) internal successors, (556), 5 states have internal predecessors, (556), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-24 11:39:55,315 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2023-08-24 11:39:55,315 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 108 of 237 [2023-08-24 11:39:55,315 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2023-08-24 11:39:55,835 INFO L292 olderBase$Statistics]: inserting event number 4 for the transition-marking pair ([395] L838-->L845: Formula: (let ((.cse3 (not (= (mod v_~x$r_buff1_thd4~0_20 256) 0))) (.cse4 (not (= (mod v_~x$w_buff0_used~0_99 256) 0))) (.cse5 (not (= (mod v_~x$r_buff0_thd4~0_24 256) 0)))) (let ((.cse0 (and .cse5 (not (= (mod v_~x$w_buff0_used~0_100 256) 0)))) (.cse2 (and .cse5 .cse4)) (.cse1 (and (not (= (mod v_~x$w_buff1_used~0_93 256) 0)) .cse3))) (and (= v_~x~0_38 (ite .cse0 v_~x$w_buff0~0_35 (ite .cse1 v_~x$w_buff1~0_28 v_~x~0_39))) (= (ite .cse2 0 v_~x$r_buff0_thd4~0_24) v_~x$r_buff0_thd4~0_23) (= v_~x$r_buff1_thd4~0_19 (ite (or (and (not (= (mod v_~x$w_buff1_used~0_92 256) 0)) .cse3) (and .cse4 (not (= (mod v_~x$r_buff0_thd4~0_23 256) 0)))) 0 v_~x$r_buff1_thd4~0_20)) (= (ite .cse0 0 v_~x$w_buff0_used~0_100) v_~x$w_buff0_used~0_99) (= v_~x$w_buff1_used~0_92 (ite (or .cse2 .cse1) 0 v_~x$w_buff1_used~0_93))))) InVars {~x$w_buff0~0=v_~x$w_buff0~0_35, ~x$w_buff1~0=v_~x$w_buff1~0_28, ~x$w_buff1_used~0=v_~x$w_buff1_used~0_93, ~x$r_buff0_thd4~0=v_~x$r_buff0_thd4~0_24, ~x~0=v_~x~0_39, ~x$r_buff1_thd4~0=v_~x$r_buff1_thd4~0_20, ~x$w_buff0_used~0=v_~x$w_buff0_used~0_100} OutVars{~x$w_buff0~0=v_~x$w_buff0~0_35, ~x$w_buff1~0=v_~x$w_buff1~0_28, ~x$w_buff1_used~0=v_~x$w_buff1_used~0_92, ~x$r_buff0_thd4~0=v_~x$r_buff0_thd4~0_23, ~x~0=v_~x~0_38, ~x$r_buff1_thd4~0=v_~x$r_buff1_thd4~0_19, ~x$w_buff0_used~0=v_~x$w_buff0_used~0_99} AuxVars[] AssignedVars[~x$w_buff1_used~0, ~x$r_buff0_thd4~0, ~x~0, ~x$r_buff1_thd4~0, ~x$w_buff0_used~0][74], [Black: 161#(= ~__unbuffered_cnt~0 0), 32#L770true, Black: 162#(= |ULTIMATE.start_assume_abort_if_not_#in~cond#1| 0), Black: 164#(and (= ~__unbuffered_cnt~0 0) (= |ULTIMATE.start_assume_abort_if_not_#in~cond#1| 0)), P3Thread1of1ForFork0InUse, 47#L795true, P1Thread1of1ForFork1InUse, 43#P2EXITtrue, P0Thread1of1ForFork3InUse, 159#true, P2Thread1of1ForFork2InUse, 177#(and (<= ~__unbuffered_cnt~0 1) (= |ULTIMATE.start_assume_abort_if_not_#in~cond#1| 0)), Black: 150#(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))), 45#L873true, 92#L845true, Black: 156#(= ~__unbuffered_p3_EAX~0 0)]) [2023-08-24 11:39:55,835 INFO L294 olderBase$Statistics]: this new event has 21 ancestors and is cut-off event [2023-08-24 11:39:55,836 INFO L297 olderBase$Statistics]: existing Event has 21 ancestors and is cut-off event [2023-08-24 11:39:55,836 INFO L297 olderBase$Statistics]: existing Event has 21 ancestors and is cut-off event [2023-08-24 11:39:55,836 INFO L297 olderBase$Statistics]: existing Event has 21 ancestors and is cut-off event [2023-08-24 11:39:55,874 INFO L292 olderBase$Statistics]: inserting event number 4 for the transition-marking pair ([395] L838-->L845: Formula: (let ((.cse3 (not (= (mod v_~x$r_buff1_thd4~0_20 256) 0))) (.cse4 (not (= (mod v_~x$w_buff0_used~0_99 256) 0))) (.cse5 (not (= (mod v_~x$r_buff0_thd4~0_24 256) 0)))) (let ((.cse0 (and .cse5 (not (= (mod v_~x$w_buff0_used~0_100 256) 0)))) (.cse2 (and .cse5 .cse4)) (.cse1 (and (not (= (mod v_~x$w_buff1_used~0_93 256) 0)) .cse3))) (and (= v_~x~0_38 (ite .cse0 v_~x$w_buff0~0_35 (ite .cse1 v_~x$w_buff1~0_28 v_~x~0_39))) (= (ite .cse2 0 v_~x$r_buff0_thd4~0_24) v_~x$r_buff0_thd4~0_23) (= v_~x$r_buff1_thd4~0_19 (ite (or (and (not (= (mod v_~x$w_buff1_used~0_92 256) 0)) .cse3) (and .cse4 (not (= (mod v_~x$r_buff0_thd4~0_23 256) 0)))) 0 v_~x$r_buff1_thd4~0_20)) (= (ite .cse0 0 v_~x$w_buff0_used~0_100) v_~x$w_buff0_used~0_99) (= v_~x$w_buff1_used~0_92 (ite (or .cse2 .cse1) 0 v_~x$w_buff1_used~0_93))))) InVars {~x$w_buff0~0=v_~x$w_buff0~0_35, ~x$w_buff1~0=v_~x$w_buff1~0_28, ~x$w_buff1_used~0=v_~x$w_buff1_used~0_93, ~x$r_buff0_thd4~0=v_~x$r_buff0_thd4~0_24, ~x~0=v_~x~0_39, ~x$r_buff1_thd4~0=v_~x$r_buff1_thd4~0_20, ~x$w_buff0_used~0=v_~x$w_buff0_used~0_100} OutVars{~x$w_buff0~0=v_~x$w_buff0~0_35, ~x$w_buff1~0=v_~x$w_buff1~0_28, ~x$w_buff1_used~0=v_~x$w_buff1_used~0_92, ~x$r_buff0_thd4~0=v_~x$r_buff0_thd4~0_23, ~x~0=v_~x~0_38, ~x$r_buff1_thd4~0=v_~x$r_buff1_thd4~0_19, ~x$w_buff0_used~0=v_~x$w_buff0_used~0_99} AuxVars[] AssignedVars[~x$w_buff1_used~0, ~x$r_buff0_thd4~0, ~x~0, ~x$r_buff1_thd4~0, ~x$w_buff0_used~0][105], [Black: 161#(= ~__unbuffered_cnt~0 0), Black: 162#(= |ULTIMATE.start_assume_abort_if_not_#in~cond#1| 0), Black: 164#(and (= ~__unbuffered_cnt~0 0) (= |ULTIMATE.start_assume_abort_if_not_#in~cond#1| 0)), P3Thread1of1ForFork0InUse, 47#L795true, P1Thread1of1ForFork1InUse, 43#P2EXITtrue, 173#(= |ULTIMATE.start_assume_abort_if_not_#in~cond#1| 0), P0Thread1of1ForFork3InUse, 159#true, P2Thread1of1ForFork2InUse, 112#P0EXITtrue, Black: 150#(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))), 45#L873true, Black: 156#(= ~__unbuffered_p3_EAX~0 0), 92#L845true]) [2023-08-24 11:39:55,875 INFO L294 olderBase$Statistics]: this new event has 22 ancestors and is cut-off event [2023-08-24 11:39:55,875 INFO L297 olderBase$Statistics]: existing Event has 22 ancestors and is cut-off event [2023-08-24 11:39:55,875 INFO L297 olderBase$Statistics]: existing Event has 22 ancestors and is cut-off event [2023-08-24 11:39:55,875 INFO L297 olderBase$Statistics]: existing Event has 22 ancestors and is cut-off event [2023-08-24 11:39:55,934 INFO L124 PetriNetUnfolderBase]: 5294/8067 cut-off events. [2023-08-24 11:39:55,935 INFO L125 PetriNetUnfolderBase]: For 4243/4279 co-relation queries the response was YES. [2023-08-24 11:39:55,946 INFO L83 FinitePrefix]: Finished finitePrefix Result has 23527 conditions, 8067 events. 5294/8067 cut-off events. For 4243/4279 co-relation queries the response was YES. Maximal size of possible extension queue 484. Compared 49700 event pairs, 635 based on Foata normal form. 476/8312 useless extension candidates. Maximal degree in co-relation 23511. Up to 2558 conditions per place. [2023-08-24 11:39:55,961 INFO L140 encePairwiseOnDemand]: 230/237 looper letters, 88 selfloop transitions, 19 changer transitions 0/115 dead transitions. [2023-08-24 11:39:55,961 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 52 places, 115 transitions, 642 flow [2023-08-24 11:39:55,961 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2023-08-24 11:39:55,961 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 7 states. [2023-08-24 11:39:55,963 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 7 states to 7 states and 853 transitions. [2023-08-24 11:39:55,963 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.5141651597347799 [2023-08-24 11:39:55,963 INFO L72 ComplementDD]: Start complementDD. Operand 7 states and 853 transitions. [2023-08-24 11:39:55,963 INFO L73 IsDeterministic]: Start isDeterministic. Operand 7 states and 853 transitions. [2023-08-24 11:39:55,963 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2023-08-24 11:39:55,964 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 7 states and 853 transitions. [2023-08-24 11:39:55,965 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 8 states, 7 states have (on average 121.85714285714286) internal successors, (853), 7 states have internal predecessors, (853), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-24 11:39:55,967 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 8 states, 8 states have (on average 237.0) internal successors, (1896), 8 states have internal predecessors, (1896), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-24 11:39:55,968 INFO L81 ComplementDD]: Finished complementDD. Result has 8 states, 8 states have (on average 237.0) internal successors, (1896), 8 states have internal predecessors, (1896), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-24 11:39:55,968 INFO L175 Difference]: Start difference. First operand has 46 places, 42 transitions, 182 flow. Second operand 7 states and 853 transitions. [2023-08-24 11:39:55,968 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 52 places, 115 transitions, 642 flow [2023-08-24 11:39:55,985 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 51 places, 115 transitions, 637 flow, removed 0 selfloop flow, removed 1 redundant places. [2023-08-24 11:39:55,987 INFO L231 Difference]: Finished difference. Result has 54 places, 51 transitions, 311 flow [2023-08-24 11:39:55,987 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=237, PETRI_DIFFERENCE_MINUEND_FLOW=177, PETRI_DIFFERENCE_MINUEND_PLACES=45, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=42, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=10, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=27, PETRI_DIFFERENCE_SUBTRAHEND_STATES=7, PETRI_FLOW=311, PETRI_PLACES=54, PETRI_TRANSITIONS=51} [2023-08-24 11:39:55,987 INFO L281 CegarLoopForPetriNet]: 42 programPoint places, 12 predicate places. [2023-08-24 11:39:55,987 INFO L495 AbstractCegarLoop]: Abstraction has has 54 places, 51 transitions, 311 flow [2023-08-24 11:39:55,988 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 111.2) internal successors, (556), 5 states have internal predecessors, (556), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-24 11:39:55,988 INFO L200 CegarLoopForPetriNet]: Found error trace [2023-08-24 11:39:55,988 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-08-24 11:39:55,988 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable4 [2023-08-24 11:39:55,988 INFO L420 AbstractCegarLoop]: === Iteration 6 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [P1Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 4 more)] === [2023-08-24 11:39:55,988 INFO L145 PredicateUnifier]: Initialized classic predicate unifier [2023-08-24 11:39:55,988 INFO L85 PathProgramCache]: Analyzing trace with hash -1254189260, now seen corresponding path program 1 times [2023-08-24 11:39:55,988 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-08-24 11:39:55,988 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [680637901] [2023-08-24 11:39:55,989 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-08-24 11:39:55,989 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-08-24 11:39:56,002 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-08-24 11:39:56,103 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-24 11:39:56,103 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-08-24 11:39:56,104 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [680637901] [2023-08-24 11:39:56,104 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [680637901] provided 1 perfect and 0 imperfect interpolant sequences [2023-08-24 11:39:56,104 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-08-24 11:39:56,104 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2023-08-24 11:39:56,104 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1179512349] [2023-08-24 11:39:56,104 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-08-24 11:39:56,104 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2023-08-24 11:39:56,104 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-08-24 11:39:56,105 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2023-08-24 11:39:56,105 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2023-08-24 11:39:56,105 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 111 out of 237 [2023-08-24 11:39:56,105 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 54 places, 51 transitions, 311 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-24 11:39:56,106 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2023-08-24 11:39:56,106 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 111 of 237 [2023-08-24 11:39:56,106 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2023-08-24 11:39:56,765 INFO L292 olderBase$Statistics]: inserting event number 4 for the transition-marking pair ([394] L835-->L838: Formula: (= v_~__unbuffered_p3_EBX~0_1 v_~a~0_2) InVars {~a~0=v_~a~0_2} OutVars{~a~0=v_~a~0_2, ~__unbuffered_p3_EBX~0=v_~__unbuffered_p3_EBX~0_1} AuxVars[] AssignedVars[~__unbuffered_p3_EBX~0][44], [Black: 161#(= ~__unbuffered_cnt~0 0), Black: 162#(= |ULTIMATE.start_assume_abort_if_not_#in~cond#1| 0), Black: 164#(and (= ~__unbuffered_cnt~0 0) (= |ULTIMATE.start_assume_abort_if_not_#in~cond#1| 0)), P3Thread1of1ForFork0InUse, 47#L795true, P1Thread1of1ForFork1InUse, 43#P2EXITtrue, 187#(and (= ~__unbuffered_p3_EBX~0 1) (= ~a~0 1)), P0Thread1of1ForFork3InUse, 173#(= |ULTIMATE.start_assume_abort_if_not_#in~cond#1| 0), 125#L838true, P2Thread1of1ForFork2InUse, 112#P0EXITtrue, Black: 177#(and (<= ~__unbuffered_cnt~0 1) (= |ULTIMATE.start_assume_abort_if_not_#in~cond#1| 0)), Black: 172#(<= ~__unbuffered_cnt~0 1), Black: 150#(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))), 45#L873true, Black: 156#(= ~__unbuffered_p3_EAX~0 0)]) [2023-08-24 11:39:56,765 INFO L294 olderBase$Statistics]: this new event has 21 ancestors and is not cut-off event [2023-08-24 11:39:56,765 INFO L297 olderBase$Statistics]: existing Event has 21 ancestors and is not cut-off event [2023-08-24 11:39:56,765 INFO L297 olderBase$Statistics]: existing Event has 21 ancestors and is not cut-off event [2023-08-24 11:39:56,765 INFO L297 olderBase$Statistics]: existing Event has 21 ancestors and is not cut-off event [2023-08-24 11:39:56,980 INFO L124 PetriNetUnfolderBase]: 7635/11666 cut-off events. [2023-08-24 11:39:56,980 INFO L125 PetriNetUnfolderBase]: For 21823/22123 co-relation queries the response was YES. [2023-08-24 11:39:56,995 INFO L83 FinitePrefix]: Finished finitePrefix Result has 41786 conditions, 11666 events. 7635/11666 cut-off events. For 21823/22123 co-relation queries the response was YES. Maximal size of possible extension queue 612. Compared 75309 event pairs, 1310 based on Foata normal form. 148/11618 useless extension candidates. Maximal degree in co-relation 41766. Up to 6447 conditions per place. [2023-08-24 11:39:57,010 INFO L140 encePairwiseOnDemand]: 234/237 looper letters, 84 selfloop transitions, 3 changer transitions 24/117 dead transitions. [2023-08-24 11:39:57,011 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 57 places, 117 transitions, 980 flow [2023-08-24 11:39:57,011 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2023-08-24 11:39:57,011 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 4 states. [2023-08-24 11:39:57,012 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 500 transitions. [2023-08-24 11:39:57,012 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.5274261603375527 [2023-08-24 11:39:57,012 INFO L72 ComplementDD]: Start complementDD. Operand 4 states and 500 transitions. [2023-08-24 11:39:57,012 INFO L73 IsDeterministic]: Start isDeterministic. Operand 4 states and 500 transitions. [2023-08-24 11:39:57,013 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2023-08-24 11:39:57,013 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 4 states and 500 transitions. [2023-08-24 11:39:57,013 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 5 states, 4 states have (on average 125.0) internal successors, (500), 4 states have internal predecessors, (500), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-24 11:39:57,014 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 5 states, 5 states have (on average 237.0) internal successors, (1185), 5 states have internal predecessors, (1185), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-24 11:39:57,015 INFO L81 ComplementDD]: Finished complementDD. Result has 5 states, 5 states have (on average 237.0) internal successors, (1185), 5 states have internal predecessors, (1185), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-24 11:39:57,015 INFO L175 Difference]: Start difference. First operand has 54 places, 51 transitions, 311 flow. Second operand 4 states and 500 transitions. [2023-08-24 11:39:57,015 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 57 places, 117 transitions, 980 flow [2023-08-24 11:39:57,269 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 54 places, 117 transitions, 845 flow, removed 47 selfloop flow, removed 3 redundant places. [2023-08-24 11:39:57,270 INFO L231 Difference]: Finished difference. Result has 56 places, 51 transitions, 270 flow [2023-08-24 11:39:57,270 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=237, PETRI_DIFFERENCE_MINUEND_FLOW=261, PETRI_DIFFERENCE_MINUEND_PLACES=51, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=51, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=1, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=48, PETRI_DIFFERENCE_SUBTRAHEND_STATES=4, PETRI_FLOW=270, PETRI_PLACES=56, PETRI_TRANSITIONS=51} [2023-08-24 11:39:57,270 INFO L281 CegarLoopForPetriNet]: 42 programPoint places, 14 predicate places. [2023-08-24 11:39:57,271 INFO L495 AbstractCegarLoop]: Abstraction has has 56 places, 51 transitions, 270 flow [2023-08-24 11:39:57,271 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-24 11:39:57,271 INFO L200 CegarLoopForPetriNet]: Found error trace [2023-08-24 11:39:57,271 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-08-24 11:39:57,271 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable5 [2023-08-24 11:39:57,271 INFO L420 AbstractCegarLoop]: === Iteration 7 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [P1Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 4 more)] === [2023-08-24 11:39:57,272 INFO L145 PredicateUnifier]: Initialized classic predicate unifier [2023-08-24 11:39:57,272 INFO L85 PathProgramCache]: Analyzing trace with hash -202141348, now seen corresponding path program 2 times [2023-08-24 11:39:57,272 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-08-24 11:39:57,272 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2130189265] [2023-08-24 11:39:57,272 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-08-24 11:39:57,272 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-08-24 11:39:57,297 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-08-24 11:39:57,419 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-24 11:39:57,419 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-08-24 11:39:57,419 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2130189265] [2023-08-24 11:39:57,420 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2130189265] provided 1 perfect and 0 imperfect interpolant sequences [2023-08-24 11:39:57,420 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-08-24 11:39:57,420 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2023-08-24 11:39:57,420 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1027350873] [2023-08-24 11:39:57,420 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-08-24 11:39:57,420 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2023-08-24 11:39:57,420 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-08-24 11:39:57,421 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2023-08-24 11:39:57,421 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=12, Invalid=18, Unknown=0, NotChecked=0, Total=30 [2023-08-24 11:39:57,421 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 108 out of 237 [2023-08-24 11:39:57,422 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 56 places, 51 transitions, 270 flow. Second operand has 6 states, 6 states have (on average 110.83333333333333) internal successors, (665), 6 states have internal predecessors, (665), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-24 11:39:57,422 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2023-08-24 11:39:57,422 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 108 of 237 [2023-08-24 11:39:57,422 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2023-08-24 11:39:58,103 INFO L292 olderBase$Statistics]: inserting event number 4 for the transition-marking pair ([395] L838-->L845: Formula: (let ((.cse3 (not (= (mod v_~x$r_buff1_thd4~0_20 256) 0))) (.cse4 (not (= (mod v_~x$w_buff0_used~0_99 256) 0))) (.cse5 (not (= (mod v_~x$r_buff0_thd4~0_24 256) 0)))) (let ((.cse0 (and .cse5 (not (= (mod v_~x$w_buff0_used~0_100 256) 0)))) (.cse2 (and .cse5 .cse4)) (.cse1 (and (not (= (mod v_~x$w_buff1_used~0_93 256) 0)) .cse3))) (and (= v_~x~0_38 (ite .cse0 v_~x$w_buff0~0_35 (ite .cse1 v_~x$w_buff1~0_28 v_~x~0_39))) (= (ite .cse2 0 v_~x$r_buff0_thd4~0_24) v_~x$r_buff0_thd4~0_23) (= v_~x$r_buff1_thd4~0_19 (ite (or (and (not (= (mod v_~x$w_buff1_used~0_92 256) 0)) .cse3) (and .cse4 (not (= (mod v_~x$r_buff0_thd4~0_23 256) 0)))) 0 v_~x$r_buff1_thd4~0_20)) (= (ite .cse0 0 v_~x$w_buff0_used~0_100) v_~x$w_buff0_used~0_99) (= v_~x$w_buff1_used~0_92 (ite (or .cse2 .cse1) 0 v_~x$w_buff1_used~0_93))))) InVars {~x$w_buff0~0=v_~x$w_buff0~0_35, ~x$w_buff1~0=v_~x$w_buff1~0_28, ~x$w_buff1_used~0=v_~x$w_buff1_used~0_93, ~x$r_buff0_thd4~0=v_~x$r_buff0_thd4~0_24, ~x~0=v_~x~0_39, ~x$r_buff1_thd4~0=v_~x$r_buff1_thd4~0_20, ~x$w_buff0_used~0=v_~x$w_buff0_used~0_100} OutVars{~x$w_buff0~0=v_~x$w_buff0~0_35, ~x$w_buff1~0=v_~x$w_buff1~0_28, ~x$w_buff1_used~0=v_~x$w_buff1_used~0_92, ~x$r_buff0_thd4~0=v_~x$r_buff0_thd4~0_23, ~x~0=v_~x~0_38, ~x$r_buff1_thd4~0=v_~x$r_buff1_thd4~0_19, ~x$w_buff0_used~0=v_~x$w_buff0_used~0_99} AuxVars[] AssignedVars[~x$w_buff1_used~0, ~x$r_buff0_thd4~0, ~x~0, ~x$r_buff1_thd4~0, ~x$w_buff0_used~0][74], [162#(= |ULTIMATE.start_assume_abort_if_not_#in~cond#1| 0), Black: 161#(= ~__unbuffered_cnt~0 0), 32#L770true, Black: 164#(and (= ~__unbuffered_cnt~0 0) (= |ULTIMATE.start_assume_abort_if_not_#in~cond#1| 0)), P3Thread1of1ForFork0InUse, 47#L795true, P1Thread1of1ForFork1InUse, 43#P2EXITtrue, 187#(and (= ~__unbuffered_p3_EBX~0 1) (= ~a~0 1)), P0Thread1of1ForFork3InUse, P2Thread1of1ForFork2InUse, 177#(and (<= ~__unbuffered_cnt~0 1) (= |ULTIMATE.start_assume_abort_if_not_#in~cond#1| 0)), Black: 172#(<= ~__unbuffered_cnt~0 1), 200#(and (<= ~__unbuffered_cnt~0 1) (= |ULTIMATE.start_assume_abort_if_not_#in~cond#1| 0)), Black: 173#(= |ULTIMATE.start_assume_abort_if_not_#in~cond#1| 0), Black: 150#(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))), 45#L873true, 92#L845true, Black: 156#(= ~__unbuffered_p3_EAX~0 0), Black: 184#(= ~a~0 1)]) [2023-08-24 11:39:58,103 INFO L294 olderBase$Statistics]: this new event has 21 ancestors and is cut-off event [2023-08-24 11:39:58,104 INFO L297 olderBase$Statistics]: existing Event has 21 ancestors and is cut-off event [2023-08-24 11:39:58,104 INFO L297 olderBase$Statistics]: existing Event has 21 ancestors and is cut-off event [2023-08-24 11:39:58,104 INFO L297 olderBase$Statistics]: existing Event has 21 ancestors and is cut-off event [2023-08-24 11:39:58,106 INFO L292 olderBase$Statistics]: inserting event number 4 for the transition-marking pair ([395] L838-->L845: Formula: (let ((.cse3 (not (= (mod v_~x$r_buff1_thd4~0_20 256) 0))) (.cse4 (not (= (mod v_~x$w_buff0_used~0_99 256) 0))) (.cse5 (not (= (mod v_~x$r_buff0_thd4~0_24 256) 0)))) (let ((.cse0 (and .cse5 (not (= (mod v_~x$w_buff0_used~0_100 256) 0)))) (.cse2 (and .cse5 .cse4)) (.cse1 (and (not (= (mod v_~x$w_buff1_used~0_93 256) 0)) .cse3))) (and (= v_~x~0_38 (ite .cse0 v_~x$w_buff0~0_35 (ite .cse1 v_~x$w_buff1~0_28 v_~x~0_39))) (= (ite .cse2 0 v_~x$r_buff0_thd4~0_24) v_~x$r_buff0_thd4~0_23) (= v_~x$r_buff1_thd4~0_19 (ite (or (and (not (= (mod v_~x$w_buff1_used~0_92 256) 0)) .cse3) (and .cse4 (not (= (mod v_~x$r_buff0_thd4~0_23 256) 0)))) 0 v_~x$r_buff1_thd4~0_20)) (= (ite .cse0 0 v_~x$w_buff0_used~0_100) v_~x$w_buff0_used~0_99) (= v_~x$w_buff1_used~0_92 (ite (or .cse2 .cse1) 0 v_~x$w_buff1_used~0_93))))) InVars {~x$w_buff0~0=v_~x$w_buff0~0_35, ~x$w_buff1~0=v_~x$w_buff1~0_28, ~x$w_buff1_used~0=v_~x$w_buff1_used~0_93, ~x$r_buff0_thd4~0=v_~x$r_buff0_thd4~0_24, ~x~0=v_~x~0_39, ~x$r_buff1_thd4~0=v_~x$r_buff1_thd4~0_20, ~x$w_buff0_used~0=v_~x$w_buff0_used~0_100} OutVars{~x$w_buff0~0=v_~x$w_buff0~0_35, ~x$w_buff1~0=v_~x$w_buff1~0_28, ~x$w_buff1_used~0=v_~x$w_buff1_used~0_92, ~x$r_buff0_thd4~0=v_~x$r_buff0_thd4~0_23, ~x~0=v_~x~0_38, ~x$r_buff1_thd4~0=v_~x$r_buff1_thd4~0_19, ~x$w_buff0_used~0=v_~x$w_buff0_used~0_99} AuxVars[] AssignedVars[~x$w_buff1_used~0, ~x$r_buff0_thd4~0, ~x~0, ~x$r_buff1_thd4~0, ~x$w_buff0_used~0][74], [Black: 161#(= ~__unbuffered_cnt~0 0), 32#L770true, Black: 162#(= |ULTIMATE.start_assume_abort_if_not_#in~cond#1| 0), Black: 164#(and (= ~__unbuffered_cnt~0 0) (= |ULTIMATE.start_assume_abort_if_not_#in~cond#1| 0)), P3Thread1of1ForFork0InUse, 47#L795true, P1Thread1of1ForFork1InUse, 43#P2EXITtrue, 187#(and (= ~__unbuffered_p3_EBX~0 1) (= ~a~0 1)), P0Thread1of1ForFork3InUse, P2Thread1of1ForFork2InUse, 177#(and (<= ~__unbuffered_cnt~0 1) (= |ULTIMATE.start_assume_abort_if_not_#in~cond#1| 0)), Black: 172#(<= ~__unbuffered_cnt~0 1), 200#(and (<= ~__unbuffered_cnt~0 1) (= |ULTIMATE.start_assume_abort_if_not_#in~cond#1| 0)), Black: 173#(= |ULTIMATE.start_assume_abort_if_not_#in~cond#1| 0), Black: 150#(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))), 45#L873true, Black: 156#(= ~__unbuffered_p3_EAX~0 0), Black: 184#(= ~a~0 1), 92#L845true]) [2023-08-24 11:39:58,106 INFO L294 olderBase$Statistics]: this new event has 21 ancestors and is cut-off event [2023-08-24 11:39:58,106 INFO L297 olderBase$Statistics]: existing Event has 21 ancestors and is cut-off event [2023-08-24 11:39:58,106 INFO L297 olderBase$Statistics]: existing Event has 21 ancestors and is cut-off event [2023-08-24 11:39:58,106 INFO L297 olderBase$Statistics]: existing Event has 21 ancestors and is cut-off event [2023-08-24 11:39:58,181 INFO L292 olderBase$Statistics]: inserting event number 4 for the transition-marking pair ([395] L838-->L845: Formula: (let ((.cse3 (not (= (mod v_~x$r_buff1_thd4~0_20 256) 0))) (.cse4 (not (= (mod v_~x$w_buff0_used~0_99 256) 0))) (.cse5 (not (= (mod v_~x$r_buff0_thd4~0_24 256) 0)))) (let ((.cse0 (and .cse5 (not (= (mod v_~x$w_buff0_used~0_100 256) 0)))) (.cse2 (and .cse5 .cse4)) (.cse1 (and (not (= (mod v_~x$w_buff1_used~0_93 256) 0)) .cse3))) (and (= v_~x~0_38 (ite .cse0 v_~x$w_buff0~0_35 (ite .cse1 v_~x$w_buff1~0_28 v_~x~0_39))) (= (ite .cse2 0 v_~x$r_buff0_thd4~0_24) v_~x$r_buff0_thd4~0_23) (= v_~x$r_buff1_thd4~0_19 (ite (or (and (not (= (mod v_~x$w_buff1_used~0_92 256) 0)) .cse3) (and .cse4 (not (= (mod v_~x$r_buff0_thd4~0_23 256) 0)))) 0 v_~x$r_buff1_thd4~0_20)) (= (ite .cse0 0 v_~x$w_buff0_used~0_100) v_~x$w_buff0_used~0_99) (= v_~x$w_buff1_used~0_92 (ite (or .cse2 .cse1) 0 v_~x$w_buff1_used~0_93))))) InVars {~x$w_buff0~0=v_~x$w_buff0~0_35, ~x$w_buff1~0=v_~x$w_buff1~0_28, ~x$w_buff1_used~0=v_~x$w_buff1_used~0_93, ~x$r_buff0_thd4~0=v_~x$r_buff0_thd4~0_24, ~x~0=v_~x~0_39, ~x$r_buff1_thd4~0=v_~x$r_buff1_thd4~0_20, ~x$w_buff0_used~0=v_~x$w_buff0_used~0_100} OutVars{~x$w_buff0~0=v_~x$w_buff0~0_35, ~x$w_buff1~0=v_~x$w_buff1~0_28, ~x$w_buff1_used~0=v_~x$w_buff1_used~0_92, ~x$r_buff0_thd4~0=v_~x$r_buff0_thd4~0_23, ~x~0=v_~x~0_38, ~x$r_buff1_thd4~0=v_~x$r_buff1_thd4~0_19, ~x$w_buff0_used~0=v_~x$w_buff0_used~0_99} AuxVars[] AssignedVars[~x$w_buff1_used~0, ~x$r_buff0_thd4~0, ~x~0, ~x$r_buff1_thd4~0, ~x$w_buff0_used~0][105], [162#(= |ULTIMATE.start_assume_abort_if_not_#in~cond#1| 0), Black: 161#(= ~__unbuffered_cnt~0 0), Black: 164#(and (= ~__unbuffered_cnt~0 0) (= |ULTIMATE.start_assume_abort_if_not_#in~cond#1| 0)), P3Thread1of1ForFork0InUse, 47#L795true, P1Thread1of1ForFork1InUse, 43#P2EXITtrue, 187#(and (= ~__unbuffered_p3_EBX~0 1) (= ~a~0 1)), 173#(= |ULTIMATE.start_assume_abort_if_not_#in~cond#1| 0), P0Thread1of1ForFork3InUse, P2Thread1of1ForFork2InUse, 112#P0EXITtrue, Black: 177#(and (<= ~__unbuffered_cnt~0 1) (= |ULTIMATE.start_assume_abort_if_not_#in~cond#1| 0)), Black: 172#(<= ~__unbuffered_cnt~0 1), Black: 150#(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))), 45#L873true, 92#L845true, 202#(and (<= ~__unbuffered_cnt~0 2) (= |ULTIMATE.start_assume_abort_if_not_#in~cond#1| 0)), Black: 156#(= ~__unbuffered_p3_EAX~0 0), Black: 184#(= ~a~0 1)]) [2023-08-24 11:39:58,181 INFO L294 olderBase$Statistics]: this new event has 22 ancestors and is cut-off event [2023-08-24 11:39:58,181 INFO L297 olderBase$Statistics]: existing Event has 22 ancestors and is cut-off event [2023-08-24 11:39:58,181 INFO L297 olderBase$Statistics]: existing Event has 22 ancestors and is cut-off event [2023-08-24 11:39:58,181 INFO L297 olderBase$Statistics]: existing Event has 22 ancestors and is cut-off event [2023-08-24 11:39:58,182 INFO L292 olderBase$Statistics]: inserting event number 4 for the transition-marking pair ([395] L838-->L845: Formula: (let ((.cse3 (not (= (mod v_~x$r_buff1_thd4~0_20 256) 0))) (.cse4 (not (= (mod v_~x$w_buff0_used~0_99 256) 0))) (.cse5 (not (= (mod v_~x$r_buff0_thd4~0_24 256) 0)))) (let ((.cse0 (and .cse5 (not (= (mod v_~x$w_buff0_used~0_100 256) 0)))) (.cse2 (and .cse5 .cse4)) (.cse1 (and (not (= (mod v_~x$w_buff1_used~0_93 256) 0)) .cse3))) (and (= v_~x~0_38 (ite .cse0 v_~x$w_buff0~0_35 (ite .cse1 v_~x$w_buff1~0_28 v_~x~0_39))) (= (ite .cse2 0 v_~x$r_buff0_thd4~0_24) v_~x$r_buff0_thd4~0_23) (= v_~x$r_buff1_thd4~0_19 (ite (or (and (not (= (mod v_~x$w_buff1_used~0_92 256) 0)) .cse3) (and .cse4 (not (= (mod v_~x$r_buff0_thd4~0_23 256) 0)))) 0 v_~x$r_buff1_thd4~0_20)) (= (ite .cse0 0 v_~x$w_buff0_used~0_100) v_~x$w_buff0_used~0_99) (= v_~x$w_buff1_used~0_92 (ite (or .cse2 .cse1) 0 v_~x$w_buff1_used~0_93))))) InVars {~x$w_buff0~0=v_~x$w_buff0~0_35, ~x$w_buff1~0=v_~x$w_buff1~0_28, ~x$w_buff1_used~0=v_~x$w_buff1_used~0_93, ~x$r_buff0_thd4~0=v_~x$r_buff0_thd4~0_24, ~x~0=v_~x~0_39, ~x$r_buff1_thd4~0=v_~x$r_buff1_thd4~0_20, ~x$w_buff0_used~0=v_~x$w_buff0_used~0_100} OutVars{~x$w_buff0~0=v_~x$w_buff0~0_35, ~x$w_buff1~0=v_~x$w_buff1~0_28, ~x$w_buff1_used~0=v_~x$w_buff1_used~0_92, ~x$r_buff0_thd4~0=v_~x$r_buff0_thd4~0_23, ~x~0=v_~x~0_38, ~x$r_buff1_thd4~0=v_~x$r_buff1_thd4~0_19, ~x$w_buff0_used~0=v_~x$w_buff0_used~0_99} AuxVars[] AssignedVars[~x$w_buff1_used~0, ~x$r_buff0_thd4~0, ~x~0, ~x$r_buff1_thd4~0, ~x$w_buff0_used~0][105], [Black: 161#(= ~__unbuffered_cnt~0 0), Black: 162#(= |ULTIMATE.start_assume_abort_if_not_#in~cond#1| 0), Black: 164#(and (= ~__unbuffered_cnt~0 0) (= |ULTIMATE.start_assume_abort_if_not_#in~cond#1| 0)), P3Thread1of1ForFork0InUse, 47#L795true, P1Thread1of1ForFork1InUse, 43#P2EXITtrue, 187#(and (= ~__unbuffered_p3_EBX~0 1) (= ~a~0 1)), P0Thread1of1ForFork3InUse, 173#(= |ULTIMATE.start_assume_abort_if_not_#in~cond#1| 0), P2Thread1of1ForFork2InUse, 112#P0EXITtrue, Black: 177#(and (<= ~__unbuffered_cnt~0 1) (= |ULTIMATE.start_assume_abort_if_not_#in~cond#1| 0)), Black: 172#(<= ~__unbuffered_cnt~0 1), Black: 150#(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))), 45#L873true, 92#L845true, 202#(and (<= ~__unbuffered_cnt~0 2) (= |ULTIMATE.start_assume_abort_if_not_#in~cond#1| 0)), Black: 156#(= ~__unbuffered_p3_EAX~0 0), Black: 184#(= ~a~0 1)]) [2023-08-24 11:39:58,183 INFO L294 olderBase$Statistics]: this new event has 22 ancestors and is cut-off event [2023-08-24 11:39:58,183 INFO L297 olderBase$Statistics]: existing Event has 22 ancestors and is cut-off event [2023-08-24 11:39:58,183 INFO L297 olderBase$Statistics]: existing Event has 22 ancestors and is cut-off event [2023-08-24 11:39:58,183 INFO L297 olderBase$Statistics]: existing Event has 22 ancestors and is cut-off event [2023-08-24 11:39:58,290 INFO L124 PetriNetUnfolderBase]: 5993/9321 cut-off events. [2023-08-24 11:39:58,290 INFO L125 PetriNetUnfolderBase]: For 11952/11988 co-relation queries the response was YES. [2023-08-24 11:39:58,307 INFO L83 FinitePrefix]: Finished finitePrefix Result has 29623 conditions, 9321 events. 5993/9321 cut-off events. For 11952/11988 co-relation queries the response was YES. Maximal size of possible extension queue 562. Compared 60750 event pairs, 609 based on Foata normal form. 292/9453 useless extension candidates. Maximal degree in co-relation 29602. Up to 1919 conditions per place. [2023-08-24 11:39:58,324 INFO L140 encePairwiseOnDemand]: 230/237 looper letters, 97 selfloop transitions, 26 changer transitions 13/146 dead transitions. [2023-08-24 11:39:58,324 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 64 places, 146 transitions, 921 flow [2023-08-24 11:39:58,325 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2023-08-24 11:39:58,325 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 9 states. [2023-08-24 11:39:58,326 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 9 states to 9 states and 1094 transitions. [2023-08-24 11:39:58,327 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.5128926394749179 [2023-08-24 11:39:58,327 INFO L72 ComplementDD]: Start complementDD. Operand 9 states and 1094 transitions. [2023-08-24 11:39:58,327 INFO L73 IsDeterministic]: Start isDeterministic. Operand 9 states and 1094 transitions. [2023-08-24 11:39:58,328 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2023-08-24 11:39:58,328 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 9 states and 1094 transitions. [2023-08-24 11:39:58,329 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 10 states, 9 states have (on average 121.55555555555556) internal successors, (1094), 9 states have internal predecessors, (1094), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-24 11:39:58,331 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 10 states, 10 states have (on average 237.0) internal successors, (2370), 10 states have internal predecessors, (2370), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-24 11:39:58,332 INFO L81 ComplementDD]: Finished complementDD. Result has 10 states, 10 states have (on average 237.0) internal successors, (2370), 10 states have internal predecessors, (2370), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-24 11:39:58,332 INFO L175 Difference]: Start difference. First operand has 56 places, 51 transitions, 270 flow. Second operand 9 states and 1094 transitions. [2023-08-24 11:39:58,332 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 64 places, 146 transitions, 921 flow [2023-08-24 11:39:58,565 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 63 places, 146 transitions, 913 flow, removed 0 selfloop flow, removed 1 redundant places. [2023-08-24 11:39:58,566 INFO L231 Difference]: Finished difference. Result has 66 places, 60 transitions, 443 flow [2023-08-24 11:39:58,566 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=237, PETRI_DIFFERENCE_MINUEND_FLOW=269, PETRI_DIFFERENCE_MINUEND_PLACES=55, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=51, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=21, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=29, PETRI_DIFFERENCE_SUBTRAHEND_STATES=9, PETRI_FLOW=443, PETRI_PLACES=66, PETRI_TRANSITIONS=60} [2023-08-24 11:39:58,567 INFO L281 CegarLoopForPetriNet]: 42 programPoint places, 24 predicate places. [2023-08-24 11:39:58,567 INFO L495 AbstractCegarLoop]: Abstraction has has 66 places, 60 transitions, 443 flow [2023-08-24 11:39:58,567 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 110.83333333333333) internal successors, (665), 6 states have internal predecessors, (665), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-24 11:39:58,567 INFO L200 CegarLoopForPetriNet]: Found error trace [2023-08-24 11:39:58,567 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-24 11:39:58,567 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable6 [2023-08-24 11:39:58,568 INFO L420 AbstractCegarLoop]: === Iteration 8 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [P1Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 4 more)] === [2023-08-24 11:39:58,568 INFO L145 PredicateUnifier]: Initialized classic predicate unifier [2023-08-24 11:39:58,568 INFO L85 PathProgramCache]: Analyzing trace with hash 593381539, now seen corresponding path program 1 times [2023-08-24 11:39:58,568 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-08-24 11:39:58,568 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [226738278] [2023-08-24 11:39:58,568 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-08-24 11:39:58,568 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-08-24 11:39:58,586 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-08-24 11:39:58,703 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-24 11:39:58,703 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-08-24 11:39:58,703 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [226738278] [2023-08-24 11:39:58,703 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [226738278] provided 1 perfect and 0 imperfect interpolant sequences [2023-08-24 11:39:58,703 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-08-24 11:39:58,703 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2023-08-24 11:39:58,703 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [173206697] [2023-08-24 11:39:58,703 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-08-24 11:39:58,704 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2023-08-24 11:39:58,704 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-08-24 11:39:58,704 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2023-08-24 11:39:58,704 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2023-08-24 11:39:58,705 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 105 out of 237 [2023-08-24 11:39:58,705 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 66 places, 60 transitions, 443 flow. Second operand has 4 states, 4 states have (on average 111.0) internal successors, (444), 4 states have internal predecessors, (444), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-24 11:39:58,705 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2023-08-24 11:39:58,705 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 105 of 237 [2023-08-24 11:39:58,705 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2023-08-24 11:39:59,737 INFO L124 PetriNetUnfolderBase]: 10531/15683 cut-off events. [2023-08-24 11:39:59,737 INFO L125 PetriNetUnfolderBase]: For 39292/39292 co-relation queries the response was YES. [2023-08-24 11:39:59,763 INFO L83 FinitePrefix]: Finished finitePrefix Result has 58703 conditions, 15683 events. 10531/15683 cut-off events. For 39292/39292 co-relation queries the response was YES. Maximal size of possible extension queue 662. Compared 95767 event pairs, 2252 based on Foata normal form. 13/15696 useless extension candidates. Maximal degree in co-relation 58678. Up to 9016 conditions per place. [2023-08-24 11:39:59,778 INFO L140 encePairwiseOnDemand]: 231/237 looper letters, 69 selfloop transitions, 8 changer transitions 40/117 dead transitions. [2023-08-24 11:39:59,778 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 69 places, 117 transitions, 1092 flow [2023-08-24 11:39:59,779 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2023-08-24 11:39:59,779 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 4 states. [2023-08-24 11:39:59,780 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 480 transitions. [2023-08-24 11:39:59,780 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.5063291139240507 [2023-08-24 11:39:59,780 INFO L72 ComplementDD]: Start complementDD. Operand 4 states and 480 transitions. [2023-08-24 11:39:59,780 INFO L73 IsDeterministic]: Start isDeterministic. Operand 4 states and 480 transitions. [2023-08-24 11:39:59,780 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2023-08-24 11:39:59,780 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 4 states and 480 transitions. [2023-08-24 11:39:59,785 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 5 states, 4 states have (on average 120.0) internal successors, (480), 4 states have internal predecessors, (480), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-24 11:39:59,786 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 5 states, 5 states have (on average 237.0) internal successors, (1185), 5 states have internal predecessors, (1185), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-24 11:39:59,786 INFO L81 ComplementDD]: Finished complementDD. Result has 5 states, 5 states have (on average 237.0) internal successors, (1185), 5 states have internal predecessors, (1185), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-24 11:39:59,786 INFO L175 Difference]: Start difference. First operand has 66 places, 60 transitions, 443 flow. Second operand 4 states and 480 transitions. [2023-08-24 11:39:59,786 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 69 places, 117 transitions, 1092 flow [2023-08-24 11:40:00,726 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 65 places, 117 transitions, 905 flow, removed 68 selfloop flow, removed 4 redundant places. [2023-08-24 11:40:00,727 INFO L231 Difference]: Finished difference. Result has 67 places, 48 transitions, 290 flow [2023-08-24 11:40:00,727 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=237, PETRI_DIFFERENCE_MINUEND_FLOW=350, PETRI_DIFFERENCE_MINUEND_PLACES=62, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=60, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=4, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=53, PETRI_DIFFERENCE_SUBTRAHEND_STATES=4, PETRI_FLOW=290, PETRI_PLACES=67, PETRI_TRANSITIONS=48} [2023-08-24 11:40:00,727 INFO L281 CegarLoopForPetriNet]: 42 programPoint places, 25 predicate places. [2023-08-24 11:40:00,727 INFO L495 AbstractCegarLoop]: Abstraction has has 67 places, 48 transitions, 290 flow [2023-08-24 11:40:00,728 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 111.0) internal successors, (444), 4 states have internal predecessors, (444), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-24 11:40:00,728 INFO L200 CegarLoopForPetriNet]: Found error trace [2023-08-24 11:40:00,728 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-08-24 11:40:00,728 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable7 [2023-08-24 11:40:00,728 INFO L420 AbstractCegarLoop]: === Iteration 9 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [P1Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 4 more)] === [2023-08-24 11:40:00,728 INFO L145 PredicateUnifier]: Initialized classic predicate unifier [2023-08-24 11:40:00,728 INFO L85 PathProgramCache]: Analyzing trace with hash 586013674, now seen corresponding path program 1 times [2023-08-24 11:40:00,728 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-08-24 11:40:00,728 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [695749598] [2023-08-24 11:40:00,729 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-08-24 11:40:00,729 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-08-24 11:40:00,761 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-08-24 11:40:01,064 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-24 11:40:01,064 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-08-24 11:40:01,064 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [695749598] [2023-08-24 11:40:01,064 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [695749598] provided 1 perfect and 0 imperfect interpolant sequences [2023-08-24 11:40:01,064 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-08-24 11:40:01,064 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2023-08-24 11:40:01,064 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1051352282] [2023-08-24 11:40:01,065 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-08-24 11:40:01,065 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2023-08-24 11:40:01,066 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-08-24 11:40:01,066 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2023-08-24 11:40:01,068 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2023-08-24 11:40:01,068 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 110 out of 237 [2023-08-24 11:40:01,068 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 67 places, 48 transitions, 290 flow. Second operand has 5 states, 5 states have (on average 114.0) internal successors, (570), 5 states have internal predecessors, (570), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-24 11:40:01,068 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2023-08-24 11:40:01,068 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 110 of 237 [2023-08-24 11:40:01,068 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2023-08-24 11:40:01,578 INFO L292 olderBase$Statistics]: inserting event number 4 for the transition-marking pair ([395] L838-->L845: Formula: (let ((.cse3 (not (= (mod v_~x$r_buff1_thd4~0_20 256) 0))) (.cse4 (not (= (mod v_~x$w_buff0_used~0_99 256) 0))) (.cse5 (not (= (mod v_~x$r_buff0_thd4~0_24 256) 0)))) (let ((.cse0 (and .cse5 (not (= (mod v_~x$w_buff0_used~0_100 256) 0)))) (.cse2 (and .cse5 .cse4)) (.cse1 (and (not (= (mod v_~x$w_buff1_used~0_93 256) 0)) .cse3))) (and (= v_~x~0_38 (ite .cse0 v_~x$w_buff0~0_35 (ite .cse1 v_~x$w_buff1~0_28 v_~x~0_39))) (= (ite .cse2 0 v_~x$r_buff0_thd4~0_24) v_~x$r_buff0_thd4~0_23) (= v_~x$r_buff1_thd4~0_19 (ite (or (and (not (= (mod v_~x$w_buff1_used~0_92 256) 0)) .cse3) (and .cse4 (not (= (mod v_~x$r_buff0_thd4~0_23 256) 0)))) 0 v_~x$r_buff1_thd4~0_20)) (= (ite .cse0 0 v_~x$w_buff0_used~0_100) v_~x$w_buff0_used~0_99) (= v_~x$w_buff1_used~0_92 (ite (or .cse2 .cse1) 0 v_~x$w_buff1_used~0_93))))) InVars {~x$w_buff0~0=v_~x$w_buff0~0_35, ~x$w_buff1~0=v_~x$w_buff1~0_28, ~x$w_buff1_used~0=v_~x$w_buff1_used~0_93, ~x$r_buff0_thd4~0=v_~x$r_buff0_thd4~0_24, ~x~0=v_~x~0_39, ~x$r_buff1_thd4~0=v_~x$r_buff1_thd4~0_20, ~x$w_buff0_used~0=v_~x$w_buff0_used~0_100} OutVars{~x$w_buff0~0=v_~x$w_buff0~0_35, ~x$w_buff1~0=v_~x$w_buff1~0_28, ~x$w_buff1_used~0=v_~x$w_buff1_used~0_92, ~x$r_buff0_thd4~0=v_~x$r_buff0_thd4~0_23, ~x~0=v_~x~0_38, ~x$r_buff1_thd4~0=v_~x$r_buff1_thd4~0_19, ~x$w_buff0_used~0=v_~x$w_buff0_used~0_99} AuxVars[] AssignedVars[~x$w_buff1_used~0, ~x$r_buff0_thd4~0, ~x~0, ~x$r_buff1_thd4~0, ~x$w_buff0_used~0][70], [32#L770true, P3Thread1of1ForFork0InUse, 47#L795true, P1Thread1of1ForFork1InUse, 187#(and (= ~__unbuffered_p3_EBX~0 1) (= ~a~0 1)), Black: 195#(<= ~__unbuffered_cnt~0 2), P0Thread1of1ForFork3InUse, Black: 196#(= |ULTIMATE.start_assume_abort_if_not_#in~cond#1| 0), Black: 202#(and (<= ~__unbuffered_cnt~0 2) (= |ULTIMATE.start_assume_abort_if_not_#in~cond#1| 0)), 209#(= ~z~0 1), P2Thread1of1ForFork2InUse, 214#true, Black: 210#(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: 150#(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: 156#(= ~__unbuffered_p3_EAX~0 0), 92#L845true, 172#(<= ~__unbuffered_cnt~0 1), 59#L869-3true, Black: 161#(= ~__unbuffered_cnt~0 0), Black: 162#(= |ULTIMATE.start_assume_abort_if_not_#in~cond#1| 0), Black: 164#(and (= ~__unbuffered_cnt~0 0) (= |ULTIMATE.start_assume_abort_if_not_#in~cond#1| 0)), 43#P2EXITtrue, Black: 177#(and (<= ~__unbuffered_cnt~0 1) (= |ULTIMATE.start_assume_abort_if_not_#in~cond#1| 0)), Black: 173#(= |ULTIMATE.start_assume_abort_if_not_#in~cond#1| 0), Black: 184#(= ~a~0 1)]) [2023-08-24 11:40:01,578 INFO L294 olderBase$Statistics]: this new event has 20 ancestors and is cut-off event [2023-08-24 11:40:01,578 INFO L297 olderBase$Statistics]: existing Event has 20 ancestors and is cut-off event [2023-08-24 11:40:01,578 INFO L297 olderBase$Statistics]: existing Event has 20 ancestors and is cut-off event [2023-08-24 11:40:01,578 INFO L297 olderBase$Statistics]: existing Event has 20 ancestors and is cut-off event [2023-08-24 11:40:01,662 INFO L292 olderBase$Statistics]: inserting event number 4 for the transition-marking pair ([395] L838-->L845: Formula: (let ((.cse3 (not (= (mod v_~x$r_buff1_thd4~0_20 256) 0))) (.cse4 (not (= (mod v_~x$w_buff0_used~0_99 256) 0))) (.cse5 (not (= (mod v_~x$r_buff0_thd4~0_24 256) 0)))) (let ((.cse0 (and .cse5 (not (= (mod v_~x$w_buff0_used~0_100 256) 0)))) (.cse2 (and .cse5 .cse4)) (.cse1 (and (not (= (mod v_~x$w_buff1_used~0_93 256) 0)) .cse3))) (and (= v_~x~0_38 (ite .cse0 v_~x$w_buff0~0_35 (ite .cse1 v_~x$w_buff1~0_28 v_~x~0_39))) (= (ite .cse2 0 v_~x$r_buff0_thd4~0_24) v_~x$r_buff0_thd4~0_23) (= v_~x$r_buff1_thd4~0_19 (ite (or (and (not (= (mod v_~x$w_buff1_used~0_92 256) 0)) .cse3) (and .cse4 (not (= (mod v_~x$r_buff0_thd4~0_23 256) 0)))) 0 v_~x$r_buff1_thd4~0_20)) (= (ite .cse0 0 v_~x$w_buff0_used~0_100) v_~x$w_buff0_used~0_99) (= v_~x$w_buff1_used~0_92 (ite (or .cse2 .cse1) 0 v_~x$w_buff1_used~0_93))))) InVars {~x$w_buff0~0=v_~x$w_buff0~0_35, ~x$w_buff1~0=v_~x$w_buff1~0_28, ~x$w_buff1_used~0=v_~x$w_buff1_used~0_93, ~x$r_buff0_thd4~0=v_~x$r_buff0_thd4~0_24, ~x~0=v_~x~0_39, ~x$r_buff1_thd4~0=v_~x$r_buff1_thd4~0_20, ~x$w_buff0_used~0=v_~x$w_buff0_used~0_100} OutVars{~x$w_buff0~0=v_~x$w_buff0~0_35, ~x$w_buff1~0=v_~x$w_buff1~0_28, ~x$w_buff1_used~0=v_~x$w_buff1_used~0_92, ~x$r_buff0_thd4~0=v_~x$r_buff0_thd4~0_23, ~x~0=v_~x~0_38, ~x$r_buff1_thd4~0=v_~x$r_buff1_thd4~0_19, ~x$w_buff0_used~0=v_~x$w_buff0_used~0_99} AuxVars[] AssignedVars[~x$w_buff1_used~0, ~x$r_buff0_thd4~0, ~x~0, ~x$r_buff1_thd4~0, ~x$w_buff0_used~0][70], [P3Thread1of1ForFork0InUse, 47#L795true, P1Thread1of1ForFork1InUse, 187#(and (= ~__unbuffered_p3_EBX~0 1) (= ~a~0 1)), P0Thread1of1ForFork3InUse, Black: 196#(= |ULTIMATE.start_assume_abort_if_not_#in~cond#1| 0), Black: 202#(and (<= ~__unbuffered_cnt~0 2) (= |ULTIMATE.start_assume_abort_if_not_#in~cond#1| 0)), 209#(= ~z~0 1), P2Thread1of1ForFork2InUse, 214#true, Black: 210#(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: 150#(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: 156#(= ~__unbuffered_p3_EAX~0 0), 92#L845true, 59#L869-3true, Black: 161#(= ~__unbuffered_cnt~0 0), Black: 162#(= |ULTIMATE.start_assume_abort_if_not_#in~cond#1| 0), Black: 164#(and (= ~__unbuffered_cnt~0 0) (= |ULTIMATE.start_assume_abort_if_not_#in~cond#1| 0)), 43#P2EXITtrue, 112#P0EXITtrue, Black: 177#(and (<= ~__unbuffered_cnt~0 1) (= |ULTIMATE.start_assume_abort_if_not_#in~cond#1| 0)), Black: 172#(<= ~__unbuffered_cnt~0 1), Black: 173#(= |ULTIMATE.start_assume_abort_if_not_#in~cond#1| 0), 195#(<= ~__unbuffered_cnt~0 2), Black: 184#(= ~a~0 1)]) [2023-08-24 11:40:01,662 INFO L294 olderBase$Statistics]: this new event has 21 ancestors and is cut-off event [2023-08-24 11:40:01,662 INFO L297 olderBase$Statistics]: existing Event has 21 ancestors and is cut-off event [2023-08-24 11:40:01,662 INFO L297 olderBase$Statistics]: existing Event has 21 ancestors and is cut-off event [2023-08-24 11:40:01,662 INFO L297 olderBase$Statistics]: existing Event has 21 ancestors and is cut-off event [2023-08-24 11:40:01,875 INFO L124 PetriNetUnfolderBase]: 5500/9136 cut-off events. [2023-08-24 11:40:01,876 INFO L125 PetriNetUnfolderBase]: For 13130/13189 co-relation queries the response was YES. [2023-08-24 11:40:01,888 INFO L83 FinitePrefix]: Finished finitePrefix Result has 30722 conditions, 9136 events. 5500/9136 cut-off events. For 13130/13189 co-relation queries the response was YES. Maximal size of possible extension queue 528. Compared 63653 event pairs, 1221 based on Foata normal form. 27/8934 useless extension candidates. Maximal degree in co-relation 30694. Up to 4680 conditions per place. [2023-08-24 11:40:01,897 INFO L140 encePairwiseOnDemand]: 230/237 looper letters, 86 selfloop transitions, 11 changer transitions 56/161 dead transitions. [2023-08-24 11:40:01,897 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 66 places, 161 transitions, 1287 flow [2023-08-24 11:40:01,897 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2023-08-24 11:40:01,897 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 6 states. [2023-08-24 11:40:01,899 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6 states to 6 states and 744 transitions. [2023-08-24 11:40:01,899 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.5232067510548524 [2023-08-24 11:40:01,899 INFO L72 ComplementDD]: Start complementDD. Operand 6 states and 744 transitions. [2023-08-24 11:40:01,899 INFO L73 IsDeterministic]: Start isDeterministic. Operand 6 states and 744 transitions. [2023-08-24 11:40:01,899 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2023-08-24 11:40:01,899 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 6 states and 744 transitions. [2023-08-24 11:40:01,900 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 7 states, 6 states have (on average 124.0) internal successors, (744), 6 states have internal predecessors, (744), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-24 11:40:01,902 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 7 states, 7 states have (on average 237.0) internal successors, (1659), 7 states have internal predecessors, (1659), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-24 11:40:01,902 INFO L81 ComplementDD]: Finished complementDD. Result has 7 states, 7 states have (on average 237.0) internal successors, (1659), 7 states have internal predecessors, (1659), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-24 11:40:01,902 INFO L175 Difference]: Start difference. First operand has 67 places, 48 transitions, 290 flow. Second operand 6 states and 744 transitions. [2023-08-24 11:40:01,902 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 66 places, 161 transitions, 1287 flow [2023-08-24 11:40:02,004 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 61 places, 161 transitions, 1203 flow, removed 42 selfloop flow, removed 5 redundant places. [2023-08-24 11:40:02,006 INFO L231 Difference]: Finished difference. Result has 64 places, 58 transitions, 359 flow [2023-08-24 11:40:02,006 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=237, PETRI_DIFFERENCE_MINUEND_FLOW=270, PETRI_DIFFERENCE_MINUEND_PLACES=56, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=48, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=4, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=40, PETRI_DIFFERENCE_SUBTRAHEND_STATES=6, PETRI_FLOW=359, PETRI_PLACES=64, PETRI_TRANSITIONS=58} [2023-08-24 11:40:02,006 INFO L281 CegarLoopForPetriNet]: 42 programPoint places, 22 predicate places. [2023-08-24 11:40:02,006 INFO L495 AbstractCegarLoop]: Abstraction has has 64 places, 58 transitions, 359 flow [2023-08-24 11:40:02,007 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 114.0) internal successors, (570), 5 states have internal predecessors, (570), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-24 11:40:02,007 INFO L200 CegarLoopForPetriNet]: Found error trace [2023-08-24 11:40:02,007 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-08-24 11:40:02,007 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable8 [2023-08-24 11:40:02,007 INFO L420 AbstractCegarLoop]: === Iteration 10 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [P1Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 4 more)] === [2023-08-24 11:40:02,007 INFO L145 PredicateUnifier]: Initialized classic predicate unifier [2023-08-24 11:40:02,007 INFO L85 PathProgramCache]: Analyzing trace with hash 531315468, now seen corresponding path program 2 times [2023-08-24 11:40:02,007 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-08-24 11:40:02,007 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1139092115] [2023-08-24 11:40:02,007 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-08-24 11:40:02,008 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-08-24 11:40:02,027 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-08-24 11:40:02,576 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-08-24 11:40:02,576 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-08-24 11:40:02,576 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1139092115] [2023-08-24 11:40:02,576 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1139092115] provided 1 perfect and 0 imperfect interpolant sequences [2023-08-24 11:40:02,577 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-08-24 11:40:02,577 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2023-08-24 11:40:02,577 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2071428983] [2023-08-24 11:40:02,577 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-08-24 11:40:02,577 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2023-08-24 11:40:02,577 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-08-24 11:40:02,577 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2023-08-24 11:40:02,577 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=12, Invalid=30, Unknown=0, NotChecked=0, Total=42 [2023-08-24 11:40:02,578 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 108 out of 237 [2023-08-24 11:40:02,578 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 64 places, 58 transitions, 359 flow. Second operand has 7 states, 7 states have (on average 110.85714285714286) internal successors, (776), 7 states have internal predecessors, (776), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-24 11:40:02,578 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2023-08-24 11:40:02,578 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 108 of 237 [2023-08-24 11:40:02,579 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2023-08-24 11:40:03,509 INFO L124 PetriNetUnfolderBase]: 5875/9817 cut-off events. [2023-08-24 11:40:03,510 INFO L125 PetriNetUnfolderBase]: For 16992/17721 co-relation queries the response was YES. [2023-08-24 11:40:03,529 INFO L83 FinitePrefix]: Finished finitePrefix Result has 37167 conditions, 9817 events. 5875/9817 cut-off events. For 16992/17721 co-relation queries the response was YES. Maximal size of possible extension queue 619. Compared 70508 event pairs, 774 based on Foata normal form. 394/9957 useless extension candidates. Maximal degree in co-relation 37140. Up to 3516 conditions per place. [2023-08-24 11:40:03,543 INFO L140 encePairwiseOnDemand]: 230/237 looper letters, 116 selfloop transitions, 13 changer transitions 28/165 dead transitions. [2023-08-24 11:40:03,543 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 67 places, 165 transitions, 1305 flow [2023-08-24 11:40:03,543 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2023-08-24 11:40:03,543 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 6 states. [2023-08-24 11:40:03,544 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6 states to 6 states and 734 transitions. [2023-08-24 11:40:03,545 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.5161744022503516 [2023-08-24 11:40:03,545 INFO L72 ComplementDD]: Start complementDD. Operand 6 states and 734 transitions. [2023-08-24 11:40:03,545 INFO L73 IsDeterministic]: Start isDeterministic. Operand 6 states and 734 transitions. [2023-08-24 11:40:03,545 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2023-08-24 11:40:03,545 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 6 states and 734 transitions. [2023-08-24 11:40:03,546 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 7 states, 6 states have (on average 122.33333333333333) internal successors, (734), 6 states have internal predecessors, (734), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-24 11:40:03,548 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 7 states, 7 states have (on average 237.0) internal successors, (1659), 7 states have internal predecessors, (1659), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-24 11:40:03,548 INFO L81 ComplementDD]: Finished complementDD. Result has 7 states, 7 states have (on average 237.0) internal successors, (1659), 7 states have internal predecessors, (1659), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-24 11:40:03,548 INFO L175 Difference]: Start difference. First operand has 64 places, 58 transitions, 359 flow. Second operand 6 states and 734 transitions. [2023-08-24 11:40:03,548 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 67 places, 165 transitions, 1305 flow [2023-08-24 11:40:03,750 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 66 places, 165 transitions, 1295 flow, removed 5 selfloop flow, removed 1 redundant places. [2023-08-24 11:40:03,751 INFO L231 Difference]: Finished difference. Result has 69 places, 63 transitions, 442 flow [2023-08-24 11:40:03,751 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=237, PETRI_DIFFERENCE_MINUEND_FLOW=355, PETRI_DIFFERENCE_MINUEND_PLACES=61, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=58, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=8, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=46, PETRI_DIFFERENCE_SUBTRAHEND_STATES=6, PETRI_FLOW=442, PETRI_PLACES=69, PETRI_TRANSITIONS=63} [2023-08-24 11:40:03,751 INFO L281 CegarLoopForPetriNet]: 42 programPoint places, 27 predicate places. [2023-08-24 11:40:03,752 INFO L495 AbstractCegarLoop]: Abstraction has has 69 places, 63 transitions, 442 flow [2023-08-24 11:40:03,752 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 7 states, 7 states have (on average 110.85714285714286) internal successors, (776), 7 states have internal predecessors, (776), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-24 11:40:03,752 INFO L200 CegarLoopForPetriNet]: Found error trace [2023-08-24 11:40:03,752 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-08-24 11:40:03,752 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable9 [2023-08-24 11:40:03,752 INFO L420 AbstractCegarLoop]: === Iteration 11 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [P1Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 4 more)] === [2023-08-24 11:40:03,752 INFO L145 PredicateUnifier]: Initialized classic predicate unifier [2023-08-24 11:40:03,753 INFO L85 PathProgramCache]: Analyzing trace with hash -2123183322, now seen corresponding path program 3 times [2023-08-24 11:40:03,753 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-08-24 11:40:03,753 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [516520791] [2023-08-24 11:40:03,753 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-08-24 11:40:03,753 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-08-24 11:40:03,806 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-08-24 11:40:03,942 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-24 11:40:03,943 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-08-24 11:40:03,943 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [516520791] [2023-08-24 11:40:03,943 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [516520791] provided 1 perfect and 0 imperfect interpolant sequences [2023-08-24 11:40:03,943 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-08-24 11:40:03,943 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2023-08-24 11:40:03,943 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [878724900] [2023-08-24 11:40:03,943 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-08-24 11:40:03,943 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2023-08-24 11:40:03,944 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-08-24 11:40:03,944 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2023-08-24 11:40:03,944 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=17, Invalid=25, Unknown=0, NotChecked=0, Total=42 [2023-08-24 11:40:03,944 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 108 out of 237 [2023-08-24 11:40:03,945 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 69 places, 63 transitions, 442 flow. Second operand has 7 states, 7 states have (on average 110.85714285714286) internal successors, (776), 7 states have internal predecessors, (776), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-24 11:40:03,945 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2023-08-24 11:40:03,945 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 108 of 237 [2023-08-24 11:40:03,945 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2023-08-24 11:40:04,540 INFO L292 olderBase$Statistics]: inserting event number 4 for the transition-marking pair ([395] L838-->L845: Formula: (let ((.cse3 (not (= (mod v_~x$r_buff1_thd4~0_20 256) 0))) (.cse4 (not (= (mod v_~x$w_buff0_used~0_99 256) 0))) (.cse5 (not (= (mod v_~x$r_buff0_thd4~0_24 256) 0)))) (let ((.cse0 (and .cse5 (not (= (mod v_~x$w_buff0_used~0_100 256) 0)))) (.cse2 (and .cse5 .cse4)) (.cse1 (and (not (= (mod v_~x$w_buff1_used~0_93 256) 0)) .cse3))) (and (= v_~x~0_38 (ite .cse0 v_~x$w_buff0~0_35 (ite .cse1 v_~x$w_buff1~0_28 v_~x~0_39))) (= (ite .cse2 0 v_~x$r_buff0_thd4~0_24) v_~x$r_buff0_thd4~0_23) (= v_~x$r_buff1_thd4~0_19 (ite (or (and (not (= (mod v_~x$w_buff1_used~0_92 256) 0)) .cse3) (and .cse4 (not (= (mod v_~x$r_buff0_thd4~0_23 256) 0)))) 0 v_~x$r_buff1_thd4~0_20)) (= (ite .cse0 0 v_~x$w_buff0_used~0_100) v_~x$w_buff0_used~0_99) (= v_~x$w_buff1_used~0_92 (ite (or .cse2 .cse1) 0 v_~x$w_buff1_used~0_93))))) InVars {~x$w_buff0~0=v_~x$w_buff0~0_35, ~x$w_buff1~0=v_~x$w_buff1~0_28, ~x$w_buff1_used~0=v_~x$w_buff1_used~0_93, ~x$r_buff0_thd4~0=v_~x$r_buff0_thd4~0_24, ~x~0=v_~x~0_39, ~x$r_buff1_thd4~0=v_~x$r_buff1_thd4~0_20, ~x$w_buff0_used~0=v_~x$w_buff0_used~0_100} OutVars{~x$w_buff0~0=v_~x$w_buff0~0_35, ~x$w_buff1~0=v_~x$w_buff1~0_28, ~x$w_buff1_used~0=v_~x$w_buff1_used~0_92, ~x$r_buff0_thd4~0=v_~x$r_buff0_thd4~0_23, ~x~0=v_~x~0_38, ~x$r_buff1_thd4~0=v_~x$r_buff1_thd4~0_19, ~x$w_buff0_used~0=v_~x$w_buff0_used~0_99} AuxVars[] AssignedVars[~x$w_buff1_used~0, ~x$r_buff0_thd4~0, ~x~0, ~x$r_buff1_thd4~0, ~x$w_buff0_used~0][69], [32#L770true, P3Thread1of1ForFork0InUse, 47#L795true, P1Thread1of1ForFork1InUse, 187#(and (= ~__unbuffered_p3_EBX~0 1) (= ~a~0 1)), Black: 195#(<= ~__unbuffered_cnt~0 2), P0Thread1of1ForFork3InUse, P2Thread1of1ForFork2InUse, 209#(= ~z~0 1), 214#true, Black: 210#(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))), 244#(<= ~__unbuffered_cnt~0 1), Black: 150#(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))), 226#true, 92#L845true, Black: 156#(= ~__unbuffered_p3_EAX~0 0), Black: 216#(and (<= (div ~x$w_buff0_used~0 256) 0) (= ~x$w_buff0~0 1) (<= 1 ~x$w_buff0_used~0) (= 1 ~x$r_buff0_thd2~0)), Black: 217#(and (= ~x$w_buff0~0 1) (= ~x$w_buff0_used~0 0) (= ~x~0 1)), 172#(<= ~__unbuffered_cnt~0 1), 59#L869-3true, Black: 161#(= ~__unbuffered_cnt~0 0), Black: 164#(and (= ~__unbuffered_cnt~0 0) (= |ULTIMATE.start_assume_abort_if_not_#in~cond#1| 0)), 43#P2EXITtrue, Black: 236#(and (not (= 0 ~x$w_buff0~0)) (<= ~x$r_buff0_thd4~0 (* 256 (div ~x$r_buff0_thd4~0 256))) (= ~x$w_buff1_used~0 0) (= ~x$w_buff0_used~0 0) (not (= ~x~0 0)) (not (= ~__unbuffered_p0_EAX~0 0)) (<= 0 ~x$r_buff0_thd4~0)), Black: 229#(and (<= (div ~x$w_buff0_used~0 256) 0) (<= ~x$r_buff0_thd4~0 (* 256 (div ~x$r_buff0_thd4~0 256))) (= ~x$w_buff1_used~0 0) (= ~x$w_buff0~0 1) (<= 1 ~x$w_buff0_used~0) (= 1 ~x$r_buff0_thd2~0) (<= 0 ~x$r_buff0_thd4~0)), Black: 234#(and (not (= 0 ~x$w_buff0~0)) (<= ~x$r_buff0_thd4~0 (* 256 (div ~x$r_buff0_thd4~0 256))) (= ~x$w_buff1_used~0 0) (= ~x$w_buff0_used~0 0) (not (= ~x~0 0)) (<= 0 ~x$r_buff0_thd4~0)), Black: 184#(= ~a~0 1)]) [2023-08-24 11:40:04,540 INFO L294 olderBase$Statistics]: this new event has 20 ancestors and is cut-off event [2023-08-24 11:40:04,540 INFO L297 olderBase$Statistics]: existing Event has 20 ancestors and is cut-off event [2023-08-24 11:40:04,540 INFO L297 olderBase$Statistics]: existing Event has 20 ancestors and is cut-off event [2023-08-24 11:40:04,540 INFO L297 olderBase$Statistics]: existing Event has 20 ancestors and is cut-off event [2023-08-24 11:40:04,630 INFO L292 olderBase$Statistics]: inserting event number 4 for the transition-marking pair ([395] L838-->L845: Formula: (let ((.cse3 (not (= (mod v_~x$r_buff1_thd4~0_20 256) 0))) (.cse4 (not (= (mod v_~x$w_buff0_used~0_99 256) 0))) (.cse5 (not (= (mod v_~x$r_buff0_thd4~0_24 256) 0)))) (let ((.cse0 (and .cse5 (not (= (mod v_~x$w_buff0_used~0_100 256) 0)))) (.cse2 (and .cse5 .cse4)) (.cse1 (and (not (= (mod v_~x$w_buff1_used~0_93 256) 0)) .cse3))) (and (= v_~x~0_38 (ite .cse0 v_~x$w_buff0~0_35 (ite .cse1 v_~x$w_buff1~0_28 v_~x~0_39))) (= (ite .cse2 0 v_~x$r_buff0_thd4~0_24) v_~x$r_buff0_thd4~0_23) (= v_~x$r_buff1_thd4~0_19 (ite (or (and (not (= (mod v_~x$w_buff1_used~0_92 256) 0)) .cse3) (and .cse4 (not (= (mod v_~x$r_buff0_thd4~0_23 256) 0)))) 0 v_~x$r_buff1_thd4~0_20)) (= (ite .cse0 0 v_~x$w_buff0_used~0_100) v_~x$w_buff0_used~0_99) (= v_~x$w_buff1_used~0_92 (ite (or .cse2 .cse1) 0 v_~x$w_buff1_used~0_93))))) InVars {~x$w_buff0~0=v_~x$w_buff0~0_35, ~x$w_buff1~0=v_~x$w_buff1~0_28, ~x$w_buff1_used~0=v_~x$w_buff1_used~0_93, ~x$r_buff0_thd4~0=v_~x$r_buff0_thd4~0_24, ~x~0=v_~x~0_39, ~x$r_buff1_thd4~0=v_~x$r_buff1_thd4~0_20, ~x$w_buff0_used~0=v_~x$w_buff0_used~0_100} OutVars{~x$w_buff0~0=v_~x$w_buff0~0_35, ~x$w_buff1~0=v_~x$w_buff1~0_28, ~x$w_buff1_used~0=v_~x$w_buff1_used~0_92, ~x$r_buff0_thd4~0=v_~x$r_buff0_thd4~0_23, ~x~0=v_~x~0_38, ~x$r_buff1_thd4~0=v_~x$r_buff1_thd4~0_19, ~x$w_buff0_used~0=v_~x$w_buff0_used~0_99} AuxVars[] AssignedVars[~x$w_buff1_used~0, ~x$r_buff0_thd4~0, ~x~0, ~x$r_buff1_thd4~0, ~x$w_buff0_used~0][98], [P3Thread1of1ForFork0InUse, 47#L795true, P1Thread1of1ForFork1InUse, 187#(and (= ~__unbuffered_p3_EBX~0 1) (= ~a~0 1)), P0Thread1of1ForFork3InUse, P2Thread1of1ForFork2InUse, 209#(= ~z~0 1), 214#true, Black: 210#(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: 150#(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))), 245#(<= ~__unbuffered_cnt~0 2), 226#true, Black: 156#(= ~__unbuffered_p3_EAX~0 0), 92#L845true, Black: 216#(and (<= (div ~x$w_buff0_used~0 256) 0) (= ~x$w_buff0~0 1) (<= 1 ~x$w_buff0_used~0) (= 1 ~x$r_buff0_thd2~0)), Black: 217#(and (= ~x$w_buff0~0 1) (= ~x$w_buff0_used~0 0) (= ~x~0 1)), 59#L869-3true, Black: 161#(= ~__unbuffered_cnt~0 0), Black: 164#(and (= ~__unbuffered_cnt~0 0) (= |ULTIMATE.start_assume_abort_if_not_#in~cond#1| 0)), 43#P2EXITtrue, Black: 236#(and (not (= 0 ~x$w_buff0~0)) (<= ~x$r_buff0_thd4~0 (* 256 (div ~x$r_buff0_thd4~0 256))) (= ~x$w_buff1_used~0 0) (= ~x$w_buff0_used~0 0) (not (= ~x~0 0)) (not (= ~__unbuffered_p0_EAX~0 0)) (<= 0 ~x$r_buff0_thd4~0)), Black: 229#(and (<= (div ~x$w_buff0_used~0 256) 0) (<= ~x$r_buff0_thd4~0 (* 256 (div ~x$r_buff0_thd4~0 256))) (= ~x$w_buff1_used~0 0) (= ~x$w_buff0~0 1) (<= 1 ~x$w_buff0_used~0) (= 1 ~x$r_buff0_thd2~0) (<= 0 ~x$r_buff0_thd4~0)), Black: 234#(and (not (= 0 ~x$w_buff0~0)) (<= ~x$r_buff0_thd4~0 (* 256 (div ~x$r_buff0_thd4~0 256))) (= ~x$w_buff1_used~0 0) (= ~x$w_buff0_used~0 0) (not (= ~x~0 0)) (<= 0 ~x$r_buff0_thd4~0)), 112#P0EXITtrue, Black: 172#(<= ~__unbuffered_cnt~0 1), 195#(<= ~__unbuffered_cnt~0 2), Black: 184#(= ~a~0 1)]) [2023-08-24 11:40:04,630 INFO L294 olderBase$Statistics]: this new event has 21 ancestors and is cut-off event [2023-08-24 11:40:04,630 INFO L297 olderBase$Statistics]: existing Event has 21 ancestors and is cut-off event [2023-08-24 11:40:04,631 INFO L297 olderBase$Statistics]: existing Event has 21 ancestors and is cut-off event [2023-08-24 11:40:04,631 INFO L297 olderBase$Statistics]: existing Event has 21 ancestors and is cut-off event [2023-08-24 11:40:04,809 INFO L124 PetriNetUnfolderBase]: 5395/9033 cut-off events. [2023-08-24 11:40:04,809 INFO L125 PetriNetUnfolderBase]: For 25227/25662 co-relation queries the response was YES. [2023-08-24 11:40:04,828 INFO L83 FinitePrefix]: Finished finitePrefix Result has 37608 conditions, 9033 events. 5395/9033 cut-off events. For 25227/25662 co-relation queries the response was YES. Maximal size of possible extension queue 604. Compared 64935 event pairs, 594 based on Foata normal form. 322/9177 useless extension candidates. Maximal degree in co-relation 37577. Up to 3228 conditions per place. [2023-08-24 11:40:04,836 INFO L140 encePairwiseOnDemand]: 230/237 looper letters, 77 selfloop transitions, 18 changer transitions 50/152 dead transitions. [2023-08-24 11:40:04,836 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 76 places, 152 transitions, 1355 flow [2023-08-24 11:40:04,837 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2023-08-24 11:40:04,837 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 8 states. [2023-08-24 11:40:04,839 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 8 states to 8 states and 950 transitions. [2023-08-24 11:40:04,839 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.5010548523206751 [2023-08-24 11:40:04,839 INFO L72 ComplementDD]: Start complementDD. Operand 8 states and 950 transitions. [2023-08-24 11:40:04,839 INFO L73 IsDeterministic]: Start isDeterministic. Operand 8 states and 950 transitions. [2023-08-24 11:40:04,840 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2023-08-24 11:40:04,840 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 8 states and 950 transitions. [2023-08-24 11:40:04,841 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 9 states, 8 states have (on average 118.75) internal successors, (950), 8 states have internal predecessors, (950), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-24 11:40:04,843 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 9 states, 9 states have (on average 237.0) internal successors, (2133), 9 states have internal predecessors, (2133), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-24 11:40:04,843 INFO L81 ComplementDD]: Finished complementDD. Result has 9 states, 9 states have (on average 237.0) internal successors, (2133), 9 states have internal predecessors, (2133), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-24 11:40:04,843 INFO L175 Difference]: Start difference. First operand has 69 places, 63 transitions, 442 flow. Second operand 8 states and 950 transitions. [2023-08-24 11:40:04,843 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 76 places, 152 transitions, 1355 flow [2023-08-24 11:40:05,213 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 73 places, 152 transitions, 1296 flow, removed 17 selfloop flow, removed 3 redundant places. [2023-08-24 11:40:05,215 INFO L231 Difference]: Finished difference. Result has 76 places, 54 transitions, 387 flow [2023-08-24 11:40:05,215 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=237, PETRI_DIFFERENCE_MINUEND_FLOW=400, PETRI_DIFFERENCE_MINUEND_PLACES=66, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=61, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=17, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=43, PETRI_DIFFERENCE_SUBTRAHEND_STATES=8, PETRI_FLOW=387, PETRI_PLACES=76, PETRI_TRANSITIONS=54} [2023-08-24 11:40:05,215 INFO L281 CegarLoopForPetriNet]: 42 programPoint places, 34 predicate places. [2023-08-24 11:40:05,215 INFO L495 AbstractCegarLoop]: Abstraction has has 76 places, 54 transitions, 387 flow [2023-08-24 11:40:05,216 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 7 states, 7 states have (on average 110.85714285714286) internal successors, (776), 7 states have internal predecessors, (776), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-24 11:40:05,216 INFO L200 CegarLoopForPetriNet]: Found error trace [2023-08-24 11:40:05,216 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-08-24 11:40:05,216 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable10 [2023-08-24 11:40:05,216 INFO L420 AbstractCegarLoop]: === Iteration 12 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [P1Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 4 more)] === [2023-08-24 11:40:05,216 INFO L145 PredicateUnifier]: Initialized classic predicate unifier [2023-08-24 11:40:05,216 INFO L85 PathProgramCache]: Analyzing trace with hash -1449487193, now seen corresponding path program 1 times [2023-08-24 11:40:05,216 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-08-24 11:40:05,216 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1847303332] [2023-08-24 11:40:05,217 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-08-24 11:40:05,217 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-08-24 11:40:05,233 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-08-24 11:40:05,325 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-24 11:40:05,325 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-08-24 11:40:05,325 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1847303332] [2023-08-24 11:40:05,325 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1847303332] provided 1 perfect and 0 imperfect interpolant sequences [2023-08-24 11:40:05,325 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-08-24 11:40:05,326 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2023-08-24 11:40:05,326 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1844056379] [2023-08-24 11:40:05,326 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-08-24 11:40:05,326 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2023-08-24 11:40:05,326 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-08-24 11:40:05,326 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2023-08-24 11:40:05,326 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2023-08-24 11:40:05,327 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 111 out of 237 [2023-08-24 11:40:05,327 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 76 places, 54 transitions, 387 flow. Second operand has 4 states, 4 states have (on average 117.0) internal successors, (468), 4 states have internal predecessors, (468), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-24 11:40:05,327 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2023-08-24 11:40:05,327 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 111 of 237 [2023-08-24 11:40:05,327 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2023-08-24 11:40:05,620 INFO L124 PetriNetUnfolderBase]: 2220/3730 cut-off events. [2023-08-24 11:40:05,620 INFO L125 PetriNetUnfolderBase]: For 10157/10180 co-relation queries the response was YES. [2023-08-24 11:40:05,627 INFO L83 FinitePrefix]: Finished finitePrefix Result has 15983 conditions, 3730 events. 2220/3730 cut-off events. For 10157/10180 co-relation queries the response was YES. Maximal size of possible extension queue 169. Compared 21473 event pairs, 513 based on Foata normal form. 11/3711 useless extension candidates. Maximal degree in co-relation 15954. Up to 2016 conditions per place. [2023-08-24 11:40:05,630 INFO L140 encePairwiseOnDemand]: 234/237 looper letters, 42 selfloop transitions, 1 changer transitions 56/102 dead transitions. [2023-08-24 11:40:05,630 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 76 places, 102 transitions, 946 flow [2023-08-24 11:40:05,630 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2023-08-24 11:40:05,630 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 4 states. [2023-08-24 11:40:05,631 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 492 transitions. [2023-08-24 11:40:05,631 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.5189873417721519 [2023-08-24 11:40:05,631 INFO L72 ComplementDD]: Start complementDD. Operand 4 states and 492 transitions. [2023-08-24 11:40:05,631 INFO L73 IsDeterministic]: Start isDeterministic. Operand 4 states and 492 transitions. [2023-08-24 11:40:05,631 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2023-08-24 11:40:05,632 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 4 states and 492 transitions. [2023-08-24 11:40:05,632 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 5 states, 4 states have (on average 123.0) internal successors, (492), 4 states have internal predecessors, (492), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-24 11:40:05,633 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 5 states, 5 states have (on average 237.0) internal successors, (1185), 5 states have internal predecessors, (1185), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-24 11:40:05,633 INFO L81 ComplementDD]: Finished complementDD. Result has 5 states, 5 states have (on average 237.0) internal successors, (1185), 5 states have internal predecessors, (1185), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-24 11:40:05,633 INFO L175 Difference]: Start difference. First operand has 76 places, 54 transitions, 387 flow. Second operand 4 states and 492 transitions. [2023-08-24 11:40:05,634 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 76 places, 102 transitions, 946 flow [2023-08-24 11:40:05,668 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 65 places, 102 transitions, 772 flow, removed 47 selfloop flow, removed 11 redundant places. [2023-08-24 11:40:05,669 INFO L231 Difference]: Finished difference. Result has 67 places, 44 transitions, 245 flow [2023-08-24 11:40:05,669 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=237, PETRI_DIFFERENCE_MINUEND_FLOW=296, PETRI_DIFFERENCE_MINUEND_PLACES=62, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=54, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=1, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=53, PETRI_DIFFERENCE_SUBTRAHEND_STATES=4, PETRI_FLOW=245, PETRI_PLACES=67, PETRI_TRANSITIONS=44} [2023-08-24 11:40:05,669 INFO L281 CegarLoopForPetriNet]: 42 programPoint places, 25 predicate places. [2023-08-24 11:40:05,669 INFO L495 AbstractCegarLoop]: Abstraction has has 67 places, 44 transitions, 245 flow [2023-08-24 11:40:05,669 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 117.0) internal successors, (468), 4 states have internal predecessors, (468), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-24 11:40:05,669 INFO L200 CegarLoopForPetriNet]: Found error trace [2023-08-24 11:40:05,670 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-08-24 11:40:05,670 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable11 [2023-08-24 11:40:05,670 INFO L420 AbstractCegarLoop]: === Iteration 13 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [P1Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 4 more)] === [2023-08-24 11:40:05,670 INFO L145 PredicateUnifier]: Initialized classic predicate unifier [2023-08-24 11:40:05,670 INFO L85 PathProgramCache]: Analyzing trace with hash -624746367, now seen corresponding path program 2 times [2023-08-24 11:40:05,670 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-08-24 11:40:05,670 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1061267846] [2023-08-24 11:40:05,670 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-08-24 11:40:05,670 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-08-24 11:40:05,700 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2023-08-24 11:40:05,700 INFO L356 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2023-08-24 11:40:05,726 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2023-08-24 11:40:05,754 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2023-08-24 11:40:05,754 INFO L360 BasicCegarLoop]: Counterexample is feasible [2023-08-24 11:40:05,755 INFO L805 garLoopResultBuilder]: Registering result UNSAFE for location ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION (6 of 7 remaining) [2023-08-24 11:40:05,756 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location P1Err0ASSERT_VIOLATIONERROR_FUNCTION (5 of 7 remaining) [2023-08-24 11:40:05,756 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (4 of 7 remaining) [2023-08-24 11:40:05,756 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (3 of 7 remaining) [2023-08-24 11:40:05,757 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr2INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (2 of 7 remaining) [2023-08-24 11:40:05,757 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr3INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (1 of 7 remaining) [2023-08-24 11:40:05,757 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location P1Err0ASSERT_VIOLATIONERROR_FUNCTION (0 of 7 remaining) [2023-08-24 11:40:05,757 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable12 [2023-08-24 11:40:05,757 INFO L445 BasicCegarLoop]: Path program histogram: [3, 2, 2, 1, 1, 1, 1, 1, 1] [2023-08-24 11:40:05,763 INFO L228 ceAbstractionStarter]: Analysis of concurrent program completed with 1 thread instances [2023-08-24 11:40:05,764 INFO L178 ceAbstractionStarter]: Computing trace abstraction results [2023-08-24 11:40:05,830 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 24.08 11:40:05 BasicIcfg [2023-08-24 11:40:05,830 INFO L131 PluginConnector]: ------------------------ END TraceAbstraction---------------------------- [2023-08-24 11:40:05,831 INFO L158 Benchmark]: Toolchain (without parser) took 19225.68ms. Allocated memory was 392.2MB in the beginning and 2.4GB in the end (delta: 2.0GB). Free memory was 367.0MB in the beginning and 2.1GB in the end (delta: -1.7GB). Peak memory consumption was 275.8MB. Max. memory is 16.0GB. [2023-08-24 11:40:05,832 INFO L158 Benchmark]: CDTParser took 0.11ms. Allocated memory is still 392.2MB. Free memory was 370.1MB in the beginning and 370.0MB in the end (delta: 86.3kB). There was no memory consumed. Max. memory is 16.0GB. [2023-08-24 11:40:05,832 INFO L158 Benchmark]: CACSL2BoogieTranslator took 427.53ms. Allocated memory is still 392.2MB. Free memory was 367.0MB in the beginning and 342.8MB in the end (delta: 24.2MB). Peak memory consumption was 23.1MB. Max. memory is 16.0GB. [2023-08-24 11:40:05,832 INFO L158 Benchmark]: Boogie Procedure Inliner took 51.17ms. Allocated memory is still 392.2MB. Free memory was 342.8MB in the beginning and 340.3MB in the end (delta: 2.5MB). Peak memory consumption was 2.1MB. Max. memory is 16.0GB. [2023-08-24 11:40:05,832 INFO L158 Benchmark]: Boogie Preprocessor took 32.76ms. Allocated memory is still 392.2MB. Free memory was 340.3MB in the beginning and 338.2MB in the end (delta: 2.1MB). Peak memory consumption was 2.1MB. Max. memory is 16.0GB. [2023-08-24 11:40:05,833 INFO L158 Benchmark]: RCFGBuilder took 515.28ms. Allocated memory is still 392.2MB. Free memory was 338.2MB in the beginning and 301.4MB in the end (delta: 36.8MB). Peak memory consumption was 37.7MB. Max. memory is 16.0GB. [2023-08-24 11:40:05,833 INFO L158 Benchmark]: TraceAbstraction took 18195.08ms. Allocated memory was 392.2MB in the beginning and 2.4GB in the end (delta: 2.0GB). Free memory was 300.9MB in the beginning and 2.1GB in the end (delta: -1.8GB). Peak memory consumption was 210.8MB. Max. memory is 16.0GB. [2023-08-24 11:40:05,834 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 was 370.1MB in the beginning and 370.0MB in the end (delta: 86.3kB). There was no memory consumed. Max. memory is 16.0GB. * CACSL2BoogieTranslator took 427.53ms. Allocated memory is still 392.2MB. Free memory was 367.0MB in the beginning and 342.8MB in the end (delta: 24.2MB). Peak memory consumption was 23.1MB. Max. memory is 16.0GB. * Boogie Procedure Inliner took 51.17ms. Allocated memory is still 392.2MB. Free memory was 342.8MB in the beginning and 340.3MB in the end (delta: 2.5MB). Peak memory consumption was 2.1MB. Max. memory is 16.0GB. * Boogie Preprocessor took 32.76ms. Allocated memory is still 392.2MB. Free memory was 340.3MB in the beginning and 338.2MB in the end (delta: 2.1MB). Peak memory consumption was 2.1MB. Max. memory is 16.0GB. * RCFGBuilder took 515.28ms. Allocated memory is still 392.2MB. Free memory was 338.2MB in the beginning and 301.4MB in the end (delta: 36.8MB). Peak memory consumption was 37.7MB. Max. memory is 16.0GB. * TraceAbstraction took 18195.08ms. Allocated memory was 392.2MB in the beginning and 2.4GB in the end (delta: 2.0GB). Free memory was 300.9MB in the beginning and 2.1GB in the end (delta: -1.8GB). Peak memory consumption was 210.8MB. 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.3s, 137 PlacesBefore, 42 PlacesAfterwards, 126 TransitionsBefore, 29 TransitionsAfterwards, 3000 CoEnabledTransitionPairs, 7 FixpointIterations, 43 TrivialSequentialCompositions, 55 ConcurrentSequentialCompositions, 0 TrivialYvCompositions, 7 ConcurrentYvCompositions, 2 ChoiceCompositions, 107 TotalNumberOfCompositions, 7767 MoverChecksTotal, Independence Relation Statistics: CachedIndependenceRelation.Independence Queries: [ total: 3176, independent: 2954, independent conditional: 0, independent unconditional: 2954, dependent: 222, dependent conditional: 0, dependent unconditional: 222, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , CachedIndependenceRelation.Statistics on underlying relation: SyntacticIndependenceRelation.Independence Queries: [ total: 1542, independent: 1507, independent conditional: 0, independent unconditional: 1507, dependent: 35, dependent conditional: 0, dependent unconditional: 35, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , Cache Queries: [ total: 3176, independent: 1447, independent conditional: 0, independent unconditional: 1447, dependent: 187, dependent conditional: 0, dependent unconditional: 187, unknown: 1542, unknown conditional: 0, unknown unconditional: 1542] , Statistics on independence cache: Total cache size (in pairs): 133, Positive cache size: 117, Positive conditional cache size: 0, Positive unconditional cache size: 117, Negative cache size: 16, Negative conditional cache size: 0, Negative unconditional cache size: 16, Unknown cache size: 0, Unknown conditional cache size: 0, Unknown unconditional cache size: 0 - CounterExampleResult [Line: 19]: a call to reach_error is reachable a call to reach_error is reachable 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))=0, t685={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] [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))=1, t685={6:0}, t686={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] [L866] 0 pthread_t t687; [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}, 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] [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))=2, t685={6:0}, t686={7:0}, t687={8: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}, 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] [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))=3, t685={6:0}, t686={7:0}, t687={8:0}, t688={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=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=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] [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 [__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=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] [L824] 3 __unbuffered_cnt = __unbuffered_cnt + 1 [L826] 3 return 0; [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 [\result={0:0}, __unbuffered_cnt=1, __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=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=0, x$w_buff1=0, x$w_buff1_used=0, x=1, y=1, z=2] [L774] 1 __unbuffered_cnt = __unbuffered_cnt + 1 [L776] 1 return 0; [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}, \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=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=0, x$w_buff1=0, x$w_buff1_used=0, x=1, y=1, z=2] [L804] 2 __unbuffered_cnt = __unbuffered_cnt + 1 [L806] 2 return 0; [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={6:0}, t686={7:0}, t687={8:0}, t688={5: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=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] 0 reach_error() VAL [\old(expression)=0, \old(expression)=1, \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}, expression=0, expression=1, main$tmp_guard0=1, main$tmp_guard1=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=0, x$w_buff1=0, x$w_buff1_used=0, x=1, y=1, z=2] - UnprovableResult [Line: 19]: Unable to prove that call to reach_error is unreachable Unable to prove that call to reach_error is unreachable 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: 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. - 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. - StatisticsResult: Ultimate Automizer benchmark data with 1 thread instances CFG has 9 procedures, 166 locations, 7 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: 18.1s, OverallIterations: 13, TraceHistogramMax: 1, PathProgramHistogramMax: 3, EmptinessCheckTime: 0.0s, AutomataDifference: 12.0s, DeadEndRemovalTime: 0.0s, HoareAnnotationTime: 0.0s, InitialAbstractionConstructionTime: 3.4s, HoareTripleCheckerStatistics: 0 mSolverCounterUnknown, 415 SdHoareTripleChecker+Valid, 1.1s IncrementalHoareTripleChecker+Time, 0 mSdLazyCounter, 415 mSDsluCounter, 14 SdHoareTripleChecker+Invalid, 0.9s Time, 0 mProtectedAction, 0 SdHoareTripleChecker+Unchecked, 0 IncrementalHoareTripleChecker+Unchecked, 0 mSDsCounter, 40 IncrementalHoareTripleChecker+Valid, 0 mProtectedPredicate, 1407 IncrementalHoareTripleChecker+Invalid, 1447 SdHoareTripleChecker+Unknown, 0 mSolverCounterNotChecked, 40 mSolverCounterUnsat, 14 mSDtfsCounter, 1407 mSolverCounterSat, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Unknown, PredicateUnifierStatistics: 0 DeclaredPredicates, 53 GetRequests, 10 SyntacticMatches, 0 SemanticMatches, 43 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 11 ImplicationChecksByTransitivity, 0.1s Time, 0.0s BasicInterpolantAutomatonTime, BiggestAbstraction: size=443occurred in iteration=7, InterpolantAutomatonStates: 62, 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.1s InterpolantComputationTime, 244 NumberOfCodeBlocks, 244 NumberOfCodeBlocksAsserted, 13 NumberOfCheckSat, 205 ConstructedInterpolants, 0 QuantifiedInterpolants, 1198 SizeOfPredicates, 0 NumberOfNonLiveVariables, 0 ConjunctsInSsa, 0 ConjunctsInUnsatCore, 12 InterpolantComputations, 12 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-24 11:40:05,850 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...