/usr/bin/java -Xmx16000000000 -Xss4m -jar ./plugins/org.eclipse.equinox.launcher_1.5.800.v20200727-1323.jar -data @noDefault -ultimatedata ./data -s ../../../trunk/examples/settings/automizer/concurrent/svcomp-Reach-32bit-Automizer_Default-noMmResRef-PN-VariableLbe.epf -tc ../../../trunk/examples/toolchains/AutomizerCInline.xml --cacsl2boogietranslator.check.unreachability.of.reach_error.function false --cacsl2boogietranslator.pointer.base.address.is.valid.at.dereference ASSERTandASSUME --cacsl2boogietranslator.pointer.to.allocated.memory.at.dereference ASSERTandASSUME --cacsl2boogietranslator.check.array.bounds.for.arrays.that.are.off.heap ASSERTandASSUME --cacsl2boogietranslator.check.if.freed.pointer.was.valid true --cacsl2boogietranslator.adapt.memory.model.on.pointer.casts.if.necessary true -i ../../../trunk/examples/svcomp/pthread-wmm/mix008_power.oepc_pso.oepc_rmo.oepc.i -------------------------------------------------------------------------------- This is Ultimate 0.2.3-dev-ac9dbd0-m [2023-08-26 11:58:42,132 INFO L188 SettingsManager]: Resetting all preferences to default values... [2023-08-26 11:58:42,178 INFO L114 SettingsManager]: Loading settings from /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../../../trunk/examples/settings/automizer/concurrent/svcomp-Reach-32bit-Automizer_Default-noMmResRef-PN-VariableLbe.epf [2023-08-26 11:58:42,182 WARN L101 SettingsManager]: Preference file contains the following unknown settings: [2023-08-26 11:58:42,183 WARN L103 SettingsManager]: * de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.Checked method. Library mode if empty. [2023-08-26 11:58:42,203 INFO L130 SettingsManager]: Preferences different from defaults after loading the file: [2023-08-26 11:58:42,204 INFO L151 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2023-08-26 11:58:42,204 INFO L153 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2023-08-26 11:58:42,205 INFO L151 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2023-08-26 11:58:42,205 INFO L153 SettingsManager]: * Create parallel compositions if possible=false [2023-08-26 11:58:42,205 INFO L153 SettingsManager]: * Use SBE=true [2023-08-26 11:58:42,206 INFO L151 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2023-08-26 11:58:42,206 INFO L153 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2023-08-26 11:58:42,206 INFO L153 SettingsManager]: * sizeof long=4 [2023-08-26 11:58:42,207 INFO L153 SettingsManager]: * Overapproximate operations on floating types=true [2023-08-26 11:58:42,207 INFO L153 SettingsManager]: * sizeof POINTER=4 [2023-08-26 11:58:42,207 INFO L153 SettingsManager]: * Check division by zero=IGNORE [2023-08-26 11:58:42,208 INFO L153 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2023-08-26 11:58:42,208 INFO L153 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2023-08-26 11:58:42,208 INFO L153 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2023-08-26 11:58:42,209 INFO L153 SettingsManager]: * sizeof long double=12 [2023-08-26 11:58:42,209 INFO L153 SettingsManager]: * Check if freed pointer was valid=false [2023-08-26 11:58:42,210 INFO L153 SettingsManager]: * Use constant arrays=true [2023-08-26 11:58:42,210 INFO L151 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2023-08-26 11:58:42,210 INFO L153 SettingsManager]: * Size of a code block=SequenceOfStatements [2023-08-26 11:58:42,211 INFO L153 SettingsManager]: * To the following directory=./dump/ [2023-08-26 11:58:42,211 INFO L153 SettingsManager]: * SMT solver=External_DefaultMode [2023-08-26 11:58:42,211 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2023-08-26 11:58:42,212 INFO L151 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2023-08-26 11:58:42,212 INFO L153 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2023-08-26 11:58:42,212 INFO L153 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopsAndPotentialCycles [2023-08-26 11:58:42,213 INFO L153 SettingsManager]: * Trace refinement strategy=CAMEL [2023-08-26 11:58:42,213 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2023-08-26 11:58:42,213 INFO L153 SettingsManager]: * Automaton type used in concurrency analysis=PETRI_NET [2023-08-26 11:58:42,214 INFO L153 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2023-08-26 11:58:42,214 INFO L153 SettingsManager]: * Independence relation used for large block encoding in concurrent analysis=SYNTACTIC WARNING: An illegal reflective access operation has occurred WARNING: Illegal reflective access by com.sun.xml.bind.v2.runtime.reflect.opt.Injector$1 (file:/storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/plugins/com.sun.xml.bind_2.2.0.v201505121915.jar) to method java.lang.ClassLoader.defineClass(java.lang.String,byte[],int,int) WARNING: Please consider reporting this to the maintainers of com.sun.xml.bind.v2.runtime.reflect.opt.Injector$1 WARNING: Use --illegal-access=warn to enable warnings of further illegal reflective access operations WARNING: All illegal access operations will be denied in a future release Applying setting for plugin de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator: Check unreachability of reach_error function -> false Applying setting for plugin de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator: Pointer base address is valid at dereference -> ASSERTandASSUME Applying setting for plugin de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator: Pointer to allocated memory at dereference -> ASSERTandASSUME Applying setting for plugin de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator: Check array bounds for arrays that are off heap -> ASSERTandASSUME Applying setting for plugin de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator: Check if freed pointer was valid -> true Applying setting for plugin de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator: Adapt memory model on pointer casts if necessary -> true [2023-08-26 11:58:42,539 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2023-08-26 11:58:42,559 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2023-08-26 11:58:42,561 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2023-08-26 11:58:42,562 INFO L270 PluginConnector]: Initializing CDTParser... [2023-08-26 11:58:42,564 INFO L274 PluginConnector]: CDTParser initialized [2023-08-26 11:58:42,567 INFO L431 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../../../trunk/examples/svcomp/pthread-wmm/mix008_power.oepc_pso.oepc_rmo.oepc.i [2023-08-26 11:58:43,850 INFO L533 CDTParser]: Created temporary CDT project at NULL [2023-08-26 11:58:44,057 INFO L384 CDTParser]: Found 1 translation units. [2023-08-26 11:58:44,058 INFO L180 CDTParser]: Scanning /storage/repos/ultimate/trunk/examples/svcomp/pthread-wmm/mix008_power.oepc_pso.oepc_rmo.oepc.i [2023-08-26 11:58:44,071 INFO L427 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/69782af6a/118d74b33c5e460ba01bf001c01c6811/FLAG46f78ff30 [2023-08-26 11:58:44,084 INFO L435 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/69782af6a/118d74b33c5e460ba01bf001c01c6811 [2023-08-26 11:58:44,086 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2023-08-26 11:58:44,088 INFO L133 ToolchainWalker]: Walking toolchain with 5 elements. [2023-08-26 11:58:44,089 INFO L112 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2023-08-26 11:58:44,089 INFO L270 PluginConnector]: Initializing CACSL2BoogieTranslator... [2023-08-26 11:58:44,091 INFO L274 PluginConnector]: CACSL2BoogieTranslator initialized [2023-08-26 11:58:44,092 INFO L184 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 26.08 11:58:44" (1/1) ... [2023-08-26 11:58:44,092 INFO L204 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@3a29d164 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 26.08 11:58:44, skipping insertion in model container [2023-08-26 11:58:44,093 INFO L184 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 26.08 11:58:44" (1/1) ... [2023-08-26 11:58:44,129 INFO L176 MainTranslator]: Built tables and reachable declarations [2023-08-26 11:58:44,503 INFO L209 PostProcessor]: Analyzing one entry point: main [2023-08-26 11:58:44,517 INFO L201 MainTranslator]: Completed pre-run [2023-08-26 11:58:44,548 WARN L75 lationResultReporter]: Unsoundness Warning: unspecified type, defaulting to int C: short [267] [2023-08-26 11:58:44,550 WARN L75 lationResultReporter]: Unsoundness Warning: unspecified type, defaulting to int C: short [267] [2023-08-26 11:58:44,607 INFO L209 PostProcessor]: Analyzing one entry point: main [2023-08-26 11:58:44,650 WARN L669 CHandler]: The function __VERIFIER_atomic_begin is called, but not defined or handled by StandardFunctionHandler. [2023-08-26 11:58:44,650 WARN L669 CHandler]: The function __VERIFIER_atomic_end is called, but not defined or handled by StandardFunctionHandler. [2023-08-26 11:58:44,656 INFO L206 MainTranslator]: Completed translation [2023-08-26 11:58:44,658 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 26.08 11:58:44 WrapperNode [2023-08-26 11:58:44,659 INFO L131 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2023-08-26 11:58:44,660 INFO L112 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2023-08-26 11:58:44,660 INFO L270 PluginConnector]: Initializing Boogie Procedure Inliner... [2023-08-26 11:58:44,660 INFO L274 PluginConnector]: Boogie Procedure Inliner initialized [2023-08-26 11:58:44,666 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 26.08 11:58:44" (1/1) ... [2023-08-26 11:58:44,700 INFO L184 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 26.08 11:58:44" (1/1) ... [2023-08-26 11:58:44,741 INFO L138 Inliner]: procedures = 177, calls = 72, calls flagged for inlining = 6, calls inlined = 7, statements flattened = 151 [2023-08-26 11:58:44,742 INFO L131 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2023-08-26 11:58:44,742 INFO L112 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2023-08-26 11:58:44,743 INFO L270 PluginConnector]: Initializing Boogie Preprocessor... [2023-08-26 11:58:44,743 INFO L274 PluginConnector]: Boogie Preprocessor initialized [2023-08-26 11:58:44,750 INFO L184 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 26.08 11:58:44" (1/1) ... [2023-08-26 11:58:44,751 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 26.08 11:58:44" (1/1) ... [2023-08-26 11:58:44,766 INFO L184 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 26.08 11:58:44" (1/1) ... [2023-08-26 11:58:44,767 INFO L184 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 26.08 11:58:44" (1/1) ... [2023-08-26 11:58:44,774 INFO L184 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 26.08 11:58:44" (1/1) ... [2023-08-26 11:58:44,776 INFO L184 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 26.08 11:58:44" (1/1) ... [2023-08-26 11:58:44,791 INFO L184 PluginConnector]: Executing the observer LTLStepAnnotator from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 26.08 11:58:44" (1/1) ... [2023-08-26 11:58:44,793 INFO L184 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 26.08 11:58:44" (1/1) ... [2023-08-26 11:58:44,796 INFO L131 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2023-08-26 11:58:44,797 INFO L112 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2023-08-26 11:58:44,797 INFO L270 PluginConnector]: Initializing RCFGBuilder... [2023-08-26 11:58:44,797 INFO L274 PluginConnector]: RCFGBuilder initialized [2023-08-26 11:58:44,798 INFO L184 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 26.08 11:58:44" (1/1) ... [2023-08-26 11:58:44,803 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2023-08-26 11:58:44,824 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2023-08-26 11:58:44,837 INFO L229 MonitoredProcess]: Starting monitored process 1 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 (exit command is (exit), workingDir is null) [2023-08-26 11:58:44,848 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 (1)] Waiting until timeout for monitored process [2023-08-26 11:58:44,874 INFO L130 BoogieDeclarations]: Found specification of procedure write~int [2023-08-26 11:58:44,874 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_atomic_begin [2023-08-26 11:58:44,875 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2023-08-26 11:58:44,875 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnStack [2023-08-26 11:58:44,875 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.dealloc [2023-08-26 11:58:44,875 INFO L130 BoogieDeclarations]: Found specification of procedure P0 [2023-08-26 11:58:44,875 INFO L138 BoogieDeclarations]: Found implementation of procedure P0 [2023-08-26 11:58:44,875 INFO L130 BoogieDeclarations]: Found specification of procedure P1 [2023-08-26 11:58:44,876 INFO L138 BoogieDeclarations]: Found implementation of procedure P1 [2023-08-26 11:58:44,876 INFO L130 BoogieDeclarations]: Found specification of procedure P2 [2023-08-26 11:58:44,876 INFO L138 BoogieDeclarations]: Found implementation of procedure P2 [2023-08-26 11:58:44,876 INFO L130 BoogieDeclarations]: Found specification of procedure P3 [2023-08-26 11:58:44,876 INFO L138 BoogieDeclarations]: Found implementation of procedure P3 [2023-08-26 11:58:44,876 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int [2023-08-26 11:58:44,877 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_atomic_end [2023-08-26 11:58:44,878 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2023-08-26 11:58:44,878 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2023-08-26 11:58:44,879 WARN L210 CfgBuilder]: User set CodeBlockSize to SequenceOfStatements but program contains fork statements. Overwriting the user preferences and setting CodeBlockSize to OneNontrivialStatement [2023-08-26 11:58:45,026 INFO L236 CfgBuilder]: Building ICFG [2023-08-26 11:58:45,028 INFO L262 CfgBuilder]: Building CFG for each procedure with an implementation [2023-08-26 11:58:45,450 INFO L277 CfgBuilder]: Performing block encoding [2023-08-26 11:58:45,541 INFO L297 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2023-08-26 11:58:45,541 INFO L302 CfgBuilder]: Removed 0 assume(true) statements. [2023-08-26 11:58:45,543 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 26.08 11:58:45 BoogieIcfgContainer [2023-08-26 11:58:45,543 INFO L131 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2023-08-26 11:58:45,545 INFO L112 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2023-08-26 11:58:45,546 INFO L270 PluginConnector]: Initializing TraceAbstraction... [2023-08-26 11:58:45,548 INFO L274 PluginConnector]: TraceAbstraction initialized [2023-08-26 11:58:45,549 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 26.08 11:58:44" (1/3) ... [2023-08-26 11:58:45,549 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@4ab61b60 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 26.08 11:58:45, skipping insertion in model container [2023-08-26 11:58:45,549 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 26.08 11:58:44" (2/3) ... [2023-08-26 11:58:45,550 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@4ab61b60 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 26.08 11:58:45, skipping insertion in model container [2023-08-26 11:58:45,550 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 26.08 11:58:45" (3/3) ... [2023-08-26 11:58:45,551 INFO L112 eAbstractionObserver]: Analyzing ICFG mix008_power.oepc_pso.oepc_rmo.oepc.i [2023-08-26 11:58:45,567 INFO L203 ceAbstractionStarter]: Automizer settings: Hoare:false NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2023-08-26 11:58:45,567 INFO L162 ceAbstractionStarter]: Applying trace abstraction to program that has 10 error locations. [2023-08-26 11:58:45,567 INFO L515 ceAbstractionStarter]: Constructing petrified ICFG for 1 thread instances. [2023-08-26 11:58:45,621 INFO L144 ThreadInstanceAdder]: Constructed 0 joinOtherThreadTransitions. [2023-08-26 11:58:45,653 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 154 places, 144 transitions, 308 flow [2023-08-26 11:58:45,701 INFO L124 PetriNetUnfolderBase]: 3/140 cut-off events. [2023-08-26 11:58:45,701 INFO L125 PetriNetUnfolderBase]: For 0/0 co-relation queries the response was YES. [2023-08-26 11:58:45,706 INFO L83 FinitePrefix]: Finished finitePrefix Result has 153 conditions, 140 events. 3/140 cut-off events. For 0/0 co-relation queries the response was YES. Maximal size of possible extension queue 4. Compared 114 event pairs, 0 based on Foata normal form. 0/127 useless extension candidates. Maximal degree in co-relation 99. Up to 2 conditions per place. [2023-08-26 11:58:45,707 INFO L82 GeneralOperation]: Start removeDead. Operand has 154 places, 144 transitions, 308 flow [2023-08-26 11:58:45,711 INFO L88 GeneralOperation]: Finished RemoveDead, result has has 150 places, 140 transitions, 292 flow [2023-08-26 11:58:45,714 INFO L124 etLargeBlockEncoding]: Petri net LBE is using variable-based independence relation. [2023-08-26 11:58:45,721 INFO L131 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 150 places, 140 transitions, 292 flow [2023-08-26 11:58:45,724 INFO L113 LiptonReduction]: Starting Lipton reduction on Petri net that has 150 places, 140 transitions, 292 flow [2023-08-26 11:58:45,724 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 150 places, 140 transitions, 292 flow [2023-08-26 11:58:45,752 INFO L124 PetriNetUnfolderBase]: 3/140 cut-off events. [2023-08-26 11:58:45,752 INFO L125 PetriNetUnfolderBase]: For 0/0 co-relation queries the response was YES. [2023-08-26 11:58:45,753 INFO L83 FinitePrefix]: Finished finitePrefix Result has 153 conditions, 140 events. 3/140 cut-off events. For 0/0 co-relation queries the response was YES. Maximal size of possible extension queue 4. Compared 114 event pairs, 0 based on Foata normal form. 0/127 useless extension candidates. Maximal degree in co-relation 99. Up to 2 conditions per place. [2023-08-26 11:58:45,756 INFO L119 LiptonReduction]: Number of co-enabled transitions 3718 [2023-08-26 11:58:50,006 INFO L134 LiptonReduction]: Checked pairs total: 11329 [2023-08-26 11:58:50,007 INFO L136 LiptonReduction]: Total number of compositions: 139 [2023-08-26 11:58:50,019 INFO L356 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2023-08-26 11:58:50,024 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;@429c1c9, mLbeIndependenceSettings=[IndependenceType=SYNTACTIC, AbstractionType=NONE, UseConditional=, UseSemiCommutativity=, Solver=, SolverTimeout=] [2023-08-26 11:58:50,025 INFO L358 AbstractCegarLoop]: Starting to check reachability of 15 error locations. [2023-08-26 11:58:50,026 INFO L185 PetriNetUnfolderBase]: Found word, exiting Unfolder. [2023-08-26 11:58:50,026 INFO L124 PetriNetUnfolderBase]: 0/0 cut-off events. [2023-08-26 11:58:50,026 INFO L125 PetriNetUnfolderBase]: For 0/0 co-relation queries the response was YES. [2023-08-26 11:58:50,026 INFO L200 CegarLoopForPetriNet]: Found error trace [2023-08-26 11:58:50,027 INFO L208 CegarLoopForPetriNet]: trace histogram [1] [2023-08-26 11:58:50,027 INFO L420 AbstractCegarLoop]: === Iteration 1 === Targeting ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [P0Err0ASSERT_VIOLATIONASSERT, ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 12 more)] === [2023-08-26 11:58:50,031 INFO L145 PredicateUnifier]: Initialized classic predicate unifier [2023-08-26 11:58:50,031 INFO L85 PathProgramCache]: Analyzing trace with hash 628, now seen corresponding path program 1 times [2023-08-26 11:58:50,037 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-08-26 11:58:50,038 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1608869929] [2023-08-26 11:58:50,038 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-08-26 11:58:50,039 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-08-26 11:58:50,110 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-08-26 11:58:50,128 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-08-26 11:58:50,128 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-08-26 11:58:50,128 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1608869929] [2023-08-26 11:58:50,129 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1608869929] provided 1 perfect and 0 imperfect interpolant sequences [2023-08-26 11:58:50,129 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-08-26 11:58:50,129 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [0] imperfect sequences [] total 0 [2023-08-26 11:58:50,131 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [682594547] [2023-08-26 11:58:50,131 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-08-26 11:58:50,138 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 2 states [2023-08-26 11:58:50,143 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-08-26 11:58:50,166 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 2 interpolants. [2023-08-26 11:58:50,166 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=1, Invalid=1, Unknown=0, NotChecked=0, Total=2 [2023-08-26 11:58:50,169 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 128 out of 283 [2023-08-26 11:58:50,171 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 53 places, 41 transitions, 94 flow. Second operand has 2 states, 2 states have (on average 128.5) internal successors, (257), 2 states have internal predecessors, (257), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-26 11:58:50,172 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2023-08-26 11:58:50,172 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 128 of 283 [2023-08-26 11:58:50,173 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2023-08-26 11:58:51,472 INFO L124 PetriNetUnfolderBase]: 7479/10186 cut-off events. [2023-08-26 11:58:51,472 INFO L125 PetriNetUnfolderBase]: For 47/47 co-relation queries the response was YES. [2023-08-26 11:58:51,488 INFO L83 FinitePrefix]: Finished finitePrefix Result has 20494 conditions, 10186 events. 7479/10186 cut-off events. For 47/47 co-relation queries the response was YES. Maximal size of possible extension queue 500. Compared 53621 event pairs, 7479 based on Foata normal form. 0/9159 useless extension candidates. Maximal degree in co-relation 20482. Up to 10091 conditions per place. [2023-08-26 11:58:51,539 INFO L140 encePairwiseOnDemand]: 274/283 looper letters, 27 selfloop transitions, 0 changer transitions 0/32 dead transitions. [2023-08-26 11:58:51,539 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 46 places, 32 transitions, 130 flow [2023-08-26 11:58:51,540 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2023-08-26 11:58:51,542 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 2 states. [2023-08-26 11:58:51,548 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2 states to 2 states and 292 transitions. [2023-08-26 11:58:51,550 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.5159010600706714 [2023-08-26 11:58:51,551 INFO L72 ComplementDD]: Start complementDD. Operand 2 states and 292 transitions. [2023-08-26 11:58:51,551 INFO L73 IsDeterministic]: Start isDeterministic. Operand 2 states and 292 transitions. [2023-08-26 11:58:51,553 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2023-08-26 11:58:51,555 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 2 states and 292 transitions. [2023-08-26 11:58:51,557 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 3 states, 2 states have (on average 146.0) internal successors, (292), 2 states have internal predecessors, (292), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-26 11:58:51,560 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 3 states, 3 states have (on average 283.0) internal successors, (849), 3 states have internal predecessors, (849), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-26 11:58:51,561 INFO L81 ComplementDD]: Finished complementDD. Result has 3 states, 3 states have (on average 283.0) internal successors, (849), 3 states have internal predecessors, (849), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-26 11:58:51,562 INFO L175 Difference]: Start difference. First operand has 53 places, 41 transitions, 94 flow. Second operand 2 states and 292 transitions. [2023-08-26 11:58:51,563 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 46 places, 32 transitions, 130 flow [2023-08-26 11:58:51,568 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 42 places, 32 transitions, 126 flow, removed 0 selfloop flow, removed 4 redundant places. [2023-08-26 11:58:51,569 INFO L231 Difference]: Finished difference. Result has 42 places, 32 transitions, 72 flow [2023-08-26 11:58:51,571 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=283, PETRI_DIFFERENCE_MINUEND_FLOW=72, PETRI_DIFFERENCE_MINUEND_PLACES=41, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=32, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=0, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=32, PETRI_DIFFERENCE_SUBTRAHEND_STATES=2, PETRI_FLOW=72, PETRI_PLACES=42, PETRI_TRANSITIONS=32} [2023-08-26 11:58:51,574 INFO L281 CegarLoopForPetriNet]: 53 programPoint places, -11 predicate places. [2023-08-26 11:58:51,574 INFO L495 AbstractCegarLoop]: Abstraction has has 42 places, 32 transitions, 72 flow [2023-08-26 11:58:51,574 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 2 states, 2 states have (on average 128.5) internal successors, (257), 2 states have internal predecessors, (257), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-26 11:58:51,574 INFO L200 CegarLoopForPetriNet]: Found error trace [2023-08-26 11:58:51,574 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1] [2023-08-26 11:58:51,575 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable0 [2023-08-26 11:58:51,575 INFO L420 AbstractCegarLoop]: === Iteration 2 === Targeting P0Err0ASSERT_VIOLATIONASSERT === [P0Err0ASSERT_VIOLATIONASSERT, ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 12 more)] === [2023-08-26 11:58:51,575 INFO L145 PredicateUnifier]: Initialized classic predicate unifier [2023-08-26 11:58:51,576 INFO L85 PathProgramCache]: Analyzing trace with hash 617275, now seen corresponding path program 1 times [2023-08-26 11:58:51,576 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-08-26 11:58:51,576 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1865114851] [2023-08-26 11:58:51,576 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-08-26 11:58:51,576 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-08-26 11:58:51,610 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-08-26 11:58:51,804 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-08-26 11:58:51,804 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-08-26 11:58:51,804 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1865114851] [2023-08-26 11:58:51,805 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1865114851] provided 1 perfect and 0 imperfect interpolant sequences [2023-08-26 11:58:51,805 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-08-26 11:58:51,805 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [1] imperfect sequences [] total 1 [2023-08-26 11:58:51,805 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1563353017] [2023-08-26 11:58:51,805 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-08-26 11:58:51,806 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2023-08-26 11:58:51,806 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-08-26 11:58:51,807 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2023-08-26 11:58:51,807 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2023-08-26 11:58:51,808 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 127 out of 283 [2023-08-26 11:58:51,808 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 42 places, 32 transitions, 72 flow. Second operand has 3 states, 3 states have (on average 128.0) internal successors, (384), 3 states have internal predecessors, (384), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-26 11:58:51,808 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2023-08-26 11:58:51,809 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 127 of 283 [2023-08-26 11:58:51,809 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2023-08-26 11:58:52,835 INFO L124 PetriNetUnfolderBase]: 5879/8509 cut-off events. [2023-08-26 11:58:52,836 INFO L125 PetriNetUnfolderBase]: For 0/0 co-relation queries the response was YES. [2023-08-26 11:58:52,849 INFO L83 FinitePrefix]: Finished finitePrefix Result has 16650 conditions, 8509 events. 5879/8509 cut-off events. For 0/0 co-relation queries the response was YES. Maximal size of possible extension queue 434. Compared 52202 event pairs, 1079 based on Foata normal form. 0/8164 useless extension candidates. Maximal degree in co-relation 16647. Up to 6367 conditions per place. [2023-08-26 11:58:52,892 INFO L140 encePairwiseOnDemand]: 280/283 looper letters, 43 selfloop transitions, 2 changer transitions 2/52 dead transitions. [2023-08-26 11:58:52,893 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 43 places, 52 transitions, 212 flow [2023-08-26 11:58:52,894 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2023-08-26 11:58:52,894 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2023-08-26 11:58:52,897 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 429 transitions. [2023-08-26 11:58:52,898 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.5053003533568905 [2023-08-26 11:58:52,899 INFO L72 ComplementDD]: Start complementDD. Operand 3 states and 429 transitions. [2023-08-26 11:58:52,899 INFO L73 IsDeterministic]: Start isDeterministic. Operand 3 states and 429 transitions. [2023-08-26 11:58:52,899 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2023-08-26 11:58:52,899 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 3 states and 429 transitions. [2023-08-26 11:58:52,901 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 4 states, 3 states have (on average 143.0) internal successors, (429), 3 states have internal predecessors, (429), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-26 11:58:52,905 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 4 states, 4 states have (on average 283.0) internal successors, (1132), 4 states have internal predecessors, (1132), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-26 11:58:52,905 INFO L81 ComplementDD]: Finished complementDD. Result has 4 states, 4 states have (on average 283.0) internal successors, (1132), 4 states have internal predecessors, (1132), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-26 11:58:52,906 INFO L175 Difference]: Start difference. First operand has 42 places, 32 transitions, 72 flow. Second operand 3 states and 429 transitions. [2023-08-26 11:58:52,907 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 43 places, 52 transitions, 212 flow [2023-08-26 11:58:52,909 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 43 places, 52 transitions, 212 flow, removed 0 selfloop flow, removed 0 redundant places. [2023-08-26 11:58:52,910 INFO L231 Difference]: Finished difference. Result has 43 places, 30 transitions, 72 flow [2023-08-26 11:58:52,910 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=283, PETRI_DIFFERENCE_MINUEND_FLOW=70, PETRI_DIFFERENCE_MINUEND_PLACES=41, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=31, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=2, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=29, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=72, PETRI_PLACES=43, PETRI_TRANSITIONS=30} [2023-08-26 11:58:52,911 INFO L281 CegarLoopForPetriNet]: 53 programPoint places, -10 predicate places. [2023-08-26 11:58:52,912 INFO L495 AbstractCegarLoop]: Abstraction has has 43 places, 30 transitions, 72 flow [2023-08-26 11:58:52,912 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 128.0) internal successors, (384), 3 states have internal predecessors, (384), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-26 11:58:52,912 INFO L200 CegarLoopForPetriNet]: Found error trace [2023-08-26 11:58:52,916 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-08-26 11:58:52,917 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1 [2023-08-26 11:58:52,918 INFO L420 AbstractCegarLoop]: === Iteration 3 === Targeting ULTIMATE.startErr8ASSERT_VIOLATIONASSERT === [P0Err0ASSERT_VIOLATIONASSERT, ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 12 more)] === [2023-08-26 11:58:52,920 INFO L145 PredicateUnifier]: Initialized classic predicate unifier [2023-08-26 11:58:52,921 INFO L85 PathProgramCache]: Analyzing trace with hash -541720847, now seen corresponding path program 1 times [2023-08-26 11:58:52,921 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-08-26 11:58:52,921 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [422106927] [2023-08-26 11:58:52,921 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-08-26 11:58:52,922 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-08-26 11:58:52,984 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-08-26 11:58:53,132 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-08-26 11:58:53,133 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-08-26 11:58:53,133 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [422106927] [2023-08-26 11:58:53,133 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [422106927] provided 1 perfect and 0 imperfect interpolant sequences [2023-08-26 11:58:53,133 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-08-26 11:58:53,133 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2023-08-26 11:58:53,133 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [439817246] [2023-08-26 11:58:53,133 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-08-26 11:58:53,134 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2023-08-26 11:58:53,134 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-08-26 11:58:53,134 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2023-08-26 11:58:53,134 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2023-08-26 11:58:53,135 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 123 out of 283 [2023-08-26 11:58:53,136 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 43 places, 30 transitions, 72 flow. Second operand has 4 states, 4 states have (on average 126.0) internal successors, (504), 4 states have internal predecessors, (504), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-26 11:58:53,136 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2023-08-26 11:58:53,136 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 123 of 283 [2023-08-26 11:58:53,136 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2023-08-26 11:58:54,041 INFO L124 PetriNetUnfolderBase]: 5975/8221 cut-off events. [2023-08-26 11:58:54,042 INFO L125 PetriNetUnfolderBase]: For 553/553 co-relation queries the response was YES. [2023-08-26 11:58:54,053 INFO L83 FinitePrefix]: Finished finitePrefix Result has 17142 conditions, 8221 events. 5975/8221 cut-off events. For 553/553 co-relation queries the response was YES. Maximal size of possible extension queue 411. Compared 42740 event pairs, 1655 based on Foata normal form. 384/8569 useless extension candidates. Maximal degree in co-relation 17138. Up to 5057 conditions per place. [2023-08-26 11:58:54,077 INFO L140 encePairwiseOnDemand]: 279/283 looper letters, 35 selfloop transitions, 2 changer transitions 24/65 dead transitions. [2023-08-26 11:58:54,077 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 46 places, 65 transitions, 270 flow [2023-08-26 11:58:54,078 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2023-08-26 11:58:54,078 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 5 states. [2023-08-26 11:58:54,079 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 678 transitions. [2023-08-26 11:58:54,080 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.4791519434628975 [2023-08-26 11:58:54,080 INFO L72 ComplementDD]: Start complementDD. Operand 5 states and 678 transitions. [2023-08-26 11:58:54,080 INFO L73 IsDeterministic]: Start isDeterministic. Operand 5 states and 678 transitions. [2023-08-26 11:58:54,080 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2023-08-26 11:58:54,080 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 5 states and 678 transitions. [2023-08-26 11:58:54,082 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 6 states, 5 states have (on average 135.6) internal successors, (678), 5 states have internal predecessors, (678), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-26 11:58:54,084 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 6 states, 6 states have (on average 283.0) internal successors, (1698), 6 states have internal predecessors, (1698), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-26 11:58:54,085 INFO L81 ComplementDD]: Finished complementDD. Result has 6 states, 6 states have (on average 283.0) internal successors, (1698), 6 states have internal predecessors, (1698), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-26 11:58:54,085 INFO L175 Difference]: Start difference. First operand has 43 places, 30 transitions, 72 flow. Second operand 5 states and 678 transitions. [2023-08-26 11:58:54,085 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 46 places, 65 transitions, 270 flow [2023-08-26 11:58:54,086 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 44 places, 65 transitions, 260 flow, removed 0 selfloop flow, removed 2 redundant places. [2023-08-26 11:58:54,087 INFO L231 Difference]: Finished difference. Result has 47 places, 30 transitions, 80 flow [2023-08-26 11:58:54,087 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=283, PETRI_DIFFERENCE_MINUEND_FLOW=68, PETRI_DIFFERENCE_MINUEND_PLACES=40, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=30, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=2, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=28, PETRI_DIFFERENCE_SUBTRAHEND_STATES=5, PETRI_FLOW=80, PETRI_PLACES=47, PETRI_TRANSITIONS=30} [2023-08-26 11:58:54,088 INFO L281 CegarLoopForPetriNet]: 53 programPoint places, -6 predicate places. [2023-08-26 11:58:54,088 INFO L495 AbstractCegarLoop]: Abstraction has has 47 places, 30 transitions, 80 flow [2023-08-26 11:58:54,089 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 126.0) internal successors, (504), 4 states have internal predecessors, (504), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-26 11:58:54,089 INFO L200 CegarLoopForPetriNet]: Found error trace [2023-08-26 11:58:54,089 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-08-26 11:58:54,089 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2 [2023-08-26 11:58:54,089 INFO L420 AbstractCegarLoop]: === Iteration 4 === Targeting ULTIMATE.startErr8ASSERT_VIOLATIONASSERT === [P0Err0ASSERT_VIOLATIONASSERT, ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 12 more)] === [2023-08-26 11:58:54,089 INFO L145 PredicateUnifier]: Initialized classic predicate unifier [2023-08-26 11:58:54,090 INFO L85 PathProgramCache]: Analyzing trace with hash 1564495328, now seen corresponding path program 1 times [2023-08-26 11:58:54,090 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-08-26 11:58:54,090 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1203790150] [2023-08-26 11:58:54,090 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-08-26 11:58:54,090 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-08-26 11:58:54,109 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-08-26 11:58:54,240 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-08-26 11:58:54,241 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-08-26 11:58:54,241 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1203790150] [2023-08-26 11:58:54,241 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1203790150] provided 1 perfect and 0 imperfect interpolant sequences [2023-08-26 11:58:54,241 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-08-26 11:58:54,241 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2023-08-26 11:58:54,241 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1912318414] [2023-08-26 11:58:54,241 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-08-26 11:58:54,242 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2023-08-26 11:58:54,242 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-08-26 11:58:54,242 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2023-08-26 11:58:54,242 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=8, Invalid=12, Unknown=0, NotChecked=0, Total=20 [2023-08-26 11:58:54,243 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 112 out of 283 [2023-08-26 11:58:54,244 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 47 places, 30 transitions, 80 flow. Second operand has 5 states, 5 states have (on average 114.8) internal successors, (574), 5 states have internal predecessors, (574), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-26 11:58:54,244 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2023-08-26 11:58:54,244 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 112 of 283 [2023-08-26 11:58:54,244 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2023-08-26 11:58:56,966 INFO L124 PetriNetUnfolderBase]: 23978/32475 cut-off events. [2023-08-26 11:58:56,966 INFO L125 PetriNetUnfolderBase]: For 5970/5970 co-relation queries the response was YES. [2023-08-26 11:58:57,076 INFO L83 FinitePrefix]: Finished finitePrefix Result has 70162 conditions, 32475 events. 23978/32475 cut-off events. For 5970/5970 co-relation queries the response was YES. Maximal size of possible extension queue 928. Compared 179278 event pairs, 2065 based on Foata normal form. 1086/33561 useless extension candidates. Maximal degree in co-relation 70155. Up to 16429 conditions per place. [2023-08-26 11:58:57,186 INFO L140 encePairwiseOnDemand]: 272/283 looper letters, 65 selfloop transitions, 11 changer transitions 45/121 dead transitions. [2023-08-26 11:58:57,187 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 51 places, 121 transitions, 528 flow [2023-08-26 11:58:57,187 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2023-08-26 11:58:57,187 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 7 states. [2023-08-26 11:58:57,189 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 7 states to 7 states and 908 transitions. [2023-08-26 11:58:57,190 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.45835436648157496 [2023-08-26 11:58:57,190 INFO L72 ComplementDD]: Start complementDD. Operand 7 states and 908 transitions. [2023-08-26 11:58:57,190 INFO L73 IsDeterministic]: Start isDeterministic. Operand 7 states and 908 transitions. [2023-08-26 11:58:57,190 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2023-08-26 11:58:57,190 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 7 states and 908 transitions. [2023-08-26 11:58:57,192 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 8 states, 7 states have (on average 129.71428571428572) internal successors, (908), 7 states have internal predecessors, (908), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-26 11:58:57,195 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 8 states, 8 states have (on average 283.0) internal successors, (2264), 8 states have internal predecessors, (2264), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-26 11:58:57,196 INFO L81 ComplementDD]: Finished complementDD. Result has 8 states, 8 states have (on average 283.0) internal successors, (2264), 8 states have internal predecessors, (2264), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-26 11:58:57,197 INFO L175 Difference]: Start difference. First operand has 47 places, 30 transitions, 80 flow. Second operand 7 states and 908 transitions. [2023-08-26 11:58:57,197 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 51 places, 121 transitions, 528 flow [2023-08-26 11:58:57,747 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 47 places, 121 transitions, 512 flow, removed 4 selfloop flow, removed 4 redundant places. [2023-08-26 11:58:57,749 INFO L231 Difference]: Finished difference. Result has 53 places, 40 transitions, 173 flow [2023-08-26 11:58:57,749 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=283, PETRI_DIFFERENCE_MINUEND_FLOW=72, PETRI_DIFFERENCE_MINUEND_PLACES=41, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=30, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=3, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=21, PETRI_DIFFERENCE_SUBTRAHEND_STATES=7, PETRI_FLOW=173, PETRI_PLACES=53, PETRI_TRANSITIONS=40} [2023-08-26 11:58:57,750 INFO L281 CegarLoopForPetriNet]: 53 programPoint places, 0 predicate places. [2023-08-26 11:58:57,750 INFO L495 AbstractCegarLoop]: Abstraction has has 53 places, 40 transitions, 173 flow [2023-08-26 11:58:57,751 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 114.8) internal successors, (574), 5 states have internal predecessors, (574), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-26 11:58:57,751 INFO L200 CegarLoopForPetriNet]: Found error trace [2023-08-26 11:58:57,751 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-08-26 11:58:57,751 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable3 [2023-08-26 11:58:57,751 INFO L420 AbstractCegarLoop]: === Iteration 5 === Targeting ULTIMATE.startErr8ASSERT_VIOLATIONASSERT === [P0Err0ASSERT_VIOLATIONASSERT, ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 12 more)] === [2023-08-26 11:58:57,752 INFO L145 PredicateUnifier]: Initialized classic predicate unifier [2023-08-26 11:58:57,752 INFO L85 PathProgramCache]: Analyzing trace with hash 1150123872, now seen corresponding path program 1 times [2023-08-26 11:58:57,752 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-08-26 11:58:57,752 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1920843816] [2023-08-26 11:58:57,752 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-08-26 11:58:57,752 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-08-26 11:58:57,782 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-08-26 11:58:57,973 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-08-26 11:58:57,974 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-08-26 11:58:57,974 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1920843816] [2023-08-26 11:58:57,974 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1920843816] provided 1 perfect and 0 imperfect interpolant sequences [2023-08-26 11:58:57,974 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-08-26 11:58:57,975 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2023-08-26 11:58:57,978 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [770299649] [2023-08-26 11:58:57,978 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-08-26 11:58:57,979 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2023-08-26 11:58:57,979 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-08-26 11:58:57,980 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2023-08-26 11:58:57,980 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=8, Invalid=12, Unknown=0, NotChecked=0, Total=20 [2023-08-26 11:58:57,981 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 112 out of 283 [2023-08-26 11:58:57,983 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 53 places, 40 transitions, 173 flow. Second operand has 5 states, 5 states have (on average 115.0) internal successors, (575), 5 states have internal predecessors, (575), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-26 11:58:57,983 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2023-08-26 11:58:57,983 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 112 of 283 [2023-08-26 11:58:57,983 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2023-08-26 11:59:00,462 INFO L124 PetriNetUnfolderBase]: 22746/30990 cut-off events. [2023-08-26 11:59:00,462 INFO L125 PetriNetUnfolderBase]: For 27200/27200 co-relation queries the response was YES. [2023-08-26 11:59:00,572 INFO L83 FinitePrefix]: Finished finitePrefix Result has 86822 conditions, 30990 events. 22746/30990 cut-off events. For 27200/27200 co-relation queries the response was YES. Maximal size of possible extension queue 882. Compared 174242 event pairs, 1312 based on Foata normal form. 969/31959 useless extension candidates. Maximal degree in co-relation 86812. Up to 16211 conditions per place. [2023-08-26 11:59:00,687 INFO L140 encePairwiseOnDemand]: 272/283 looper letters, 66 selfloop transitions, 14 changer transitions 45/125 dead transitions. [2023-08-26 11:59:00,688 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 56 places, 125 transitions, 739 flow [2023-08-26 11:59:00,921 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2023-08-26 11:59:00,921 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 7 states. [2023-08-26 11:59:00,923 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 7 states to 7 states and 900 transitions. [2023-08-26 11:59:00,923 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.4543160020191822 [2023-08-26 11:59:00,923 INFO L72 ComplementDD]: Start complementDD. Operand 7 states and 900 transitions. [2023-08-26 11:59:00,923 INFO L73 IsDeterministic]: Start isDeterministic. Operand 7 states and 900 transitions. [2023-08-26 11:59:00,924 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2023-08-26 11:59:00,924 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 7 states and 900 transitions. [2023-08-26 11:59:00,926 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 8 states, 7 states have (on average 128.57142857142858) internal successors, (900), 7 states have internal predecessors, (900), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-26 11:59:00,929 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 8 states, 8 states have (on average 283.0) internal successors, (2264), 8 states have internal predecessors, (2264), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-26 11:59:00,929 INFO L81 ComplementDD]: Finished complementDD. Result has 8 states, 8 states have (on average 283.0) internal successors, (2264), 8 states have internal predecessors, (2264), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-26 11:59:00,930 INFO L175 Difference]: Start difference. First operand has 53 places, 40 transitions, 173 flow. Second operand 7 states and 900 transitions. [2023-08-26 11:59:00,930 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 56 places, 125 transitions, 739 flow [2023-08-26 11:59:01,040 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 55 places, 125 transitions, 735 flow, removed 2 selfloop flow, removed 1 redundant places. [2023-08-26 11:59:01,042 INFO L231 Difference]: Finished difference. Result has 61 places, 49 transitions, 312 flow [2023-08-26 11:59:01,042 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=283, PETRI_DIFFERENCE_MINUEND_FLOW=171, PETRI_DIFFERENCE_MINUEND_PLACES=49, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=40, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=5, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=28, PETRI_DIFFERENCE_SUBTRAHEND_STATES=7, PETRI_FLOW=312, PETRI_PLACES=61, PETRI_TRANSITIONS=49} [2023-08-26 11:59:01,044 INFO L281 CegarLoopForPetriNet]: 53 programPoint places, 8 predicate places. [2023-08-26 11:59:01,044 INFO L495 AbstractCegarLoop]: Abstraction has has 61 places, 49 transitions, 312 flow [2023-08-26 11:59:01,045 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 115.0) internal successors, (575), 5 states have internal predecessors, (575), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-26 11:59:01,045 INFO L200 CegarLoopForPetriNet]: Found error trace [2023-08-26 11:59:01,045 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-08-26 11:59:01,045 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable4 [2023-08-26 11:59:01,045 INFO L420 AbstractCegarLoop]: === Iteration 6 === Targeting ULTIMATE.startErr8ASSERT_VIOLATIONASSERT === [P0Err0ASSERT_VIOLATIONASSERT, ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 12 more)] === [2023-08-26 11:59:01,045 INFO L145 PredicateUnifier]: Initialized classic predicate unifier [2023-08-26 11:59:01,046 INFO L85 PathProgramCache]: Analyzing trace with hash -1318753327, now seen corresponding path program 1 times [2023-08-26 11:59:01,046 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-08-26 11:59:01,046 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1497288956] [2023-08-26 11:59:01,046 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-08-26 11:59:01,046 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-08-26 11:59:01,076 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-08-26 11:59:01,218 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-08-26 11:59:01,219 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-08-26 11:59:01,219 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1497288956] [2023-08-26 11:59:01,219 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1497288956] provided 1 perfect and 0 imperfect interpolant sequences [2023-08-26 11:59:01,219 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-08-26 11:59:01,219 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2023-08-26 11:59:01,219 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1933385703] [2023-08-26 11:59:01,219 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-08-26 11:59:01,220 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2023-08-26 11:59:01,220 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-08-26 11:59:01,221 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2023-08-26 11:59:01,222 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=8, Invalid=12, Unknown=0, NotChecked=0, Total=20 [2023-08-26 11:59:01,222 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 112 out of 283 [2023-08-26 11:59:01,223 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 61 places, 49 transitions, 312 flow. Second operand has 5 states, 5 states have (on average 115.2) internal successors, (576), 5 states have internal predecessors, (576), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-26 11:59:01,223 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2023-08-26 11:59:01,223 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 112 of 283 [2023-08-26 11:59:01,223 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2023-08-26 11:59:03,797 INFO L124 PetriNetUnfolderBase]: 21158/28829 cut-off events. [2023-08-26 11:59:03,798 INFO L125 PetriNetUnfolderBase]: For 70971/70971 co-relation queries the response was YES. [2023-08-26 11:59:03,930 INFO L83 FinitePrefix]: Finished finitePrefix Result has 92685 conditions, 28829 events. 21158/28829 cut-off events. For 70971/70971 co-relation queries the response was YES. Maximal size of possible extension queue 779. Compared 156372 event pairs, 3854 based on Foata normal form. 916/29745 useless extension candidates. Maximal degree in co-relation 92670. Up to 11877 conditions per place. [2023-08-26 11:59:04,025 INFO L140 encePairwiseOnDemand]: 273/283 looper letters, 78 selfloop transitions, 10 changer transitions 46/134 dead transitions. [2023-08-26 11:59:04,025 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 64 places, 134 transitions, 964 flow [2023-08-26 11:59:04,025 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2023-08-26 11:59:04,026 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 7 states. [2023-08-26 11:59:04,027 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 7 states to 7 states and 896 transitions. [2023-08-26 11:59:04,028 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.45229681978798586 [2023-08-26 11:59:04,028 INFO L72 ComplementDD]: Start complementDD. Operand 7 states and 896 transitions. [2023-08-26 11:59:04,028 INFO L73 IsDeterministic]: Start isDeterministic. Operand 7 states and 896 transitions. [2023-08-26 11:59:04,029 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2023-08-26 11:59:04,029 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 7 states and 896 transitions. [2023-08-26 11:59:04,031 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 8 states, 7 states have (on average 128.0) internal successors, (896), 7 states have internal predecessors, (896), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-26 11:59:04,033 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 8 states, 8 states have (on average 283.0) internal successors, (2264), 8 states have internal predecessors, (2264), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-26 11:59:04,034 INFO L81 ComplementDD]: Finished complementDD. Result has 8 states, 8 states have (on average 283.0) internal successors, (2264), 8 states have internal predecessors, (2264), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-26 11:59:04,034 INFO L175 Difference]: Start difference. First operand has 61 places, 49 transitions, 312 flow. Second operand 7 states and 896 transitions. [2023-08-26 11:59:04,034 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 64 places, 134 transitions, 964 flow [2023-08-26 11:59:04,277 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 64 places, 134 transitions, 950 flow, removed 7 selfloop flow, removed 0 redundant places. [2023-08-26 11:59:04,279 INFO L231 Difference]: Finished difference. Result has 70 places, 55 transitions, 431 flow [2023-08-26 11:59:04,279 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=283, PETRI_DIFFERENCE_MINUEND_FLOW=304, PETRI_DIFFERENCE_MINUEND_PLACES=58, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=49, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=4, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=39, PETRI_DIFFERENCE_SUBTRAHEND_STATES=7, PETRI_FLOW=431, PETRI_PLACES=70, PETRI_TRANSITIONS=55} [2023-08-26 11:59:04,279 INFO L281 CegarLoopForPetriNet]: 53 programPoint places, 17 predicate places. [2023-08-26 11:59:04,280 INFO L495 AbstractCegarLoop]: Abstraction has has 70 places, 55 transitions, 431 flow [2023-08-26 11:59:04,280 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 115.2) internal successors, (576), 5 states have internal predecessors, (576), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-26 11:59:04,280 INFO L200 CegarLoopForPetriNet]: Found error trace [2023-08-26 11:59:04,280 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-08-26 11:59:04,280 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable5 [2023-08-26 11:59:04,280 INFO L420 AbstractCegarLoop]: === Iteration 7 === Targeting ULTIMATE.startErr8ASSERT_VIOLATIONASSERT === [P0Err0ASSERT_VIOLATIONASSERT, ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 12 more)] === [2023-08-26 11:59:04,281 INFO L145 PredicateUnifier]: Initialized classic predicate unifier [2023-08-26 11:59:04,281 INFO L85 PathProgramCache]: Analyzing trace with hash 644872707, now seen corresponding path program 1 times [2023-08-26 11:59:04,281 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-08-26 11:59:04,281 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [159259791] [2023-08-26 11:59:04,281 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-08-26 11:59:04,281 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-08-26 11:59:04,307 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-08-26 11:59:04,399 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-08-26 11:59:04,399 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-08-26 11:59:04,399 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [159259791] [2023-08-26 11:59:04,400 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [159259791] provided 1 perfect and 0 imperfect interpolant sequences [2023-08-26 11:59:04,400 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-08-26 11:59:04,400 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2023-08-26 11:59:04,400 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [9040736] [2023-08-26 11:59:04,400 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-08-26 11:59:04,400 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2023-08-26 11:59:04,401 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-08-26 11:59:04,401 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2023-08-26 11:59:04,401 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2023-08-26 11:59:04,402 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 120 out of 283 [2023-08-26 11:59:04,402 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 70 places, 55 transitions, 431 flow. Second operand has 4 states, 4 states have (on average 123.75) internal successors, (495), 4 states have internal predecessors, (495), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-26 11:59:04,402 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2023-08-26 11:59:04,402 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 120 of 283 [2023-08-26 11:59:04,402 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2023-08-26 11:59:06,082 INFO L124 PetriNetUnfolderBase]: 10804/16253 cut-off events. [2023-08-26 11:59:06,082 INFO L125 PetriNetUnfolderBase]: For 38246/39269 co-relation queries the response was YES. [2023-08-26 11:59:06,149 INFO L83 FinitePrefix]: Finished finitePrefix Result has 48752 conditions, 16253 events. 10804/16253 cut-off events. For 38246/39269 co-relation queries the response was YES. Maximal size of possible extension queue 776. Compared 106129 event pairs, 2004 based on Foata normal form. 1731/17705 useless extension candidates. Maximal degree in co-relation 48731. Up to 10002 conditions per place. [2023-08-26 11:59:06,201 INFO L140 encePairwiseOnDemand]: 276/283 looper letters, 101 selfloop transitions, 10 changer transitions 0/131 dead transitions. [2023-08-26 11:59:06,201 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 71 places, 131 transitions, 1111 flow [2023-08-26 11:59:06,202 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2023-08-26 11:59:06,202 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 5 states. [2023-08-26 11:59:06,203 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 673 transitions. [2023-08-26 11:59:06,204 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.4756183745583039 [2023-08-26 11:59:06,204 INFO L72 ComplementDD]: Start complementDD. Operand 5 states and 673 transitions. [2023-08-26 11:59:06,204 INFO L73 IsDeterministic]: Start isDeterministic. Operand 5 states and 673 transitions. [2023-08-26 11:59:06,204 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2023-08-26 11:59:06,204 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 5 states and 673 transitions. [2023-08-26 11:59:06,206 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 6 states, 5 states have (on average 134.6) internal successors, (673), 5 states have internal predecessors, (673), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-26 11:59:06,208 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 6 states, 6 states have (on average 283.0) internal successors, (1698), 6 states have internal predecessors, (1698), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-26 11:59:06,208 INFO L81 ComplementDD]: Finished complementDD. Result has 6 states, 6 states have (on average 283.0) internal successors, (1698), 6 states have internal predecessors, (1698), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-26 11:59:06,208 INFO L175 Difference]: Start difference. First operand has 70 places, 55 transitions, 431 flow. Second operand 5 states and 673 transitions. [2023-08-26 11:59:06,208 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 71 places, 131 transitions, 1111 flow [2023-08-26 11:59:06,496 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 66 places, 131 transitions, 1088 flow, removed 10 selfloop flow, removed 5 redundant places. [2023-08-26 11:59:06,498 INFO L231 Difference]: Finished difference. Result has 69 places, 64 transitions, 489 flow [2023-08-26 11:59:06,498 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=283, PETRI_DIFFERENCE_MINUEND_FLOW=414, PETRI_DIFFERENCE_MINUEND_PLACES=62, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=55, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=1, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=49, PETRI_DIFFERENCE_SUBTRAHEND_STATES=5, PETRI_FLOW=489, PETRI_PLACES=69, PETRI_TRANSITIONS=64} [2023-08-26 11:59:06,499 INFO L281 CegarLoopForPetriNet]: 53 programPoint places, 16 predicate places. [2023-08-26 11:59:06,499 INFO L495 AbstractCegarLoop]: Abstraction has has 69 places, 64 transitions, 489 flow [2023-08-26 11:59:06,499 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 123.75) internal successors, (495), 4 states have internal predecessors, (495), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-26 11:59:06,499 INFO L200 CegarLoopForPetriNet]: Found error trace [2023-08-26 11:59:06,499 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-08-26 11:59:06,499 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable6 [2023-08-26 11:59:06,500 INFO L420 AbstractCegarLoop]: === Iteration 8 === Targeting ULTIMATE.startErr8ASSERT_VIOLATIONASSERT === [P0Err0ASSERT_VIOLATIONASSERT, ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 12 more)] === [2023-08-26 11:59:06,500 INFO L145 PredicateUnifier]: Initialized classic predicate unifier [2023-08-26 11:59:06,500 INFO L85 PathProgramCache]: Analyzing trace with hash 679259693, now seen corresponding path program 1 times [2023-08-26 11:59:06,500 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-08-26 11:59:06,500 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [937575610] [2023-08-26 11:59:06,500 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-08-26 11:59:06,500 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-08-26 11:59:06,531 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-08-26 11:59:06,713 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-08-26 11:59:06,713 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-08-26 11:59:06,713 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [937575610] [2023-08-26 11:59:06,714 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [937575610] provided 1 perfect and 0 imperfect interpolant sequences [2023-08-26 11:59:06,714 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-08-26 11:59:06,714 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2023-08-26 11:59:06,714 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [898159807] [2023-08-26 11:59:06,714 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-08-26 11:59:06,715 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2023-08-26 11:59:06,715 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-08-26 11:59:06,716 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2023-08-26 11:59:06,716 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2023-08-26 11:59:06,716 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 122 out of 283 [2023-08-26 11:59:06,717 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 69 places, 64 transitions, 489 flow. Second operand has 4 states, 4 states have (on average 126.5) internal successors, (506), 4 states have internal predecessors, (506), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-26 11:59:06,717 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2023-08-26 11:59:06,717 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 122 of 283 [2023-08-26 11:59:06,717 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2023-08-26 11:59:09,163 INFO L292 olderBase$Statistics]: inserting event number 4 for the transition-marking pair ([442] L809-->L816: Formula: (let ((.cse2 (not (= 0 (mod v_~a$r_buff1_thd3~0_16 256)))) (.cse3 (not (= (mod v_~a$w_buff0_used~0_115 256) 0))) (.cse5 (not (= (mod v_~a$r_buff0_thd3~0_20 256) 0)))) (let ((.cse1 (and (not (= (mod v_~a$w_buff0_used~0_116 256) 0)) .cse5)) (.cse0 (and .cse3 .cse5)) (.cse4 (and .cse2 (not (= (mod v_~a$w_buff1_used~0_107 256) 0))))) (and (= v_~a$r_buff0_thd3~0_19 (ite .cse0 0 v_~a$r_buff0_thd3~0_20)) (= v_~a$w_buff0_used~0_115 (ite .cse1 0 v_~a$w_buff0_used~0_116)) (= (ite (or (and .cse2 (not (= (mod v_~a$w_buff1_used~0_106 256) 0))) (and (not (= (mod v_~a$r_buff0_thd3~0_19 256) 0)) .cse3)) 0 v_~a$r_buff1_thd3~0_16) v_~a$r_buff1_thd3~0_15) (= v_~a~0_54 (ite .cse1 v_~a$w_buff0~0_36 (ite .cse4 v_~a$w_buff1~0_33 v_~a~0_55))) (= (ite (or .cse0 .cse4) 0 v_~a$w_buff1_used~0_107) v_~a$w_buff1_used~0_106)))) InVars {~a~0=v_~a~0_55, ~a$w_buff1~0=v_~a$w_buff1~0_33, ~a$w_buff0~0=v_~a$w_buff0~0_36, ~a$r_buff1_thd3~0=v_~a$r_buff1_thd3~0_16, ~a$w_buff0_used~0=v_~a$w_buff0_used~0_116, ~a$r_buff0_thd3~0=v_~a$r_buff0_thd3~0_20, ~a$w_buff1_used~0=v_~a$w_buff1_used~0_107} OutVars{~a~0=v_~a~0_54, ~a$w_buff1~0=v_~a$w_buff1~0_33, ~a$w_buff0~0=v_~a$w_buff0~0_36, ~a$r_buff1_thd3~0=v_~a$r_buff1_thd3~0_15, ~a$w_buff0_used~0=v_~a$w_buff0_used~0_115, ~a$r_buff0_thd3~0=v_~a$r_buff0_thd3~0_19, ~a$w_buff1_used~0=v_~a$w_buff1_used~0_106} AuxVars[] AssignedVars[~a~0, ~a$r_buff1_thd3~0, ~a$w_buff0_used~0, ~a$r_buff0_thd3~0, ~a$w_buff1_used~0][58], [113#L852true, 24#L816true, 157#true, 190#true, 79#P0EXITtrue, Black: 193#(or (not (= 2 ~y~0)) (not (= ~__unbuffered_p3_EAX~0 1)) (not (= ~__unbuffered_p2_EBX~0 0)) (not (= 2 ~x~0)) (not (= ~__unbuffered_p3_EBX~0 0)) (not (= 2 ~__unbuffered_p2_EAX~0))), Black: 192#(<= ~y~0 0), Black: 196#(and (<= ~y~0 0) (not (= |ULTIMATE.start___VERIFIER_assert_#in~expression#1| 0))), 174#true, 225#(and (<= |ULTIMATE.start_assume_abort_if_not_#in~cond#1| 0) (<= 0 |ULTIMATE.start_assume_abort_if_not_#in~cond#1|)), P1Thread1of1ForFork0InUse, P3Thread1of1ForFork1InUse, Black: 214#(and (or (not (= 2 ~y~0)) (not (= ~__unbuffered_p3_EAX~0 1)) (not (= ~__unbuffered_p2_EBX~0 0)) (not (= 2 ~x~0)) (not (= ~__unbuffered_p3_EBX~0 0)) (not (= 2 ~__unbuffered_p2_EAX~0))) (not (= |ULTIMATE.start___VERIFIER_assert_#in~expression#1| 0))), Black: 208#(<= ~__unbuffered_p2_EAX~0 0), P2Thread1of1ForFork3InUse, Black: 210#(not (= |ULTIMATE.start___VERIFIER_assert_#in~expression#1| 0)), P0Thread1of1ForFork2InUse, Black: 209#(or (not (= 2 ~y~0)) (not (= ~__unbuffered_p3_EAX~0 1)) (not (= ~__unbuffered_p2_EBX~0 0)) (not (= 2 ~x~0)) (not (= ~__unbuffered_p3_EBX~0 0)) (not (= 2 ~__unbuffered_p2_EAX~0))), 37#L880true, Black: 227#(and (<= ~__unbuffered_cnt~0 0) (<= |ULTIMATE.start_assume_abort_if_not_#in~cond#1| 0) (<= 0 |ULTIMATE.start_assume_abort_if_not_#in~cond#1|)), Black: 224#(<= ~__unbuffered_cnt~0 0), 36#P1EXITtrue, 234#(= ~x~0 1), Black: 166#(<= ~__unbuffered_p3_EAX~0 0), Black: 177#(or (not (= 2 ~y~0)) (not (= ~__unbuffered_p3_EAX~0 1)) (not (= ~__unbuffered_p2_EBX~0 0)) (not (= 2 ~x~0)) (not (= ~__unbuffered_p3_EBX~0 0)) (not (= 2 ~__unbuffered_p2_EAX~0))), Black: 182#(and (or (not (= 2 ~y~0)) (not (= ~__unbuffered_p3_EAX~0 1)) (not (= ~__unbuffered_p2_EBX~0 0)) (not (= 2 ~x~0)) (not (= ~__unbuffered_p3_EBX~0 0)) (not (= 2 ~__unbuffered_p2_EAX~0))) (not (= |ULTIMATE.start___VERIFIER_assert_#in~expression#1| 0))), 206#true, Black: 176#(<= ~x~0 0)]) [2023-08-26 11:59:09,163 INFO L294 olderBase$Statistics]: this new event has 25 ancestors and is cut-off event [2023-08-26 11:59:09,163 INFO L297 olderBase$Statistics]: existing Event has 25 ancestors and is cut-off event [2023-08-26 11:59:09,163 INFO L297 olderBase$Statistics]: existing Event has 25 ancestors and is cut-off event [2023-08-26 11:59:09,163 INFO L297 olderBase$Statistics]: existing Event has 25 ancestors and is cut-off event [2023-08-26 11:59:09,428 INFO L124 PetriNetUnfolderBase]: 17759/26708 cut-off events. [2023-08-26 11:59:09,428 INFO L125 PetriNetUnfolderBase]: For 69732/70926 co-relation queries the response was YES. [2023-08-26 11:59:09,678 INFO L83 FinitePrefix]: Finished finitePrefix Result has 99272 conditions, 26708 events. 17759/26708 cut-off events. For 69732/70926 co-relation queries the response was YES. Maximal size of possible extension queue 1134. Compared 185175 event pairs, 7575 based on Foata normal form. 1013/27008 useless extension candidates. Maximal degree in co-relation 99251. Up to 12893 conditions per place. [2023-08-26 11:59:09,733 INFO L140 encePairwiseOnDemand]: 279/283 looper letters, 69 selfloop transitions, 9 changer transitions 29/119 dead transitions. [2023-08-26 11:59:09,733 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 73 places, 119 transitions, 1001 flow [2023-08-26 11:59:09,734 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2023-08-26 11:59:09,734 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 5 states. [2023-08-26 11:59:09,735 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 679 transitions. [2023-08-26 11:59:09,735 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.47985865724381627 [2023-08-26 11:59:09,735 INFO L72 ComplementDD]: Start complementDD. Operand 5 states and 679 transitions. [2023-08-26 11:59:09,735 INFO L73 IsDeterministic]: Start isDeterministic. Operand 5 states and 679 transitions. [2023-08-26 11:59:09,736 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2023-08-26 11:59:09,736 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 5 states and 679 transitions. [2023-08-26 11:59:09,737 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 6 states, 5 states have (on average 135.8) internal successors, (679), 5 states have internal predecessors, (679), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-26 11:59:09,739 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 6 states, 6 states have (on average 283.0) internal successors, (1698), 6 states have internal predecessors, (1698), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-26 11:59:09,740 INFO L81 ComplementDD]: Finished complementDD. Result has 6 states, 6 states have (on average 283.0) internal successors, (1698), 6 states have internal predecessors, (1698), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-26 11:59:09,740 INFO L175 Difference]: Start difference. First operand has 69 places, 64 transitions, 489 flow. Second operand 5 states and 679 transitions. [2023-08-26 11:59:09,740 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 73 places, 119 transitions, 1001 flow [2023-08-26 11:59:10,141 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 70 places, 119 transitions, 984 flow, removed 4 selfloop flow, removed 3 redundant places. [2023-08-26 11:59:10,143 INFO L231 Difference]: Finished difference. Result has 73 places, 61 transitions, 483 flow [2023-08-26 11:59:10,143 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=283, PETRI_DIFFERENCE_MINUEND_FLOW=478, PETRI_DIFFERENCE_MINUEND_PLACES=66, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=64, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=9, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=55, PETRI_DIFFERENCE_SUBTRAHEND_STATES=5, PETRI_FLOW=483, PETRI_PLACES=73, PETRI_TRANSITIONS=61} [2023-08-26 11:59:10,144 INFO L281 CegarLoopForPetriNet]: 53 programPoint places, 20 predicate places. [2023-08-26 11:59:10,144 INFO L495 AbstractCegarLoop]: Abstraction has has 73 places, 61 transitions, 483 flow [2023-08-26 11:59:10,144 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 126.5) internal successors, (506), 4 states have internal predecessors, (506), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-26 11:59:10,144 INFO L200 CegarLoopForPetriNet]: Found error trace [2023-08-26 11:59:10,144 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-08-26 11:59:10,144 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable7 [2023-08-26 11:59:10,145 INFO L420 AbstractCegarLoop]: === Iteration 9 === Targeting ULTIMATE.startErr8ASSERT_VIOLATIONASSERT === [P0Err0ASSERT_VIOLATIONASSERT, ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 12 more)] === [2023-08-26 11:59:10,145 INFO L145 PredicateUnifier]: Initialized classic predicate unifier [2023-08-26 11:59:10,145 INFO L85 PathProgramCache]: Analyzing trace with hash -1570240585, now seen corresponding path program 1 times [2023-08-26 11:59:10,145 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-08-26 11:59:10,145 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [524124099] [2023-08-26 11:59:10,145 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-08-26 11:59:10,146 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-08-26 11:59:10,188 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-08-26 11:59:10,376 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-08-26 11:59:10,376 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-08-26 11:59:10,377 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [524124099] [2023-08-26 11:59:10,377 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [524124099] provided 1 perfect and 0 imperfect interpolant sequences [2023-08-26 11:59:10,377 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-08-26 11:59:10,377 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2023-08-26 11:59:10,377 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [148270745] [2023-08-26 11:59:10,377 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-08-26 11:59:10,378 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2023-08-26 11:59:10,378 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-08-26 11:59:10,378 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2023-08-26 11:59:10,380 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=8, Invalid=12, Unknown=0, NotChecked=0, Total=20 [2023-08-26 11:59:10,380 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 120 out of 283 [2023-08-26 11:59:10,381 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 73 places, 61 transitions, 483 flow. Second operand has 5 states, 5 states have (on average 123.4) internal successors, (617), 5 states have internal predecessors, (617), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-26 11:59:10,381 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2023-08-26 11:59:10,381 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 120 of 283 [2023-08-26 11:59:10,381 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2023-08-26 11:59:12,293 INFO L124 PetriNetUnfolderBase]: 11756/18277 cut-off events. [2023-08-26 11:59:12,293 INFO L125 PetriNetUnfolderBase]: For 41779/42651 co-relation queries the response was YES. [2023-08-26 11:59:12,389 INFO L83 FinitePrefix]: Finished finitePrefix Result has 64473 conditions, 18277 events. 11756/18277 cut-off events. For 41779/42651 co-relation queries the response was YES. Maximal size of possible extension queue 964. Compared 130420 event pairs, 1427 based on Foata normal form. 1644/19519 useless extension candidates. Maximal degree in co-relation 64451. Up to 6040 conditions per place. [2023-08-26 11:59:12,425 INFO L140 encePairwiseOnDemand]: 276/283 looper letters, 141 selfloop transitions, 19 changer transitions 0/177 dead transitions. [2023-08-26 11:59:12,425 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 77 places, 177 transitions, 1623 flow [2023-08-26 11:59:12,426 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2023-08-26 11:59:12,426 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 7 states. [2023-08-26 11:59:12,427 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 7 states to 7 states and 944 transitions. [2023-08-26 11:59:12,428 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.47652700656234226 [2023-08-26 11:59:12,428 INFO L72 ComplementDD]: Start complementDD. Operand 7 states and 944 transitions. [2023-08-26 11:59:12,428 INFO L73 IsDeterministic]: Start isDeterministic. Operand 7 states and 944 transitions. [2023-08-26 11:59:12,428 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2023-08-26 11:59:12,428 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 7 states and 944 transitions. [2023-08-26 11:59:12,430 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 8 states, 7 states have (on average 134.85714285714286) internal successors, (944), 7 states have internal predecessors, (944), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-26 11:59:12,432 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 8 states, 8 states have (on average 283.0) internal successors, (2264), 8 states have internal predecessors, (2264), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-26 11:59:12,433 INFO L81 ComplementDD]: Finished complementDD. Result has 8 states, 8 states have (on average 283.0) internal successors, (2264), 8 states have internal predecessors, (2264), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-26 11:59:12,433 INFO L175 Difference]: Start difference. First operand has 73 places, 61 transitions, 483 flow. Second operand 7 states and 944 transitions. [2023-08-26 11:59:12,433 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 77 places, 177 transitions, 1623 flow [2023-08-26 11:59:12,689 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 74 places, 177 transitions, 1590 flow, removed 2 selfloop flow, removed 3 redundant places. [2023-08-26 11:59:12,691 INFO L231 Difference]: Finished difference. Result has 77 places, 70 transitions, 604 flow [2023-08-26 11:59:12,691 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=283, PETRI_DIFFERENCE_MINUEND_FLOW=470, PETRI_DIFFERENCE_MINUEND_PLACES=68, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=61, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=10, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=46, PETRI_DIFFERENCE_SUBTRAHEND_STATES=7, PETRI_FLOW=604, PETRI_PLACES=77, PETRI_TRANSITIONS=70} [2023-08-26 11:59:12,692 INFO L281 CegarLoopForPetriNet]: 53 programPoint places, 24 predicate places. [2023-08-26 11:59:12,692 INFO L495 AbstractCegarLoop]: Abstraction has has 77 places, 70 transitions, 604 flow [2023-08-26 11:59:12,692 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 123.4) internal successors, (617), 5 states have internal predecessors, (617), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-26 11:59:12,692 INFO L200 CegarLoopForPetriNet]: Found error trace [2023-08-26 11:59:12,693 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-08-26 11:59:12,693 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable8 [2023-08-26 11:59:12,693 INFO L420 AbstractCegarLoop]: === Iteration 10 === Targeting ULTIMATE.startErr8ASSERT_VIOLATIONASSERT === [P0Err0ASSERT_VIOLATIONASSERT, ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 12 more)] === [2023-08-26 11:59:12,693 INFO L145 PredicateUnifier]: Initialized classic predicate unifier [2023-08-26 11:59:12,693 INFO L85 PathProgramCache]: Analyzing trace with hash -844612108, now seen corresponding path program 1 times [2023-08-26 11:59:12,693 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-08-26 11:59:12,693 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [242663576] [2023-08-26 11:59:12,694 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-08-26 11:59:12,694 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-08-26 11:59:12,712 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-08-26 11:59:12,841 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-08-26 11:59:12,842 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-08-26 11:59:12,842 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [242663576] [2023-08-26 11:59:12,842 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [242663576] provided 1 perfect and 0 imperfect interpolant sequences [2023-08-26 11:59:12,842 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-08-26 11:59:12,842 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2023-08-26 11:59:12,842 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1689109249] [2023-08-26 11:59:12,842 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-08-26 11:59:12,843 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2023-08-26 11:59:12,843 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-08-26 11:59:12,843 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2023-08-26 11:59:12,843 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2023-08-26 11:59:12,844 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 120 out of 283 [2023-08-26 11:59:12,845 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 77 places, 70 transitions, 604 flow. Second operand has 5 states, 5 states have (on average 124.2) internal successors, (621), 5 states have internal predecessors, (621), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-26 11:59:12,845 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2023-08-26 11:59:12,845 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 120 of 283 [2023-08-26 11:59:12,845 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2023-08-26 11:59:15,952 INFO L124 PetriNetUnfolderBase]: 19966/30197 cut-off events. [2023-08-26 11:59:15,953 INFO L125 PetriNetUnfolderBase]: For 126098/127767 co-relation queries the response was YES. [2023-08-26 11:59:16,120 INFO L83 FinitePrefix]: Finished finitePrefix Result has 131429 conditions, 30197 events. 19966/30197 cut-off events. For 126098/127767 co-relation queries the response was YES. Maximal size of possible extension queue 1357. Compared 216240 event pairs, 3279 based on Foata normal form. 844/30729 useless extension candidates. Maximal degree in co-relation 131406. Up to 15686 conditions per place. [2023-08-26 11:59:16,161 INFO L140 encePairwiseOnDemand]: 279/283 looper letters, 99 selfloop transitions, 3 changer transitions 39/152 dead transitions. [2023-08-26 11:59:16,162 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 81 places, 152 transitions, 1543 flow [2023-08-26 11:59:16,162 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2023-08-26 11:59:16,162 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 5 states. [2023-08-26 11:59:16,163 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 666 transitions. [2023-08-26 11:59:16,164 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.4706713780918728 [2023-08-26 11:59:16,164 INFO L72 ComplementDD]: Start complementDD. Operand 5 states and 666 transitions. [2023-08-26 11:59:16,164 INFO L73 IsDeterministic]: Start isDeterministic. Operand 5 states and 666 transitions. [2023-08-26 11:59:16,164 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2023-08-26 11:59:16,164 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 5 states and 666 transitions. [2023-08-26 11:59:16,166 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 6 states, 5 states have (on average 133.2) internal successors, (666), 5 states have internal predecessors, (666), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-26 11:59:16,168 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 6 states, 6 states have (on average 283.0) internal successors, (1698), 6 states have internal predecessors, (1698), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-26 11:59:16,168 INFO L81 ComplementDD]: Finished complementDD. Result has 6 states, 6 states have (on average 283.0) internal successors, (1698), 6 states have internal predecessors, (1698), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-26 11:59:16,168 INFO L175 Difference]: Start difference. First operand has 77 places, 70 transitions, 604 flow. Second operand 5 states and 666 transitions. [2023-08-26 11:59:16,169 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 81 places, 152 transitions, 1543 flow [2023-08-26 11:59:17,979 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 78 places, 152 transitions, 1408 flow, removed 47 selfloop flow, removed 3 redundant places. [2023-08-26 11:59:17,980 INFO L231 Difference]: Finished difference. Result has 81 places, 71 transitions, 585 flow [2023-08-26 11:59:17,980 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=283, PETRI_DIFFERENCE_MINUEND_FLOW=554, PETRI_DIFFERENCE_MINUEND_PLACES=74, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=70, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=1, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=67, PETRI_DIFFERENCE_SUBTRAHEND_STATES=5, PETRI_FLOW=585, PETRI_PLACES=81, PETRI_TRANSITIONS=71} [2023-08-26 11:59:17,981 INFO L281 CegarLoopForPetriNet]: 53 programPoint places, 28 predicate places. [2023-08-26 11:59:17,981 INFO L495 AbstractCegarLoop]: Abstraction has has 81 places, 71 transitions, 585 flow [2023-08-26 11:59:17,981 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 124.2) internal successors, (621), 5 states have internal predecessors, (621), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-26 11:59:17,982 INFO L200 CegarLoopForPetriNet]: Found error trace [2023-08-26 11:59:17,982 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-08-26 11:59:17,982 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable9 [2023-08-26 11:59:17,982 INFO L420 AbstractCegarLoop]: === Iteration 11 === Targeting ULTIMATE.startErr8ASSERT_VIOLATIONASSERT === [P0Err0ASSERT_VIOLATIONASSERT, ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 12 more)] === [2023-08-26 11:59:17,982 INFO L145 PredicateUnifier]: Initialized classic predicate unifier [2023-08-26 11:59:17,982 INFO L85 PathProgramCache]: Analyzing trace with hash -1367846620, now seen corresponding path program 2 times [2023-08-26 11:59:17,984 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-08-26 11:59:17,984 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [199083221] [2023-08-26 11:59:17,984 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-08-26 11:59:17,984 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-08-26 11:59:18,014 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-08-26 11:59:18,149 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-08-26 11:59:18,149 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-08-26 11:59:18,149 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [199083221] [2023-08-26 11:59:18,149 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [199083221] provided 1 perfect and 0 imperfect interpolant sequences [2023-08-26 11:59:18,149 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-08-26 11:59:18,149 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2023-08-26 11:59:18,149 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [924372042] [2023-08-26 11:59:18,149 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-08-26 11:59:18,150 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2023-08-26 11:59:18,150 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-08-26 11:59:18,150 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2023-08-26 11:59:18,150 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=12, Invalid=18, Unknown=0, NotChecked=0, Total=30 [2023-08-26 11:59:18,151 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 120 out of 283 [2023-08-26 11:59:18,152 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 81 places, 71 transitions, 585 flow. Second operand has 6 states, 6 states have (on average 123.16666666666667) internal successors, (739), 6 states have internal predecessors, (739), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-26 11:59:18,152 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2023-08-26 11:59:18,152 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 120 of 283 [2023-08-26 11:59:18,152 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2023-08-26 11:59:20,939 INFO L124 PetriNetUnfolderBase]: 14698/22969 cut-off events. [2023-08-26 11:59:20,939 INFO L125 PetriNetUnfolderBase]: For 64521/66034 co-relation queries the response was YES. [2023-08-26 11:59:21,076 INFO L83 FinitePrefix]: Finished finitePrefix Result has 85541 conditions, 22969 events. 14698/22969 cut-off events. For 64521/66034 co-relation queries the response was YES. Maximal size of possible extension queue 1317. Compared 173271 event pairs, 1335 based on Foata normal form. 1288/23860 useless extension candidates. Maximal degree in co-relation 85515. Up to 5325 conditions per place. [2023-08-26 11:59:21,108 INFO L140 encePairwiseOnDemand]: 276/283 looper letters, 154 selfloop transitions, 27 changer transitions 13/213 dead transitions. [2023-08-26 11:59:21,108 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 88 places, 213 transitions, 1994 flow [2023-08-26 11:59:21,109 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2023-08-26 11:59:21,109 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 9 states. [2023-08-26 11:59:21,111 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 9 states to 9 states and 1212 transitions. [2023-08-26 11:59:21,111 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.4758539458186101 [2023-08-26 11:59:21,112 INFO L72 ComplementDD]: Start complementDD. Operand 9 states and 1212 transitions. [2023-08-26 11:59:21,112 INFO L73 IsDeterministic]: Start isDeterministic. Operand 9 states and 1212 transitions. [2023-08-26 11:59:21,112 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2023-08-26 11:59:21,112 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 9 states and 1212 transitions. [2023-08-26 11:59:21,115 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 10 states, 9 states have (on average 134.66666666666666) internal successors, (1212), 9 states have internal predecessors, (1212), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-26 11:59:21,118 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 10 states, 10 states have (on average 283.0) internal successors, (2830), 10 states have internal predecessors, (2830), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-26 11:59:21,119 INFO L81 ComplementDD]: Finished complementDD. Result has 10 states, 10 states have (on average 283.0) internal successors, (2830), 10 states have internal predecessors, (2830), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-26 11:59:21,119 INFO L175 Difference]: Start difference. First operand has 81 places, 71 transitions, 585 flow. Second operand 9 states and 1212 transitions. [2023-08-26 11:59:21,119 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 88 places, 213 transitions, 1994 flow [2023-08-26 11:59:22,587 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 85 places, 213 transitions, 1970 flow, removed 3 selfloop flow, removed 3 redundant places. [2023-08-26 11:59:22,589 INFO L231 Difference]: Finished difference. Result has 88 places, 80 transitions, 749 flow [2023-08-26 11:59:22,589 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=283, PETRI_DIFFERENCE_MINUEND_FLOW=573, PETRI_DIFFERENCE_MINUEND_PLACES=77, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=71, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=22, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=48, PETRI_DIFFERENCE_SUBTRAHEND_STATES=9, PETRI_FLOW=749, PETRI_PLACES=88, PETRI_TRANSITIONS=80} [2023-08-26 11:59:22,590 INFO L281 CegarLoopForPetriNet]: 53 programPoint places, 35 predicate places. [2023-08-26 11:59:22,590 INFO L495 AbstractCegarLoop]: Abstraction has has 88 places, 80 transitions, 749 flow [2023-08-26 11:59:22,590 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 123.16666666666667) internal successors, (739), 6 states have internal predecessors, (739), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-26 11:59:22,591 INFO L200 CegarLoopForPetriNet]: Found error trace [2023-08-26 11:59:22,591 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-08-26 11:59:22,591 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable10 [2023-08-26 11:59:22,591 INFO L420 AbstractCegarLoop]: === Iteration 12 === Targeting ULTIMATE.startErr8ASSERT_VIOLATIONASSERT === [P0Err0ASSERT_VIOLATIONASSERT, ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 12 more)] === [2023-08-26 11:59:22,591 INFO L145 PredicateUnifier]: Initialized classic predicate unifier [2023-08-26 11:59:22,591 INFO L85 PathProgramCache]: Analyzing trace with hash 1805179792, now seen corresponding path program 1 times [2023-08-26 11:59:22,591 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-08-26 11:59:22,592 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [191444427] [2023-08-26 11:59:22,592 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-08-26 11:59:22,592 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-08-26 11:59:22,639 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-08-26 11:59:22,829 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-08-26 11:59:22,829 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-08-26 11:59:22,830 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [191444427] [2023-08-26 11:59:22,830 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [191444427] provided 1 perfect and 0 imperfect interpolant sequences [2023-08-26 11:59:22,830 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-08-26 11:59:22,830 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2023-08-26 11:59:22,830 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1771045844] [2023-08-26 11:59:22,830 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-08-26 11:59:22,832 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2023-08-26 11:59:22,832 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-08-26 11:59:22,832 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2023-08-26 11:59:22,833 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=17, Invalid=25, Unknown=0, NotChecked=0, Total=42 [2023-08-26 11:59:22,833 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 120 out of 283 [2023-08-26 11:59:22,834 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 88 places, 80 transitions, 749 flow. Second operand has 7 states, 7 states have (on average 123.14285714285714) internal successors, (862), 7 states have internal predecessors, (862), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-26 11:59:22,834 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2023-08-26 11:59:22,834 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 120 of 283 [2023-08-26 11:59:22,834 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2023-08-26 11:59:25,800 INFO L124 PetriNetUnfolderBase]: 14526/22668 cut-off events. [2023-08-26 11:59:25,801 INFO L125 PetriNetUnfolderBase]: For 77100/78598 co-relation queries the response was YES. [2023-08-26 11:59:25,937 INFO L83 FinitePrefix]: Finished finitePrefix Result has 94754 conditions, 22668 events. 14526/22668 cut-off events. For 77100/78598 co-relation queries the response was YES. Maximal size of possible extension queue 1327. Compared 170773 event pairs, 1356 based on Foata normal form. 756/22995 useless extension candidates. Maximal degree in co-relation 94727. Up to 5296 conditions per place. [2023-08-26 11:59:25,958 INFO L140 encePairwiseOnDemand]: 276/283 looper letters, 103 selfloop transitions, 30 changer transitions 65/214 dead transitions. [2023-08-26 11:59:25,959 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 98 places, 214 transitions, 2078 flow [2023-08-26 11:59:25,959 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 11 states. [2023-08-26 11:59:25,959 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 11 states. [2023-08-26 11:59:25,961 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 11 states to 11 states and 1453 transitions. [2023-08-26 11:59:25,962 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.46675232894314167 [2023-08-26 11:59:25,962 INFO L72 ComplementDD]: Start complementDD. Operand 11 states and 1453 transitions. [2023-08-26 11:59:25,962 INFO L73 IsDeterministic]: Start isDeterministic. Operand 11 states and 1453 transitions. [2023-08-26 11:59:25,963 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2023-08-26 11:59:25,963 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 11 states and 1453 transitions. [2023-08-26 11:59:25,966 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 12 states, 11 states have (on average 132.0909090909091) internal successors, (1453), 11 states have internal predecessors, (1453), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-26 11:59:25,969 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 12 states, 12 states have (on average 283.0) internal successors, (3396), 12 states have internal predecessors, (3396), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-26 11:59:25,970 INFO L81 ComplementDD]: Finished complementDD. Result has 12 states, 12 states have (on average 283.0) internal successors, (3396), 12 states have internal predecessors, (3396), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-26 11:59:25,970 INFO L175 Difference]: Start difference. First operand has 88 places, 80 transitions, 749 flow. Second operand 11 states and 1453 transitions. [2023-08-26 11:59:25,970 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 98 places, 214 transitions, 2078 flow [2023-08-26 11:59:29,440 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 91 places, 214 transitions, 1965 flow, removed 39 selfloop flow, removed 7 redundant places. [2023-08-26 11:59:29,442 INFO L231 Difference]: Finished difference. Result has 94 places, 73 transitions, 653 flow [2023-08-26 11:59:29,442 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=283, PETRI_DIFFERENCE_MINUEND_FLOW=636, PETRI_DIFFERENCE_MINUEND_PLACES=81, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=80, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=29, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=50, PETRI_DIFFERENCE_SUBTRAHEND_STATES=11, PETRI_FLOW=653, PETRI_PLACES=94, PETRI_TRANSITIONS=73} [2023-08-26 11:59:29,442 INFO L281 CegarLoopForPetriNet]: 53 programPoint places, 41 predicate places. [2023-08-26 11:59:29,442 INFO L495 AbstractCegarLoop]: Abstraction has has 94 places, 73 transitions, 653 flow [2023-08-26 11:59:29,443 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 7 states, 7 states have (on average 123.14285714285714) internal successors, (862), 7 states have internal predecessors, (862), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-26 11:59:29,443 INFO L200 CegarLoopForPetriNet]: Found error trace [2023-08-26 11:59:29,443 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-08-26 11:59:29,443 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable11 [2023-08-26 11:59:29,443 INFO L420 AbstractCegarLoop]: === Iteration 13 === Targeting ULTIMATE.startErr8ASSERT_VIOLATIONASSERT === [P0Err0ASSERT_VIOLATIONASSERT, ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 12 more)] === [2023-08-26 11:59:29,444 INFO L145 PredicateUnifier]: Initialized classic predicate unifier [2023-08-26 11:59:29,444 INFO L85 PathProgramCache]: Analyzing trace with hash -1976933706, now seen corresponding path program 1 times [2023-08-26 11:59:29,444 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-08-26 11:59:29,444 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [993297137] [2023-08-26 11:59:29,444 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-08-26 11:59:29,444 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-08-26 11:59:29,489 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-08-26 11:59:30,756 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-08-26 11:59:30,756 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-08-26 11:59:30,756 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [993297137] [2023-08-26 11:59:30,756 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [993297137] provided 1 perfect and 0 imperfect interpolant sequences [2023-08-26 11:59:30,756 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-08-26 11:59:30,756 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2023-08-26 11:59:30,756 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1371792432] [2023-08-26 11:59:30,757 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-08-26 11:59:30,757 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 9 states [2023-08-26 11:59:30,757 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-08-26 11:59:30,757 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2023-08-26 11:59:30,758 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=18, Invalid=54, Unknown=0, NotChecked=0, Total=72 [2023-08-26 11:59:30,758 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 112 out of 283 [2023-08-26 11:59:30,759 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 94 places, 73 transitions, 653 flow. Second operand has 9 states, 9 states have (on average 114.77777777777777) internal successors, (1033), 9 states have internal predecessors, (1033), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-26 11:59:30,759 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2023-08-26 11:59:30,760 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 112 of 283 [2023-08-26 11:59:30,760 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2023-08-26 11:59:32,039 INFO L292 olderBase$Statistics]: inserting event number 4 for the transition-marking pair ([449] L829-->L845: Formula: (let ((.cse3 (= (mod v_~a$r_buff1_thd4~0_56 256) 0)) (.cse7 (= (mod v_~a$r_buff0_thd4~0_60 256) 0))) (let ((.cse9 (not .cse7)) (.cse10 (and .cse7 (= (mod v_~a$w_buff1_used~0_135 256) 0))) (.cse8 (and .cse3 .cse7)) (.cse11 (= (mod v_~a$w_buff0_used~0_148 256) 0))) (let ((.cse5 (or .cse10 .cse8 .cse11)) (.cse6 (and (not .cse11) .cse9)) (.cse2 (= (mod v_~a$w_buff1_used~0_134 256) 0)) (.cse0 (not (= (mod v_~weak$$choice2~0_30 256) 0))) (.cse4 (= (mod v_~a$w_buff0_used~0_147 256) 0))) (and (= v_~a$flush_delayed~0_23 0) (= (ite .cse0 v_~a$r_buff1_thd4~0_56 (ite (let ((.cse1 (= (mod v_~a$r_buff0_thd4~0_59 256) 0))) (or (and .cse1 .cse2) (and .cse1 .cse3) .cse4)) v_~a$r_buff1_thd4~0_56 0)) v_~a$r_buff1_thd4~0_55) (= (ite .cse5 v_~a~0_81 (ite .cse6 v_~a$w_buff0~0_63 v_~a$w_buff1~0_56)) v_~__unbuffered_p3_EBX~0_10) (= (ite .cse0 v_~a$w_buff0_used~0_148 (ite .cse5 v_~a$w_buff0_used~0_148 (ite .cse6 0 v_~a$w_buff0_used~0_148))) v_~a$w_buff0_used~0_147) (= v_~a~0_80 (ite .cse0 v_~a$mem_tmp~0_14 v_~__unbuffered_p3_EBX~0_10)) (= v_~a$w_buff0~0_63 v_~a$w_buff0~0_62) (= v_~a~0_81 v_~a$mem_tmp~0_14) (= v_~a$w_buff1~0_55 v_~a$w_buff1~0_56) (= v_~a$r_buff0_thd4~0_59 (ite .cse0 v_~a$r_buff0_thd4~0_60 (ite (or (and .cse7 .cse2) .cse8 .cse4) v_~a$r_buff0_thd4~0_60 (ite (and (not .cse4) .cse9) 0 v_~a$r_buff0_thd4~0_60)))) (= (ite .cse0 v_~a$w_buff1_used~0_135 (ite (or .cse10 .cse8 .cse4) v_~a$w_buff1_used~0_135 0)) v_~a$w_buff1_used~0_134))))) InVars {~a~0=v_~a~0_81, ~a$w_buff1~0=v_~a$w_buff1~0_56, ~a$w_buff0~0=v_~a$w_buff0~0_63, ~a$r_buff1_thd4~0=v_~a$r_buff1_thd4~0_56, ~a$w_buff0_used~0=v_~a$w_buff0_used~0_148, ~a$w_buff1_used~0=v_~a$w_buff1_used~0_135, ~a$r_buff0_thd4~0=v_~a$r_buff0_thd4~0_60} OutVars{~a$r_buff1_thd4~0=v_~a$r_buff1_thd4~0_55, ~a$w_buff0_used~0=v_~a$w_buff0_used~0_147, ~__unbuffered_p3_EBX~0=v_~__unbuffered_p3_EBX~0_10, ~a$r_buff0_thd4~0=v_~a$r_buff0_thd4~0_59, ~a~0=v_~a~0_80, ~a$mem_tmp~0=v_~a$mem_tmp~0_14, ~weak$$choice0~0=v_~weak$$choice0~0_9, ~a$w_buff1~0=v_~a$w_buff1~0_55, ~a$flush_delayed~0=v_~a$flush_delayed~0_23, ~a$w_buff0~0=v_~a$w_buff0~0_62, ~a$w_buff1_used~0=v_~a$w_buff1_used~0_134, ~weak$$choice2~0=v_~weak$$choice2~0_30, P3Thread1of1ForFork1_#t~nondet3=|v_P3Thread1of1ForFork1_#t~nondet3_1|, P3Thread1of1ForFork1_#t~nondet4=|v_P3Thread1of1ForFork1_#t~nondet4_1|} AuxVars[] AssignedVars[~a$r_buff1_thd4~0, ~a$w_buff0_used~0, ~__unbuffered_p3_EBX~0, ~a$r_buff0_thd4~0, ~a~0, ~a$mem_tmp~0, ~weak$$choice0~0, ~a$w_buff1~0, ~a$flush_delayed~0, ~a$w_buff0~0, ~a$w_buff1_used~0, ~weak$$choice2~0, P3Thread1of1ForFork1_#t~nondet3, P3Thread1of1ForFork1_#t~nondet4][81], [314#(and (= ~a$r_buff1_thd4~0 0) (not (= ~__unbuffered_p3_EBX~0 0)) (<= ~a$w_buff1_used~0 0) (<= ~a$r_buff0_thd2~0 (* (div ~a$r_buff0_thd2~0 256) 256)) (= ~a$r_buff1_thd3~0 0) (< 0 (+ ~a$w_buff1_used~0 1)) (not (= ~a~0 0)) (= ~a$r_buff0_thd3~0 0) (< 0 (+ (div ~a$r_buff0_thd2~0 256) 1)) (= ~a$r_buff0_thd4~0 0)), 157#true, 79#P0EXITtrue, 190#true, Black: 193#(or (not (= 2 ~y~0)) (not (= ~__unbuffered_p3_EAX~0 1)) (not (= ~__unbuffered_p2_EBX~0 0)) (not (= 2 ~x~0)) (not (= ~__unbuffered_p3_EBX~0 0)) (not (= 2 ~__unbuffered_p2_EAX~0))), Black: 257#(= ~z~0 1), Black: 192#(<= ~y~0 0), 174#true, 94#L845true, P1Thread1of1ForFork0InUse, P3Thread1of1ForFork1InUse, 250#(and (<= |ULTIMATE.start_assume_abort_if_not_#in~cond#1| 0) (<= ~__unbuffered_cnt~0 1) (<= 0 |ULTIMATE.start_assume_abort_if_not_#in~cond#1|)), P2Thread1of1ForFork3InUse, Black: 274#(and (<= |ULTIMATE.start_assume_abort_if_not_#in~cond#1| 0) (<= 0 |ULTIMATE.start_assume_abort_if_not_#in~cond#1|)), Black: 280#(and (<= ~__unbuffered_cnt~0 2) (<= |ULTIMATE.start_assume_abort_if_not_#in~cond#1| 0) (<= 0 |ULTIMATE.start_assume_abort_if_not_#in~cond#1|)), P0Thread1of1ForFork2InUse, Black: 273#(<= ~__unbuffered_cnt~0 2), Black: 209#(or (not (= 2 ~y~0)) (not (= ~__unbuffered_p3_EAX~0 1)) (not (= ~__unbuffered_p2_EBX~0 0)) (not (= 2 ~x~0)) (not (= ~__unbuffered_p3_EBX~0 0)) (not (= 2 ~__unbuffered_p2_EAX~0))), 261#(and (= ~z~0 1) (= ~__unbuffered_p2_EBX~0 1)), 37#L880true, Black: 225#(and (<= |ULTIMATE.start_assume_abort_if_not_#in~cond#1| 0) (<= 0 |ULTIMATE.start_assume_abort_if_not_#in~cond#1|)), Black: 227#(and (<= ~__unbuffered_cnt~0 0) (<= |ULTIMATE.start_assume_abort_if_not_#in~cond#1| 0) (<= 0 |ULTIMATE.start_assume_abort_if_not_#in~cond#1|)), Black: 224#(<= ~__unbuffered_cnt~0 0), Black: 299#(and (<= |ULTIMATE.start_assume_abort_if_not_#in~cond#1| 0) (<= 0 |ULTIMATE.start_assume_abort_if_not_#in~cond#1|) (<= ~__unbuffered_cnt~0 3)), Black: 291#(and (<= |ULTIMATE.start_assume_abort_if_not_#in~cond#1| 0) (<= 0 |ULTIMATE.start_assume_abort_if_not_#in~cond#1|)), 295#(and (<= |ULTIMATE.start_assume_abort_if_not_#in~cond#1| 0) (<= ~__unbuffered_cnt~0 1) (<= 0 |ULTIMATE.start_assume_abort_if_not_#in~cond#1|)), 125#L809true, Black: 290#(<= ~__unbuffered_cnt~0 3), Black: 234#(= ~x~0 1), Black: 177#(or (not (= 2 ~y~0)) (not (= ~__unbuffered_p3_EAX~0 1)) (not (= ~__unbuffered_p2_EBX~0 0)) (not (= 2 ~x~0)) (not (= ~__unbuffered_p3_EBX~0 0)) (not (= 2 ~__unbuffered_p2_EAX~0))), Black: 182#(and (or (not (= 2 ~y~0)) (not (= ~__unbuffered_p3_EAX~0 1)) (not (= ~__unbuffered_p2_EBX~0 0)) (not (= 2 ~x~0)) (not (= ~__unbuffered_p3_EBX~0 0)) (not (= 2 ~__unbuffered_p2_EAX~0))) (not (= |ULTIMATE.start___VERIFIER_assert_#in~expression#1| 0))), 206#true, 129#L786true, Black: 245#(<= ~__unbuffered_cnt~0 1), Black: 246#(and (<= |ULTIMATE.start_assume_abort_if_not_#in~cond#1| 0) (<= 0 |ULTIMATE.start_assume_abort_if_not_#in~cond#1|))]) [2023-08-26 11:59:32,039 INFO L294 olderBase$Statistics]: this new event has 21 ancestors and is cut-off event [2023-08-26 11:59:32,039 INFO L297 olderBase$Statistics]: existing Event has 21 ancestors and is cut-off event [2023-08-26 11:59:32,039 INFO L297 olderBase$Statistics]: existing Event has 21 ancestors and is cut-off event [2023-08-26 11:59:32,039 INFO L297 olderBase$Statistics]: existing Event has 21 ancestors and is cut-off event [2023-08-26 11:59:32,039 INFO L292 olderBase$Statistics]: inserting event number 4 for the transition-marking pair ([442] L809-->L816: Formula: (let ((.cse2 (not (= 0 (mod v_~a$r_buff1_thd3~0_16 256)))) (.cse3 (not (= (mod v_~a$w_buff0_used~0_115 256) 0))) (.cse5 (not (= (mod v_~a$r_buff0_thd3~0_20 256) 0)))) (let ((.cse1 (and (not (= (mod v_~a$w_buff0_used~0_116 256) 0)) .cse5)) (.cse0 (and .cse3 .cse5)) (.cse4 (and .cse2 (not (= (mod v_~a$w_buff1_used~0_107 256) 0))))) (and (= v_~a$r_buff0_thd3~0_19 (ite .cse0 0 v_~a$r_buff0_thd3~0_20)) (= v_~a$w_buff0_used~0_115 (ite .cse1 0 v_~a$w_buff0_used~0_116)) (= (ite (or (and .cse2 (not (= (mod v_~a$w_buff1_used~0_106 256) 0))) (and (not (= (mod v_~a$r_buff0_thd3~0_19 256) 0)) .cse3)) 0 v_~a$r_buff1_thd3~0_16) v_~a$r_buff1_thd3~0_15) (= v_~a~0_54 (ite .cse1 v_~a$w_buff0~0_36 (ite .cse4 v_~a$w_buff1~0_33 v_~a~0_55))) (= (ite (or .cse0 .cse4) 0 v_~a$w_buff1_used~0_107) v_~a$w_buff1_used~0_106)))) InVars {~a~0=v_~a~0_55, ~a$w_buff1~0=v_~a$w_buff1~0_33, ~a$w_buff0~0=v_~a$w_buff0~0_36, ~a$r_buff1_thd3~0=v_~a$r_buff1_thd3~0_16, ~a$w_buff0_used~0=v_~a$w_buff0_used~0_116, ~a$r_buff0_thd3~0=v_~a$r_buff0_thd3~0_20, ~a$w_buff1_used~0=v_~a$w_buff1_used~0_107} OutVars{~a~0=v_~a~0_54, ~a$w_buff1~0=v_~a$w_buff1~0_33, ~a$w_buff0~0=v_~a$w_buff0~0_36, ~a$r_buff1_thd3~0=v_~a$r_buff1_thd3~0_15, ~a$w_buff0_used~0=v_~a$w_buff0_used~0_115, ~a$r_buff0_thd3~0=v_~a$r_buff0_thd3~0_19, ~a$w_buff1_used~0=v_~a$w_buff1_used~0_106} AuxVars[] AssignedVars[~a~0, ~a$r_buff1_thd3~0, ~a$w_buff0_used~0, ~a$r_buff0_thd3~0, ~a$w_buff1_used~0][71], [24#L816true, 308#(and (= ~a$r_buff1_thd4~0 0) (<= ~a$w_buff1_used~0 0) (<= ~a$r_buff0_thd2~0 (* (div ~a$r_buff0_thd2~0 256) 256)) (= ~a$r_buff1_thd3~0 0) (< 0 (+ ~a$w_buff1_used~0 1)) (not (= ~a~0 0)) (= ~a$r_buff0_thd3~0 0) (< 0 (+ (div ~a$r_buff0_thd2~0 256) 1)) (= ~a$r_buff0_thd4~0 0)), 157#true, 79#P0EXITtrue, 190#true, Black: 193#(or (not (= 2 ~y~0)) (not (= ~__unbuffered_p3_EAX~0 1)) (not (= ~__unbuffered_p2_EBX~0 0)) (not (= 2 ~x~0)) (not (= ~__unbuffered_p3_EBX~0 0)) (not (= 2 ~__unbuffered_p2_EAX~0))), 56#L829true, Black: 257#(= ~z~0 1), Black: 192#(<= ~y~0 0), 174#true, P1Thread1of1ForFork0InUse, P3Thread1of1ForFork1InUse, 250#(and (<= |ULTIMATE.start_assume_abort_if_not_#in~cond#1| 0) (<= ~__unbuffered_cnt~0 1) (<= 0 |ULTIMATE.start_assume_abort_if_not_#in~cond#1|)), P2Thread1of1ForFork3InUse, Black: 274#(and (<= |ULTIMATE.start_assume_abort_if_not_#in~cond#1| 0) (<= 0 |ULTIMATE.start_assume_abort_if_not_#in~cond#1|)), Black: 280#(and (<= ~__unbuffered_cnt~0 2) (<= |ULTIMATE.start_assume_abort_if_not_#in~cond#1| 0) (<= 0 |ULTIMATE.start_assume_abort_if_not_#in~cond#1|)), P0Thread1of1ForFork2InUse, Black: 273#(<= ~__unbuffered_cnt~0 2), Black: 209#(or (not (= 2 ~y~0)) (not (= ~__unbuffered_p3_EAX~0 1)) (not (= ~__unbuffered_p2_EBX~0 0)) (not (= 2 ~x~0)) (not (= ~__unbuffered_p3_EBX~0 0)) (not (= 2 ~__unbuffered_p2_EAX~0))), 261#(and (= ~z~0 1) (= ~__unbuffered_p2_EBX~0 1)), 37#L880true, Black: 225#(and (<= |ULTIMATE.start_assume_abort_if_not_#in~cond#1| 0) (<= 0 |ULTIMATE.start_assume_abort_if_not_#in~cond#1|)), Black: 227#(and (<= ~__unbuffered_cnt~0 0) (<= |ULTIMATE.start_assume_abort_if_not_#in~cond#1| 0) (<= 0 |ULTIMATE.start_assume_abort_if_not_#in~cond#1|)), Black: 224#(<= ~__unbuffered_cnt~0 0), Black: 299#(and (<= |ULTIMATE.start_assume_abort_if_not_#in~cond#1| 0) (<= 0 |ULTIMATE.start_assume_abort_if_not_#in~cond#1|) (<= ~__unbuffered_cnt~0 3)), Black: 291#(and (<= |ULTIMATE.start_assume_abort_if_not_#in~cond#1| 0) (<= 0 |ULTIMATE.start_assume_abort_if_not_#in~cond#1|)), 295#(and (<= |ULTIMATE.start_assume_abort_if_not_#in~cond#1| 0) (<= ~__unbuffered_cnt~0 1) (<= 0 |ULTIMATE.start_assume_abort_if_not_#in~cond#1|)), Black: 290#(<= ~__unbuffered_cnt~0 3), Black: 234#(= ~x~0 1), Black: 177#(or (not (= 2 ~y~0)) (not (= ~__unbuffered_p3_EAX~0 1)) (not (= ~__unbuffered_p2_EBX~0 0)) (not (= 2 ~x~0)) (not (= ~__unbuffered_p3_EBX~0 0)) (not (= 2 ~__unbuffered_p2_EAX~0))), Black: 182#(and (or (not (= 2 ~y~0)) (not (= ~__unbuffered_p3_EAX~0 1)) (not (= ~__unbuffered_p2_EBX~0 0)) (not (= 2 ~x~0)) (not (= ~__unbuffered_p3_EBX~0 0)) (not (= 2 ~__unbuffered_p2_EAX~0))) (not (= |ULTIMATE.start___VERIFIER_assert_#in~expression#1| 0))), 206#true, 129#L786true, Black: 245#(<= ~__unbuffered_cnt~0 1), Black: 246#(and (<= |ULTIMATE.start_assume_abort_if_not_#in~cond#1| 0) (<= 0 |ULTIMATE.start_assume_abort_if_not_#in~cond#1|))]) [2023-08-26 11:59:32,039 INFO L294 olderBase$Statistics]: this new event has 21 ancestors and is cut-off event [2023-08-26 11:59:32,039 INFO L297 olderBase$Statistics]: existing Event has 21 ancestors and is cut-off event [2023-08-26 11:59:32,039 INFO L297 olderBase$Statistics]: existing Event has 21 ancestors and is cut-off event [2023-08-26 11:59:32,039 INFO L297 olderBase$Statistics]: existing Event has 21 ancestors and is cut-off event [2023-08-26 11:59:32,616 INFO L124 PetriNetUnfolderBase]: 10505/16886 cut-off events. [2023-08-26 11:59:32,616 INFO L125 PetriNetUnfolderBase]: For 59233/59932 co-relation queries the response was YES. [2023-08-26 11:59:32,784 INFO L83 FinitePrefix]: Finished finitePrefix Result has 69145 conditions, 16886 events. 10505/16886 cut-off events. For 59233/59932 co-relation queries the response was YES. Maximal size of possible extension queue 1006. Compared 129001 event pairs, 1607 based on Foata normal form. 117/16577 useless extension candidates. Maximal degree in co-relation 69117. Up to 6421 conditions per place. [2023-08-26 11:59:32,808 INFO L140 encePairwiseOnDemand]: 276/283 looper letters, 94 selfloop transitions, 4 changer transitions 69/183 dead transitions. [2023-08-26 11:59:32,808 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 100 places, 183 transitions, 1863 flow [2023-08-26 11:59:32,808 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2023-08-26 11:59:32,808 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 8 states. [2023-08-26 11:59:32,810 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 8 states to 8 states and 968 transitions. [2023-08-26 11:59:32,811 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.4275618374558304 [2023-08-26 11:59:32,811 INFO L72 ComplementDD]: Start complementDD. Operand 8 states and 968 transitions. [2023-08-26 11:59:32,811 INFO L73 IsDeterministic]: Start isDeterministic. Operand 8 states and 968 transitions. [2023-08-26 11:59:32,811 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2023-08-26 11:59:32,812 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 8 states and 968 transitions. [2023-08-26 11:59:32,814 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 9 states, 8 states have (on average 121.0) internal successors, (968), 8 states have internal predecessors, (968), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-26 11:59:32,817 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 9 states, 9 states have (on average 283.0) internal successors, (2547), 9 states have internal predecessors, (2547), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-26 11:59:32,817 INFO L81 ComplementDD]: Finished complementDD. Result has 9 states, 9 states have (on average 283.0) internal successors, (2547), 9 states have internal predecessors, (2547), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-26 11:59:32,817 INFO L175 Difference]: Start difference. First operand has 94 places, 73 transitions, 653 flow. Second operand 8 states and 968 transitions. [2023-08-26 11:59:32,817 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 100 places, 183 transitions, 1863 flow [2023-08-26 11:59:33,929 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 86 places, 183 transitions, 1501 flow, removed 68 selfloop flow, removed 14 redundant places. [2023-08-26 11:59:33,930 INFO L231 Difference]: Finished difference. Result has 89 places, 71 transitions, 510 flow [2023-08-26 11:59:33,931 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=283, PETRI_DIFFERENCE_MINUEND_FLOW=508, PETRI_DIFFERENCE_MINUEND_PLACES=79, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=73, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=4, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=69, PETRI_DIFFERENCE_SUBTRAHEND_STATES=8, PETRI_FLOW=510, PETRI_PLACES=89, PETRI_TRANSITIONS=71} [2023-08-26 11:59:33,931 INFO L281 CegarLoopForPetriNet]: 53 programPoint places, 36 predicate places. [2023-08-26 11:59:33,931 INFO L495 AbstractCegarLoop]: Abstraction has has 89 places, 71 transitions, 510 flow [2023-08-26 11:59:33,932 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 9 states, 9 states have (on average 114.77777777777777) internal successors, (1033), 9 states have internal predecessors, (1033), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-26 11:59:33,932 INFO L200 CegarLoopForPetriNet]: Found error trace [2023-08-26 11:59:33,932 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-08-26 11:59:33,932 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable12 [2023-08-26 11:59:33,932 INFO L420 AbstractCegarLoop]: === Iteration 14 === Targeting ULTIMATE.startErr8ASSERT_VIOLATIONASSERT === [P0Err0ASSERT_VIOLATIONASSERT, ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 12 more)] === [2023-08-26 11:59:33,933 INFO L145 PredicateUnifier]: Initialized classic predicate unifier [2023-08-26 11:59:33,933 INFO L85 PathProgramCache]: Analyzing trace with hash -2078204516, now seen corresponding path program 2 times [2023-08-26 11:59:33,933 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-08-26 11:59:33,933 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1013243954] [2023-08-26 11:59:33,933 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-08-26 11:59:33,933 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-08-26 11:59:34,030 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2023-08-26 11:59:34,030 INFO L356 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2023-08-26 11:59:34,102 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2023-08-26 11:59:34,137 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2023-08-26 11:59:34,137 INFO L360 BasicCegarLoop]: Counterexample is feasible [2023-08-26 11:59:34,138 INFO L805 garLoopResultBuilder]: Registering result UNSAFE for location ULTIMATE.startErr8ASSERT_VIOLATIONASSERT (14 of 15 remaining) [2023-08-26 11:59:34,139 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location P0Err0ASSERT_VIOLATIONASSERT (13 of 15 remaining) [2023-08-26 11:59:34,139 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE (12 of 15 remaining) [2023-08-26 11:59:34,140 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE (11 of 15 remaining) [2023-08-26 11:59:34,140 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (10 of 15 remaining) [2023-08-26 11:59:34,140 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr3REQUIRES_VIOLATIONMEMORY_DEREFERENCE (9 of 15 remaining) [2023-08-26 11:59:34,140 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr4REQUIRES_VIOLATIONMEMORY_DEREFERENCE (8 of 15 remaining) [2023-08-26 11:59:34,140 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr5REQUIRES_VIOLATIONMEMORY_DEREFERENCE (7 of 15 remaining) [2023-08-26 11:59:34,140 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr6REQUIRES_VIOLATIONMEMORY_DEREFERENCE (6 of 15 remaining) [2023-08-26 11:59:34,140 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr7REQUIRES_VIOLATIONMEMORY_DEREFERENCE (5 of 15 remaining) [2023-08-26 11:59:34,140 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (4 of 15 remaining) [2023-08-26 11:59:34,141 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (3 of 15 remaining) [2023-08-26 11:59:34,141 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr2INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (2 of 15 remaining) [2023-08-26 11:59:34,141 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr3INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (1 of 15 remaining) [2023-08-26 11:59:34,141 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location P0Err0ASSERT_VIOLATIONASSERT (0 of 15 remaining) [2023-08-26 11:59:34,141 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable13 [2023-08-26 11:59:34,142 INFO L445 BasicCegarLoop]: Path program histogram: [2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-08-26 11:59:34,152 INFO L228 ceAbstractionStarter]: Analysis of concurrent program completed with 1 thread instances [2023-08-26 11:59:34,152 INFO L178 ceAbstractionStarter]: Computing trace abstraction results [2023-08-26 11:59:34,262 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 26.08 11:59:34 BasicIcfg [2023-08-26 11:59:34,262 INFO L131 PluginConnector]: ------------------------ END TraceAbstraction---------------------------- [2023-08-26 11:59:34,262 INFO L158 Benchmark]: Toolchain (without parser) took 50174.54ms. Allocated memory was 379.6MB in the beginning and 10.6GB in the end (delta: 10.3GB). Free memory was 333.6MB in the beginning and 7.4GB in the end (delta: -7.1GB). Peak memory consumption was 3.1GB. Max. memory is 16.0GB. [2023-08-26 11:59:34,262 INFO L158 Benchmark]: CDTParser took 0.15ms. Allocated memory is still 379.6MB. Free memory was 357.5MB in the beginning and 357.4MB in the end (delta: 157.3kB). There was no memory consumed. Max. memory is 16.0GB. [2023-08-26 11:59:34,263 INFO L158 Benchmark]: CACSL2BoogieTranslator took 570.37ms. Allocated memory is still 379.6MB. Free memory was 333.6MB in the beginning and 309.5MB in the end (delta: 24.1MB). Peak memory consumption was 23.1MB. Max. memory is 16.0GB. [2023-08-26 11:59:34,263 INFO L158 Benchmark]: Boogie Procedure Inliner took 82.09ms. Allocated memory is still 379.6MB. Free memory was 309.5MB in the beginning and 307.4MB in the end (delta: 2.1MB). Peak memory consumption was 2.1MB. Max. memory is 16.0GB. [2023-08-26 11:59:34,263 INFO L158 Benchmark]: Boogie Preprocessor took 53.94ms. Allocated memory is still 379.6MB. Free memory was 307.4MB in the beginning and 305.3MB in the end (delta: 2.1MB). Peak memory consumption was 2.1MB. Max. memory is 16.0GB. [2023-08-26 11:59:34,263 INFO L158 Benchmark]: RCFGBuilder took 746.49ms. Allocated memory is still 379.6MB. Free memory was 305.3MB in the beginning and 262.3MB in the end (delta: 43.0MB). Peak memory consumption was 44.0MB. Max. memory is 16.0GB. [2023-08-26 11:59:34,264 INFO L158 Benchmark]: TraceAbstraction took 48716.42ms. Allocated memory was 379.6MB in the beginning and 10.6GB in the end (delta: 10.3GB). Free memory was 261.2MB in the beginning and 7.4GB in the end (delta: -7.2GB). Peak memory consumption was 3.1GB. Max. memory is 16.0GB. [2023-08-26 11:59:34,269 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.15ms. Allocated memory is still 379.6MB. Free memory was 357.5MB in the beginning and 357.4MB in the end (delta: 157.3kB). There was no memory consumed. Max. memory is 16.0GB. * CACSL2BoogieTranslator took 570.37ms. Allocated memory is still 379.6MB. Free memory was 333.6MB in the beginning and 309.5MB in the end (delta: 24.1MB). Peak memory consumption was 23.1MB. Max. memory is 16.0GB. * Boogie Procedure Inliner took 82.09ms. Allocated memory is still 379.6MB. Free memory was 309.5MB in the beginning and 307.4MB in the end (delta: 2.1MB). Peak memory consumption was 2.1MB. Max. memory is 16.0GB. * Boogie Preprocessor took 53.94ms. Allocated memory is still 379.6MB. Free memory was 307.4MB in the beginning and 305.3MB in the end (delta: 2.1MB). Peak memory consumption was 2.1MB. Max. memory is 16.0GB. * RCFGBuilder took 746.49ms. Allocated memory is still 379.6MB. Free memory was 305.3MB in the beginning and 262.3MB in the end (delta: 43.0MB). Peak memory consumption was 44.0MB. Max. memory is 16.0GB. * TraceAbstraction took 48716.42ms. Allocated memory was 379.6MB in the beginning and 10.6GB in the end (delta: 10.3GB). Free memory was 261.2MB in the beginning and 7.4GB in the end (delta: -7.2GB). Peak memory consumption was 3.1GB. Max. memory is 16.0GB. * Results from de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator: - GenericResultAtLocation [Line: 267]: Unsoundness Warning unspecified type, defaulting to int C: short [267] - GenericResultAtLocation [Line: 267]: Unsoundness Warning unspecified type, defaulting to int C: short [267] * Results from de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: - StatisticsResult: PetriNetLargeBlockEncoding benchmarks Lipton Reduction Statistics: ReductionTime: 4.3s, 150 PlacesBefore, 53 PlacesAfterwards, 140 TransitionsBefore, 41 TransitionsAfterwards, 3718 CoEnabledTransitionPairs, 7 FixpointIterations, 51 TrivialSequentialCompositions, 72 ConcurrentSequentialCompositions, 0 TrivialYvCompositions, 14 ConcurrentYvCompositions, 2 ChoiceCompositions, 139 TotalNumberOfCompositions, 11329 MoverChecksTotal, Independence Relation Statistics: CachedIndependenceRelation.Independence Queries: [ total: 4158, independent: 3904, independent conditional: 0, independent unconditional: 3904, dependent: 254, dependent conditional: 0, dependent unconditional: 254, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , CachedIndependenceRelation.Statistics on underlying relation: SyntacticIndependenceRelation.Independence Queries: [ total: 2031, independent: 1987, independent conditional: 0, independent unconditional: 1987, dependent: 44, dependent conditional: 0, dependent unconditional: 44, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , Cache Queries: [ total: 4158, independent: 1917, independent conditional: 0, independent unconditional: 1917, dependent: 210, dependent conditional: 0, dependent unconditional: 210, unknown: 2031, unknown conditional: 0, unknown unconditional: 2031] , Statistics on independence cache: Total cache size (in pairs): 153, Positive cache size: 133, Positive conditional cache size: 0, Positive unconditional cache size: 133, Negative cache size: 20, Negative conditional cache size: 0, Negative unconditional cache size: 20, Unknown cache size: 0, Unknown conditional cache size: 0, Unknown unconditional cache size: 0 - CounterExampleResult [Line: 17]: assertion can be violated assertion can be violated We found a FailurePath: [L710] 0 int __unbuffered_cnt = 0; [L712] 0 int __unbuffered_p2_EAX = 0; [L714] 0 int __unbuffered_p2_EBX = 0; [L716] 0 int __unbuffered_p3_EAX = 0; [L718] 0 int __unbuffered_p3_EBX = 0; [L720] 0 int a = 0; [L721] 0 _Bool a$flush_delayed; [L722] 0 int a$mem_tmp; [L723] 0 _Bool a$r_buff0_thd0; [L724] 0 _Bool a$r_buff0_thd1; [L725] 0 _Bool a$r_buff0_thd2; [L726] 0 _Bool a$r_buff0_thd3; [L727] 0 _Bool a$r_buff0_thd4; [L728] 0 _Bool a$r_buff1_thd0; [L729] 0 _Bool a$r_buff1_thd1; [L730] 0 _Bool a$r_buff1_thd2; [L731] 0 _Bool a$r_buff1_thd3; [L732] 0 _Bool a$r_buff1_thd4; [L733] 0 _Bool a$read_delayed; [L734] 0 int *a$read_delayed_var; [L735] 0 int a$w_buff0; [L736] 0 _Bool a$w_buff0_used; [L737] 0 int a$w_buff1; [L738] 0 _Bool a$w_buff1_used; [L739] 0 _Bool main$tmp_guard0; [L740] 0 _Bool main$tmp_guard1; [L742] 0 int x = 0; [L744] 0 int y = 0; [L746] 0 int z = 0; [L747] 0 _Bool weak$$choice0; [L748] 0 _Bool weak$$choice2; [L869] 0 pthread_t t209; [L870] FCALL, FORK 0 pthread_create(&t209, ((void *)0), P0, ((void *)0)) VAL [__unbuffered_cnt=0, __unbuffered_p2_EAX=0, __unbuffered_p2_EBX=0, __unbuffered_p3_EAX=0, __unbuffered_p3_EBX=0, a$flush_delayed=0, a$mem_tmp=0, a$r_buff0_thd0=0, a$r_buff0_thd1=0, a$r_buff0_thd2=0, a$r_buff0_thd3=0, a$r_buff0_thd4=0, a$r_buff1_thd0=0, a$r_buff1_thd1=0, a$r_buff1_thd2=0, a$r_buff1_thd3=0, a$r_buff1_thd4=0, a$read_delayed=0, a$read_delayed_var={0:0}, a$w_buff0=0, a$w_buff0_used=0, a$w_buff1=0, a$w_buff1_used=0, a=0, main$tmp_guard0=0, main$tmp_guard1=0, pthread_create(&t209, ((void *)0), P0, ((void *)0))=-3, t209={5:0}, weak$$choice0=0, weak$$choice2=0, x=0, y=0, z=0] [L871] 0 pthread_t t210; [L872] FCALL, FORK 0 pthread_create(&t210, ((void *)0), P1, ((void *)0)) VAL [__unbuffered_cnt=0, __unbuffered_p2_EAX=0, __unbuffered_p2_EBX=0, __unbuffered_p3_EAX=0, __unbuffered_p3_EBX=0, a$flush_delayed=0, a$mem_tmp=0, a$r_buff0_thd0=0, a$r_buff0_thd1=0, a$r_buff0_thd2=0, a$r_buff0_thd3=0, a$r_buff0_thd4=0, a$r_buff1_thd0=0, a$r_buff1_thd1=0, a$r_buff1_thd2=0, a$r_buff1_thd3=0, a$r_buff1_thd4=0, a$read_delayed=0, a$read_delayed_var={0:0}, a$w_buff0=0, a$w_buff0_used=0, a$w_buff1=0, a$w_buff1_used=0, a=0, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, pthread_create(&t210, ((void *)0), P1, ((void *)0))=-2, t209={5:0}, t210={6:0}, weak$$choice0=0, weak$$choice2=0, x=0, y=0, z=0] [L873] 0 pthread_t t211; [L874] FCALL, FORK 0 pthread_create(&t211, ((void *)0), P2, ((void *)0)) VAL [__unbuffered_cnt=0, __unbuffered_p2_EAX=0, __unbuffered_p2_EBX=0, __unbuffered_p3_EAX=0, __unbuffered_p3_EBX=0, a$flush_delayed=0, a$mem_tmp=0, a$r_buff0_thd0=0, a$r_buff0_thd1=0, a$r_buff0_thd2=0, a$r_buff0_thd3=0, a$r_buff0_thd4=0, a$r_buff1_thd0=0, a$r_buff1_thd1=0, a$r_buff1_thd2=0, a$r_buff1_thd3=0, a$r_buff1_thd4=0, a$read_delayed=0, a$read_delayed_var={0:0}, a$w_buff0=0, a$w_buff0_used=0, a$w_buff1=0, a$w_buff1_used=0, a=0, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, pthread_create(&t211, ((void *)0), P2, ((void *)0))=-1, t209={5:0}, t210={6:0}, t211={7:0}, weak$$choice0=0, weak$$choice2=0, x=0, y=0, z=0] [L875] 0 pthread_t t212; [L876] FCALL, FORK 0 pthread_create(&t212, ((void *)0), P3, ((void *)0)) VAL [__unbuffered_cnt=0, __unbuffered_p2_EAX=0, __unbuffered_p2_EBX=0, __unbuffered_p3_EAX=0, __unbuffered_p3_EBX=0, a$flush_delayed=0, a$mem_tmp=0, a$r_buff0_thd0=0, a$r_buff0_thd1=0, a$r_buff0_thd2=0, a$r_buff0_thd3=0, a$r_buff0_thd4=0, a$r_buff1_thd0=0, a$r_buff1_thd1=0, a$r_buff1_thd2=0, a$r_buff1_thd3=0, a$r_buff1_thd4=0, a$read_delayed=0, a$read_delayed_var={0:0}, a$w_buff0=0, a$w_buff0_used=0, a$w_buff1=0, a$w_buff1_used=0, a=0, arg={0:0}, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, pthread_create(&t212, ((void *)0), P3, ((void *)0))=0, t209={5:0}, t210={6:0}, t211={7:0}, t212={3:0}, weak$$choice0=0, weak$$choice2=0, x=0, y=0, z=0] [L752] 1 a$w_buff1 = a$w_buff0 [L753] 1 a$w_buff0 = 1 [L754] 1 a$w_buff1_used = a$w_buff0_used [L755] 1 a$w_buff0_used = (_Bool)1 [L756] CALL 1 __VERIFIER_assert(!(a$w_buff1_used && a$w_buff0_used)) [L18] COND FALSE 1 !(!expression) [L756] RET 1 __VERIFIER_assert(!(a$w_buff1_used && a$w_buff0_used)) [L757] 1 a$r_buff1_thd0 = a$r_buff0_thd0 [L758] 1 a$r_buff1_thd1 = a$r_buff0_thd1 [L759] 1 a$r_buff1_thd2 = a$r_buff0_thd2 [L760] 1 a$r_buff1_thd3 = a$r_buff0_thd3 [L761] 1 a$r_buff1_thd4 = a$r_buff0_thd4 [L762] 1 a$r_buff0_thd1 = (_Bool)1 VAL [__unbuffered_cnt=0, __unbuffered_p2_EAX=0, __unbuffered_p2_EBX=0, __unbuffered_p3_EAX=0, __unbuffered_p3_EBX=0, a$flush_delayed=0, a$mem_tmp=0, a$r_buff0_thd0=0, a$r_buff0_thd1=1, a$r_buff0_thd2=0, a$r_buff0_thd3=0, a$r_buff0_thd4=0, a$r_buff1_thd0=0, a$r_buff1_thd1=0, a$r_buff1_thd2=0, a$r_buff1_thd3=0, a$r_buff1_thd4=0, a$read_delayed=0, a$read_delayed_var={0:0}, a$w_buff0=1, a$w_buff0_used=1, a$w_buff1=0, a$w_buff1_used=0, a=0, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=0, x=0, y=0, z=0] [L765] 1 x = 1 VAL [__unbuffered_cnt=0, __unbuffered_p2_EAX=0, __unbuffered_p2_EBX=0, __unbuffered_p3_EAX=0, __unbuffered_p3_EBX=0, a$flush_delayed=0, a$mem_tmp=0, a$r_buff0_thd0=0, a$r_buff0_thd1=1, a$r_buff0_thd2=0, a$r_buff0_thd3=0, a$r_buff0_thd4=0, a$r_buff1_thd0=0, a$r_buff1_thd1=0, a$r_buff1_thd2=0, a$r_buff1_thd3=0, a$r_buff1_thd4=0, a$read_delayed=0, a$read_delayed_var={0:0}, a$w_buff0=1, a$w_buff0_used=1, a$w_buff1=0, a$w_buff1_used=0, a=0, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=0, x=1, y=0, z=0] [L782] 2 x = 2 VAL [__unbuffered_cnt=0, __unbuffered_p2_EAX=0, __unbuffered_p2_EBX=0, __unbuffered_p3_EAX=0, __unbuffered_p3_EBX=0, a$flush_delayed=0, a$mem_tmp=0, a$r_buff0_thd0=0, a$r_buff0_thd1=1, a$r_buff0_thd2=0, a$r_buff0_thd3=0, a$r_buff0_thd4=0, a$r_buff1_thd0=0, a$r_buff1_thd1=0, a$r_buff1_thd2=0, a$r_buff1_thd3=0, a$r_buff1_thd4=0, a$read_delayed=0, a$read_delayed_var={0:0}, a$w_buff0=1, a$w_buff0_used=1, a$w_buff1=0, a$w_buff1_used=0, a=0, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=0, x=2, y=0, z=0] [L785] 2 y = 1 VAL [__unbuffered_cnt=0, __unbuffered_p2_EAX=0, __unbuffered_p2_EBX=0, __unbuffered_p3_EAX=0, __unbuffered_p3_EBX=0, a$flush_delayed=0, a$mem_tmp=0, a$r_buff0_thd0=0, a$r_buff0_thd1=1, a$r_buff0_thd2=0, a$r_buff0_thd3=0, a$r_buff0_thd4=0, a$r_buff1_thd0=0, a$r_buff1_thd1=0, a$r_buff1_thd2=0, a$r_buff1_thd3=0, a$r_buff1_thd4=0, a$read_delayed=0, a$read_delayed_var={0:0}, a$w_buff0=1, a$w_buff0_used=1, a$w_buff1=0, a$w_buff1_used=0, a=0, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=0, x=2, y=1, z=0] [L788] 2 a = a$w_buff0_used && a$r_buff0_thd2 ? a$w_buff0 : (a$w_buff1_used && a$r_buff1_thd2 ? a$w_buff1 : a) [L789] 2 a$w_buff0_used = a$w_buff0_used && a$r_buff0_thd2 ? (_Bool)0 : a$w_buff0_used [L790] 2 a$w_buff1_used = a$w_buff0_used && a$r_buff0_thd2 || a$w_buff1_used && a$r_buff1_thd2 ? (_Bool)0 : a$w_buff1_used [L791] 2 a$r_buff0_thd2 = a$w_buff0_used && a$r_buff0_thd2 ? (_Bool)0 : a$r_buff0_thd2 [L792] 2 a$r_buff1_thd2 = a$w_buff0_used && a$r_buff0_thd2 || a$w_buff1_used && a$r_buff1_thd2 ? (_Bool)0 : a$r_buff1_thd2 VAL [__unbuffered_cnt=0, __unbuffered_p2_EAX=0, __unbuffered_p2_EBX=0, __unbuffered_p3_EAX=0, __unbuffered_p3_EBX=0, a$flush_delayed=0, a$mem_tmp=0, a$r_buff0_thd0=0, a$r_buff0_thd1=1, a$r_buff0_thd2=0, a$r_buff0_thd3=0, a$r_buff0_thd4=0, a$r_buff1_thd0=0, a$r_buff1_thd1=0, a$r_buff1_thd2=0, a$r_buff1_thd3=0, a$r_buff1_thd4=0, a$read_delayed=0, a$read_delayed_var={0:0}, a$w_buff0=1, a$w_buff0_used=1, a$w_buff1=0, a$w_buff1_used=0, a=0, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=0, x=2, y=1, z=0] [L802] 3 y = 2 VAL [__unbuffered_cnt=0, __unbuffered_p2_EAX=0, __unbuffered_p2_EBX=0, __unbuffered_p3_EAX=0, __unbuffered_p3_EBX=0, a$flush_delayed=0, a$mem_tmp=0, a$r_buff0_thd0=0, a$r_buff0_thd1=1, a$r_buff0_thd2=0, a$r_buff0_thd3=0, a$r_buff0_thd4=0, a$r_buff1_thd0=0, a$r_buff1_thd1=0, a$r_buff1_thd2=0, a$r_buff1_thd3=0, a$r_buff1_thd4=0, a$read_delayed=0, a$read_delayed_var={0:0}, a$w_buff0=1, a$w_buff0_used=1, a$w_buff1=0, a$w_buff1_used=0, a=0, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=0, x=2, y=2, z=0] [L805] 3 __unbuffered_p2_EAX = y VAL [__unbuffered_cnt=0, __unbuffered_p2_EAX=2, __unbuffered_p2_EBX=0, __unbuffered_p3_EAX=0, __unbuffered_p3_EBX=0, a$flush_delayed=0, a$mem_tmp=0, a$r_buff0_thd0=0, a$r_buff0_thd1=1, a$r_buff0_thd2=0, a$r_buff0_thd3=0, a$r_buff0_thd4=0, a$r_buff1_thd0=0, a$r_buff1_thd1=0, a$r_buff1_thd2=0, a$r_buff1_thd3=0, a$r_buff1_thd4=0, a$read_delayed=0, a$read_delayed_var={0:0}, a$w_buff0=1, a$w_buff0_used=1, a$w_buff1=0, a$w_buff1_used=0, a=0, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=0, x=2, y=2, z=0] [L808] 3 __unbuffered_p2_EBX = z VAL [__unbuffered_cnt=0, __unbuffered_p2_EAX=2, __unbuffered_p2_EBX=0, __unbuffered_p3_EAX=0, __unbuffered_p3_EBX=0, a$flush_delayed=0, a$mem_tmp=0, a$r_buff0_thd0=0, a$r_buff0_thd1=1, a$r_buff0_thd2=0, a$r_buff0_thd3=0, a$r_buff0_thd4=0, a$r_buff1_thd0=0, a$r_buff1_thd1=0, a$r_buff1_thd2=0, a$r_buff1_thd3=0, a$r_buff1_thd4=0, a$read_delayed=0, a$read_delayed_var={0:0}, a$w_buff0=1, a$w_buff0_used=1, a$w_buff1=0, a$w_buff1_used=0, a=0, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=0, x=2, y=2, z=0] [L825] 4 z = 1 VAL [__unbuffered_cnt=0, __unbuffered_p2_EAX=2, __unbuffered_p2_EBX=0, __unbuffered_p3_EAX=0, __unbuffered_p3_EBX=0, a$flush_delayed=0, a$mem_tmp=0, a$r_buff0_thd0=0, a$r_buff0_thd1=1, a$r_buff0_thd2=0, a$r_buff0_thd3=0, a$r_buff0_thd4=0, a$r_buff1_thd0=0, a$r_buff1_thd1=0, a$r_buff1_thd2=0, a$r_buff1_thd3=0, a$r_buff1_thd4=0, a$read_delayed=0, a$read_delayed_var={0:0}, a$w_buff0=1, a$w_buff0_used=1, a$w_buff1=0, a$w_buff1_used=0, a=0, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=0, x=2, y=2, z=1] [L828] 4 __unbuffered_p3_EAX = z VAL [__unbuffered_cnt=0, __unbuffered_p2_EAX=2, __unbuffered_p2_EBX=0, __unbuffered_p3_EAX=1, __unbuffered_p3_EBX=0, a$flush_delayed=0, a$mem_tmp=0, a$r_buff0_thd0=0, a$r_buff0_thd1=1, a$r_buff0_thd2=0, a$r_buff0_thd3=0, a$r_buff0_thd4=0, a$r_buff1_thd0=0, a$r_buff1_thd1=0, a$r_buff1_thd2=0, a$r_buff1_thd3=0, a$r_buff1_thd4=0, a$read_delayed=0, a$read_delayed_var={0:0}, a$w_buff0=1, a$w_buff0_used=1, a$w_buff1=0, a$w_buff1_used=0, a=0, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=0, x=2, y=2, z=1] [L831] 4 weak$$choice0 = __VERIFIER_nondet_bool() [L832] 4 weak$$choice2 = __VERIFIER_nondet_bool() [L833] 4 a$flush_delayed = weak$$choice2 [L834] 4 a$mem_tmp = a [L835] 4 a = !a$w_buff0_used || !a$r_buff0_thd4 && !a$w_buff1_used || !a$r_buff0_thd4 && !a$r_buff1_thd4 ? a : (a$w_buff0_used && a$r_buff0_thd4 ? a$w_buff0 : a$w_buff1) [L836] 4 a$w_buff0 = weak$$choice2 ? a$w_buff0 : (!a$w_buff0_used || !a$r_buff0_thd4 && !a$w_buff1_used || !a$r_buff0_thd4 && !a$r_buff1_thd4 ? a$w_buff0 : (a$w_buff0_used && a$r_buff0_thd4 ? a$w_buff0 : a$w_buff0)) [L837] 4 a$w_buff1 = weak$$choice2 ? a$w_buff1 : (!a$w_buff0_used || !a$r_buff0_thd4 && !a$w_buff1_used || !a$r_buff0_thd4 && !a$r_buff1_thd4 ? a$w_buff1 : (a$w_buff0_used && a$r_buff0_thd4 ? a$w_buff1 : a$w_buff1)) [L838] 4 a$w_buff0_used = weak$$choice2 ? a$w_buff0_used : (!a$w_buff0_used || !a$r_buff0_thd4 && !a$w_buff1_used || !a$r_buff0_thd4 && !a$r_buff1_thd4 ? a$w_buff0_used : (a$w_buff0_used && a$r_buff0_thd4 ? (_Bool)0 : a$w_buff0_used)) [L839] 4 a$w_buff1_used = weak$$choice2 ? a$w_buff1_used : (!a$w_buff0_used || !a$r_buff0_thd4 && !a$w_buff1_used || !a$r_buff0_thd4 && !a$r_buff1_thd4 ? a$w_buff1_used : (a$w_buff0_used && a$r_buff0_thd4 ? (_Bool)0 : (_Bool)0)) [L840] 4 a$r_buff0_thd4 = weak$$choice2 ? a$r_buff0_thd4 : (!a$w_buff0_used || !a$r_buff0_thd4 && !a$w_buff1_used || !a$r_buff0_thd4 && !a$r_buff1_thd4 ? a$r_buff0_thd4 : (a$w_buff0_used && a$r_buff0_thd4 ? (_Bool)0 : a$r_buff0_thd4)) [L841] 4 a$r_buff1_thd4 = weak$$choice2 ? a$r_buff1_thd4 : (!a$w_buff0_used || !a$r_buff0_thd4 && !a$w_buff1_used || !a$r_buff0_thd4 && !a$r_buff1_thd4 ? a$r_buff1_thd4 : (a$w_buff0_used && a$r_buff0_thd4 ? (_Bool)0 : (_Bool)0)) [L842] 4 __unbuffered_p3_EBX = a [L843] 4 a = a$flush_delayed ? a$mem_tmp : a [L844] 4 a$flush_delayed = (_Bool)0 VAL [__unbuffered_cnt=0, __unbuffered_p2_EAX=2, __unbuffered_p2_EBX=0, __unbuffered_p3_EAX=1, __unbuffered_p3_EBX=0, a$flush_delayed=0, a$mem_tmp=0, a$r_buff0_thd0=0, a$r_buff0_thd1=1, a$r_buff0_thd2=0, a$r_buff0_thd3=0, a$r_buff0_thd4=0, a$r_buff1_thd0=0, a$r_buff1_thd1=0, a$r_buff1_thd2=0, a$r_buff1_thd3=0, a$r_buff1_thd4=0, a$read_delayed=0, a$read_delayed_var={0:0}, a$w_buff0=1, a$w_buff0_used=1, a$w_buff1=0, a$w_buff1_used=0, a=0, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice2=1, x=2, y=2, z=1] [L811] 3 a = a$w_buff0_used && a$r_buff0_thd3 ? a$w_buff0 : (a$w_buff1_used && a$r_buff1_thd3 ? a$w_buff1 : a) [L812] 3 a$w_buff0_used = a$w_buff0_used && a$r_buff0_thd3 ? (_Bool)0 : a$w_buff0_used [L813] 3 a$w_buff1_used = a$w_buff0_used && a$r_buff0_thd3 || a$w_buff1_used && a$r_buff1_thd3 ? (_Bool)0 : a$w_buff1_used [L814] 3 a$r_buff0_thd3 = a$w_buff0_used && a$r_buff0_thd3 ? (_Bool)0 : a$r_buff0_thd3 [L815] 3 a$r_buff1_thd3 = a$w_buff0_used && a$r_buff0_thd3 || a$w_buff1_used && a$r_buff1_thd3 ? (_Bool)0 : a$r_buff1_thd3 VAL [__unbuffered_cnt=0, __unbuffered_p2_EAX=2, __unbuffered_p2_EBX=0, __unbuffered_p3_EAX=1, __unbuffered_p3_EBX=0, a$flush_delayed=0, a$mem_tmp=0, a$r_buff0_thd0=0, a$r_buff0_thd1=1, a$r_buff0_thd2=0, a$r_buff0_thd3=0, a$r_buff0_thd4=0, a$r_buff1_thd0=0, a$r_buff1_thd1=0, a$r_buff1_thd2=0, a$r_buff1_thd3=0, a$r_buff1_thd4=0, a$read_delayed=0, a$read_delayed_var={0:0}, a$w_buff0=1, a$w_buff0_used=1, a$w_buff1=0, a$w_buff1_used=0, a=0, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice2=1, x=2, y=2, z=1] [L847] 4 a = a$w_buff0_used && a$r_buff0_thd4 ? a$w_buff0 : (a$w_buff1_used && a$r_buff1_thd4 ? a$w_buff1 : a) [L848] 4 a$w_buff0_used = a$w_buff0_used && a$r_buff0_thd4 ? (_Bool)0 : a$w_buff0_used [L849] 4 a$w_buff1_used = a$w_buff0_used && a$r_buff0_thd4 || a$w_buff1_used && a$r_buff1_thd4 ? (_Bool)0 : a$w_buff1_used [L850] 4 a$r_buff0_thd4 = a$w_buff0_used && a$r_buff0_thd4 ? (_Bool)0 : a$r_buff0_thd4 [L851] 4 a$r_buff1_thd4 = a$w_buff0_used && a$r_buff0_thd4 || a$w_buff1_used && a$r_buff1_thd4 ? (_Bool)0 : a$r_buff1_thd4 VAL [__unbuffered_cnt=0, __unbuffered_p2_EAX=2, __unbuffered_p2_EBX=0, __unbuffered_p3_EAX=1, __unbuffered_p3_EBX=0, a$flush_delayed=0, a$mem_tmp=0, a$r_buff0_thd0=0, a$r_buff0_thd1=1, a$r_buff0_thd2=0, a$r_buff0_thd3=0, a$r_buff0_thd4=0, a$r_buff1_thd0=0, a$r_buff1_thd1=0, a$r_buff1_thd2=0, a$r_buff1_thd3=0, a$r_buff1_thd4=0, a$read_delayed=0, a$read_delayed_var={0:0}, a$w_buff0=1, a$w_buff0_used=1, a$w_buff1=0, a$w_buff1_used=0, a=0, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice2=1, x=2, y=2, z=1] [L768] 1 a = a$w_buff0_used && a$r_buff0_thd1 ? a$w_buff0 : (a$w_buff1_used && a$r_buff1_thd1 ? a$w_buff1 : a) [L769] 1 a$w_buff0_used = a$w_buff0_used && a$r_buff0_thd1 ? (_Bool)0 : a$w_buff0_used [L770] 1 a$w_buff1_used = a$w_buff0_used && a$r_buff0_thd1 || a$w_buff1_used && a$r_buff1_thd1 ? (_Bool)0 : a$w_buff1_used [L771] 1 a$r_buff0_thd1 = a$w_buff0_used && a$r_buff0_thd1 ? (_Bool)0 : a$r_buff0_thd1 [L772] 1 a$r_buff1_thd1 = a$w_buff0_used && a$r_buff0_thd1 || a$w_buff1_used && a$r_buff1_thd1 ? (_Bool)0 : a$r_buff1_thd1 VAL [__unbuffered_cnt=0, __unbuffered_p2_EAX=2, __unbuffered_p2_EBX=0, __unbuffered_p3_EAX=1, __unbuffered_p3_EBX=0, a$flush_delayed=0, a$mem_tmp=0, a$r_buff0_thd0=0, a$r_buff0_thd1=1, a$r_buff0_thd2=0, a$r_buff0_thd3=0, a$r_buff0_thd4=0, a$r_buff1_thd0=0, a$r_buff1_thd1=0, a$r_buff1_thd2=0, a$r_buff1_thd3=0, a$r_buff1_thd4=0, a$read_delayed=0, a$read_delayed_var={0:0}, a$w_buff0=1, a$w_buff0_used=0, a$w_buff1=0, a$w_buff1_used=0, a=1, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice2=1, x=2, y=2, z=1] [L775] 1 __unbuffered_cnt = __unbuffered_cnt + 1 [L777] 1 return 0; [L795] 2 __unbuffered_cnt = __unbuffered_cnt + 1 [L797] 2 return 0; [L818] 3 __unbuffered_cnt = __unbuffered_cnt + 1 [L820] 3 return 0; [L854] 4 __unbuffered_cnt = __unbuffered_cnt + 1 [L856] 4 return 0; [L878] 0 main$tmp_guard0 = __unbuffered_cnt == 4 [L880] CALL 0 assume_abort_if_not(main$tmp_guard0) [L3] COND FALSE 0 !(!cond) [L880] RET 0 assume_abort_if_not(main$tmp_guard0) [L882] 0 a = a$w_buff0_used && a$r_buff0_thd0 ? a$w_buff0 : (a$w_buff1_used && a$r_buff1_thd0 ? a$w_buff1 : a) [L883] 0 a$w_buff0_used = a$w_buff0_used && a$r_buff0_thd0 ? (_Bool)0 : a$w_buff0_used [L884] 0 a$w_buff1_used = a$w_buff0_used && a$r_buff0_thd0 || a$w_buff1_used && a$r_buff1_thd0 ? (_Bool)0 : a$w_buff1_used [L885] 0 a$r_buff0_thd0 = a$w_buff0_used && a$r_buff0_thd0 ? (_Bool)0 : a$r_buff0_thd0 [L886] 0 a$r_buff1_thd0 = a$w_buff0_used && a$r_buff0_thd0 || a$w_buff1_used && a$r_buff1_thd0 ? (_Bool)0 : a$r_buff1_thd0 VAL [\result={0:0}, \result={0:0}, \result={0:0}, __unbuffered_cnt=4, __unbuffered_p2_EAX=2, __unbuffered_p2_EBX=0, __unbuffered_p3_EAX=1, __unbuffered_p3_EBX=0, a$flush_delayed=0, a$mem_tmp=0, a$r_buff0_thd0=0, a$r_buff0_thd1=1, a$r_buff0_thd2=0, a$r_buff0_thd3=0, a$r_buff0_thd4=0, a$r_buff1_thd0=0, a$r_buff1_thd1=0, a$r_buff1_thd2=0, a$r_buff1_thd3=0, a$r_buff1_thd4=0, a$read_delayed=0, a$read_delayed_var={0:0}, a$w_buff0=1, a$w_buff0_used=0, a$w_buff1=0, a$w_buff1_used=0, a=1, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, main$tmp_guard0=1, main$tmp_guard1=0, t209={5:0}, t210={6:0}, t211={7:0}, t212={3:0}, weak$$choice2=1, x=2, y=2, z=1] [L889] 0 main$tmp_guard1 = !(x == 2 && y == 2 && __unbuffered_p2_EAX == 2 && __unbuffered_p2_EBX == 0 && __unbuffered_p3_EAX == 1 && __unbuffered_p3_EBX == 0) [L891] CALL 0 __VERIFIER_assert(main$tmp_guard1) [L18] COND TRUE 0 !expression [L18] CALL 0 reach_error() [L17] COND FALSE 0 !(0) [L17] 0 __assert_fail ("0", "mix008_power.oepc_pso.oepc_rmo.oepc.c", 8, __extension__ __PRETTY_FUNCTION__) VAL [\read(__PRETTY_FUNCTION__)={49:50}, \result={0:0}, \result={0:0}, \result={0:0}, __unbuffered_cnt=4, __unbuffered_p2_EAX=2, __unbuffered_p2_EBX=0, __unbuffered_p3_EAX=1, __unbuffered_p3_EBX=0, a$flush_delayed=0, a$mem_tmp=0, a$r_buff0_thd0=0, a$r_buff0_thd1=1, a$r_buff0_thd2=0, a$r_buff0_thd3=0, a$r_buff0_thd4=0, a$r_buff1_thd0=0, a$r_buff1_thd1=0, a$r_buff1_thd2=0, a$r_buff1_thd3=0, a$r_buff1_thd4=0, a$read_delayed=0, a$read_delayed_var={0:0}, a$w_buff0=1, a$w_buff0_used=0, a$w_buff1=0, a$w_buff1_used=0, a=1, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, main$tmp_guard0=1, main$tmp_guard1=0, weak$$choice2=1, x=2, y=2, z=1] - UnprovableResult [Line: 17]: Unable to prove that assertion always holds Unable to prove that assertion always holds Reason: Not analyzed. - UnprovableResult [Line: -1]: Unable to prove that pointer dereference always succeeds Unable to prove that pointer dereference always succeeds Reason: Not analyzed. - UnprovableResult [Line: -1]: Unable to prove that pointer dereference always succeeds Unable to prove that pointer dereference always succeeds Reason: Not analyzed. - UnprovableResult [Line: -1]: Unable to prove that pointer dereference always succeeds Unable to prove that pointer dereference always succeeds Reason: Not analyzed. - UnprovableResult [Line: -1]: Unable to prove that pointer dereference always succeeds Unable to prove that pointer dereference always succeeds Reason: Not analyzed. - UnprovableResult [Line: -1]: Unable to prove that pointer dereference always succeeds Unable to prove that pointer dereference always succeeds Reason: Not analyzed. - UnprovableResult [Line: -1]: Unable to prove that pointer dereference always succeeds Unable to prove that pointer dereference always succeeds Reason: Not analyzed. - UnprovableResult [Line: -1]: Unable to prove that pointer dereference always succeeds Unable to prove that pointer dereference always succeeds Reason: Not analyzed. - UnprovableResult [Line: -1]: Unable to prove that pointer dereference always succeeds Unable to prove that pointer dereference always succeeds Reason: Not analyzed. - UnprovableResult [Line: 872]: Unable to prove that petrification did provide enough thread instances (tool internal message, not intended for end users) Unable to prove that petrification did provide enough thread instances (tool internal message, not intended for end users) Reason: Not analyzed. - UnprovableResult [Line: 876]: Unable to prove that petrification did provide enough thread instances (tool internal message, not intended for end users) Unable to prove that petrification did provide enough thread instances (tool internal message, not intended for end users) Reason: Not analyzed. - UnprovableResult [Line: 874]: Unable to prove that petrification did provide enough thread instances (tool internal message, not intended for end users) Unable to prove that petrification did provide enough thread instances (tool internal message, not intended for end users) Reason: Not analyzed. - UnprovableResult [Line: 870]: Unable to prove that petrification did provide enough thread instances (tool internal message, not intended for end users) Unable to prove that petrification did provide enough thread instances (tool internal message, not intended for end users) Reason: Not analyzed. - StatisticsResult: Ultimate Automizer benchmark data with 1 thread instances CFG has 9 procedures, 181 locations, 15 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: 48.5s, OverallIterations: 14, TraceHistogramMax: 1, PathProgramHistogramMax: 2, EmptinessCheckTime: 0.0s, AutomataDifference: 40.3s, DeadEndRemovalTime: 0.0s, HoareAnnotationTime: 0.0s, InitialAbstractionConstructionTime: 4.4s, HoareTripleCheckerStatistics: 0 mSolverCounterUnknown, 652 SdHoareTripleChecker+Valid, 2.1s IncrementalHoareTripleChecker+Time, 0 mSdLazyCounter, 652 mSDsluCounter, 79 SdHoareTripleChecker+Invalid, 1.5s Time, 0 mProtectedAction, 0 SdHoareTripleChecker+Unchecked, 0 IncrementalHoareTripleChecker+Unchecked, 42 mSDsCounter, 48 IncrementalHoareTripleChecker+Valid, 0 mProtectedPredicate, 1843 IncrementalHoareTripleChecker+Invalid, 1891 SdHoareTripleChecker+Unknown, 0 mSolverCounterNotChecked, 48 mSolverCounterUnsat, 37 mSDtfsCounter, 1843 mSolverCounterSat, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Unknown, PredicateUnifierStatistics: 0 DeclaredPredicates, 67 GetRequests, 7 SyntacticMatches, 0 SemanticMatches, 60 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 27 ImplicationChecksByTransitivity, 0.3s Time, 0.0s BasicInterpolantAutomatonTime, BiggestAbstraction: size=749occurred in iteration=11, InterpolantAutomatonStates: 81, traceCheckStatistics: No data available, InterpolantConsolidationStatistics: No data available, PathInvariantsStatistics: No data available, 0/0 InterpolantCoveringCapability, TotalInterpolationStatistics: No data available, 0.0s DumpTime, AutomataMinimizationStatistics: No data available, HoareAnnotationStatistics: No data available, RefinementEngineStatistics: TRACE_CHECK: 0.1s SsaConstructionTime, 0.4s SatisfiabilityAnalysisTime, 3.0s InterpolantComputationTime, 250 NumberOfCodeBlocks, 250 NumberOfCodeBlocksAsserted, 14 NumberOfCheckSat, 207 ConstructedInterpolants, 0 QuantifiedInterpolants, 1145 SizeOfPredicates, 0 NumberOfNonLiveVariables, 0 ConjunctsInSsa, 0 ConjunctsInUnsatCore, 13 InterpolantComputations, 13 PerfectInterpolantSequences, 0/0 InterpolantCoveringCapability, INVARIANT_SYNTHESIS: No data available, INTERPOLANT_CONSOLIDATION: No data available, ABSTRACT_INTERPRETATION: No data available, PDR: No data available, ACCELERATED_INTERPOLATION: No data available, SIFA: No data available, ReuseStatistics: No data available RESULT: Ultimate proved your program to be incorrect! [2023-08-26 11:59:34,295 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...