/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/mix023_power.opt_pso.opt_rmo.opt.i -------------------------------------------------------------------------------- This is Ultimate 0.2.3-dev-ac9dbd0-m [2023-08-26 12:01:36,190 INFO L188 SettingsManager]: Resetting all preferences to default values... [2023-08-26 12:01:36,274 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 12:01:36,278 WARN L101 SettingsManager]: Preference file contains the following unknown settings: [2023-08-26 12:01:36,279 WARN L103 SettingsManager]: * de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.Checked method. Library mode if empty. [2023-08-26 12:01:36,313 INFO L130 SettingsManager]: Preferences different from defaults after loading the file: [2023-08-26 12:01:36,314 INFO L151 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2023-08-26 12:01:36,318 INFO L153 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2023-08-26 12:01:36,319 INFO L151 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2023-08-26 12:01:36,323 INFO L153 SettingsManager]: * Create parallel compositions if possible=false [2023-08-26 12:01:36,323 INFO L153 SettingsManager]: * Use SBE=true [2023-08-26 12:01:36,323 INFO L151 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2023-08-26 12:01:36,324 INFO L153 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2023-08-26 12:01:36,325 INFO L153 SettingsManager]: * sizeof long=4 [2023-08-26 12:01:36,325 INFO L153 SettingsManager]: * Overapproximate operations on floating types=true [2023-08-26 12:01:36,325 INFO L153 SettingsManager]: * sizeof POINTER=4 [2023-08-26 12:01:36,325 INFO L153 SettingsManager]: * Check division by zero=IGNORE [2023-08-26 12:01:36,326 INFO L153 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2023-08-26 12:01:36,326 INFO L153 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2023-08-26 12:01:36,326 INFO L153 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2023-08-26 12:01:36,326 INFO L153 SettingsManager]: * sizeof long double=12 [2023-08-26 12:01:36,327 INFO L153 SettingsManager]: * Check if freed pointer was valid=false [2023-08-26 12:01:36,327 INFO L153 SettingsManager]: * Use constant arrays=true [2023-08-26 12:01:36,327 INFO L151 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2023-08-26 12:01:36,328 INFO L153 SettingsManager]: * Size of a code block=SequenceOfStatements [2023-08-26 12:01:36,328 INFO L153 SettingsManager]: * To the following directory=./dump/ [2023-08-26 12:01:36,328 INFO L153 SettingsManager]: * SMT solver=External_DefaultMode [2023-08-26 12:01:36,328 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2023-08-26 12:01:36,329 INFO L151 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2023-08-26 12:01:36,329 INFO L153 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2023-08-26 12:01:36,330 INFO L153 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopsAndPotentialCycles [2023-08-26 12:01:36,330 INFO L153 SettingsManager]: * Trace refinement strategy=CAMEL [2023-08-26 12:01:36,330 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2023-08-26 12:01:36,330 INFO L153 SettingsManager]: * Automaton type used in concurrency analysis=PETRI_NET [2023-08-26 12:01:36,331 INFO L153 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2023-08-26 12:01:36,331 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 12:01:36,655 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2023-08-26 12:01:36,670 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2023-08-26 12:01:36,672 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2023-08-26 12:01:36,673 INFO L270 PluginConnector]: Initializing CDTParser... [2023-08-26 12:01:36,674 INFO L274 PluginConnector]: CDTParser initialized [2023-08-26 12:01:36,675 INFO L431 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../../../trunk/examples/svcomp/pthread-wmm/mix023_power.opt_pso.opt_rmo.opt.i [2023-08-26 12:01:37,952 INFO L533 CDTParser]: Created temporary CDT project at NULL [2023-08-26 12:01:38,194 INFO L384 CDTParser]: Found 1 translation units. [2023-08-26 12:01:38,195 INFO L180 CDTParser]: Scanning /storage/repos/ultimate/trunk/examples/svcomp/pthread-wmm/mix023_power.opt_pso.opt_rmo.opt.i [2023-08-26 12:01:38,225 INFO L427 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/dcad81b82/9511666c83c244b68ceedd9b1eb03b5f/FLAG482dad9b0 [2023-08-26 12:01:38,242 INFO L435 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/dcad81b82/9511666c83c244b68ceedd9b1eb03b5f [2023-08-26 12:01:38,247 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2023-08-26 12:01:38,249 INFO L133 ToolchainWalker]: Walking toolchain with 5 elements. [2023-08-26 12:01:38,251 INFO L112 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2023-08-26 12:01:38,251 INFO L270 PluginConnector]: Initializing CACSL2BoogieTranslator... [2023-08-26 12:01:38,254 INFO L274 PluginConnector]: CACSL2BoogieTranslator initialized [2023-08-26 12:01:38,255 INFO L184 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 26.08 12:01:38" (1/1) ... [2023-08-26 12:01:38,256 INFO L204 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@79a8e920 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 26.08 12:01:38, skipping insertion in model container [2023-08-26 12:01:38,256 INFO L184 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 26.08 12:01:38" (1/1) ... [2023-08-26 12:01:38,317 INFO L176 MainTranslator]: Built tables and reachable declarations [2023-08-26 12:01:38,693 INFO L209 PostProcessor]: Analyzing one entry point: main [2023-08-26 12:01:38,707 INFO L201 MainTranslator]: Completed pre-run [2023-08-26 12:01:38,722 WARN L75 lationResultReporter]: Unsoundness Warning: unspecified type, defaulting to int C: short [267] [2023-08-26 12:01:38,724 WARN L75 lationResultReporter]: Unsoundness Warning: unspecified type, defaulting to int C: short [267] [2023-08-26 12:01:38,757 INFO L209 PostProcessor]: Analyzing one entry point: main [2023-08-26 12:01:38,787 WARN L669 CHandler]: The function __VERIFIER_atomic_begin is called, but not defined or handled by StandardFunctionHandler. [2023-08-26 12:01:38,787 WARN L669 CHandler]: The function __VERIFIER_atomic_end is called, but not defined or handled by StandardFunctionHandler. [2023-08-26 12:01:38,793 INFO L206 MainTranslator]: Completed translation [2023-08-26 12:01:38,794 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 26.08 12:01:38 WrapperNode [2023-08-26 12:01:38,794 INFO L131 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2023-08-26 12:01:38,795 INFO L112 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2023-08-26 12:01:38,795 INFO L270 PluginConnector]: Initializing Boogie Procedure Inliner... [2023-08-26 12:01:38,795 INFO L274 PluginConnector]: Boogie Procedure Inliner initialized [2023-08-26 12:01:38,801 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 26.08 12:01:38" (1/1) ... [2023-08-26 12:01:38,815 INFO L184 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 26.08 12:01:38" (1/1) ... [2023-08-26 12:01:38,838 INFO L138 Inliner]: procedures = 177, calls = 72, calls flagged for inlining = 6, calls inlined = 7, statements flattened = 151 [2023-08-26 12:01:38,839 INFO L131 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2023-08-26 12:01:38,839 INFO L112 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2023-08-26 12:01:38,840 INFO L270 PluginConnector]: Initializing Boogie Preprocessor... [2023-08-26 12:01:38,840 INFO L274 PluginConnector]: Boogie Preprocessor initialized [2023-08-26 12:01:38,847 INFO L184 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 26.08 12:01:38" (1/1) ... [2023-08-26 12:01:38,848 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 26.08 12:01:38" (1/1) ... [2023-08-26 12:01:38,851 INFO L184 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 26.08 12:01:38" (1/1) ... [2023-08-26 12:01:38,852 INFO L184 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 26.08 12:01:38" (1/1) ... [2023-08-26 12:01:38,862 INFO L184 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 26.08 12:01:38" (1/1) ... [2023-08-26 12:01:38,874 INFO L184 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 26.08 12:01:38" (1/1) ... [2023-08-26 12:01:38,877 INFO L184 PluginConnector]: Executing the observer LTLStepAnnotator from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 26.08 12:01:38" (1/1) ... [2023-08-26 12:01:38,878 INFO L184 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 26.08 12:01:38" (1/1) ... [2023-08-26 12:01:38,881 INFO L131 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2023-08-26 12:01:38,882 INFO L112 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2023-08-26 12:01:38,882 INFO L270 PluginConnector]: Initializing RCFGBuilder... [2023-08-26 12:01:38,882 INFO L274 PluginConnector]: RCFGBuilder initialized [2023-08-26 12:01:38,883 INFO L184 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 26.08 12:01:38" (1/1) ... [2023-08-26 12:01:38,888 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2023-08-26 12:01:38,900 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2023-08-26 12:01:38,918 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 12:01:38,945 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 12:01:38,957 INFO L130 BoogieDeclarations]: Found specification of procedure write~int [2023-08-26 12:01:38,957 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_atomic_begin [2023-08-26 12:01:38,958 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2023-08-26 12:01:38,958 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnStack [2023-08-26 12:01:38,958 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.dealloc [2023-08-26 12:01:38,958 INFO L130 BoogieDeclarations]: Found specification of procedure P0 [2023-08-26 12:01:38,958 INFO L138 BoogieDeclarations]: Found implementation of procedure P0 [2023-08-26 12:01:38,958 INFO L130 BoogieDeclarations]: Found specification of procedure P1 [2023-08-26 12:01:38,958 INFO L138 BoogieDeclarations]: Found implementation of procedure P1 [2023-08-26 12:01:38,958 INFO L130 BoogieDeclarations]: Found specification of procedure P2 [2023-08-26 12:01:38,958 INFO L138 BoogieDeclarations]: Found implementation of procedure P2 [2023-08-26 12:01:38,958 INFO L130 BoogieDeclarations]: Found specification of procedure P3 [2023-08-26 12:01:38,959 INFO L138 BoogieDeclarations]: Found implementation of procedure P3 [2023-08-26 12:01:38,959 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int [2023-08-26 12:01:38,959 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_atomic_end [2023-08-26 12:01:38,959 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2023-08-26 12:01:38,959 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2023-08-26 12:01:38,960 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 12:01:39,105 INFO L236 CfgBuilder]: Building ICFG [2023-08-26 12:01:39,106 INFO L262 CfgBuilder]: Building CFG for each procedure with an implementation [2023-08-26 12:01:39,510 INFO L277 CfgBuilder]: Performing block encoding [2023-08-26 12:01:39,614 INFO L297 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2023-08-26 12:01:39,614 INFO L302 CfgBuilder]: Removed 0 assume(true) statements. [2023-08-26 12:01:39,616 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 26.08 12:01:39 BoogieIcfgContainer [2023-08-26 12:01:39,616 INFO L131 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2023-08-26 12:01:39,619 INFO L112 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2023-08-26 12:01:39,619 INFO L270 PluginConnector]: Initializing TraceAbstraction... [2023-08-26 12:01:39,622 INFO L274 PluginConnector]: TraceAbstraction initialized [2023-08-26 12:01:39,622 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 26.08 12:01:38" (1/3) ... [2023-08-26 12:01:39,623 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@6aaed575 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 26.08 12:01:39, skipping insertion in model container [2023-08-26 12:01:39,623 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 26.08 12:01:38" (2/3) ... [2023-08-26 12:01:39,623 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@6aaed575 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 26.08 12:01:39, skipping insertion in model container [2023-08-26 12:01:39,624 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 26.08 12:01:39" (3/3) ... [2023-08-26 12:01:39,625 INFO L112 eAbstractionObserver]: Analyzing ICFG mix023_power.opt_pso.opt_rmo.opt.i [2023-08-26 12:01:39,643 INFO L203 ceAbstractionStarter]: Automizer settings: Hoare:false NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2023-08-26 12:01:39,643 INFO L162 ceAbstractionStarter]: Applying trace abstraction to program that has 10 error locations. [2023-08-26 12:01:39,644 INFO L515 ceAbstractionStarter]: Constructing petrified ICFG for 1 thread instances. [2023-08-26 12:01:39,696 INFO L144 ThreadInstanceAdder]: Constructed 0 joinOtherThreadTransitions. [2023-08-26 12:01:39,726 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 152 places, 142 transitions, 304 flow [2023-08-26 12:01:39,772 INFO L124 PetriNetUnfolderBase]: 3/138 cut-off events. [2023-08-26 12:01:39,772 INFO L125 PetriNetUnfolderBase]: For 0/0 co-relation queries the response was YES. [2023-08-26 12:01:39,777 INFO L83 FinitePrefix]: Finished finitePrefix Result has 151 conditions, 138 events. 3/138 cut-off events. For 0/0 co-relation queries the response was YES. Maximal size of possible extension queue 4. Compared 106 event pairs, 0 based on Foata normal form. 0/125 useless extension candidates. Maximal degree in co-relation 97. Up to 2 conditions per place. [2023-08-26 12:01:39,777 INFO L82 GeneralOperation]: Start removeDead. Operand has 152 places, 142 transitions, 304 flow [2023-08-26 12:01:39,781 INFO L88 GeneralOperation]: Finished RemoveDead, result has has 148 places, 138 transitions, 288 flow [2023-08-26 12:01:39,784 INFO L124 etLargeBlockEncoding]: Petri net LBE is using variable-based independence relation. [2023-08-26 12:01:39,800 INFO L131 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 148 places, 138 transitions, 288 flow [2023-08-26 12:01:39,806 INFO L113 LiptonReduction]: Starting Lipton reduction on Petri net that has 148 places, 138 transitions, 288 flow [2023-08-26 12:01:39,807 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 148 places, 138 transitions, 288 flow [2023-08-26 12:01:39,845 INFO L124 PetriNetUnfolderBase]: 3/138 cut-off events. [2023-08-26 12:01:39,845 INFO L125 PetriNetUnfolderBase]: For 0/0 co-relation queries the response was YES. [2023-08-26 12:01:39,846 INFO L83 FinitePrefix]: Finished finitePrefix Result has 151 conditions, 138 events. 3/138 cut-off events. For 0/0 co-relation queries the response was YES. Maximal size of possible extension queue 4. Compared 106 event pairs, 0 based on Foata normal form. 0/125 useless extension candidates. Maximal degree in co-relation 97. Up to 2 conditions per place. [2023-08-26 12:01:39,849 INFO L119 LiptonReduction]: Number of co-enabled transitions 3378 [2023-08-26 12:01:44,412 INFO L134 LiptonReduction]: Checked pairs total: 10124 [2023-08-26 12:01:44,413 INFO L136 LiptonReduction]: Total number of compositions: 146 [2023-08-26 12:01:44,424 INFO L356 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2023-08-26 12:01:44,430 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;@d10e12d, mLbeIndependenceSettings=[IndependenceType=SYNTACTIC, AbstractionType=NONE, UseConditional=, UseSemiCommutativity=, Solver=, SolverTimeout=] [2023-08-26 12:01:44,430 INFO L358 AbstractCegarLoop]: Starting to check reachability of 15 error locations. [2023-08-26 12:01:44,432 INFO L185 PetriNetUnfolderBase]: Found word, exiting Unfolder. [2023-08-26 12:01:44,432 INFO L124 PetriNetUnfolderBase]: 0/0 cut-off events. [2023-08-26 12:01:44,432 INFO L125 PetriNetUnfolderBase]: For 0/0 co-relation queries the response was YES. [2023-08-26 12:01:44,432 INFO L200 CegarLoopForPetriNet]: Found error trace [2023-08-26 12:01:44,433 INFO L208 CegarLoopForPetriNet]: trace histogram [1] [2023-08-26 12:01:44,433 INFO L420 AbstractCegarLoop]: === Iteration 1 === Targeting ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [P2Err0ASSERT_VIOLATIONASSERT, ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 12 more)] === [2023-08-26 12:01:44,437 INFO L145 PredicateUnifier]: Initialized classic predicate unifier [2023-08-26 12:01:44,437 INFO L85 PathProgramCache]: Analyzing trace with hash 615, now seen corresponding path program 1 times [2023-08-26 12:01:44,445 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-08-26 12:01:44,445 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1206431241] [2023-08-26 12:01:44,446 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-08-26 12:01:44,446 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-08-26 12:01:44,514 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-08-26 12:01:44,536 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 12:01:44,536 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-08-26 12:01:44,537 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1206431241] [2023-08-26 12:01:44,537 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1206431241] provided 1 perfect and 0 imperfect interpolant sequences [2023-08-26 12:01:44,537 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-08-26 12:01:44,538 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [0] imperfect sequences [] total 0 [2023-08-26 12:01:44,539 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2070164732] [2023-08-26 12:01:44,540 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-08-26 12:01:44,548 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 2 states [2023-08-26 12:01:44,553 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-08-26 12:01:44,568 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 2 interpolants. [2023-08-26 12:01:44,569 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=1, Invalid=1, Unknown=0, NotChecked=0, Total=2 [2023-08-26 12:01:44,570 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 128 out of 288 [2023-08-26 12:01:44,573 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 50 places, 38 transitions, 88 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 12:01:44,573 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2023-08-26 12:01:44,573 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 128 of 288 [2023-08-26 12:01:44,574 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2023-08-26 12:01:45,235 INFO L124 PetriNetUnfolderBase]: 3625/5191 cut-off events. [2023-08-26 12:01:45,236 INFO L125 PetriNetUnfolderBase]: For 56/56 co-relation queries the response was YES. [2023-08-26 12:01:45,251 INFO L83 FinitePrefix]: Finished finitePrefix Result has 10325 conditions, 5191 events. 3625/5191 cut-off events. For 56/56 co-relation queries the response was YES. Maximal size of possible extension queue 281. Compared 27205 event pairs, 3625 based on Foata normal form. 0/4488 useless extension candidates. Maximal degree in co-relation 10313. Up to 4977 conditions per place. [2023-08-26 12:01:45,276 INFO L140 encePairwiseOnDemand]: 279/288 looper letters, 24 selfloop transitions, 0 changer transitions 0/29 dead transitions. [2023-08-26 12:01:45,276 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 43 places, 29 transitions, 118 flow [2023-08-26 12:01:45,277 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2023-08-26 12:01:45,279 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 2 states. [2023-08-26 12:01:45,285 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2 states to 2 states and 289 transitions. [2023-08-26 12:01:45,287 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.5017361111111112 [2023-08-26 12:01:45,287 INFO L72 ComplementDD]: Start complementDD. Operand 2 states and 289 transitions. [2023-08-26 12:01:45,288 INFO L73 IsDeterministic]: Start isDeterministic. Operand 2 states and 289 transitions. [2023-08-26 12:01:45,289 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2023-08-26 12:01:45,291 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 2 states and 289 transitions. [2023-08-26 12:01:45,293 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 3 states, 2 states have (on average 144.5) internal successors, (289), 2 states have internal predecessors, (289), 0 states have call successors, (0), 0 states 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 12:01:45,297 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 3 states, 3 states have (on average 288.0) internal successors, (864), 3 states have internal predecessors, (864), 0 states have call successors, (0), 0 states 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 12:01:45,298 INFO L81 ComplementDD]: Finished complementDD. Result has 3 states, 3 states have (on average 288.0) internal successors, (864), 3 states have internal predecessors, (864), 0 states have call successors, (0), 0 states 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 12:01:45,299 INFO L175 Difference]: Start difference. First operand has 50 places, 38 transitions, 88 flow. Second operand 2 states and 289 transitions. [2023-08-26 12:01:45,300 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 43 places, 29 transitions, 118 flow [2023-08-26 12:01:45,303 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 39 places, 29 transitions, 114 flow, removed 0 selfloop flow, removed 4 redundant places. [2023-08-26 12:01:45,304 INFO L231 Difference]: Finished difference. Result has 39 places, 29 transitions, 66 flow [2023-08-26 12:01:45,306 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=288, PETRI_DIFFERENCE_MINUEND_FLOW=66, PETRI_DIFFERENCE_MINUEND_PLACES=38, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=29, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=0, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=29, PETRI_DIFFERENCE_SUBTRAHEND_STATES=2, PETRI_FLOW=66, PETRI_PLACES=39, PETRI_TRANSITIONS=29} [2023-08-26 12:01:45,309 INFO L281 CegarLoopForPetriNet]: 50 programPoint places, -11 predicate places. [2023-08-26 12:01:45,309 INFO L495 AbstractCegarLoop]: Abstraction has has 39 places, 29 transitions, 66 flow [2023-08-26 12:01:45,309 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 12:01:45,309 INFO L200 CegarLoopForPetriNet]: Found error trace [2023-08-26 12:01:45,310 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1] [2023-08-26 12:01:45,310 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable0 [2023-08-26 12:01:45,310 INFO L420 AbstractCegarLoop]: === Iteration 2 === Targeting P2Err0ASSERT_VIOLATIONASSERT === [P2Err0ASSERT_VIOLATIONASSERT, ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 12 more)] === [2023-08-26 12:01:45,311 INFO L145 PredicateUnifier]: Initialized classic predicate unifier [2023-08-26 12:01:45,311 INFO L85 PathProgramCache]: Analyzing trace with hash 1278138015, now seen corresponding path program 1 times [2023-08-26 12:01:45,311 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-08-26 12:01:45,311 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1114318662] [2023-08-26 12:01:45,311 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-08-26 12:01:45,311 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-08-26 12:01:45,385 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-08-26 12:01:45,629 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 12:01:45,629 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-08-26 12:01:45,629 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1114318662] [2023-08-26 12:01:45,629 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1114318662] provided 1 perfect and 0 imperfect interpolant sequences [2023-08-26 12:01:45,630 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-08-26 12:01:45,630 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [1] imperfect sequences [] total 1 [2023-08-26 12:01:45,630 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [493053409] [2023-08-26 12:01:45,630 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-08-26 12:01:45,631 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2023-08-26 12:01:45,631 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-08-26 12:01:45,632 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2023-08-26 12:01:45,632 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2023-08-26 12:01:45,632 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 127 out of 288 [2023-08-26 12:01:45,633 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 39 places, 29 transitions, 66 flow. Second operand has 3 states, 3 states have (on average 129.33333333333334) internal successors, (388), 3 states have internal predecessors, (388), 0 states have call successors, (0), 0 states 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 12:01:45,633 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2023-08-26 12:01:45,633 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 127 of 288 [2023-08-26 12:01:45,633 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2023-08-26 12:01:46,072 INFO L124 PetriNetUnfolderBase]: 2855/4259 cut-off events. [2023-08-26 12:01:46,073 INFO L125 PetriNetUnfolderBase]: For 0/0 co-relation queries the response was YES. [2023-08-26 12:01:46,081 INFO L83 FinitePrefix]: Finished finitePrefix Result has 8332 conditions, 4259 events. 2855/4259 cut-off events. For 0/0 co-relation queries the response was YES. Maximal size of possible extension queue 248. Compared 24018 event pairs, 545 based on Foata normal form. 0/4015 useless extension candidates. Maximal degree in co-relation 8329. Up to 3103 conditions per place. [2023-08-26 12:01:46,097 INFO L140 encePairwiseOnDemand]: 285/288 looper letters, 33 selfloop transitions, 2 changer transitions 2/42 dead transitions. [2023-08-26 12:01:46,098 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 40 places, 42 transitions, 168 flow [2023-08-26 12:01:46,099 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2023-08-26 12:01:46,099 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2023-08-26 12:01:46,102 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 419 transitions. [2023-08-26 12:01:46,103 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.4849537037037037 [2023-08-26 12:01:46,104 INFO L72 ComplementDD]: Start complementDD. Operand 3 states and 419 transitions. [2023-08-26 12:01:46,104 INFO L73 IsDeterministic]: Start isDeterministic. Operand 3 states and 419 transitions. [2023-08-26 12:01:46,105 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2023-08-26 12:01:46,105 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 3 states and 419 transitions. [2023-08-26 12:01:46,107 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 4 states, 3 states have (on average 139.66666666666666) internal successors, (419), 3 states have internal predecessors, (419), 0 states have call successors, (0), 0 states 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 12:01:46,110 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 4 states, 4 states have (on average 288.0) internal successors, (1152), 4 states have internal predecessors, (1152), 0 states have call successors, (0), 0 states 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 12:01:46,111 INFO L81 ComplementDD]: Finished complementDD. Result has 4 states, 4 states have (on average 288.0) internal successors, (1152), 4 states have internal predecessors, (1152), 0 states have call successors, (0), 0 states 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 12:01:46,112 INFO L175 Difference]: Start difference. First operand has 39 places, 29 transitions, 66 flow. Second operand 3 states and 419 transitions. [2023-08-26 12:01:46,112 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 40 places, 42 transitions, 168 flow [2023-08-26 12:01:46,115 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 40 places, 42 transitions, 168 flow, removed 0 selfloop flow, removed 0 redundant places. [2023-08-26 12:01:46,115 INFO L231 Difference]: Finished difference. Result has 40 places, 27 transitions, 66 flow [2023-08-26 12:01:46,116 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=288, PETRI_DIFFERENCE_MINUEND_FLOW=64, PETRI_DIFFERENCE_MINUEND_PLACES=38, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=28, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=2, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=26, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=66, PETRI_PLACES=40, PETRI_TRANSITIONS=27} [2023-08-26 12:01:46,117 INFO L281 CegarLoopForPetriNet]: 50 programPoint places, -10 predicate places. [2023-08-26 12:01:46,118 INFO L495 AbstractCegarLoop]: Abstraction has has 40 places, 27 transitions, 66 flow [2023-08-26 12:01:46,118 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 129.33333333333334) internal successors, (388), 3 states have internal predecessors, (388), 0 states have call successors, (0), 0 states 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 12:01:46,118 INFO L200 CegarLoopForPetriNet]: Found error trace [2023-08-26 12:01:46,123 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-08-26 12:01:46,123 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1 [2023-08-26 12:01:46,123 INFO L420 AbstractCegarLoop]: === Iteration 3 === Targeting ULTIMATE.startErr8ASSERT_VIOLATIONASSERT === [P2Err0ASSERT_VIOLATIONASSERT, ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 12 more)] === [2023-08-26 12:01:46,125 INFO L145 PredicateUnifier]: Initialized classic predicate unifier [2023-08-26 12:01:46,125 INFO L85 PathProgramCache]: Analyzing trace with hash 1508503840, now seen corresponding path program 1 times [2023-08-26 12:01:46,126 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-08-26 12:01:46,126 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1258615937] [2023-08-26 12:01:46,126 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-08-26 12:01:46,126 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-08-26 12:01:46,169 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-08-26 12:01:46,400 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 12:01:46,400 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-08-26 12:01:46,401 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1258615937] [2023-08-26 12:01:46,401 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1258615937] provided 1 perfect and 0 imperfect interpolant sequences [2023-08-26 12:01:46,401 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-08-26 12:01:46,401 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [1] imperfect sequences [] total 1 [2023-08-26 12:01:46,401 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [702542266] [2023-08-26 12:01:46,401 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-08-26 12:01:46,402 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2023-08-26 12:01:46,402 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-08-26 12:01:46,402 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2023-08-26 12:01:46,402 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2023-08-26 12:01:46,403 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 125 out of 288 [2023-08-26 12:01:46,404 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 40 places, 27 transitions, 66 flow. Second operand has 3 states, 3 states have (on average 128.66666666666666) internal successors, (386), 3 states have internal predecessors, (386), 0 states have call successors, (0), 0 states 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 12:01:46,404 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2023-08-26 12:01:46,404 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 125 of 288 [2023-08-26 12:01:46,404 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2023-08-26 12:01:46,776 INFO L124 PetriNetUnfolderBase]: 2619/3726 cut-off events. [2023-08-26 12:01:46,776 INFO L125 PetriNetUnfolderBase]: For 240/240 co-relation queries the response was YES. [2023-08-26 12:01:46,784 INFO L83 FinitePrefix]: Finished finitePrefix Result has 7775 conditions, 3726 events. 2619/3726 cut-off events. For 240/240 co-relation queries the response was YES. Maximal size of possible extension queue 195. Compared 19111 event pairs, 879 based on Foata normal form. 96/3746 useless extension candidates. Maximal degree in co-relation 7771. Up to 2503 conditions per place. [2023-08-26 12:01:46,805 INFO L140 encePairwiseOnDemand]: 285/288 looper letters, 35 selfloop transitions, 2 changer transitions 0/41 dead transitions. [2023-08-26 12:01:46,805 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 41 places, 41 transitions, 174 flow [2023-08-26 12:01:46,805 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2023-08-26 12:01:46,806 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2023-08-26 12:01:46,806 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 413 transitions. [2023-08-26 12:01:46,807 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.47800925925925924 [2023-08-26 12:01:46,807 INFO L72 ComplementDD]: Start complementDD. Operand 3 states and 413 transitions. [2023-08-26 12:01:46,807 INFO L73 IsDeterministic]: Start isDeterministic. Operand 3 states and 413 transitions. [2023-08-26 12:01:46,807 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2023-08-26 12:01:46,807 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 3 states and 413 transitions. [2023-08-26 12:01:46,808 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 4 states, 3 states have (on average 137.66666666666666) internal successors, (413), 3 states have internal predecessors, (413), 0 states have call successors, (0), 0 states 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 12:01:46,810 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 4 states, 4 states have (on average 288.0) internal successors, (1152), 4 states have internal predecessors, (1152), 0 states have call successors, (0), 0 states 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 12:01:46,811 INFO L81 ComplementDD]: Finished complementDD. Result has 4 states, 4 states have (on average 288.0) internal successors, (1152), 4 states have internal predecessors, (1152), 0 states have call successors, (0), 0 states 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 12:01:46,811 INFO L175 Difference]: Start difference. First operand has 40 places, 27 transitions, 66 flow. Second operand 3 states and 413 transitions. [2023-08-26 12:01:46,811 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 41 places, 41 transitions, 174 flow [2023-08-26 12:01:46,813 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 39 places, 41 transitions, 168 flow, removed 0 selfloop flow, removed 2 redundant places. [2023-08-26 12:01:46,814 INFO L231 Difference]: Finished difference. Result has 40 places, 27 transitions, 70 flow [2023-08-26 12:01:46,814 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=288, PETRI_DIFFERENCE_MINUEND_FLOW=62, PETRI_DIFFERENCE_MINUEND_PLACES=37, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=27, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=2, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=25, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=70, PETRI_PLACES=40, PETRI_TRANSITIONS=27} [2023-08-26 12:01:46,815 INFO L281 CegarLoopForPetriNet]: 50 programPoint places, -10 predicate places. [2023-08-26 12:01:46,815 INFO L495 AbstractCegarLoop]: Abstraction has has 40 places, 27 transitions, 70 flow [2023-08-26 12:01:46,816 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 128.66666666666666) internal successors, (386), 3 states have internal predecessors, (386), 0 states have call successors, (0), 0 states 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 12:01:46,816 INFO L200 CegarLoopForPetriNet]: Found error trace [2023-08-26 12:01:46,816 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-08-26 12:01:46,816 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2 [2023-08-26 12:01:46,820 INFO L420 AbstractCegarLoop]: === Iteration 4 === Targeting ULTIMATE.startErr8ASSERT_VIOLATIONASSERT === [P2Err0ASSERT_VIOLATIONASSERT, ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 12 more)] === [2023-08-26 12:01:46,820 INFO L145 PredicateUnifier]: Initialized classic predicate unifier [2023-08-26 12:01:46,820 INFO L85 PathProgramCache]: Analyzing trace with hash 2015274126, now seen corresponding path program 1 times [2023-08-26 12:01:46,820 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-08-26 12:01:46,820 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2054452786] [2023-08-26 12:01:46,821 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-08-26 12:01:46,821 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-08-26 12:01:46,857 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-08-26 12:01:47,035 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 12:01:47,036 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-08-26 12:01:47,036 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2054452786] [2023-08-26 12:01:47,036 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2054452786] provided 1 perfect and 0 imperfect interpolant sequences [2023-08-26 12:01:47,036 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-08-26 12:01:47,036 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2023-08-26 12:01:47,036 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1309672095] [2023-08-26 12:01:47,036 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-08-26 12:01:47,037 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2023-08-26 12:01:47,037 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-08-26 12:01:47,038 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2023-08-26 12:01:47,039 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2023-08-26 12:01:47,040 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 114 out of 288 [2023-08-26 12:01:47,040 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 40 places, 27 transitions, 70 flow. Second operand has 4 states, 4 states have (on average 117.25) internal successors, (469), 4 states have internal predecessors, (469), 0 states have call successors, (0), 0 states 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 12:01:47,040 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2023-08-26 12:01:47,040 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 114 of 288 [2023-08-26 12:01:47,040 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2023-08-26 12:01:48,203 INFO L124 PetriNetUnfolderBase]: 9285/12726 cut-off events. [2023-08-26 12:01:48,203 INFO L125 PetriNetUnfolderBase]: For 1053/1053 co-relation queries the response was YES. [2023-08-26 12:01:48,225 INFO L83 FinitePrefix]: Finished finitePrefix Result has 27148 conditions, 12726 events. 9285/12726 cut-off events. For 1053/1053 co-relation queries the response was YES. Maximal size of possible extension queue 425. Compared 61404 event pairs, 2229 based on Foata normal form. 312/13038 useless extension candidates. Maximal degree in co-relation 27143. Up to 6053 conditions per place. [2023-08-26 12:01:48,272 INFO L140 encePairwiseOnDemand]: 279/288 looper letters, 48 selfloop transitions, 8 changer transitions 0/56 dead transitions. [2023-08-26 12:01:48,272 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 43 places, 56 transitions, 246 flow [2023-08-26 12:01:48,273 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2023-08-26 12:01:48,273 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 4 states. [2023-08-26 12:01:48,274 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 514 transitions. [2023-08-26 12:01:48,275 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.4461805555555556 [2023-08-26 12:01:48,275 INFO L72 ComplementDD]: Start complementDD. Operand 4 states and 514 transitions. [2023-08-26 12:01:48,275 INFO L73 IsDeterministic]: Start isDeterministic. Operand 4 states and 514 transitions. [2023-08-26 12:01:48,275 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2023-08-26 12:01:48,275 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 4 states and 514 transitions. [2023-08-26 12:01:48,277 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 5 states, 4 states have (on average 128.5) internal successors, (514), 4 states have internal predecessors, (514), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-26 12:01:48,279 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 5 states, 5 states have (on average 288.0) internal successors, (1440), 5 states have internal predecessors, (1440), 0 states have call successors, (0), 0 states 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 12:01:48,280 INFO L81 ComplementDD]: Finished complementDD. Result has 5 states, 5 states have (on average 288.0) internal successors, (1440), 5 states have internal predecessors, (1440), 0 states have call successors, (0), 0 states 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 12:01:48,280 INFO L175 Difference]: Start difference. First operand has 40 places, 27 transitions, 70 flow. Second operand 4 states and 514 transitions. [2023-08-26 12:01:48,280 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 43 places, 56 transitions, 246 flow [2023-08-26 12:01:48,282 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 41 places, 56 transitions, 238 flow, removed 0 selfloop flow, removed 2 redundant places. [2023-08-26 12:01:48,283 INFO L231 Difference]: Finished difference. Result has 44 places, 33 transitions, 127 flow [2023-08-26 12:01:48,283 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=288, PETRI_DIFFERENCE_MINUEND_FLOW=66, PETRI_DIFFERENCE_MINUEND_PLACES=38, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=27, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=2, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=19, PETRI_DIFFERENCE_SUBTRAHEND_STATES=4, PETRI_FLOW=127, PETRI_PLACES=44, PETRI_TRANSITIONS=33} [2023-08-26 12:01:48,284 INFO L281 CegarLoopForPetriNet]: 50 programPoint places, -6 predicate places. [2023-08-26 12:01:48,284 INFO L495 AbstractCegarLoop]: Abstraction has has 44 places, 33 transitions, 127 flow [2023-08-26 12:01:48,284 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 117.25) internal successors, (469), 4 states have internal predecessors, (469), 0 states have call successors, (0), 0 states 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 12:01:48,284 INFO L200 CegarLoopForPetriNet]: Found error trace [2023-08-26 12:01:48,285 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-08-26 12:01:48,285 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable3 [2023-08-26 12:01:48,285 INFO L420 AbstractCegarLoop]: === Iteration 5 === Targeting ULTIMATE.startErr8ASSERT_VIOLATIONASSERT === [P2Err0ASSERT_VIOLATIONASSERT, ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 12 more)] === [2023-08-26 12:01:48,285 INFO L145 PredicateUnifier]: Initialized classic predicate unifier [2023-08-26 12:01:48,285 INFO L85 PathProgramCache]: Analyzing trace with hash -619336871, now seen corresponding path program 1 times [2023-08-26 12:01:48,286 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-08-26 12:01:48,286 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [873086353] [2023-08-26 12:01:48,286 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-08-26 12:01:48,286 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-08-26 12:01:48,316 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-08-26 12:01:48,493 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 12:01:48,493 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-08-26 12:01:48,493 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [873086353] [2023-08-26 12:01:48,493 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [873086353] provided 1 perfect and 0 imperfect interpolant sequences [2023-08-26 12:01:48,493 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-08-26 12:01:48,494 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2023-08-26 12:01:48,494 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [298251322] [2023-08-26 12:01:48,494 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-08-26 12:01:48,494 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2023-08-26 12:01:48,494 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-08-26 12:01:48,495 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2023-08-26 12:01:48,495 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2023-08-26 12:01:48,495 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 120 out of 288 [2023-08-26 12:01:48,496 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 44 places, 33 transitions, 127 flow. Second operand has 4 states, 4 states have (on average 123.25) internal successors, (493), 4 states have internal predecessors, (493), 0 states have call successors, (0), 0 states 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 12:01:48,496 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2023-08-26 12:01:48,496 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 120 of 288 [2023-08-26 12:01:48,497 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2023-08-26 12:01:49,157 INFO L292 olderBase$Statistics]: inserting event number 4 for the transition-marking pair ([497] L756-->P0EXIT: Formula: (and (= v_~__unbuffered_cnt~0_21 (+ v_~__unbuffered_cnt~0_22 1)) (= |v_P0Thread1of1ForFork0_#res.offset_7| 0) (= |v_P0Thread1of1ForFork0_#res.base_7| 0)) InVars {~__unbuffered_cnt~0=v_~__unbuffered_cnt~0_22} OutVars{P0Thread1of1ForFork0_#res.offset=|v_P0Thread1of1ForFork0_#res.offset_7|, P0Thread1of1ForFork0_#res.base=|v_P0Thread1of1ForFork0_#res.base_7|, ~__unbuffered_cnt~0=v_~__unbuffered_cnt~0_21} AuxVars[] AssignedVars[P0Thread1of1ForFork0_#res.offset, P0Thread1of1ForFork0_#res.base, ~__unbuffered_cnt~0][68], [60#L832true, 170#(or (not (= 2 ~__unbuffered_p1_EAX~0)) (not (= 2 ~__unbuffered_p3_EAX~0)) (not (= ~__unbuffered_p1_EBX~0 0)) (not (= 2 ~x~0)) (not (= ~__unbuffered_p3_EBX~0 0)) (not (= 2 ~z~0))), 99#P1EXITtrue, Black: 164#(= ~__unbuffered_p1_EAX~0 0), 155#true, Black: 169#(= ~__unbuffered_p3_EAX~0 0), Black: 167#true, 5#L819true, P1Thread1of1ForFork2InUse, P0Thread1of1ForFork0InUse, 78#L2true, P2Thread1of1ForFork1InUse, P3Thread1of1ForFork3InUse, 127#P0EXITtrue, 178#(= |ULTIMATE.start_assume_abort_if_not_#in~cond#1| 0)]) [2023-08-26 12:01:49,157 INFO L294 olderBase$Statistics]: this new event has 21 ancestors and is cut-off event [2023-08-26 12:01:49,158 INFO L297 olderBase$Statistics]: existing Event has 21 ancestors and is cut-off event [2023-08-26 12:01:49,158 INFO L297 olderBase$Statistics]: existing Event has 21 ancestors and is cut-off event [2023-08-26 12:01:49,158 INFO L297 olderBase$Statistics]: existing Event has 21 ancestors and is cut-off event [2023-08-26 12:01:49,165 INFO L292 olderBase$Statistics]: inserting event number 4 for the transition-marking pair ([412] L771-->L787: Formula: (let ((.cse8 (= (mod v_~y$r_buff1_thd2~0_52 256) 0)) (.cse3 (= (mod v_~y$r_buff0_thd2~0_52 256) 0))) (let ((.cse6 (not .cse3)) (.cse12 (= (mod v_~y$w_buff0_used~0_128 256) 0)) (.cse5 (and .cse3 .cse8)) (.cse11 (and (= 0 (mod v_~y$w_buff1_used~0_115 256)) .cse3))) (let ((.cse9 (or .cse12 .cse5 .cse11)) (.cse10 (and (not .cse12) .cse6))) (let ((.cse4 (= (mod v_~y$w_buff1_used~0_114 256) 0)) (.cse1 (ite .cse9 v_~y~0_86 (ite .cse10 v_~y$w_buff0~0_59 v_~y$w_buff1~0_52))) (.cse0 (not (= (mod v_~weak$$choice2~0_40 256) 0))) (.cse2 (= (mod v_~y$w_buff0_used~0_127 256) 0))) (and (= v_~y~0_86 v_~y$mem_tmp~0_24) (= v_~y$w_buff0~0_59 v_~y$w_buff0~0_58) (= v_~y~0_84 (ite .cse0 v_~y$mem_tmp~0_24 .cse1)) (= v_~y$r_buff0_thd2~0_51 (ite .cse0 v_~y$r_buff0_thd2~0_52 (ite (or .cse2 (and .cse3 .cse4) .cse5) v_~y$r_buff0_thd2~0_52 (ite (and .cse6 (not .cse2)) 0 v_~y$r_buff0_thd2~0_52)))) (= (ite .cse0 v_~y$r_buff1_thd2~0_52 (ite (let ((.cse7 (= (mod v_~y$r_buff0_thd2~0_51 256) 0))) (or .cse2 (and .cse7 .cse8) (and .cse7 .cse4))) v_~y$r_buff1_thd2~0_52 0)) v_~y$r_buff1_thd2~0_51) (= 0 v_~y$flush_delayed~0_27) (= v_~y$w_buff0_used~0_127 (ite .cse0 v_~y$w_buff0_used~0_128 (ite .cse9 v_~y$w_buff0_used~0_128 (ite .cse10 0 v_~y$w_buff0_used~0_128)))) (= v_~__unbuffered_p1_EBX~0_12 .cse1) (= v_~y$w_buff1~0_52 v_~y$w_buff1~0_51) (= v_~y$w_buff1_used~0_114 (ite .cse0 v_~y$w_buff1_used~0_115 (ite (or .cse2 .cse5 .cse11) v_~y$w_buff1_used~0_115 0)))))))) InVars {~y$r_buff1_thd2~0=v_~y$r_buff1_thd2~0_52, ~y$w_buff0_used~0=v_~y$w_buff0_used~0_128, ~y$w_buff1~0=v_~y$w_buff1~0_52, ~y$w_buff0~0=v_~y$w_buff0~0_59, ~y$r_buff0_thd2~0=v_~y$r_buff0_thd2~0_52, ~y~0=v_~y~0_86, ~y$w_buff1_used~0=v_~y$w_buff1_used~0_115} OutVars{~__unbuffered_p1_EBX~0=v_~__unbuffered_p1_EBX~0_12, ~y$w_buff0_used~0=v_~y$w_buff0_used~0_127, P1Thread1of1ForFork2_#t~nondet4=|v_P1Thread1of1ForFork2_#t~nondet4_1|, P1Thread1of1ForFork2_#t~nondet3=|v_P1Thread1of1ForFork2_#t~nondet3_1|, ~y$r_buff1_thd2~0=v_~y$r_buff1_thd2~0_51, ~weak$$choice0~0=v_~weak$$choice0~0_9, ~y$mem_tmp~0=v_~y$mem_tmp~0_24, ~y$w_buff1~0=v_~y$w_buff1~0_51, ~y$w_buff0~0=v_~y$w_buff0~0_58, ~y$r_buff0_thd2~0=v_~y$r_buff0_thd2~0_51, ~y$flush_delayed~0=v_~y$flush_delayed~0_27, ~y~0=v_~y~0_84, ~weak$$choice2~0=v_~weak$$choice2~0_40, ~y$w_buff1_used~0=v_~y$w_buff1_used~0_114} AuxVars[] AssignedVars[~__unbuffered_p1_EBX~0, ~y$w_buff0_used~0, P1Thread1of1ForFork2_#t~nondet4, P1Thread1of1ForFork2_#t~nondet3, ~y$r_buff1_thd2~0, ~weak$$choice0~0, ~y$mem_tmp~0, ~y$w_buff1~0, ~y$w_buff0~0, ~y$r_buff0_thd2~0, ~y$flush_delayed~0, ~y~0, ~weak$$choice2~0, ~y$w_buff1_used~0][76], [130#L787true, 18#P2EXITtrue, Black: 164#(= ~__unbuffered_p1_EAX~0 0), Black: 170#(or (not (= 2 ~__unbuffered_p1_EAX~0)) (not (= 2 ~__unbuffered_p3_EAX~0)) (not (= ~__unbuffered_p1_EBX~0 0)) (not (= 2 ~x~0)) (not (= ~__unbuffered_p3_EBX~0 0)) (not (= 2 ~z~0))), 155#true, Black: 169#(= ~__unbuffered_p3_EAX~0 0), 167#true, P1Thread1of1ForFork2InUse, P0Thread1of1ForFork0InUse, 61#L756true, 78#L2true, P2Thread1of1ForFork1InUse, 175#true, 35#L835true, P3Thread1of1ForFork3InUse]) [2023-08-26 12:01:49,165 INFO L294 olderBase$Statistics]: this new event has 21 ancestors and is cut-off event [2023-08-26 12:01:49,165 INFO L297 olderBase$Statistics]: existing Event has 21 ancestors and is cut-off event [2023-08-26 12:01:49,165 INFO L297 olderBase$Statistics]: existing Event has 21 ancestors and is cut-off event [2023-08-26 12:01:49,165 INFO L297 olderBase$Statistics]: existing Event has 21 ancestors and is cut-off event [2023-08-26 12:01:49,165 INFO L292 olderBase$Statistics]: inserting event number 4 for the transition-marking pair ([497] L756-->P0EXIT: Formula: (and (= v_~__unbuffered_cnt~0_21 (+ v_~__unbuffered_cnt~0_22 1)) (= |v_P0Thread1of1ForFork0_#res.offset_7| 0) (= |v_P0Thread1of1ForFork0_#res.base_7| 0)) InVars {~__unbuffered_cnt~0=v_~__unbuffered_cnt~0_22} OutVars{P0Thread1of1ForFork0_#res.offset=|v_P0Thread1of1ForFork0_#res.offset_7|, P0Thread1of1ForFork0_#res.base=|v_P0Thread1of1ForFork0_#res.base_7|, ~__unbuffered_cnt~0=v_~__unbuffered_cnt~0_21} AuxVars[] AssignedVars[P0Thread1of1ForFork0_#res.offset, P0Thread1of1ForFork0_#res.base, ~__unbuffered_cnt~0][29], [113#L771true, 18#P2EXITtrue, 170#(or (not (= 2 ~__unbuffered_p1_EAX~0)) (not (= 2 ~__unbuffered_p3_EAX~0)) (not (= ~__unbuffered_p1_EBX~0 0)) (not (= 2 ~x~0)) (not (= ~__unbuffered_p3_EBX~0 0)) (not (= 2 ~z~0))), Black: 164#(= ~__unbuffered_p1_EAX~0 0), 155#true, Black: 169#(= ~__unbuffered_p3_EAX~0 0), Black: 167#true, P1Thread1of1ForFork2InUse, P0Thread1of1ForFork0InUse, 78#L2true, P2Thread1of1ForFork1InUse, 175#true, 35#L835true, P3Thread1of1ForFork3InUse, 127#P0EXITtrue]) [2023-08-26 12:01:49,165 INFO L294 olderBase$Statistics]: this new event has 21 ancestors and is cut-off event [2023-08-26 12:01:49,166 INFO L297 olderBase$Statistics]: existing Event has 21 ancestors and is cut-off event [2023-08-26 12:01:49,166 INFO L297 olderBase$Statistics]: existing Event has 21 ancestors and is cut-off event [2023-08-26 12:01:49,166 INFO L297 olderBase$Statistics]: existing Event has 21 ancestors and is cut-off event [2023-08-26 12:01:49,211 INFO L292 olderBase$Statistics]: inserting event number 4 for the transition-marking pair ([562] L877-->ULTIMATE.startErr8ASSERT_VIOLATIONASSERT: Formula: (and (= |v_ULTIMATE.start___VERIFIER_assert_#in~expression#1_25| |v_ULTIMATE.start___VERIFIER_assert_~expression#1_31|) (= (ite (= (ite (not (and (= v_~__unbuffered_p1_EBX~0_28 0) (= 2 v_~__unbuffered_p3_EAX~0_18) (= v_~x~0_22 2) (= 0 v_~__unbuffered_p3_EBX~0_16) (= v_~z~0_20 2) (= 2 v_~__unbuffered_p1_EAX~0_18))) 1 0) 0) 0 1) v_~main$tmp_guard1~0_16) (= (mod v_~main$tmp_guard1~0_16 256) |v_ULTIMATE.start___VERIFIER_assert_#in~expression#1_25|) (= |v_ULTIMATE.start___VERIFIER_assert_~expression#1_31| 0)) InVars {~__unbuffered_p1_EBX~0=v_~__unbuffered_p1_EBX~0_28, ~__unbuffered_p1_EAX~0=v_~__unbuffered_p1_EAX~0_18, ~__unbuffered_p3_EAX~0=v_~__unbuffered_p3_EAX~0_18, ~z~0=v_~z~0_20, ~__unbuffered_p3_EBX~0=v_~__unbuffered_p3_EBX~0_16, ~x~0=v_~x~0_22} OutVars{ULTIMATE.start_reach_error_#t~nondet0#1.offset=|v_ULTIMATE.start_reach_error_#t~nondet0#1.offset_27|, ULTIMATE.start___VERIFIER_assert_~expression#1=|v_ULTIMATE.start___VERIFIER_assert_~expression#1_31|, ~__unbuffered_p1_EBX~0=v_~__unbuffered_p1_EBX~0_28, ULTIMATE.start___VERIFIER_assert_#in~expression#1=|v_ULTIMATE.start___VERIFIER_assert_#in~expression#1_25|, ~__unbuffered_p1_EAX~0=v_~__unbuffered_p1_EAX~0_18, ULTIMATE.start_reach_error_#t~nondet0#1.base=|v_ULTIMATE.start_reach_error_#t~nondet0#1.base_27|, ~__unbuffered_p3_EAX~0=v_~__unbuffered_p3_EAX~0_18, ~main$tmp_guard1~0=v_~main$tmp_guard1~0_16, ~z~0=v_~z~0_20, ~__unbuffered_p3_EBX~0=v_~__unbuffered_p3_EBX~0_16, ~x~0=v_~x~0_22} AuxVars[] AssignedVars[ULTIMATE.start_reach_error_#t~nondet0#1.offset, ULTIMATE.start___VERIFIER_assert_~expression#1, ULTIMATE.start___VERIFIER_assert_#in~expression#1, ULTIMATE.start_reach_error_#t~nondet0#1.base, ~main$tmp_guard1~0][72], [60#L832true, 113#L771true, 18#P2EXITtrue, Black: 164#(= ~__unbuffered_p1_EAX~0 0), Black: 170#(or (not (= 2 ~__unbuffered_p1_EAX~0)) (not (= 2 ~__unbuffered_p3_EAX~0)) (not (= ~__unbuffered_p1_EBX~0 0)) (not (= 2 ~x~0)) (not (= ~__unbuffered_p3_EBX~0 0)) (not (= 2 ~z~0))), 155#true, Black: 169#(= ~__unbuffered_p3_EAX~0 0), 167#true, P1Thread1of1ForFork2InUse, P0Thread1of1ForFork0InUse, 61#L756true, P2Thread1of1ForFork1InUse, 12#ULTIMATE.startErr8ASSERT_VIOLATIONASSERTtrue, 175#true, P3Thread1of1ForFork3InUse]) [2023-08-26 12:01:49,211 INFO L294 olderBase$Statistics]: this new event has 21 ancestors and is not cut-off event [2023-08-26 12:01:49,211 INFO L297 olderBase$Statistics]: existing Event has 21 ancestors and is not cut-off event [2023-08-26 12:01:49,211 INFO L297 olderBase$Statistics]: existing Event has 21 ancestors and is not cut-off event [2023-08-26 12:01:49,212 INFO L297 olderBase$Statistics]: existing Event has 21 ancestors and is not cut-off event [2023-08-26 12:01:49,236 INFO L292 olderBase$Statistics]: inserting event number 4 for the transition-marking pair ([497] L756-->P0EXIT: Formula: (and (= v_~__unbuffered_cnt~0_21 (+ v_~__unbuffered_cnt~0_22 1)) (= |v_P0Thread1of1ForFork0_#res.offset_7| 0) (= |v_P0Thread1of1ForFork0_#res.base_7| 0)) InVars {~__unbuffered_cnt~0=v_~__unbuffered_cnt~0_22} OutVars{P0Thread1of1ForFork0_#res.offset=|v_P0Thread1of1ForFork0_#res.offset_7|, P0Thread1of1ForFork0_#res.base=|v_P0Thread1of1ForFork0_#res.base_7|, ~__unbuffered_cnt~0=v_~__unbuffered_cnt~0_21} AuxVars[] AssignedVars[P0Thread1of1ForFork0_#res.offset, P0Thread1of1ForFork0_#res.base, ~__unbuffered_cnt~0][68], [60#L832true, 170#(or (not (= 2 ~__unbuffered_p1_EAX~0)) (not (= 2 ~__unbuffered_p3_EAX~0)) (not (= ~__unbuffered_p1_EBX~0 0)) (not (= 2 ~x~0)) (not (= ~__unbuffered_p3_EBX~0 0)) (not (= 2 ~z~0))), 18#P2EXITtrue, 99#P1EXITtrue, Black: 164#(= ~__unbuffered_p1_EAX~0 0), 155#true, Black: 169#(= ~__unbuffered_p3_EAX~0 0), Black: 167#true, P1Thread1of1ForFork2InUse, P0Thread1of1ForFork0InUse, 78#L2true, P2Thread1of1ForFork1InUse, P3Thread1of1ForFork3InUse, 127#P0EXITtrue, 178#(= |ULTIMATE.start_assume_abort_if_not_#in~cond#1| 0)]) [2023-08-26 12:01:49,237 INFO L294 olderBase$Statistics]: this new event has 22 ancestors and is cut-off event [2023-08-26 12:01:49,237 INFO L297 olderBase$Statistics]: existing Event has 22 ancestors and is cut-off event [2023-08-26 12:01:49,237 INFO L297 olderBase$Statistics]: existing Event has 22 ancestors and is cut-off event [2023-08-26 12:01:49,237 INFO L297 olderBase$Statistics]: existing Event has 22 ancestors and is cut-off event [2023-08-26 12:01:49,241 INFO L292 olderBase$Statistics]: inserting event number 4 for the transition-marking pair ([412] L771-->L787: Formula: (let ((.cse8 (= (mod v_~y$r_buff1_thd2~0_52 256) 0)) (.cse3 (= (mod v_~y$r_buff0_thd2~0_52 256) 0))) (let ((.cse6 (not .cse3)) (.cse12 (= (mod v_~y$w_buff0_used~0_128 256) 0)) (.cse5 (and .cse3 .cse8)) (.cse11 (and (= 0 (mod v_~y$w_buff1_used~0_115 256)) .cse3))) (let ((.cse9 (or .cse12 .cse5 .cse11)) (.cse10 (and (not .cse12) .cse6))) (let ((.cse4 (= (mod v_~y$w_buff1_used~0_114 256) 0)) (.cse1 (ite .cse9 v_~y~0_86 (ite .cse10 v_~y$w_buff0~0_59 v_~y$w_buff1~0_52))) (.cse0 (not (= (mod v_~weak$$choice2~0_40 256) 0))) (.cse2 (= (mod v_~y$w_buff0_used~0_127 256) 0))) (and (= v_~y~0_86 v_~y$mem_tmp~0_24) (= v_~y$w_buff0~0_59 v_~y$w_buff0~0_58) (= v_~y~0_84 (ite .cse0 v_~y$mem_tmp~0_24 .cse1)) (= v_~y$r_buff0_thd2~0_51 (ite .cse0 v_~y$r_buff0_thd2~0_52 (ite (or .cse2 (and .cse3 .cse4) .cse5) v_~y$r_buff0_thd2~0_52 (ite (and .cse6 (not .cse2)) 0 v_~y$r_buff0_thd2~0_52)))) (= (ite .cse0 v_~y$r_buff1_thd2~0_52 (ite (let ((.cse7 (= (mod v_~y$r_buff0_thd2~0_51 256) 0))) (or .cse2 (and .cse7 .cse8) (and .cse7 .cse4))) v_~y$r_buff1_thd2~0_52 0)) v_~y$r_buff1_thd2~0_51) (= 0 v_~y$flush_delayed~0_27) (= v_~y$w_buff0_used~0_127 (ite .cse0 v_~y$w_buff0_used~0_128 (ite .cse9 v_~y$w_buff0_used~0_128 (ite .cse10 0 v_~y$w_buff0_used~0_128)))) (= v_~__unbuffered_p1_EBX~0_12 .cse1) (= v_~y$w_buff1~0_52 v_~y$w_buff1~0_51) (= v_~y$w_buff1_used~0_114 (ite .cse0 v_~y$w_buff1_used~0_115 (ite (or .cse2 .cse5 .cse11) v_~y$w_buff1_used~0_115 0)))))))) InVars {~y$r_buff1_thd2~0=v_~y$r_buff1_thd2~0_52, ~y$w_buff0_used~0=v_~y$w_buff0_used~0_128, ~y$w_buff1~0=v_~y$w_buff1~0_52, ~y$w_buff0~0=v_~y$w_buff0~0_59, ~y$r_buff0_thd2~0=v_~y$r_buff0_thd2~0_52, ~y~0=v_~y~0_86, ~y$w_buff1_used~0=v_~y$w_buff1_used~0_115} OutVars{~__unbuffered_p1_EBX~0=v_~__unbuffered_p1_EBX~0_12, ~y$w_buff0_used~0=v_~y$w_buff0_used~0_127, P1Thread1of1ForFork2_#t~nondet4=|v_P1Thread1of1ForFork2_#t~nondet4_1|, P1Thread1of1ForFork2_#t~nondet3=|v_P1Thread1of1ForFork2_#t~nondet3_1|, ~y$r_buff1_thd2~0=v_~y$r_buff1_thd2~0_51, ~weak$$choice0~0=v_~weak$$choice0~0_9, ~y$mem_tmp~0=v_~y$mem_tmp~0_24, ~y$w_buff1~0=v_~y$w_buff1~0_51, ~y$w_buff0~0=v_~y$w_buff0~0_58, ~y$r_buff0_thd2~0=v_~y$r_buff0_thd2~0_51, ~y$flush_delayed~0=v_~y$flush_delayed~0_27, ~y~0=v_~y~0_84, ~weak$$choice2~0=v_~weak$$choice2~0_40, ~y$w_buff1_used~0=v_~y$w_buff1_used~0_114} AuxVars[] AssignedVars[~__unbuffered_p1_EBX~0, ~y$w_buff0_used~0, P1Thread1of1ForFork2_#t~nondet4, P1Thread1of1ForFork2_#t~nondet3, ~y$r_buff1_thd2~0, ~weak$$choice0~0, ~y$mem_tmp~0, ~y$w_buff1~0, ~y$w_buff0~0, ~y$r_buff0_thd2~0, ~y$flush_delayed~0, ~y~0, ~weak$$choice2~0, ~y$w_buff1_used~0][76], [130#L787true, 18#P2EXITtrue, Black: 164#(= ~__unbuffered_p1_EAX~0 0), Black: 170#(or (not (= 2 ~__unbuffered_p1_EAX~0)) (not (= 2 ~__unbuffered_p3_EAX~0)) (not (= ~__unbuffered_p1_EBX~0 0)) (not (= 2 ~x~0)) (not (= ~__unbuffered_p3_EBX~0 0)) (not (= 2 ~z~0))), 155#true, Black: 169#(= ~__unbuffered_p3_EAX~0 0), 167#true, P1Thread1of1ForFork2InUse, P0Thread1of1ForFork0InUse, 61#L756true, P2Thread1of1ForFork1InUse, 35#L835true, 175#true, 21#L877true, P3Thread1of1ForFork3InUse]) [2023-08-26 12:01:49,241 INFO L294 olderBase$Statistics]: this new event has 22 ancestors and is cut-off event [2023-08-26 12:01:49,241 INFO L297 olderBase$Statistics]: existing Event has 22 ancestors and is cut-off event [2023-08-26 12:01:49,241 INFO L297 olderBase$Statistics]: existing Event has 22 ancestors and is cut-off event [2023-08-26 12:01:49,241 INFO L297 olderBase$Statistics]: existing Event has 22 ancestors and is cut-off event [2023-08-26 12:01:49,241 INFO L292 olderBase$Statistics]: inserting event number 4 for the transition-marking pair ([497] L756-->P0EXIT: Formula: (and (= v_~__unbuffered_cnt~0_21 (+ v_~__unbuffered_cnt~0_22 1)) (= |v_P0Thread1of1ForFork0_#res.offset_7| 0) (= |v_P0Thread1of1ForFork0_#res.base_7| 0)) InVars {~__unbuffered_cnt~0=v_~__unbuffered_cnt~0_22} OutVars{P0Thread1of1ForFork0_#res.offset=|v_P0Thread1of1ForFork0_#res.offset_7|, P0Thread1of1ForFork0_#res.base=|v_P0Thread1of1ForFork0_#res.base_7|, ~__unbuffered_cnt~0=v_~__unbuffered_cnt~0_21} AuxVars[] AssignedVars[P0Thread1of1ForFork0_#res.offset, P0Thread1of1ForFork0_#res.base, ~__unbuffered_cnt~0][29], [113#L771true, 18#P2EXITtrue, 170#(or (not (= 2 ~__unbuffered_p1_EAX~0)) (not (= 2 ~__unbuffered_p3_EAX~0)) (not (= ~__unbuffered_p1_EBX~0 0)) (not (= 2 ~x~0)) (not (= ~__unbuffered_p3_EBX~0 0)) (not (= 2 ~z~0))), Black: 164#(= ~__unbuffered_p1_EAX~0 0), 155#true, Black: 169#(= ~__unbuffered_p3_EAX~0 0), Black: 167#true, P1Thread1of1ForFork2InUse, P0Thread1of1ForFork0InUse, P2Thread1of1ForFork1InUse, 35#L835true, 175#true, 21#L877true, P3Thread1of1ForFork3InUse, 127#P0EXITtrue]) [2023-08-26 12:01:49,241 INFO L294 olderBase$Statistics]: this new event has 22 ancestors and is cut-off event [2023-08-26 12:01:49,241 INFO L297 olderBase$Statistics]: existing Event has 22 ancestors and is cut-off event [2023-08-26 12:01:49,242 INFO L297 olderBase$Statistics]: existing Event has 22 ancestors and is cut-off event [2023-08-26 12:01:49,242 INFO L297 olderBase$Statistics]: existing Event has 22 ancestors and is cut-off event [2023-08-26 12:01:49,345 INFO L124 PetriNetUnfolderBase]: 5236/7817 cut-off events. [2023-08-26 12:01:49,345 INFO L125 PetriNetUnfolderBase]: For 3476/4188 co-relation queries the response was YES. [2023-08-26 12:01:49,374 INFO L83 FinitePrefix]: Finished finitePrefix Result has 18723 conditions, 7817 events. 5236/7817 cut-off events. For 3476/4188 co-relation queries the response was YES. Maximal size of possible extension queue 545. Compared 48114 event pairs, 944 based on Foata normal form. 600/8063 useless extension candidates. Maximal degree in co-relation 18716. Up to 5047 conditions per place. [2023-08-26 12:01:49,404 INFO L140 encePairwiseOnDemand]: 281/288 looper letters, 60 selfloop transitions, 10 changer transitions 0/79 dead transitions. [2023-08-26 12:01:49,404 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 48 places, 79 transitions, 401 flow [2023-08-26 12:01:49,404 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2023-08-26 12:01:49,404 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 5 states. [2023-08-26 12:01:49,406 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 664 transitions. [2023-08-26 12:01:49,406 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.46111111111111114 [2023-08-26 12:01:49,406 INFO L72 ComplementDD]: Start complementDD. Operand 5 states and 664 transitions. [2023-08-26 12:01:49,406 INFO L73 IsDeterministic]: Start isDeterministic. Operand 5 states and 664 transitions. [2023-08-26 12:01:49,407 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2023-08-26 12:01:49,407 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 5 states and 664 transitions. [2023-08-26 12:01:49,409 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 6 states, 5 states have (on average 132.8) internal successors, (664), 5 states have internal predecessors, (664), 0 states have call successors, (0), 0 states 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 12:01:49,411 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 6 states, 6 states have (on average 288.0) internal successors, (1728), 6 states have internal predecessors, (1728), 0 states have call successors, (0), 0 states 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 12:01:49,412 INFO L81 ComplementDD]: Finished complementDD. Result has 6 states, 6 states have (on average 288.0) internal successors, (1728), 6 states have internal predecessors, (1728), 0 states have call successors, (0), 0 states 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 12:01:49,412 INFO L175 Difference]: Start difference. First operand has 44 places, 33 transitions, 127 flow. Second operand 5 states and 664 transitions. [2023-08-26 12:01:49,412 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 48 places, 79 transitions, 401 flow [2023-08-26 12:01:49,505 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 47 places, 79 transitions, 399 flow, removed 0 selfloop flow, removed 1 redundant places. [2023-08-26 12:01:49,506 INFO L231 Difference]: Finished difference. Result has 50 places, 42 transitions, 200 flow [2023-08-26 12:01:49,506 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=288, PETRI_DIFFERENCE_MINUEND_FLOW=125, PETRI_DIFFERENCE_MINUEND_PLACES=43, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=33, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=1, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=27, PETRI_DIFFERENCE_SUBTRAHEND_STATES=5, PETRI_FLOW=200, PETRI_PLACES=50, PETRI_TRANSITIONS=42} [2023-08-26 12:01:49,507 INFO L281 CegarLoopForPetriNet]: 50 programPoint places, 0 predicate places. [2023-08-26 12:01:49,507 INFO L495 AbstractCegarLoop]: Abstraction has has 50 places, 42 transitions, 200 flow [2023-08-26 12:01:49,507 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 123.25) internal successors, (493), 4 states have internal predecessors, (493), 0 states have call successors, (0), 0 states 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 12:01:49,507 INFO L200 CegarLoopForPetriNet]: Found error trace [2023-08-26 12:01:49,507 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-08-26 12:01:49,508 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable4 [2023-08-26 12:01:49,508 INFO L420 AbstractCegarLoop]: === Iteration 6 === Targeting ULTIMATE.startErr8ASSERT_VIOLATIONASSERT === [P2Err0ASSERT_VIOLATIONASSERT, ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 12 more)] === [2023-08-26 12:01:49,508 INFO L145 PredicateUnifier]: Initialized classic predicate unifier [2023-08-26 12:01:49,508 INFO L85 PathProgramCache]: Analyzing trace with hash 1869236880, now seen corresponding path program 1 times [2023-08-26 12:01:49,508 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-08-26 12:01:49,508 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [392583305] [2023-08-26 12:01:49,508 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-08-26 12:01:49,509 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-08-26 12:01:49,532 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-08-26 12:01:49,672 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 12:01:49,672 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-08-26 12:01:49,672 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [392583305] [2023-08-26 12:01:49,672 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [392583305] provided 1 perfect and 0 imperfect interpolant sequences [2023-08-26 12:01:49,672 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-08-26 12:01:49,672 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2023-08-26 12:01:49,673 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [216682077] [2023-08-26 12:01:49,673 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-08-26 12:01:49,673 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2023-08-26 12:01:49,674 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-08-26 12:01:49,675 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2023-08-26 12:01:49,678 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2023-08-26 12:01:49,679 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 114 out of 288 [2023-08-26 12:01:49,679 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 50 places, 42 transitions, 200 flow. Second operand has 4 states, 4 states have (on average 118.5) internal successors, (474), 4 states have internal predecessors, (474), 0 states have call successors, (0), 0 states 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 12:01:49,680 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2023-08-26 12:01:49,680 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 114 of 288 [2023-08-26 12:01:49,680 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2023-08-26 12:01:51,202 INFO L124 PetriNetUnfolderBase]: 12286/17635 cut-off events. [2023-08-26 12:01:51,202 INFO L125 PetriNetUnfolderBase]: For 17987/17987 co-relation queries the response was YES. [2023-08-26 12:01:51,282 INFO L83 FinitePrefix]: Finished finitePrefix Result has 58669 conditions, 17635 events. 12286/17635 cut-off events. For 17987/17987 co-relation queries the response was YES. Maximal size of possible extension queue 668. Compared 102687 event pairs, 2737 based on Foata normal form. 96/17731 useless extension candidates. Maximal degree in co-relation 58658. Up to 7760 conditions per place. [2023-08-26 12:01:51,326 INFO L140 encePairwiseOnDemand]: 278/288 looper letters, 73 selfloop transitions, 17 changer transitions 18/108 dead transitions. [2023-08-26 12:01:51,326 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 53 places, 108 transitions, 715 flow [2023-08-26 12:01:51,327 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2023-08-26 12:01:51,327 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 4 states. [2023-08-26 12:01:51,328 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 528 transitions. [2023-08-26 12:01:51,329 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.4583333333333333 [2023-08-26 12:01:51,329 INFO L72 ComplementDD]: Start complementDD. Operand 4 states and 528 transitions. [2023-08-26 12:01:51,329 INFO L73 IsDeterministic]: Start isDeterministic. Operand 4 states and 528 transitions. [2023-08-26 12:01:51,329 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2023-08-26 12:01:51,329 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 4 states and 528 transitions. [2023-08-26 12:01:51,330 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 5 states, 4 states have (on average 132.0) internal successors, (528), 4 states have internal predecessors, (528), 0 states have call successors, (0), 0 states 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 12:01:51,333 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 5 states, 5 states have (on average 288.0) internal successors, (1440), 5 states have internal predecessors, (1440), 0 states have call successors, (0), 0 states 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 12:01:51,333 INFO L81 ComplementDD]: Finished complementDD. Result has 5 states, 5 states have (on average 288.0) internal successors, (1440), 5 states have internal predecessors, (1440), 0 states have call successors, (0), 0 states 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 12:01:51,333 INFO L175 Difference]: Start difference. First operand has 50 places, 42 transitions, 200 flow. Second operand 4 states and 528 transitions. [2023-08-26 12:01:51,334 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 53 places, 108 transitions, 715 flow [2023-08-26 12:01:51,366 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 52 places, 108 transitions, 702 flow, removed 0 selfloop flow, removed 1 redundant places. [2023-08-26 12:01:51,368 INFO L231 Difference]: Finished difference. Result has 55 places, 49 transitions, 309 flow [2023-08-26 12:01:51,368 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=288, PETRI_DIFFERENCE_MINUEND_FLOW=195, PETRI_DIFFERENCE_MINUEND_PLACES=49, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=42, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=6, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=28, PETRI_DIFFERENCE_SUBTRAHEND_STATES=4, PETRI_FLOW=309, PETRI_PLACES=55, PETRI_TRANSITIONS=49} [2023-08-26 12:01:51,370 INFO L281 CegarLoopForPetriNet]: 50 programPoint places, 5 predicate places. [2023-08-26 12:01:51,370 INFO L495 AbstractCegarLoop]: Abstraction has has 55 places, 49 transitions, 309 flow [2023-08-26 12:01:51,371 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 118.5) internal successors, (474), 4 states have internal predecessors, (474), 0 states have call successors, (0), 0 states 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 12:01:51,371 INFO L200 CegarLoopForPetriNet]: Found error trace [2023-08-26 12:01:51,371 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 12:01:51,371 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable5 [2023-08-26 12:01:51,371 INFO L420 AbstractCegarLoop]: === Iteration 7 === Targeting ULTIMATE.startErr8ASSERT_VIOLATIONASSERT === [P2Err0ASSERT_VIOLATIONASSERT, ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 12 more)] === [2023-08-26 12:01:51,372 INFO L145 PredicateUnifier]: Initialized classic predicate unifier [2023-08-26 12:01:51,372 INFO L85 PathProgramCache]: Analyzing trace with hash 645641554, now seen corresponding path program 1 times [2023-08-26 12:01:51,372 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-08-26 12:01:51,372 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [677104856] [2023-08-26 12:01:51,372 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-08-26 12:01:51,372 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-08-26 12:01:51,406 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-08-26 12:01:51,611 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 12:01:51,612 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-08-26 12:01:51,612 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [677104856] [2023-08-26 12:01:51,612 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [677104856] provided 1 perfect and 0 imperfect interpolant sequences [2023-08-26 12:01:51,612 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-08-26 12:01:51,612 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2023-08-26 12:01:51,612 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1458671155] [2023-08-26 12:01:51,612 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-08-26 12:01:51,613 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2023-08-26 12:01:51,613 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-08-26 12:01:51,613 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2023-08-26 12:01:51,613 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=8, Invalid=12, Unknown=0, NotChecked=0, Total=20 [2023-08-26 12:01:51,614 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 120 out of 288 [2023-08-26 12:01:51,614 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 55 places, 49 transitions, 309 flow. Second operand has 5 states, 5 states have (on average 123.0) internal successors, (615), 5 states have internal predecessors, (615), 0 states have call successors, (0), 0 states 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 12:01:51,614 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2023-08-26 12:01:51,615 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 120 of 288 [2023-08-26 12:01:51,615 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2023-08-26 12:01:52,414 INFO L292 olderBase$Statistics]: inserting event number 4 for the transition-marking pair ([428] L835-->L842: Formula: (let ((.cse1 (not (= (mod v_~y$w_buff0_used~0_117 256) 0))) (.cse5 (not (= (mod v_~y$r_buff0_thd4~0_26 256) 0))) (.cse0 (not (= (mod v_~y$r_buff1_thd4~0_22 256) 0)))) (let ((.cse2 (and (not (= (mod v_~y$w_buff1_used~0_103 256) 0)) .cse0)) (.cse4 (and (not (= (mod v_~y$w_buff0_used~0_118 256) 0)) .cse5)) (.cse3 (and .cse1 .cse5))) (and (= (ite (or (and (not (= (mod v_~y$w_buff1_used~0_102 256) 0)) .cse0) (and (not (= (mod v_~y$r_buff0_thd4~0_25 256) 0)) .cse1)) 0 v_~y$r_buff1_thd4~0_22) v_~y$r_buff1_thd4~0_21) (= (ite (or .cse2 .cse3) 0 v_~y$w_buff1_used~0_103) v_~y$w_buff1_used~0_102) (= v_~y~0_72 (ite .cse4 v_~y$w_buff0~0_54 (ite .cse2 v_~y$w_buff1~0_47 v_~y~0_73))) (= v_~y$w_buff0_used~0_117 (ite .cse4 0 v_~y$w_buff0_used~0_118)) (= v_~y$r_buff0_thd4~0_25 (ite .cse3 0 v_~y$r_buff0_thd4~0_26))))) InVars {~y$r_buff0_thd4~0=v_~y$r_buff0_thd4~0_26, ~y$r_buff1_thd4~0=v_~y$r_buff1_thd4~0_22, ~y$w_buff0_used~0=v_~y$w_buff0_used~0_118, ~y$w_buff1~0=v_~y$w_buff1~0_47, ~y$w_buff0~0=v_~y$w_buff0~0_54, ~y~0=v_~y~0_73, ~y$w_buff1_used~0=v_~y$w_buff1_used~0_103} OutVars{~y$r_buff0_thd4~0=v_~y$r_buff0_thd4~0_25, ~y$r_buff1_thd4~0=v_~y$r_buff1_thd4~0_21, ~y$w_buff0_used~0=v_~y$w_buff0_used~0_117, ~y$w_buff1~0=v_~y$w_buff1~0_47, ~y$w_buff0~0=v_~y$w_buff0~0_54, ~y~0=v_~y~0_72, ~y$w_buff1_used~0=v_~y$w_buff1_used~0_102} AuxVars[] AssignedVars[~y$r_buff0_thd4~0, ~y$r_buff1_thd4~0, ~y$w_buff0_used~0, ~y~0, ~y$w_buff1_used~0][67], [130#L787true, Black: 188#(or (not (= 2 ~__unbuffered_p1_EAX~0)) (not (= 2 ~__unbuffered_p3_EAX~0)) (not (= ~__unbuffered_p1_EBX~0 0)) (not (= 2 ~x~0)) (not (= ~__unbuffered_p3_EBX~0 0)) (not (= 2 ~z~0))), 18#P2EXITtrue, Black: 164#(= ~__unbuffered_p1_EAX~0 0), 187#(= ~x~0 1), Black: 170#(or (not (= 2 ~__unbuffered_p1_EAX~0)) (not (= 2 ~__unbuffered_p3_EAX~0)) (not (= ~__unbuffered_p1_EBX~0 0)) (not (= 2 ~x~0)) (not (= ~__unbuffered_p3_EBX~0 0)) (not (= 2 ~z~0))), 155#true, Black: 169#(= ~__unbuffered_p3_EAX~0 0), 167#true, P1Thread1of1ForFork2InUse, P0Thread1of1ForFork0InUse, 61#L756true, Black: 177#(= ~__unbuffered_cnt~0 0), 199#(and (<= ~__unbuffered_cnt~0 1) (= |ULTIMATE.start_assume_abort_if_not_#in~cond#1| 0)), Black: 180#(and (= ~__unbuffered_cnt~0 0) (= |ULTIMATE.start_assume_abort_if_not_#in~cond#1| 0)), 78#L2true, P2Thread1of1ForFork1InUse, Black: 178#(= |ULTIMATE.start_assume_abort_if_not_#in~cond#1| 0), P3Thread1of1ForFork3InUse, 46#L842true, Black: 185#true]) [2023-08-26 12:01:52,414 INFO L294 olderBase$Statistics]: this new event has 22 ancestors and is cut-off event [2023-08-26 12:01:52,414 INFO L297 olderBase$Statistics]: existing Event has 22 ancestors and is cut-off event [2023-08-26 12:01:52,415 INFO L297 olderBase$Statistics]: existing Event has 22 ancestors and is cut-off event [2023-08-26 12:01:52,415 INFO L297 olderBase$Statistics]: existing Event has 22 ancestors and is cut-off event [2023-08-26 12:01:52,451 INFO L292 olderBase$Statistics]: inserting event number 4 for the transition-marking pair ([497] L756-->P0EXIT: Formula: (and (= v_~__unbuffered_cnt~0_21 (+ v_~__unbuffered_cnt~0_22 1)) (= |v_P0Thread1of1ForFork0_#res.offset_7| 0) (= |v_P0Thread1of1ForFork0_#res.base_7| 0)) InVars {~__unbuffered_cnt~0=v_~__unbuffered_cnt~0_22} OutVars{P0Thread1of1ForFork0_#res.offset=|v_P0Thread1of1ForFork0_#res.offset_7|, P0Thread1of1ForFork0_#res.base=|v_P0Thread1of1ForFork0_#res.base_7|, ~__unbuffered_cnt~0=v_~__unbuffered_cnt~0_21} AuxVars[] AssignedVars[P0Thread1of1ForFork0_#res.offset, P0Thread1of1ForFork0_#res.base, ~__unbuffered_cnt~0][80], [130#L787true, Black: 188#(or (not (= 2 ~__unbuffered_p1_EAX~0)) (not (= 2 ~__unbuffered_p3_EAX~0)) (not (= ~__unbuffered_p1_EBX~0 0)) (not (= 2 ~x~0)) (not (= ~__unbuffered_p3_EBX~0 0)) (not (= 2 ~z~0))), 18#P2EXITtrue, 170#(or (not (= 2 ~__unbuffered_p1_EAX~0)) (not (= 2 ~__unbuffered_p3_EAX~0)) (not (= ~__unbuffered_p1_EBX~0 0)) (not (= 2 ~x~0)) (not (= ~__unbuffered_p3_EBX~0 0)) (not (= 2 ~z~0))), Black: 164#(= ~__unbuffered_p1_EAX~0 0), 187#(= ~x~0 1), 155#true, Black: 169#(= ~__unbuffered_p3_EAX~0 0), 197#(= |ULTIMATE.start_assume_abort_if_not_#in~cond#1| 0), Black: 167#true, P1Thread1of1ForFork2InUse, P0Thread1of1ForFork0InUse, Black: 177#(= ~__unbuffered_cnt~0 0), 78#L2true, Black: 180#(and (= ~__unbuffered_cnt~0 0) (= |ULTIMATE.start_assume_abort_if_not_#in~cond#1| 0)), P2Thread1of1ForFork1InUse, Black: 178#(= |ULTIMATE.start_assume_abort_if_not_#in~cond#1| 0), 35#L835true, P3Thread1of1ForFork3InUse, 127#P0EXITtrue, Black: 185#true]) [2023-08-26 12:01:52,451 INFO L294 olderBase$Statistics]: this new event has 22 ancestors and is cut-off event [2023-08-26 12:01:52,451 INFO L297 olderBase$Statistics]: existing Event has 22 ancestors and is cut-off event [2023-08-26 12:01:52,451 INFO L297 olderBase$Statistics]: existing Event has 22 ancestors and is cut-off event [2023-08-26 12:01:52,451 INFO L297 olderBase$Statistics]: existing Event has 22 ancestors and is cut-off event [2023-08-26 12:01:52,460 INFO L292 olderBase$Statistics]: inserting event number 4 for the transition-marking pair ([497] L756-->P0EXIT: Formula: (and (= v_~__unbuffered_cnt~0_21 (+ v_~__unbuffered_cnt~0_22 1)) (= |v_P0Thread1of1ForFork0_#res.offset_7| 0) (= |v_P0Thread1of1ForFork0_#res.base_7| 0)) InVars {~__unbuffered_cnt~0=v_~__unbuffered_cnt~0_22} OutVars{P0Thread1of1ForFork0_#res.offset=|v_P0Thread1of1ForFork0_#res.offset_7|, P0Thread1of1ForFork0_#res.base=|v_P0Thread1of1ForFork0_#res.base_7|, ~__unbuffered_cnt~0=v_~__unbuffered_cnt~0_21} AuxVars[] AssignedVars[P0Thread1of1ForFork0_#res.offset, P0Thread1of1ForFork0_#res.base, ~__unbuffered_cnt~0][124], [Black: 188#(or (not (= 2 ~__unbuffered_p1_EAX~0)) (not (= 2 ~__unbuffered_p3_EAX~0)) (not (= ~__unbuffered_p1_EBX~0 0)) (not (= 2 ~x~0)) (not (= ~__unbuffered_p3_EBX~0 0)) (not (= 2 ~z~0))), 18#P2EXITtrue, 170#(or (not (= 2 ~__unbuffered_p1_EAX~0)) (not (= 2 ~__unbuffered_p3_EAX~0)) (not (= ~__unbuffered_p1_EBX~0 0)) (not (= 2 ~x~0)) (not (= ~__unbuffered_p3_EBX~0 0)) (not (= 2 ~z~0))), 99#P1EXITtrue, Black: 164#(= ~__unbuffered_p1_EAX~0 0), 187#(= ~x~0 1), 155#true, Black: 169#(= ~__unbuffered_p3_EAX~0 0), 197#(= |ULTIMATE.start_assume_abort_if_not_#in~cond#1| 0), Black: 167#true, P1Thread1of1ForFork2InUse, P0Thread1of1ForFork0InUse, Black: 177#(= ~__unbuffered_cnt~0 0), Black: 180#(and (= ~__unbuffered_cnt~0 0) (= |ULTIMATE.start_assume_abort_if_not_#in~cond#1| 0)), 78#L2true, P2Thread1of1ForFork1InUse, Black: 178#(= |ULTIMATE.start_assume_abort_if_not_#in~cond#1| 0), 35#L835true, P3Thread1of1ForFork3InUse, 127#P0EXITtrue, Black: 185#true]) [2023-08-26 12:01:52,460 INFO L294 olderBase$Statistics]: this new event has 23 ancestors and is cut-off event [2023-08-26 12:01:52,460 INFO L297 olderBase$Statistics]: existing Event has 23 ancestors and is cut-off event [2023-08-26 12:01:52,460 INFO L297 olderBase$Statistics]: existing Event has 23 ancestors and is cut-off event [2023-08-26 12:01:52,460 INFO L297 olderBase$Statistics]: existing Event has 23 ancestors and is cut-off event [2023-08-26 12:01:52,475 INFO L292 olderBase$Statistics]: inserting event number 4 for the transition-marking pair ([428] L835-->L842: Formula: (let ((.cse1 (not (= (mod v_~y$w_buff0_used~0_117 256) 0))) (.cse5 (not (= (mod v_~y$r_buff0_thd4~0_26 256) 0))) (.cse0 (not (= (mod v_~y$r_buff1_thd4~0_22 256) 0)))) (let ((.cse2 (and (not (= (mod v_~y$w_buff1_used~0_103 256) 0)) .cse0)) (.cse4 (and (not (= (mod v_~y$w_buff0_used~0_118 256) 0)) .cse5)) (.cse3 (and .cse1 .cse5))) (and (= (ite (or (and (not (= (mod v_~y$w_buff1_used~0_102 256) 0)) .cse0) (and (not (= (mod v_~y$r_buff0_thd4~0_25 256) 0)) .cse1)) 0 v_~y$r_buff1_thd4~0_22) v_~y$r_buff1_thd4~0_21) (= (ite (or .cse2 .cse3) 0 v_~y$w_buff1_used~0_103) v_~y$w_buff1_used~0_102) (= v_~y~0_72 (ite .cse4 v_~y$w_buff0~0_54 (ite .cse2 v_~y$w_buff1~0_47 v_~y~0_73))) (= v_~y$w_buff0_used~0_117 (ite .cse4 0 v_~y$w_buff0_used~0_118)) (= v_~y$r_buff0_thd4~0_25 (ite .cse3 0 v_~y$r_buff0_thd4~0_26))))) InVars {~y$r_buff0_thd4~0=v_~y$r_buff0_thd4~0_26, ~y$r_buff1_thd4~0=v_~y$r_buff1_thd4~0_22, ~y$w_buff0_used~0=v_~y$w_buff0_used~0_118, ~y$w_buff1~0=v_~y$w_buff1~0_47, ~y$w_buff0~0=v_~y$w_buff0~0_54, ~y~0=v_~y~0_73, ~y$w_buff1_used~0=v_~y$w_buff1_used~0_103} OutVars{~y$r_buff0_thd4~0=v_~y$r_buff0_thd4~0_25, ~y$r_buff1_thd4~0=v_~y$r_buff1_thd4~0_21, ~y$w_buff0_used~0=v_~y$w_buff0_used~0_117, ~y$w_buff1~0=v_~y$w_buff1~0_47, ~y$w_buff0~0=v_~y$w_buff0~0_54, ~y~0=v_~y~0_72, ~y$w_buff1_used~0=v_~y$w_buff1_used~0_102} AuxVars[] AssignedVars[~y$r_buff0_thd4~0, ~y$r_buff1_thd4~0, ~y$w_buff0_used~0, ~y~0, ~y$w_buff1_used~0][112], [Black: 188#(or (not (= 2 ~__unbuffered_p1_EAX~0)) (not (= 2 ~__unbuffered_p3_EAX~0)) (not (= ~__unbuffered_p1_EBX~0 0)) (not (= 2 ~x~0)) (not (= ~__unbuffered_p3_EBX~0 0)) (not (= 2 ~z~0))), 18#P2EXITtrue, 99#P1EXITtrue, Black: 164#(= ~__unbuffered_p1_EAX~0 0), 187#(= ~x~0 1), Black: 170#(or (not (= 2 ~__unbuffered_p1_EAX~0)) (not (= 2 ~__unbuffered_p3_EAX~0)) (not (= ~__unbuffered_p1_EBX~0 0)) (not (= 2 ~x~0)) (not (= ~__unbuffered_p3_EBX~0 0)) (not (= 2 ~z~0))), 155#true, Black: 169#(= ~__unbuffered_p3_EAX~0 0), 167#true, 197#(= |ULTIMATE.start_assume_abort_if_not_#in~cond#1| 0), P1Thread1of1ForFork2InUse, P0Thread1of1ForFork0InUse, 61#L756true, Black: 177#(= ~__unbuffered_cnt~0 0), 78#L2true, P2Thread1of1ForFork1InUse, Black: 180#(and (= ~__unbuffered_cnt~0 0) (= |ULTIMATE.start_assume_abort_if_not_#in~cond#1| 0)), Black: 178#(= |ULTIMATE.start_assume_abort_if_not_#in~cond#1| 0), P3Thread1of1ForFork3InUse, 46#L842true, Black: 185#true]) [2023-08-26 12:01:52,475 INFO L294 olderBase$Statistics]: this new event has 23 ancestors and is cut-off event [2023-08-26 12:01:52,475 INFO L297 olderBase$Statistics]: existing Event has 23 ancestors and is cut-off event [2023-08-26 12:01:52,475 INFO L297 olderBase$Statistics]: existing Event has 23 ancestors and is cut-off event [2023-08-26 12:01:52,475 INFO L297 olderBase$Statistics]: existing Event has 23 ancestors and is cut-off event [2023-08-26 12:01:52,573 INFO L124 PetriNetUnfolderBase]: 4722/7528 cut-off events. [2023-08-26 12:01:52,574 INFO L125 PetriNetUnfolderBase]: For 10563/11276 co-relation queries the response was YES. [2023-08-26 12:01:52,597 INFO L83 FinitePrefix]: Finished finitePrefix Result has 25609 conditions, 7528 events. 4722/7528 cut-off events. For 10563/11276 co-relation queries the response was YES. Maximal size of possible extension queue 481. Compared 49731 event pairs, 613 based on Foata normal form. 799/8079 useless extension candidates. Maximal degree in co-relation 25596. Up to 3028 conditions per place. [2023-08-26 12:01:52,622 INFO L140 encePairwiseOnDemand]: 281/288 looper letters, 99 selfloop transitions, 14 changer transitions 2/130 dead transitions. [2023-08-26 12:01:52,622 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 58 places, 130 transitions, 997 flow [2023-08-26 12:01:52,623 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2023-08-26 12:01:52,623 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 6 states. [2023-08-26 12:01:52,624 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6 states to 6 states and 799 transitions. [2023-08-26 12:01:52,625 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.46238425925925924 [2023-08-26 12:01:52,625 INFO L72 ComplementDD]: Start complementDD. Operand 6 states and 799 transitions. [2023-08-26 12:01:52,625 INFO L73 IsDeterministic]: Start isDeterministic. Operand 6 states and 799 transitions. [2023-08-26 12:01:52,626 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2023-08-26 12:01:52,626 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 6 states and 799 transitions. [2023-08-26 12:01:52,627 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 7 states, 6 states have (on average 133.16666666666666) internal successors, (799), 6 states have internal predecessors, (799), 0 states have call successors, (0), 0 states 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 12:01:52,630 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 7 states, 7 states have (on average 288.0) internal successors, (2016), 7 states have internal predecessors, (2016), 0 states have call successors, (0), 0 states 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 12:01:52,630 INFO L81 ComplementDD]: Finished complementDD. Result has 7 states, 7 states have (on average 288.0) internal successors, (2016), 7 states have internal predecessors, (2016), 0 states have call successors, (0), 0 states 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 12:01:52,630 INFO L175 Difference]: Start difference. First operand has 55 places, 49 transitions, 309 flow. Second operand 6 states and 799 transitions. [2023-08-26 12:01:52,631 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 58 places, 130 transitions, 997 flow [2023-08-26 12:01:52,671 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 57 places, 130 transitions, 995 flow, removed 1 selfloop flow, removed 1 redundant places. [2023-08-26 12:01:52,673 INFO L231 Difference]: Finished difference. Result has 60 places, 58 transitions, 427 flow [2023-08-26 12:01:52,673 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=288, PETRI_DIFFERENCE_MINUEND_FLOW=307, PETRI_DIFFERENCE_MINUEND_PLACES=52, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=49, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=5, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=39, PETRI_DIFFERENCE_SUBTRAHEND_STATES=6, PETRI_FLOW=427, PETRI_PLACES=60, PETRI_TRANSITIONS=58} [2023-08-26 12:01:52,673 INFO L281 CegarLoopForPetriNet]: 50 programPoint places, 10 predicate places. [2023-08-26 12:01:52,673 INFO L495 AbstractCegarLoop]: Abstraction has has 60 places, 58 transitions, 427 flow [2023-08-26 12:01:52,674 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 123.0) internal successors, (615), 5 states have internal predecessors, (615), 0 states have call successors, (0), 0 states 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 12:01:52,674 INFO L200 CegarLoopForPetriNet]: Found error trace [2023-08-26 12:01:52,674 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 12:01:52,743 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable6 [2023-08-26 12:01:52,743 INFO L420 AbstractCegarLoop]: === Iteration 8 === Targeting ULTIMATE.startErr8ASSERT_VIOLATIONASSERT === [P2Err0ASSERT_VIOLATIONASSERT, ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 12 more)] === [2023-08-26 12:01:52,743 INFO L145 PredicateUnifier]: Initialized classic predicate unifier [2023-08-26 12:01:52,743 INFO L85 PathProgramCache]: Analyzing trace with hash 1150542503, now seen corresponding path program 1 times [2023-08-26 12:01:52,743 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-08-26 12:01:52,743 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1229310419] [2023-08-26 12:01:52,743 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-08-26 12:01:52,744 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-08-26 12:01:52,785 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-08-26 12:01:53,008 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 12:01:53,008 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-08-26 12:01:53,008 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1229310419] [2023-08-26 12:01:53,008 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1229310419] provided 1 perfect and 0 imperfect interpolant sequences [2023-08-26 12:01:53,009 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-08-26 12:01:53,009 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2023-08-26 12:01:53,009 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [54900245] [2023-08-26 12:01:53,009 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-08-26 12:01:53,010 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2023-08-26 12:01:53,010 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-08-26 12:01:53,010 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2023-08-26 12:01:53,011 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=12, Invalid=18, Unknown=0, NotChecked=0, Total=30 [2023-08-26 12:01:53,011 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 120 out of 288 [2023-08-26 12:01:53,012 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 60 places, 58 transitions, 427 flow. Second operand has 6 states, 6 states have (on average 122.83333333333333) internal successors, (737), 6 states have internal predecessors, (737), 0 states have call successors, (0), 0 states 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 12:01:53,012 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2023-08-26 12:01:53,012 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 120 of 288 [2023-08-26 12:01:53,012 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2023-08-26 12:01:53,667 INFO L292 olderBase$Statistics]: inserting event number 4 for the transition-marking pair ([428] L835-->L842: Formula: (let ((.cse1 (not (= (mod v_~y$w_buff0_used~0_117 256) 0))) (.cse5 (not (= (mod v_~y$r_buff0_thd4~0_26 256) 0))) (.cse0 (not (= (mod v_~y$r_buff1_thd4~0_22 256) 0)))) (let ((.cse2 (and (not (= (mod v_~y$w_buff1_used~0_103 256) 0)) .cse0)) (.cse4 (and (not (= (mod v_~y$w_buff0_used~0_118 256) 0)) .cse5)) (.cse3 (and .cse1 .cse5))) (and (= (ite (or (and (not (= (mod v_~y$w_buff1_used~0_102 256) 0)) .cse0) (and (not (= (mod v_~y$r_buff0_thd4~0_25 256) 0)) .cse1)) 0 v_~y$r_buff1_thd4~0_22) v_~y$r_buff1_thd4~0_21) (= (ite (or .cse2 .cse3) 0 v_~y$w_buff1_used~0_103) v_~y$w_buff1_used~0_102) (= v_~y~0_72 (ite .cse4 v_~y$w_buff0~0_54 (ite .cse2 v_~y$w_buff1~0_47 v_~y~0_73))) (= v_~y$w_buff0_used~0_117 (ite .cse4 0 v_~y$w_buff0_used~0_118)) (= v_~y$r_buff0_thd4~0_25 (ite .cse3 0 v_~y$r_buff0_thd4~0_26))))) InVars {~y$r_buff0_thd4~0=v_~y$r_buff0_thd4~0_26, ~y$r_buff1_thd4~0=v_~y$r_buff1_thd4~0_22, ~y$w_buff0_used~0=v_~y$w_buff0_used~0_118, ~y$w_buff1~0=v_~y$w_buff1~0_47, ~y$w_buff0~0=v_~y$w_buff0~0_54, ~y~0=v_~y~0_73, ~y$w_buff1_used~0=v_~y$w_buff1_used~0_103} OutVars{~y$r_buff0_thd4~0=v_~y$r_buff0_thd4~0_25, ~y$r_buff1_thd4~0=v_~y$r_buff1_thd4~0_21, ~y$w_buff0_used~0=v_~y$w_buff0_used~0_117, ~y$w_buff1~0=v_~y$w_buff1~0_47, ~y$w_buff0~0=v_~y$w_buff0~0_54, ~y~0=v_~y~0_72, ~y$w_buff1_used~0=v_~y$w_buff1_used~0_102} AuxVars[] AssignedVars[~y$r_buff0_thd4~0, ~y$r_buff1_thd4~0, ~y$w_buff0_used~0, ~y~0, ~y$w_buff1_used~0][67], [130#L787true, Black: 188#(or (not (= 2 ~__unbuffered_p1_EAX~0)) (not (= 2 ~__unbuffered_p3_EAX~0)) (not (= ~__unbuffered_p1_EBX~0 0)) (not (= 2 ~x~0)) (not (= ~__unbuffered_p3_EBX~0 0)) (not (= 2 ~z~0))), 18#P2EXITtrue, Black: 164#(= ~__unbuffered_p1_EAX~0 0), Black: 196#(<= ~__unbuffered_cnt~0 1), Black: 197#(= |ULTIMATE.start_assume_abort_if_not_#in~cond#1| 0), 187#(= ~x~0 1), Black: 170#(or (not (= 2 ~__unbuffered_p1_EAX~0)) (not (= 2 ~__unbuffered_p3_EAX~0)) (not (= ~__unbuffered_p1_EBX~0 0)) (not (= 2 ~x~0)) (not (= ~__unbuffered_p3_EBX~0 0)) (not (= 2 ~z~0))), 155#true, Black: 169#(= ~__unbuffered_p3_EAX~0 0), 167#true, 211#(and (<= ~__unbuffered_cnt~0 1) (= |ULTIMATE.start_assume_abort_if_not_#in~cond#1| 0)), P1Thread1of1ForFork2InUse, P0Thread1of1ForFork0InUse, 61#L756true, Black: 177#(= ~__unbuffered_cnt~0 0), Black: 180#(and (= ~__unbuffered_cnt~0 0) (= |ULTIMATE.start_assume_abort_if_not_#in~cond#1| 0)), P2Thread1of1ForFork1InUse, 199#(and (<= ~__unbuffered_cnt~0 1) (= |ULTIMATE.start_assume_abort_if_not_#in~cond#1| 0)), 78#L2true, P3Thread1of1ForFork3InUse, 46#L842true, Black: 185#true]) [2023-08-26 12:01:53,667 INFO L294 olderBase$Statistics]: this new event has 22 ancestors and is cut-off event [2023-08-26 12:01:53,667 INFO L297 olderBase$Statistics]: existing Event has 22 ancestors and is cut-off event [2023-08-26 12:01:53,667 INFO L297 olderBase$Statistics]: existing Event has 22 ancestors and is cut-off event [2023-08-26 12:01:53,667 INFO L297 olderBase$Statistics]: existing Event has 22 ancestors and is cut-off event [2023-08-26 12:01:53,695 INFO L292 olderBase$Statistics]: inserting event number 4 for the transition-marking pair ([497] L756-->P0EXIT: Formula: (and (= v_~__unbuffered_cnt~0_21 (+ v_~__unbuffered_cnt~0_22 1)) (= |v_P0Thread1of1ForFork0_#res.offset_7| 0) (= |v_P0Thread1of1ForFork0_#res.base_7| 0)) InVars {~__unbuffered_cnt~0=v_~__unbuffered_cnt~0_22} OutVars{P0Thread1of1ForFork0_#res.offset=|v_P0Thread1of1ForFork0_#res.offset_7|, P0Thread1of1ForFork0_#res.base=|v_P0Thread1of1ForFork0_#res.base_7|, ~__unbuffered_cnt~0=v_~__unbuffered_cnt~0_21} AuxVars[] AssignedVars[P0Thread1of1ForFork0_#res.offset, P0Thread1of1ForFork0_#res.base, ~__unbuffered_cnt~0][80], [130#L787true, Black: 188#(or (not (= 2 ~__unbuffered_p1_EAX~0)) (not (= 2 ~__unbuffered_p3_EAX~0)) (not (= ~__unbuffered_p1_EBX~0 0)) (not (= 2 ~x~0)) (not (= ~__unbuffered_p3_EBX~0 0)) (not (= 2 ~z~0))), 18#P2EXITtrue, 170#(or (not (= 2 ~__unbuffered_p1_EAX~0)) (not (= 2 ~__unbuffered_p3_EAX~0)) (not (= ~__unbuffered_p1_EBX~0 0)) (not (= 2 ~x~0)) (not (= ~__unbuffered_p3_EBX~0 0)) (not (= 2 ~z~0))), Black: 164#(= ~__unbuffered_p1_EAX~0 0), Black: 199#(and (<= ~__unbuffered_cnt~0 1) (= |ULTIMATE.start_assume_abort_if_not_#in~cond#1| 0)), 213#(and (<= ~__unbuffered_cnt~0 2) (= |ULTIMATE.start_assume_abort_if_not_#in~cond#1| 0)), Black: 196#(<= ~__unbuffered_cnt~0 1), 187#(= ~x~0 1), 155#true, Black: 169#(= ~__unbuffered_p3_EAX~0 0), 197#(= |ULTIMATE.start_assume_abort_if_not_#in~cond#1| 0), Black: 167#true, P1Thread1of1ForFork2InUse, P0Thread1of1ForFork0InUse, Black: 177#(= ~__unbuffered_cnt~0 0), P2Thread1of1ForFork1InUse, Black: 180#(and (= ~__unbuffered_cnt~0 0) (= |ULTIMATE.start_assume_abort_if_not_#in~cond#1| 0)), 78#L2true, 35#L835true, P3Thread1of1ForFork3InUse, 127#P0EXITtrue, Black: 185#true]) [2023-08-26 12:01:53,695 INFO L294 olderBase$Statistics]: this new event has 22 ancestors and is cut-off event [2023-08-26 12:01:53,695 INFO L297 olderBase$Statistics]: existing Event has 22 ancestors and is cut-off event [2023-08-26 12:01:53,695 INFO L297 olderBase$Statistics]: existing Event has 22 ancestors and is cut-off event [2023-08-26 12:01:53,695 INFO L297 olderBase$Statistics]: existing Event has 22 ancestors and is cut-off event [2023-08-26 12:01:53,703 INFO L292 olderBase$Statistics]: inserting event number 4 for the transition-marking pair ([497] L756-->P0EXIT: Formula: (and (= v_~__unbuffered_cnt~0_21 (+ v_~__unbuffered_cnt~0_22 1)) (= |v_P0Thread1of1ForFork0_#res.offset_7| 0) (= |v_P0Thread1of1ForFork0_#res.base_7| 0)) InVars {~__unbuffered_cnt~0=v_~__unbuffered_cnt~0_22} OutVars{P0Thread1of1ForFork0_#res.offset=|v_P0Thread1of1ForFork0_#res.offset_7|, P0Thread1of1ForFork0_#res.base=|v_P0Thread1of1ForFork0_#res.base_7|, ~__unbuffered_cnt~0=v_~__unbuffered_cnt~0_21} AuxVars[] AssignedVars[P0Thread1of1ForFork0_#res.offset, P0Thread1of1ForFork0_#res.base, ~__unbuffered_cnt~0][126], [Black: 188#(or (not (= 2 ~__unbuffered_p1_EAX~0)) (not (= 2 ~__unbuffered_p3_EAX~0)) (not (= ~__unbuffered_p1_EBX~0 0)) (not (= 2 ~x~0)) (not (= ~__unbuffered_p3_EBX~0 0)) (not (= 2 ~z~0))), 18#P2EXITtrue, 170#(or (not (= 2 ~__unbuffered_p1_EAX~0)) (not (= 2 ~__unbuffered_p3_EAX~0)) (not (= ~__unbuffered_p1_EBX~0 0)) (not (= 2 ~x~0)) (not (= ~__unbuffered_p3_EBX~0 0)) (not (= 2 ~z~0))), 99#P1EXITtrue, Black: 164#(= ~__unbuffered_p1_EAX~0 0), Black: 199#(and (<= ~__unbuffered_cnt~0 1) (= |ULTIMATE.start_assume_abort_if_not_#in~cond#1| 0)), Black: 196#(<= ~__unbuffered_cnt~0 1), 187#(= ~x~0 1), 155#true, Black: 169#(= ~__unbuffered_p3_EAX~0 0), 209#(= |ULTIMATE.start_assume_abort_if_not_#in~cond#1| 0), 197#(= |ULTIMATE.start_assume_abort_if_not_#in~cond#1| 0), Black: 167#true, P1Thread1of1ForFork2InUse, P0Thread1of1ForFork0InUse, Black: 177#(= ~__unbuffered_cnt~0 0), Black: 180#(and (= ~__unbuffered_cnt~0 0) (= |ULTIMATE.start_assume_abort_if_not_#in~cond#1| 0)), 78#L2true, P2Thread1of1ForFork1InUse, 35#L835true, P3Thread1of1ForFork3InUse, 127#P0EXITtrue, Black: 185#true]) [2023-08-26 12:01:53,703 INFO L294 olderBase$Statistics]: this new event has 23 ancestors and is cut-off event [2023-08-26 12:01:53,703 INFO L297 olderBase$Statistics]: existing Event has 23 ancestors and is cut-off event [2023-08-26 12:01:53,703 INFO L297 olderBase$Statistics]: existing Event has 23 ancestors and is cut-off event [2023-08-26 12:01:53,703 INFO L297 olderBase$Statistics]: existing Event has 23 ancestors and is cut-off event [2023-08-26 12:01:53,713 INFO L292 olderBase$Statistics]: inserting event number 4 for the transition-marking pair ([428] L835-->L842: Formula: (let ((.cse1 (not (= (mod v_~y$w_buff0_used~0_117 256) 0))) (.cse5 (not (= (mod v_~y$r_buff0_thd4~0_26 256) 0))) (.cse0 (not (= (mod v_~y$r_buff1_thd4~0_22 256) 0)))) (let ((.cse2 (and (not (= (mod v_~y$w_buff1_used~0_103 256) 0)) .cse0)) (.cse4 (and (not (= (mod v_~y$w_buff0_used~0_118 256) 0)) .cse5)) (.cse3 (and .cse1 .cse5))) (and (= (ite (or (and (not (= (mod v_~y$w_buff1_used~0_102 256) 0)) .cse0) (and (not (= (mod v_~y$r_buff0_thd4~0_25 256) 0)) .cse1)) 0 v_~y$r_buff1_thd4~0_22) v_~y$r_buff1_thd4~0_21) (= (ite (or .cse2 .cse3) 0 v_~y$w_buff1_used~0_103) v_~y$w_buff1_used~0_102) (= v_~y~0_72 (ite .cse4 v_~y$w_buff0~0_54 (ite .cse2 v_~y$w_buff1~0_47 v_~y~0_73))) (= v_~y$w_buff0_used~0_117 (ite .cse4 0 v_~y$w_buff0_used~0_118)) (= v_~y$r_buff0_thd4~0_25 (ite .cse3 0 v_~y$r_buff0_thd4~0_26))))) InVars {~y$r_buff0_thd4~0=v_~y$r_buff0_thd4~0_26, ~y$r_buff1_thd4~0=v_~y$r_buff1_thd4~0_22, ~y$w_buff0_used~0=v_~y$w_buff0_used~0_118, ~y$w_buff1~0=v_~y$w_buff1~0_47, ~y$w_buff0~0=v_~y$w_buff0~0_54, ~y~0=v_~y~0_73, ~y$w_buff1_used~0=v_~y$w_buff1_used~0_103} OutVars{~y$r_buff0_thd4~0=v_~y$r_buff0_thd4~0_25, ~y$r_buff1_thd4~0=v_~y$r_buff1_thd4~0_21, ~y$w_buff0_used~0=v_~y$w_buff0_used~0_117, ~y$w_buff1~0=v_~y$w_buff1~0_47, ~y$w_buff0~0=v_~y$w_buff0~0_54, ~y~0=v_~y~0_72, ~y$w_buff1_used~0=v_~y$w_buff1_used~0_102} AuxVars[] AssignedVars[~y$r_buff0_thd4~0, ~y$r_buff1_thd4~0, ~y$w_buff0_used~0, ~y~0, ~y$w_buff1_used~0][112], [Black: 188#(or (not (= 2 ~__unbuffered_p1_EAX~0)) (not (= 2 ~__unbuffered_p3_EAX~0)) (not (= ~__unbuffered_p1_EBX~0 0)) (not (= 2 ~x~0)) (not (= ~__unbuffered_p3_EBX~0 0)) (not (= 2 ~z~0))), 18#P2EXITtrue, 99#P1EXITtrue, Black: 164#(= ~__unbuffered_p1_EAX~0 0), Black: 199#(and (<= ~__unbuffered_cnt~0 1) (= |ULTIMATE.start_assume_abort_if_not_#in~cond#1| 0)), 213#(and (<= ~__unbuffered_cnt~0 2) (= |ULTIMATE.start_assume_abort_if_not_#in~cond#1| 0)), Black: 196#(<= ~__unbuffered_cnt~0 1), 187#(= ~x~0 1), Black: 170#(or (not (= 2 ~__unbuffered_p1_EAX~0)) (not (= 2 ~__unbuffered_p3_EAX~0)) (not (= ~__unbuffered_p1_EBX~0 0)) (not (= 2 ~x~0)) (not (= ~__unbuffered_p3_EBX~0 0)) (not (= 2 ~z~0))), 155#true, Black: 169#(= ~__unbuffered_p3_EAX~0 0), 197#(= |ULTIMATE.start_assume_abort_if_not_#in~cond#1| 0), 167#true, P1Thread1of1ForFork2InUse, P0Thread1of1ForFork0InUse, 61#L756true, Black: 177#(= ~__unbuffered_cnt~0 0), Black: 180#(and (= ~__unbuffered_cnt~0 0) (= |ULTIMATE.start_assume_abort_if_not_#in~cond#1| 0)), P2Thread1of1ForFork1InUse, 78#L2true, P3Thread1of1ForFork3InUse, 46#L842true, Black: 185#true]) [2023-08-26 12:01:53,713 INFO L294 olderBase$Statistics]: this new event has 23 ancestors and is cut-off event [2023-08-26 12:01:53,713 INFO L297 olderBase$Statistics]: existing Event has 23 ancestors and is cut-off event [2023-08-26 12:01:53,713 INFO L297 olderBase$Statistics]: existing Event has 23 ancestors and is cut-off event [2023-08-26 12:01:53,714 INFO L297 olderBase$Statistics]: existing Event has 23 ancestors and is cut-off event [2023-08-26 12:01:53,770 INFO L124 PetriNetUnfolderBase]: 4182/6720 cut-off events. [2023-08-26 12:01:53,771 INFO L125 PetriNetUnfolderBase]: For 14207/15219 co-relation queries the response was YES. [2023-08-26 12:01:53,792 INFO L83 FinitePrefix]: Finished finitePrefix Result has 27443 conditions, 6720 events. 4182/6720 cut-off events. For 14207/15219 co-relation queries the response was YES. Maximal size of possible extension queue 448. Compared 44361 event pairs, 459 based on Foata normal form. 498/7006 useless extension candidates. Maximal degree in co-relation 27427. Up to 2814 conditions per place. [2023-08-26 12:01:53,866 INFO L140 encePairwiseOnDemand]: 281/288 looper letters, 110 selfloop transitions, 23 changer transitions 15/163 dead transitions. [2023-08-26 12:01:53,866 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 67 places, 163 transitions, 1357 flow [2023-08-26 12:01:53,867 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2023-08-26 12:01:53,867 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 8 states. [2023-08-26 12:01:53,869 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 8 states to 8 states and 1064 transitions. [2023-08-26 12:01:53,870 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.4618055555555556 [2023-08-26 12:01:53,870 INFO L72 ComplementDD]: Start complementDD. Operand 8 states and 1064 transitions. [2023-08-26 12:01:53,870 INFO L73 IsDeterministic]: Start isDeterministic. Operand 8 states and 1064 transitions. [2023-08-26 12:01:53,871 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2023-08-26 12:01:53,871 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 8 states and 1064 transitions. [2023-08-26 12:01:53,874 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 9 states, 8 states have (on average 133.0) internal successors, (1064), 8 states have internal predecessors, (1064), 0 states have call successors, (0), 0 states 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 12:01:53,879 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 9 states, 9 states have (on average 288.0) internal successors, (2592), 9 states have internal predecessors, (2592), 0 states have call successors, (0), 0 states 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 12:01:53,879 INFO L81 ComplementDD]: Finished complementDD. Result has 9 states, 9 states have (on average 288.0) internal successors, (2592), 9 states have internal predecessors, (2592), 0 states have call successors, (0), 0 states 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 12:01:53,880 INFO L175 Difference]: Start difference. First operand has 60 places, 58 transitions, 427 flow. Second operand 8 states and 1064 transitions. [2023-08-26 12:01:53,880 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 67 places, 163 transitions, 1357 flow [2023-08-26 12:01:54,116 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 65 places, 163 transitions, 1313 flow, removed 17 selfloop flow, removed 2 redundant places. [2023-08-26 12:01:54,118 INFO L231 Difference]: Finished difference. Result has 68 places, 67 transitions, 551 flow [2023-08-26 12:01:54,118 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=288, PETRI_DIFFERENCE_MINUEND_FLOW=383, PETRI_DIFFERENCE_MINUEND_PLACES=58, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=58, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=18, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=39, PETRI_DIFFERENCE_SUBTRAHEND_STATES=8, PETRI_FLOW=551, PETRI_PLACES=68, PETRI_TRANSITIONS=67} [2023-08-26 12:01:54,118 INFO L281 CegarLoopForPetriNet]: 50 programPoint places, 18 predicate places. [2023-08-26 12:01:54,119 INFO L495 AbstractCegarLoop]: Abstraction has has 68 places, 67 transitions, 551 flow [2023-08-26 12:01:54,119 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 122.83333333333333) internal successors, (737), 6 states have internal predecessors, (737), 0 states have call successors, (0), 0 states 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 12:01:54,119 INFO L200 CegarLoopForPetriNet]: Found error trace [2023-08-26 12:01:54,119 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 12:01:54,119 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable7 [2023-08-26 12:01:54,119 INFO L420 AbstractCegarLoop]: === Iteration 9 === Targeting ULTIMATE.startErr8ASSERT_VIOLATIONASSERT === [P2Err0ASSERT_VIOLATIONASSERT, ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 12 more)] === [2023-08-26 12:01:54,120 INFO L145 PredicateUnifier]: Initialized classic predicate unifier [2023-08-26 12:01:54,120 INFO L85 PathProgramCache]: Analyzing trace with hash -19784083, now seen corresponding path program 1 times [2023-08-26 12:01:54,120 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-08-26 12:01:54,120 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2078065747] [2023-08-26 12:01:54,120 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-08-26 12:01:54,120 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-08-26 12:01:54,142 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-08-26 12:01:54,338 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 12:01:54,338 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-08-26 12:01:54,338 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2078065747] [2023-08-26 12:01:54,338 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2078065747] provided 1 perfect and 0 imperfect interpolant sequences [2023-08-26 12:01:54,339 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-08-26 12:01:54,339 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2023-08-26 12:01:54,339 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1313049505] [2023-08-26 12:01:54,339 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-08-26 12:01:54,339 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2023-08-26 12:01:54,339 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-08-26 12:01:54,340 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2023-08-26 12:01:54,340 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2023-08-26 12:01:54,340 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 112 out of 288 [2023-08-26 12:01:54,341 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 68 places, 67 transitions, 551 flow. Second operand has 4 states, 4 states have (on average 117.75) internal successors, (471), 4 states have internal predecessors, (471), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-26 12:01:54,341 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2023-08-26 12:01:54,341 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 112 of 288 [2023-08-26 12:01:54,341 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2023-08-26 12:01:55,559 INFO L124 PetriNetUnfolderBase]: 7839/11860 cut-off events. [2023-08-26 12:01:55,560 INFO L125 PetriNetUnfolderBase]: For 40448/40448 co-relation queries the response was YES. [2023-08-26 12:01:55,608 INFO L83 FinitePrefix]: Finished finitePrefix Result has 51992 conditions, 11860 events. 7839/11860 cut-off events. For 40448/40448 co-relation queries the response was YES. Maximal size of possible extension queue 475. Compared 71948 event pairs, 882 based on Foata normal form. 11/11871 useless extension candidates. Maximal degree in co-relation 51973. Up to 5562 conditions per place. [2023-08-26 12:01:55,635 INFO L140 encePairwiseOnDemand]: 277/288 looper letters, 107 selfloop transitions, 36 changer transitions 43/186 dead transitions. [2023-08-26 12:01:55,636 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 72 places, 186 transitions, 1878 flow [2023-08-26 12:01:55,636 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2023-08-26 12:01:55,636 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 5 states. [2023-08-26 12:01:55,638 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 651 transitions. [2023-08-26 12:01:55,638 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.45208333333333334 [2023-08-26 12:01:55,638 INFO L72 ComplementDD]: Start complementDD. Operand 5 states and 651 transitions. [2023-08-26 12:01:55,638 INFO L73 IsDeterministic]: Start isDeterministic. Operand 5 states and 651 transitions. [2023-08-26 12:01:55,639 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2023-08-26 12:01:55,639 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 5 states and 651 transitions. [2023-08-26 12:01:55,641 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 6 states, 5 states have (on average 130.2) internal successors, (651), 5 states have internal predecessors, (651), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-26 12:01:55,643 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 6 states, 6 states have (on average 288.0) internal successors, (1728), 6 states have internal predecessors, (1728), 0 states have call successors, (0), 0 states 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 12:01:55,643 INFO L81 ComplementDD]: Finished complementDD. Result has 6 states, 6 states have (on average 288.0) internal successors, (1728), 6 states have internal predecessors, (1728), 0 states have call successors, (0), 0 states 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 12:01:55,643 INFO L175 Difference]: Start difference. First operand has 68 places, 67 transitions, 551 flow. Second operand 5 states and 651 transitions. [2023-08-26 12:01:55,643 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 72 places, 186 transitions, 1878 flow [2023-08-26 12:01:56,410 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 68 places, 186 transitions, 1549 flow, removed 132 selfloop flow, removed 4 redundant places. [2023-08-26 12:01:56,413 INFO L231 Difference]: Finished difference. Result has 71 places, 79 transitions, 712 flow [2023-08-26 12:01:56,413 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=288, PETRI_DIFFERENCE_MINUEND_FLOW=454, PETRI_DIFFERENCE_MINUEND_PLACES=64, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=67, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=14, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=42, PETRI_DIFFERENCE_SUBTRAHEND_STATES=5, PETRI_FLOW=712, PETRI_PLACES=71, PETRI_TRANSITIONS=79} [2023-08-26 12:01:56,414 INFO L281 CegarLoopForPetriNet]: 50 programPoint places, 21 predicate places. [2023-08-26 12:01:56,414 INFO L495 AbstractCegarLoop]: Abstraction has has 71 places, 79 transitions, 712 flow [2023-08-26 12:01:56,414 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 117.75) internal successors, (471), 4 states have internal predecessors, (471), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-26 12:01:56,414 INFO L200 CegarLoopForPetriNet]: Found error trace [2023-08-26 12:01:56,414 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 12:01:56,415 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable8 [2023-08-26 12:01:56,415 INFO L420 AbstractCegarLoop]: === Iteration 10 === Targeting ULTIMATE.startErr8ASSERT_VIOLATIONASSERT === [P2Err0ASSERT_VIOLATIONASSERT, ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 12 more)] === [2023-08-26 12:01:56,415 INFO L145 PredicateUnifier]: Initialized classic predicate unifier [2023-08-26 12:01:56,415 INFO L85 PathProgramCache]: Analyzing trace with hash -21188411, now seen corresponding path program 2 times [2023-08-26 12:01:56,415 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-08-26 12:01:56,417 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [416632551] [2023-08-26 12:01:56,417 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-08-26 12:01:56,419 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-08-26 12:01:56,446 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-08-26 12:01:56,618 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 12:01:56,619 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-08-26 12:01:56,621 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [416632551] [2023-08-26 12:01:56,621 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [416632551] provided 1 perfect and 0 imperfect interpolant sequences [2023-08-26 12:01:56,621 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-08-26 12:01:56,621 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2023-08-26 12:01:56,621 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1818508541] [2023-08-26 12:01:56,621 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-08-26 12:01:56,622 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2023-08-26 12:01:56,622 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-08-26 12:01:56,623 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2023-08-26 12:01:56,623 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=8, Invalid=12, Unknown=0, NotChecked=0, Total=20 [2023-08-26 12:01:56,623 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 112 out of 288 [2023-08-26 12:01:56,624 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 71 places, 79 transitions, 712 flow. Second operand has 5 states, 5 states have (on average 116.6) internal successors, (583), 5 states have internal predecessors, (583), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-26 12:01:56,624 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2023-08-26 12:01:56,624 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 112 of 288 [2023-08-26 12:01:56,624 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2023-08-26 12:01:57,662 INFO L124 PetriNetUnfolderBase]: 5421/8357 cut-off events. [2023-08-26 12:01:57,662 INFO L125 PetriNetUnfolderBase]: For 26314/26314 co-relation queries the response was YES. [2023-08-26 12:01:57,680 INFO L83 FinitePrefix]: Finished finitePrefix Result has 37208 conditions, 8357 events. 5421/8357 cut-off events. For 26314/26314 co-relation queries the response was YES. Maximal size of possible extension queue 329. Compared 48634 event pairs, 604 based on Foata normal form. 11/8368 useless extension candidates. Maximal degree in co-relation 37186. Up to 2895 conditions per place. [2023-08-26 12:01:57,695 INFO L140 encePairwiseOnDemand]: 277/288 looper letters, 103 selfloop transitions, 32 changer transitions 49/184 dead transitions. [2023-08-26 12:01:57,695 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 72 places, 184 transitions, 1759 flow [2023-08-26 12:01:57,695 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2023-08-26 12:01:57,696 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 6 states. [2023-08-26 12:01:57,697 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6 states to 6 states and 777 transitions. [2023-08-26 12:01:57,698 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.4496527777777778 [2023-08-26 12:01:57,698 INFO L72 ComplementDD]: Start complementDD. Operand 6 states and 777 transitions. [2023-08-26 12:01:57,698 INFO L73 IsDeterministic]: Start isDeterministic. Operand 6 states and 777 transitions. [2023-08-26 12:01:57,698 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2023-08-26 12:01:57,698 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 6 states and 777 transitions. [2023-08-26 12:01:57,700 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 7 states, 6 states have (on average 129.5) internal successors, (777), 6 states have internal predecessors, (777), 0 states have call successors, (0), 0 states 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 12:01:57,703 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 7 states, 7 states have (on average 288.0) internal successors, (2016), 7 states have internal predecessors, (2016), 0 states have call successors, (0), 0 states 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 12:01:57,703 INFO L81 ComplementDD]: Finished complementDD. Result has 7 states, 7 states have (on average 288.0) internal successors, (2016), 7 states have internal predecessors, (2016), 0 states have call successors, (0), 0 states 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 12:01:57,703 INFO L175 Difference]: Start difference. First operand has 71 places, 79 transitions, 712 flow. Second operand 6 states and 777 transitions. [2023-08-26 12:01:57,703 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 72 places, 184 transitions, 1759 flow [2023-08-26 12:01:57,815 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 69 places, 184 transitions, 1729 flow, removed 15 selfloop flow, removed 3 redundant places. [2023-08-26 12:01:57,818 INFO L231 Difference]: Finished difference. Result has 70 places, 70 transitions, 676 flow [2023-08-26 12:01:57,818 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=288, PETRI_DIFFERENCE_MINUEND_FLOW=706, PETRI_DIFFERENCE_MINUEND_PLACES=64, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=79, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=32, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=47, PETRI_DIFFERENCE_SUBTRAHEND_STATES=6, PETRI_FLOW=676, PETRI_PLACES=70, PETRI_TRANSITIONS=70} [2023-08-26 12:01:57,819 INFO L281 CegarLoopForPetriNet]: 50 programPoint places, 20 predicate places. [2023-08-26 12:01:57,819 INFO L495 AbstractCegarLoop]: Abstraction has has 70 places, 70 transitions, 676 flow [2023-08-26 12:01:57,820 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 116.6) internal successors, (583), 5 states have internal predecessors, (583), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-26 12:01:57,820 INFO L200 CegarLoopForPetriNet]: Found error trace [2023-08-26 12:01:57,820 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 12:01:57,820 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable9 [2023-08-26 12:01:57,820 INFO L420 AbstractCegarLoop]: === Iteration 11 === Targeting ULTIMATE.startErr8ASSERT_VIOLATIONASSERT === [P2Err0ASSERT_VIOLATIONASSERT, ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 12 more)] === [2023-08-26 12:01:57,820 INFO L145 PredicateUnifier]: Initialized classic predicate unifier [2023-08-26 12:01:57,820 INFO L85 PathProgramCache]: Analyzing trace with hash -1182546491, now seen corresponding path program 3 times [2023-08-26 12:01:57,820 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-08-26 12:01:57,821 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [107375417] [2023-08-26 12:01:57,821 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-08-26 12:01:57,821 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-08-26 12:01:57,855 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-08-26 12:01:58,028 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 12:01:58,028 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-08-26 12:01:58,028 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [107375417] [2023-08-26 12:01:58,028 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [107375417] provided 1 perfect and 0 imperfect interpolant sequences [2023-08-26 12:01:58,028 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-08-26 12:01:58,028 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2023-08-26 12:01:58,029 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1910257249] [2023-08-26 12:01:58,029 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-08-26 12:01:58,029 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2023-08-26 12:01:58,029 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-08-26 12:01:58,029 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2023-08-26 12:01:58,030 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=17, Invalid=25, Unknown=0, NotChecked=0, Total=42 [2023-08-26 12:01:58,030 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 120 out of 288 [2023-08-26 12:01:58,031 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 70 places, 70 transitions, 676 flow. Second operand has 7 states, 7 states have (on average 122.71428571428571) internal successors, (859), 7 states have internal predecessors, (859), 0 states have call successors, (0), 0 states 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 12:01:58,031 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2023-08-26 12:01:58,031 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 120 of 288 [2023-08-26 12:01:58,031 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2023-08-26 12:01:58,512 INFO L124 PetriNetUnfolderBase]: 2510/4267 cut-off events. [2023-08-26 12:01:58,512 INFO L125 PetriNetUnfolderBase]: For 14245/14959 co-relation queries the response was YES. [2023-08-26 12:01:58,524 INFO L83 FinitePrefix]: Finished finitePrefix Result has 17886 conditions, 4267 events. 2510/4267 cut-off events. For 14245/14959 co-relation queries the response was YES. Maximal size of possible extension queue 270. Compared 27967 event pairs, 368 based on Foata normal form. 161/4311 useless extension candidates. Maximal degree in co-relation 17865. Up to 1578 conditions per place. [2023-08-26 12:01:58,529 INFO L140 encePairwiseOnDemand]: 281/288 looper letters, 43 selfloop transitions, 18 changer transitions 76/149 dead transitions. [2023-08-26 12:01:58,529 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 77 places, 149 transitions, 1602 flow [2023-08-26 12:01:58,530 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2023-08-26 12:01:58,530 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 8 states. [2023-08-26 12:01:58,532 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 8 states to 8 states and 1041 transitions. [2023-08-26 12:01:58,532 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.4518229166666667 [2023-08-26 12:01:58,532 INFO L72 ComplementDD]: Start complementDD. Operand 8 states and 1041 transitions. [2023-08-26 12:01:58,532 INFO L73 IsDeterministic]: Start isDeterministic. Operand 8 states and 1041 transitions. [2023-08-26 12:01:58,533 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2023-08-26 12:01:58,533 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 8 states and 1041 transitions. [2023-08-26 12:01:58,535 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 9 states, 8 states have (on average 130.125) internal successors, (1041), 8 states have internal predecessors, (1041), 0 states have call successors, (0), 0 states 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 12:01:58,538 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 9 states, 9 states have (on average 288.0) internal successors, (2592), 9 states have internal predecessors, (2592), 0 states have call successors, (0), 0 states 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 12:01:58,538 INFO L81 ComplementDD]: Finished complementDD. Result has 9 states, 9 states have (on average 288.0) internal successors, (2592), 9 states have internal predecessors, (2592), 0 states have call successors, (0), 0 states 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 12:01:58,539 INFO L175 Difference]: Start difference. First operand has 70 places, 70 transitions, 676 flow. Second operand 8 states and 1041 transitions. [2023-08-26 12:01:58,539 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 77 places, 149 transitions, 1602 flow [2023-08-26 12:01:58,634 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 69 places, 149 transitions, 1403 flow, removed 11 selfloop flow, removed 8 redundant places. [2023-08-26 12:01:58,636 INFO L231 Difference]: Finished difference. Result has 72 places, 49 transitions, 399 flow [2023-08-26 12:01:58,636 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=288, PETRI_DIFFERENCE_MINUEND_FLOW=573, PETRI_DIFFERENCE_MINUEND_PLACES=62, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=70, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=17, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=52, PETRI_DIFFERENCE_SUBTRAHEND_STATES=8, PETRI_FLOW=399, PETRI_PLACES=72, PETRI_TRANSITIONS=49} [2023-08-26 12:01:58,637 INFO L281 CegarLoopForPetriNet]: 50 programPoint places, 22 predicate places. [2023-08-26 12:01:58,637 INFO L495 AbstractCegarLoop]: Abstraction has has 72 places, 49 transitions, 399 flow [2023-08-26 12:01:58,637 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 7 states, 7 states have (on average 122.71428571428571) internal successors, (859), 7 states have internal predecessors, (859), 0 states have call successors, (0), 0 states 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 12:01:58,637 INFO L200 CegarLoopForPetriNet]: Found error trace [2023-08-26 12:01:58,637 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-08-26 12:01:58,637 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable10 [2023-08-26 12:01:58,637 INFO L420 AbstractCegarLoop]: === Iteration 12 === Targeting ULTIMATE.startErr8ASSERT_VIOLATIONASSERT === [P2Err0ASSERT_VIOLATIONASSERT, ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 12 more)] === [2023-08-26 12:01:58,638 INFO L145 PredicateUnifier]: Initialized classic predicate unifier [2023-08-26 12:01:58,638 INFO L85 PathProgramCache]: Analyzing trace with hash 414307624, now seen corresponding path program 1 times [2023-08-26 12:01:58,638 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-08-26 12:01:58,638 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1572524231] [2023-08-26 12:01:58,638 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-08-26 12:01:58,638 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-08-26 12:01:58,662 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-08-26 12:01:58,799 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 12:01:58,799 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-08-26 12:01:58,799 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1572524231] [2023-08-26 12:01:58,799 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1572524231] provided 1 perfect and 0 imperfect interpolant sequences [2023-08-26 12:01:58,799 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-08-26 12:01:58,799 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2023-08-26 12:01:58,799 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1068718025] [2023-08-26 12:01:58,799 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-08-26 12:01:58,800 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2023-08-26 12:01:58,800 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-08-26 12:01:58,800 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2023-08-26 12:01:58,800 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2023-08-26 12:01:58,801 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 123 out of 288 [2023-08-26 12:01:58,801 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 72 places, 49 transitions, 399 flow. Second operand has 3 states, 3 states have (on average 131.0) internal successors, (393), 3 states have internal predecessors, (393), 0 states have call successors, (0), 0 states 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 12:01:58,801 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2023-08-26 12:01:58,801 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 123 of 288 [2023-08-26 12:01:58,801 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2023-08-26 12:01:58,984 INFO L124 PetriNetUnfolderBase]: 685/1269 cut-off events. [2023-08-26 12:01:58,985 INFO L125 PetriNetUnfolderBase]: For 4856/4956 co-relation queries the response was YES. [2023-08-26 12:01:58,989 INFO L83 FinitePrefix]: Finished finitePrefix Result has 5756 conditions, 1269 events. 685/1269 cut-off events. For 4856/4956 co-relation queries the response was YES. Maximal size of possible extension queue 78. Compared 6663 event pairs, 261 based on Foata normal form. 1/1252 useless extension candidates. Maximal degree in co-relation 5736. Up to 672 conditions per place. [2023-08-26 12:01:58,991 INFO L140 encePairwiseOnDemand]: 285/288 looper letters, 38 selfloop transitions, 2 changer transitions 34/77 dead transitions. [2023-08-26 12:01:58,991 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 72 places, 77 transitions, 761 flow [2023-08-26 12:01:58,992 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2023-08-26 12:01:58,992 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2023-08-26 12:01:58,993 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 409 transitions. [2023-08-26 12:01:58,993 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.47337962962962965 [2023-08-26 12:01:58,993 INFO L72 ComplementDD]: Start complementDD. Operand 3 states and 409 transitions. [2023-08-26 12:01:58,993 INFO L73 IsDeterministic]: Start isDeterministic. Operand 3 states and 409 transitions. [2023-08-26 12:01:58,994 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2023-08-26 12:01:58,994 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 3 states and 409 transitions. [2023-08-26 12:01:58,995 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 4 states, 3 states have (on average 136.33333333333334) internal successors, (409), 3 states have internal predecessors, (409), 0 states have call successors, (0), 0 states 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 12:01:58,996 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 4 states, 4 states have (on average 288.0) internal successors, (1152), 4 states have internal predecessors, (1152), 0 states have call successors, (0), 0 states 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 12:01:58,997 INFO L81 ComplementDD]: Finished complementDD. Result has 4 states, 4 states have (on average 288.0) internal successors, (1152), 4 states have internal predecessors, (1152), 0 states have call successors, (0), 0 states 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 12:01:58,997 INFO L175 Difference]: Start difference. First operand has 72 places, 49 transitions, 399 flow. Second operand 3 states and 409 transitions. [2023-08-26 12:01:58,997 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 72 places, 77 transitions, 761 flow [2023-08-26 12:01:59,009 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 63 places, 77 transitions, 613 flow, removed 36 selfloop flow, removed 9 redundant places. [2023-08-26 12:01:59,012 INFO L231 Difference]: Finished difference. Result has 64 places, 39 transitions, 227 flow [2023-08-26 12:01:59,012 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=288, PETRI_DIFFERENCE_MINUEND_FLOW=316, PETRI_DIFFERENCE_MINUEND_PLACES=61, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=49, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=2, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=47, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=227, PETRI_PLACES=64, PETRI_TRANSITIONS=39} [2023-08-26 12:01:59,014 INFO L281 CegarLoopForPetriNet]: 50 programPoint places, 14 predicate places. [2023-08-26 12:01:59,014 INFO L495 AbstractCegarLoop]: Abstraction has has 64 places, 39 transitions, 227 flow [2023-08-26 12:01:59,014 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 131.0) internal successors, (393), 3 states have internal predecessors, (393), 0 states have call successors, (0), 0 states 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 12:01:59,014 INFO L200 CegarLoopForPetriNet]: Found error trace [2023-08-26 12:01:59,014 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-08-26 12:01:59,014 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable11 [2023-08-26 12:01:59,014 INFO L420 AbstractCegarLoop]: === Iteration 13 === Targeting ULTIMATE.startErr8ASSERT_VIOLATIONASSERT === [P2Err0ASSERT_VIOLATIONASSERT, ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 12 more)] === [2023-08-26 12:01:59,015 INFO L145 PredicateUnifier]: Initialized classic predicate unifier [2023-08-26 12:01:59,015 INFO L85 PathProgramCache]: Analyzing trace with hash -392886202, now seen corresponding path program 2 times [2023-08-26 12:01:59,015 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-08-26 12:01:59,015 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [194076587] [2023-08-26 12:01:59,015 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-08-26 12:01:59,015 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-08-26 12:01:59,047 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-08-26 12:01:59,788 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 12:01:59,788 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-08-26 12:01:59,788 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [194076587] [2023-08-26 12:01:59,789 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [194076587] provided 1 perfect and 0 imperfect interpolant sequences [2023-08-26 12:01:59,789 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-08-26 12:01:59,789 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2023-08-26 12:01:59,789 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1307940994] [2023-08-26 12:01:59,789 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-08-26 12:01:59,789 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2023-08-26 12:01:59,789 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-08-26 12:01:59,790 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2023-08-26 12:01:59,790 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=12, Invalid=30, Unknown=0, NotChecked=0, Total=42 [2023-08-26 12:01:59,791 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 117 out of 288 [2023-08-26 12:01:59,791 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 64 places, 39 transitions, 227 flow. Second operand has 7 states, 7 states have (on average 120.14285714285714) internal successors, (841), 7 states have internal predecessors, (841), 0 states have call successors, (0), 0 states 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 12:01:59,791 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2023-08-26 12:01:59,791 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 117 of 288 [2023-08-26 12:01:59,791 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2023-08-26 12:01:59,968 INFO L124 PetriNetUnfolderBase]: 236/445 cut-off events. [2023-08-26 12:01:59,968 INFO L125 PetriNetUnfolderBase]: For 1250/1342 co-relation queries the response was YES. [2023-08-26 12:01:59,969 INFO L83 FinitePrefix]: Finished finitePrefix Result has 1719 conditions, 445 events. 236/445 cut-off events. For 1250/1342 co-relation queries the response was YES. Maximal size of possible extension queue 39. Compared 1928 event pairs, 22 based on Foata normal form. 2/444 useless extension candidates. Maximal degree in co-relation 1703. Up to 175 conditions per place. [2023-08-26 12:01:59,970 INFO L140 encePairwiseOnDemand]: 282/288 looper letters, 60 selfloop transitions, 4 changer transitions 25/94 dead transitions. [2023-08-26 12:01:59,970 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 68 places, 94 transitions, 719 flow [2023-08-26 12:01:59,970 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2023-08-26 12:01:59,970 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 6 states. [2023-08-26 12:01:59,972 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6 states to 6 states and 754 transitions. [2023-08-26 12:01:59,972 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.4363425925925926 [2023-08-26 12:01:59,973 INFO L72 ComplementDD]: Start complementDD. Operand 6 states and 754 transitions. [2023-08-26 12:01:59,973 INFO L73 IsDeterministic]: Start isDeterministic. Operand 6 states and 754 transitions. [2023-08-26 12:01:59,973 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2023-08-26 12:01:59,973 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 6 states and 754 transitions. [2023-08-26 12:01:59,976 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 7 states, 6 states have (on average 125.66666666666667) internal successors, (754), 6 states have internal predecessors, (754), 0 states have call successors, (0), 0 states 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 12:01:59,979 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 7 states, 7 states have (on average 288.0) internal successors, (2016), 7 states have internal predecessors, (2016), 0 states have call successors, (0), 0 states 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 12:01:59,979 INFO L81 ComplementDD]: Finished complementDD. Result has 7 states, 7 states have (on average 288.0) internal successors, (2016), 7 states have internal predecessors, (2016), 0 states have call successors, (0), 0 states 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 12:01:59,979 INFO L175 Difference]: Start difference. First operand has 64 places, 39 transitions, 227 flow. Second operand 6 states and 754 transitions. [2023-08-26 12:01:59,979 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 68 places, 94 transitions, 719 flow [2023-08-26 12:01:59,982 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 56 places, 94 transitions, 622 flow, removed 25 selfloop flow, removed 12 redundant places. [2023-08-26 12:01:59,983 INFO L231 Difference]: Finished difference. Result has 59 places, 41 transitions, 196 flow [2023-08-26 12:01:59,984 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=288, PETRI_DIFFERENCE_MINUEND_FLOW=172, PETRI_DIFFERENCE_MINUEND_PLACES=51, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=39, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=2, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=35, PETRI_DIFFERENCE_SUBTRAHEND_STATES=6, PETRI_FLOW=196, PETRI_PLACES=59, PETRI_TRANSITIONS=41} [2023-08-26 12:01:59,984 INFO L281 CegarLoopForPetriNet]: 50 programPoint places, 9 predicate places. [2023-08-26 12:01:59,984 INFO L495 AbstractCegarLoop]: Abstraction has has 59 places, 41 transitions, 196 flow [2023-08-26 12:01:59,985 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 7 states, 7 states have (on average 120.14285714285714) internal successors, (841), 7 states have internal predecessors, (841), 0 states have call successors, (0), 0 states 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 12:01:59,985 INFO L200 CegarLoopForPetriNet]: Found error trace [2023-08-26 12:01:59,985 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-08-26 12:01:59,985 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable12 [2023-08-26 12:01:59,985 INFO L420 AbstractCegarLoop]: === Iteration 14 === Targeting ULTIMATE.startErr8ASSERT_VIOLATIONASSERT === [P2Err0ASSERT_VIOLATIONASSERT, ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 12 more)] === [2023-08-26 12:01:59,985 INFO L145 PredicateUnifier]: Initialized classic predicate unifier [2023-08-26 12:01:59,985 INFO L85 PathProgramCache]: Analyzing trace with hash -691841904, now seen corresponding path program 3 times [2023-08-26 12:01:59,985 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-08-26 12:01:59,986 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1594042399] [2023-08-26 12:01:59,986 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-08-26 12:01:59,986 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-08-26 12:02:00,031 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2023-08-26 12:02:00,032 INFO L356 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2023-08-26 12:02:00,094 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2023-08-26 12:02:00,126 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2023-08-26 12:02:00,126 INFO L360 BasicCegarLoop]: Counterexample is feasible [2023-08-26 12:02:00,127 INFO L805 garLoopResultBuilder]: Registering result UNSAFE for location ULTIMATE.startErr8ASSERT_VIOLATIONASSERT (14 of 15 remaining) [2023-08-26 12:02:00,132 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location P2Err0ASSERT_VIOLATIONASSERT (13 of 15 remaining) [2023-08-26 12:02:00,133 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE (12 of 15 remaining) [2023-08-26 12:02:00,133 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE (11 of 15 remaining) [2023-08-26 12:02:00,134 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (10 of 15 remaining) [2023-08-26 12:02:00,134 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr3REQUIRES_VIOLATIONMEMORY_DEREFERENCE (9 of 15 remaining) [2023-08-26 12:02:00,134 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr4REQUIRES_VIOLATIONMEMORY_DEREFERENCE (8 of 15 remaining) [2023-08-26 12:02:00,134 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr5REQUIRES_VIOLATIONMEMORY_DEREFERENCE (7 of 15 remaining) [2023-08-26 12:02:00,134 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr6REQUIRES_VIOLATIONMEMORY_DEREFERENCE (6 of 15 remaining) [2023-08-26 12:02:00,134 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr7REQUIRES_VIOLATIONMEMORY_DEREFERENCE (5 of 15 remaining) [2023-08-26 12:02:00,134 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (4 of 15 remaining) [2023-08-26 12:02:00,134 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (3 of 15 remaining) [2023-08-26 12:02:00,134 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr2INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (2 of 15 remaining) [2023-08-26 12:02:00,134 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr3INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (1 of 15 remaining) [2023-08-26 12:02:00,135 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location P2Err0ASSERT_VIOLATIONASSERT (0 of 15 remaining) [2023-08-26 12:02:00,135 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable13 [2023-08-26 12:02:00,135 INFO L445 BasicCegarLoop]: Path program histogram: [3, 3, 1, 1, 1, 1, 1, 1, 1, 1] [2023-08-26 12:02:00,145 INFO L228 ceAbstractionStarter]: Analysis of concurrent program completed with 1 thread instances [2023-08-26 12:02:00,145 INFO L178 ceAbstractionStarter]: Computing trace abstraction results [2023-08-26 12:02:00,244 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 26.08 12:02:00 BasicIcfg [2023-08-26 12:02:00,244 INFO L131 PluginConnector]: ------------------------ END TraceAbstraction---------------------------- [2023-08-26 12:02:00,244 INFO L158 Benchmark]: Toolchain (without parser) took 21995.61ms. Allocated memory was 358.6MB in the beginning and 1.9GB in the end (delta: 1.6GB). Free memory was 315.7MB in the beginning and 651.4MB in the end (delta: -335.7MB). Peak memory consumption was 1.2GB. Max. memory is 16.0GB. [2023-08-26 12:02:00,244 INFO L158 Benchmark]: CDTParser took 0.12ms. Allocated memory is still 358.6MB. Free memory was 336.1MB in the beginning and 335.9MB in the end (delta: 157.4kB). There was no memory consumed. Max. memory is 16.0GB. [2023-08-26 12:02:00,245 INFO L158 Benchmark]: CACSL2BoogieTranslator took 543.17ms. Allocated memory is still 358.6MB. Free memory was 314.7MB in the beginning and 291.6MB in the end (delta: 23.1MB). Peak memory consumption was 23.1MB. Max. memory is 16.0GB. [2023-08-26 12:02:00,245 INFO L158 Benchmark]: Boogie Procedure Inliner took 43.85ms. Allocated memory is still 358.6MB. Free memory was 291.6MB in the beginning and 289.5MB in the end (delta: 2.1MB). Peak memory consumption was 2.1MB. Max. memory is 16.0GB. [2023-08-26 12:02:00,245 INFO L158 Benchmark]: Boogie Preprocessor took 41.84ms. Allocated memory is still 358.6MB. Free memory was 289.5MB in the beginning and 287.4MB in the end (delta: 2.1MB). Peak memory consumption was 2.1MB. Max. memory is 16.0GB. [2023-08-26 12:02:00,245 INFO L158 Benchmark]: RCFGBuilder took 734.56ms. Allocated memory is still 358.6MB. Free memory was 287.4MB in the beginning and 248.6MB in the end (delta: 38.8MB). Peak memory consumption was 37.7MB. Max. memory is 16.0GB. [2023-08-26 12:02:00,246 INFO L158 Benchmark]: TraceAbstraction took 20625.03ms. Allocated memory was 358.6MB in the beginning and 1.9GB in the end (delta: 1.6GB). Free memory was 248.6MB in the beginning and 651.4MB in the end (delta: -402.8MB). Peak memory consumption was 1.2GB. Max. memory is 16.0GB. [2023-08-26 12:02:00,247 INFO L338 ainManager$Toolchain]: ####################### End [Toolchain 1] ####################### --- Results --- * Results from de.uni_freiburg.informatik.ultimate.core: - StatisticsResult: Toolchain Benchmarks Benchmark results are: * CDTParser took 0.12ms. Allocated memory is still 358.6MB. Free memory was 336.1MB in the beginning and 335.9MB in the end (delta: 157.4kB). There was no memory consumed. Max. memory is 16.0GB. * CACSL2BoogieTranslator took 543.17ms. Allocated memory is still 358.6MB. Free memory was 314.7MB in the beginning and 291.6MB in the end (delta: 23.1MB). Peak memory consumption was 23.1MB. Max. memory is 16.0GB. * Boogie Procedure Inliner took 43.85ms. Allocated memory is still 358.6MB. Free memory was 291.6MB in the beginning and 289.5MB in the end (delta: 2.1MB). Peak memory consumption was 2.1MB. Max. memory is 16.0GB. * Boogie Preprocessor took 41.84ms. Allocated memory is still 358.6MB. Free memory was 289.5MB in the beginning and 287.4MB in the end (delta: 2.1MB). Peak memory consumption was 2.1MB. Max. memory is 16.0GB. * RCFGBuilder took 734.56ms. Allocated memory is still 358.6MB. Free memory was 287.4MB in the beginning and 248.6MB in the end (delta: 38.8MB). Peak memory consumption was 37.7MB. Max. memory is 16.0GB. * TraceAbstraction took 20625.03ms. Allocated memory was 358.6MB in the beginning and 1.9GB in the end (delta: 1.6GB). Free memory was 248.6MB in the beginning and 651.4MB in the end (delta: -402.8MB). Peak memory consumption was 1.2GB. 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.6s, 148 PlacesBefore, 50 PlacesAfterwards, 138 TransitionsBefore, 38 TransitionsAfterwards, 3378 CoEnabledTransitionPairs, 7 FixpointIterations, 51 TrivialSequentialCompositions, 78 ConcurrentSequentialCompositions, 0 TrivialYvCompositions, 15 ConcurrentYvCompositions, 2 ChoiceCompositions, 146 TotalNumberOfCompositions, 10124 MoverChecksTotal, Independence Relation Statistics: CachedIndependenceRelation.Independence Queries: [ total: 4345, independent: 4102, independent conditional: 0, independent unconditional: 4102, dependent: 243, dependent conditional: 0, dependent unconditional: 243, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , CachedIndependenceRelation.Statistics on underlying relation: SyntacticIndependenceRelation.Independence Queries: [ total: 1937, independent: 1889, independent conditional: 0, independent unconditional: 1889, dependent: 48, dependent conditional: 0, dependent unconditional: 48, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , Cache Queries: [ total: 4345, independent: 2213, independent conditional: 0, independent unconditional: 2213, dependent: 195, dependent conditional: 0, dependent unconditional: 195, unknown: 1937, unknown conditional: 0, unknown unconditional: 1937] , Statistics on independence cache: Total cache size (in pairs): 179, Positive cache size: 158, Positive conditional cache size: 0, Positive unconditional cache size: 158, Negative cache size: 21, Negative conditional cache size: 0, Negative unconditional cache size: 21, Unknown cache size: 0, Unknown conditional cache size: 0, Unknown unconditional cache size: 0 - CounterExampleResult [Line: 17]: assertion can be violated assertion can be violated We found a FailurePath: [L710] 0 int __unbuffered_cnt = 0; [L712] 0 int __unbuffered_p1_EAX = 0; [L714] 0 int __unbuffered_p1_EBX = 0; [L716] 0 int __unbuffered_p3_EAX = 0; [L718] 0 int __unbuffered_p3_EBX = 0; [L720] 0 int a = 0; [L721] 0 _Bool main$tmp_guard0; [L722] 0 _Bool main$tmp_guard1; [L724] 0 int x = 0; [L726] 0 int y = 0; [L727] 0 _Bool y$flush_delayed; [L728] 0 int y$mem_tmp; [L729] 0 _Bool y$r_buff0_thd0; [L730] 0 _Bool y$r_buff0_thd1; [L731] 0 _Bool y$r_buff0_thd2; [L732] 0 _Bool y$r_buff0_thd3; [L733] 0 _Bool y$r_buff0_thd4; [L734] 0 _Bool y$r_buff1_thd0; [L735] 0 _Bool y$r_buff1_thd1; [L736] 0 _Bool y$r_buff1_thd2; [L737] 0 _Bool y$r_buff1_thd3; [L738] 0 _Bool y$r_buff1_thd4; [L739] 0 _Bool y$read_delayed; [L740] 0 int *y$read_delayed_var; [L741] 0 int y$w_buff0; [L742] 0 _Bool y$w_buff0_used; [L743] 0 int y$w_buff1; [L744] 0 _Bool y$w_buff1_used; [L746] 0 int z = 0; [L747] 0 _Bool weak$$choice0; [L748] 0 _Bool weak$$choice2; [L859] 0 pthread_t t605; [L860] FCALL, FORK 0 pthread_create(&t605, ((void *)0), P0, ((void *)0)) VAL [__unbuffered_cnt=0, __unbuffered_p1_EAX=0, __unbuffered_p1_EBX=0, __unbuffered_p3_EAX=0, __unbuffered_p3_EBX=0, a=0, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, pthread_create(&t605, ((void *)0), P0, ((void *)0))=-2, t605={5:0}, weak$$choice0=0, weak$$choice2=0, x=0, y$flush_delayed=0, y$mem_tmp=0, y$r_buff0_thd0=0, y$r_buff0_thd1=0, y$r_buff0_thd2=0, y$r_buff0_thd3=0, y$r_buff0_thd4=0, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$r_buff1_thd3=0, y$r_buff1_thd4=0, y$read_delayed=0, y$read_delayed_var={0:0}, y$w_buff0=0, y$w_buff0_used=0, y$w_buff1=0, y$w_buff1_used=0, y=0, z=0] [L861] 0 pthread_t t606; [L862] FCALL, FORK 0 pthread_create(&t606, ((void *)0), P1, ((void *)0)) VAL [__unbuffered_cnt=0, __unbuffered_p1_EAX=0, __unbuffered_p1_EBX=0, __unbuffered_p3_EAX=0, __unbuffered_p3_EBX=0, a=0, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, pthread_create(&t606, ((void *)0), P1, ((void *)0))=-1, t605={5:0}, t606={6:0}, weak$$choice0=0, weak$$choice2=0, x=0, y$flush_delayed=0, y$mem_tmp=0, y$r_buff0_thd0=0, y$r_buff0_thd1=0, y$r_buff0_thd2=0, y$r_buff0_thd3=0, y$r_buff0_thd4=0, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$r_buff1_thd3=0, y$r_buff1_thd4=0, y$read_delayed=0, y$read_delayed_var={0:0}, y$w_buff0=0, y$w_buff0_used=0, y$w_buff1=0, y$w_buff1_used=0, y=0, z=0] [L863] 0 pthread_t t607; [L864] FCALL, FORK 0 pthread_create(&t607, ((void *)0), P2, ((void *)0)) VAL [__unbuffered_cnt=0, __unbuffered_p1_EAX=0, __unbuffered_p1_EBX=0, __unbuffered_p3_EAX=0, __unbuffered_p3_EBX=0, a=0, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, pthread_create(&t607, ((void *)0), P2, ((void *)0))=0, t605={5:0}, t606={6:0}, t607={7:0}, weak$$choice0=0, weak$$choice2=0, x=0, y$flush_delayed=0, y$mem_tmp=0, y$r_buff0_thd0=0, y$r_buff0_thd1=0, y$r_buff0_thd2=0, y$r_buff0_thd3=0, y$r_buff0_thd4=0, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$r_buff1_thd3=0, y$r_buff1_thd4=0, y$read_delayed=0, y$read_delayed_var={0:0}, y$w_buff0=0, y$w_buff0_used=0, y$w_buff1=0, y$w_buff1_used=0, y=0, z=0] [L865] 0 pthread_t t608; [L866] FCALL, FORK 0 pthread_create(&t608, ((void *)0), P3, ((void *)0)) VAL [__unbuffered_cnt=0, __unbuffered_p1_EAX=0, __unbuffered_p1_EBX=0, __unbuffered_p3_EAX=0, __unbuffered_p3_EBX=0, a=0, arg={0:0}, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, pthread_create(&t608, ((void *)0), P3, ((void *)0))=1, t605={5:0}, t606={6:0}, t607={7:0}, t608={3:0}, weak$$choice0=0, weak$$choice2=0, x=0, y$flush_delayed=0, y$mem_tmp=0, y$r_buff0_thd0=0, y$r_buff0_thd1=0, y$r_buff0_thd2=0, y$r_buff0_thd3=0, y$r_buff0_thd4=0, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$r_buff1_thd3=0, y$r_buff1_thd4=0, y$read_delayed=0, y$read_delayed_var={0:0}, y$w_buff0=0, y$w_buff0_used=0, y$w_buff1=0, y$w_buff1_used=0, y=0, z=0] [L798] 3 y$w_buff1 = y$w_buff0 [L799] 3 y$w_buff0 = 1 [L800] 3 y$w_buff1_used = y$w_buff0_used [L801] 3 y$w_buff0_used = (_Bool)1 [L802] CALL 3 __VERIFIER_assert(!(y$w_buff1_used && y$w_buff0_used)) [L18] COND FALSE 3 !(!expression) [L802] RET 3 __VERIFIER_assert(!(y$w_buff1_used && y$w_buff0_used)) [L803] 3 y$r_buff1_thd0 = y$r_buff0_thd0 [L804] 3 y$r_buff1_thd1 = y$r_buff0_thd1 [L805] 3 y$r_buff1_thd2 = y$r_buff0_thd2 [L806] 3 y$r_buff1_thd3 = y$r_buff0_thd3 [L807] 3 y$r_buff1_thd4 = y$r_buff0_thd4 [L808] 3 y$r_buff0_thd3 = (_Bool)1 VAL [__unbuffered_cnt=0, __unbuffered_p1_EAX=0, __unbuffered_p1_EBX=0, __unbuffered_p3_EAX=0, __unbuffered_p3_EBX=0, a=0, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=0, x=0, y$flush_delayed=0, y$mem_tmp=0, y$r_buff0_thd0=0, y$r_buff0_thd1=0, y$r_buff0_thd2=0, y$r_buff0_thd3=1, y$r_buff0_thd4=0, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$r_buff1_thd3=0, y$r_buff1_thd4=0, y$read_delayed=0, y$read_delayed_var={0:0}, y$w_buff0=1, y$w_buff0_used=1, y$w_buff1=0, y$w_buff1_used=0, y=0, z=0] [L811] 3 z = 1 VAL [__unbuffered_cnt=0, __unbuffered_p1_EAX=0, __unbuffered_p1_EBX=0, __unbuffered_p3_EAX=0, __unbuffered_p3_EBX=0, a=0, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=0, x=0, y$flush_delayed=0, y$mem_tmp=0, y$r_buff0_thd0=0, y$r_buff0_thd1=0, y$r_buff0_thd2=0, y$r_buff0_thd3=1, y$r_buff0_thd4=0, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$r_buff1_thd3=0, y$r_buff1_thd4=0, y$read_delayed=0, y$read_delayed_var={0:0}, y$w_buff0=1, y$w_buff0_used=1, y$w_buff1=0, y$w_buff1_used=0, y=0, z=1] [L828] 4 z = 2 VAL [__unbuffered_cnt=0, __unbuffered_p1_EAX=0, __unbuffered_p1_EBX=0, __unbuffered_p3_EAX=0, __unbuffered_p3_EBX=0, a=0, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=0, x=0, y$flush_delayed=0, y$mem_tmp=0, y$r_buff0_thd0=0, y$r_buff0_thd1=0, y$r_buff0_thd2=0, y$r_buff0_thd3=1, y$r_buff0_thd4=0, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$r_buff1_thd3=0, y$r_buff1_thd4=0, y$read_delayed=0, y$read_delayed_var={0:0}, y$w_buff0=1, y$w_buff0_used=1, y$w_buff1=0, y$w_buff1_used=0, y=0, z=2] [L831] 4 __unbuffered_p3_EAX = z VAL [__unbuffered_cnt=0, __unbuffered_p1_EAX=0, __unbuffered_p1_EBX=0, __unbuffered_p3_EAX=2, __unbuffered_p3_EBX=0, a=0, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=0, x=0, y$flush_delayed=0, y$mem_tmp=0, y$r_buff0_thd0=0, y$r_buff0_thd1=0, y$r_buff0_thd2=0, y$r_buff0_thd3=1, y$r_buff0_thd4=0, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$r_buff1_thd3=0, y$r_buff1_thd4=0, y$read_delayed=0, y$read_delayed_var={0:0}, y$w_buff0=1, y$w_buff0_used=1, y$w_buff1=0, y$w_buff1_used=0, y=0, z=2] [L834] 4 __unbuffered_p3_EBX = a VAL [__unbuffered_cnt=0, __unbuffered_p1_EAX=0, __unbuffered_p1_EBX=0, __unbuffered_p3_EAX=2, __unbuffered_p3_EBX=0, a=0, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=0, x=0, y$flush_delayed=0, y$mem_tmp=0, y$r_buff0_thd0=0, y$r_buff0_thd1=0, y$r_buff0_thd2=0, y$r_buff0_thd3=1, y$r_buff0_thd4=0, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$r_buff1_thd3=0, y$r_buff1_thd4=0, y$read_delayed=0, y$read_delayed_var={0:0}, y$w_buff0=1, y$w_buff0_used=1, y$w_buff1=0, y$w_buff1_used=0, y=0, z=2] [L752] 1 a = 1 VAL [__unbuffered_cnt=0, __unbuffered_p1_EAX=0, __unbuffered_p1_EBX=0, __unbuffered_p3_EAX=2, __unbuffered_p3_EBX=0, a=1, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=0, x=0, y$flush_delayed=0, y$mem_tmp=0, y$r_buff0_thd0=0, y$r_buff0_thd1=0, y$r_buff0_thd2=0, y$r_buff0_thd3=1, y$r_buff0_thd4=0, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$r_buff1_thd3=0, y$r_buff1_thd4=0, y$read_delayed=0, y$read_delayed_var={0:0}, y$w_buff0=1, y$w_buff0_used=1, y$w_buff1=0, y$w_buff1_used=0, y=0, z=2] [L755] 1 x = 1 VAL [__unbuffered_cnt=0, __unbuffered_p1_EAX=0, __unbuffered_p1_EBX=0, __unbuffered_p3_EAX=2, __unbuffered_p3_EBX=0, a=1, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=0, x=1, y$flush_delayed=0, y$mem_tmp=0, y$r_buff0_thd0=0, y$r_buff0_thd1=0, y$r_buff0_thd2=0, y$r_buff0_thd3=1, y$r_buff0_thd4=0, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$r_buff1_thd3=0, y$r_buff1_thd4=0, y$read_delayed=0, y$read_delayed_var={0:0}, y$w_buff0=1, y$w_buff0_used=1, y$w_buff1=0, y$w_buff1_used=0, y=0, z=2] [L767] 2 x = 2 VAL [__unbuffered_cnt=0, __unbuffered_p1_EAX=0, __unbuffered_p1_EBX=0, __unbuffered_p3_EAX=2, __unbuffered_p3_EBX=0, a=1, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=0, x=2, y$flush_delayed=0, y$mem_tmp=0, y$r_buff0_thd0=0, y$r_buff0_thd1=0, y$r_buff0_thd2=0, y$r_buff0_thd3=1, y$r_buff0_thd4=0, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$r_buff1_thd3=0, y$r_buff1_thd4=0, y$read_delayed=0, y$read_delayed_var={0:0}, y$w_buff0=1, y$w_buff0_used=1, y$w_buff1=0, y$w_buff1_used=0, y=0, z=2] [L770] 2 __unbuffered_p1_EAX = x VAL [__unbuffered_cnt=0, __unbuffered_p1_EAX=2, __unbuffered_p1_EBX=0, __unbuffered_p3_EAX=2, __unbuffered_p3_EBX=0, a=1, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=0, x=2, y$flush_delayed=0, y$mem_tmp=0, y$r_buff0_thd0=0, y$r_buff0_thd1=0, y$r_buff0_thd2=0, y$r_buff0_thd3=1, y$r_buff0_thd4=0, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$r_buff1_thd3=0, y$r_buff1_thd4=0, y$read_delayed=0, y$read_delayed_var={0:0}, y$w_buff0=1, y$w_buff0_used=1, y$w_buff1=0, y$w_buff1_used=0, y=0, z=2] [L773] 2 weak$$choice0 = __VERIFIER_nondet_bool() [L774] 2 weak$$choice2 = __VERIFIER_nondet_bool() [L775] 2 y$flush_delayed = weak$$choice2 [L776] 2 y$mem_tmp = y [L777] 2 y = !y$w_buff0_used || !y$r_buff0_thd2 && !y$w_buff1_used || !y$r_buff0_thd2 && !y$r_buff1_thd2 ? y : (y$w_buff0_used && y$r_buff0_thd2 ? y$w_buff0 : y$w_buff1) [L778] 2 y$w_buff0 = weak$$choice2 ? y$w_buff0 : (!y$w_buff0_used || !y$r_buff0_thd2 && !y$w_buff1_used || !y$r_buff0_thd2 && !y$r_buff1_thd2 ? y$w_buff0 : (y$w_buff0_used && y$r_buff0_thd2 ? y$w_buff0 : y$w_buff0)) [L779] 2 y$w_buff1 = weak$$choice2 ? y$w_buff1 : (!y$w_buff0_used || !y$r_buff0_thd2 && !y$w_buff1_used || !y$r_buff0_thd2 && !y$r_buff1_thd2 ? y$w_buff1 : (y$w_buff0_used && y$r_buff0_thd2 ? y$w_buff1 : y$w_buff1)) [L780] 2 y$w_buff0_used = weak$$choice2 ? y$w_buff0_used : (!y$w_buff0_used || !y$r_buff0_thd2 && !y$w_buff1_used || !y$r_buff0_thd2 && !y$r_buff1_thd2 ? y$w_buff0_used : (y$w_buff0_used && y$r_buff0_thd2 ? (_Bool)0 : y$w_buff0_used)) [L781] 2 y$w_buff1_used = weak$$choice2 ? y$w_buff1_used : (!y$w_buff0_used || !y$r_buff0_thd2 && !y$w_buff1_used || !y$r_buff0_thd2 && !y$r_buff1_thd2 ? y$w_buff1_used : (y$w_buff0_used && y$r_buff0_thd2 ? (_Bool)0 : (_Bool)0)) [L782] 2 y$r_buff0_thd2 = weak$$choice2 ? y$r_buff0_thd2 : (!y$w_buff0_used || !y$r_buff0_thd2 && !y$w_buff1_used || !y$r_buff0_thd2 && !y$r_buff1_thd2 ? y$r_buff0_thd2 : (y$w_buff0_used && y$r_buff0_thd2 ? (_Bool)0 : y$r_buff0_thd2)) [L783] 2 y$r_buff1_thd2 = weak$$choice2 ? y$r_buff1_thd2 : (!y$w_buff0_used || !y$r_buff0_thd2 && !y$w_buff1_used || !y$r_buff0_thd2 && !y$r_buff1_thd2 ? y$r_buff1_thd2 : (y$w_buff0_used && y$r_buff0_thd2 ? (_Bool)0 : (_Bool)0)) [L784] 2 __unbuffered_p1_EBX = y [L785] 2 y = y$flush_delayed ? y$mem_tmp : y [L786] 2 y$flush_delayed = (_Bool)0 VAL [__unbuffered_cnt=0, __unbuffered_p1_EAX=2, __unbuffered_p1_EBX=0, __unbuffered_p3_EAX=2, __unbuffered_p3_EBX=0, a=1, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice2=0, x=2, y$flush_delayed=0, y$mem_tmp=0, y$r_buff0_thd0=0, y$r_buff0_thd1=0, y$r_buff0_thd2=0, y$r_buff0_thd3=1, y$r_buff0_thd4=0, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$r_buff1_thd3=0, y$r_buff1_thd4=0, y$read_delayed=0, y$read_delayed_var={0:0}, y$w_buff0=1, y$w_buff0_used=1, y$w_buff1=0, y$w_buff1_used=0, y=0, z=2] [L814] 3 y = y$w_buff0_used && y$r_buff0_thd3 ? y$w_buff0 : (y$w_buff1_used && y$r_buff1_thd3 ? y$w_buff1 : y) [L815] 3 y$w_buff0_used = y$w_buff0_used && y$r_buff0_thd3 ? (_Bool)0 : y$w_buff0_used [L816] 3 y$w_buff1_used = y$w_buff0_used && y$r_buff0_thd3 || y$w_buff1_used && y$r_buff1_thd3 ? (_Bool)0 : y$w_buff1_used [L817] 3 y$r_buff0_thd3 = y$w_buff0_used && y$r_buff0_thd3 ? (_Bool)0 : y$r_buff0_thd3 [L818] 3 y$r_buff1_thd3 = y$w_buff0_used && y$r_buff0_thd3 || y$w_buff1_used && y$r_buff1_thd3 ? (_Bool)0 : y$r_buff1_thd3 VAL [__unbuffered_cnt=0, __unbuffered_p1_EAX=2, __unbuffered_p1_EBX=0, __unbuffered_p3_EAX=2, __unbuffered_p3_EBX=0, a=1, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice2=0, x=2, y$flush_delayed=0, y$mem_tmp=0, y$r_buff0_thd0=0, y$r_buff0_thd1=0, y$r_buff0_thd2=0, y$r_buff0_thd3=1, y$r_buff0_thd4=0, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$r_buff1_thd3=0, y$r_buff1_thd4=0, y$read_delayed=0, y$read_delayed_var={0:0}, y$w_buff0=1, y$w_buff0_used=0, y$w_buff1=0, y$w_buff1_used=0, y=1, z=2] [L821] 3 __unbuffered_cnt = __unbuffered_cnt + 1 [L823] 3 return 0; [L837] 4 y = y$w_buff0_used && y$r_buff0_thd4 ? y$w_buff0 : (y$w_buff1_used && y$r_buff1_thd4 ? y$w_buff1 : y) [L838] 4 y$w_buff0_used = y$w_buff0_used && y$r_buff0_thd4 ? (_Bool)0 : y$w_buff0_used [L839] 4 y$w_buff1_used = y$w_buff0_used && y$r_buff0_thd4 || y$w_buff1_used && y$r_buff1_thd4 ? (_Bool)0 : y$w_buff1_used [L840] 4 y$r_buff0_thd4 = y$w_buff0_used && y$r_buff0_thd4 ? (_Bool)0 : y$r_buff0_thd4 [L841] 4 y$r_buff1_thd4 = y$w_buff0_used && y$r_buff0_thd4 || y$w_buff1_used && y$r_buff1_thd4 ? (_Bool)0 : y$r_buff1_thd4 VAL [__unbuffered_cnt=1, __unbuffered_p1_EAX=2, __unbuffered_p1_EBX=0, __unbuffered_p3_EAX=2, __unbuffered_p3_EBX=0, a=1, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice2=0, x=2, y$flush_delayed=0, y$mem_tmp=0, y$r_buff0_thd0=0, y$r_buff0_thd1=0, y$r_buff0_thd2=0, y$r_buff0_thd3=1, y$r_buff0_thd4=0, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$r_buff1_thd3=0, y$r_buff1_thd4=0, y$read_delayed=0, y$read_delayed_var={0:0}, y$w_buff0=1, y$w_buff0_used=0, y$w_buff1=0, y$w_buff1_used=0, y=1, z=2] [L760] 1 __unbuffered_cnt = __unbuffered_cnt + 1 [L762] 1 return 0; [L844] 4 __unbuffered_cnt = __unbuffered_cnt + 1 [L846] 4 return 0; [L791] 2 __unbuffered_cnt = __unbuffered_cnt + 1 [L793] 2 return 0; [L868] 0 main$tmp_guard0 = __unbuffered_cnt == 4 [L870] CALL 0 assume_abort_if_not(main$tmp_guard0) [L3] COND FALSE 0 !(!cond) [L870] RET 0 assume_abort_if_not(main$tmp_guard0) [L872] 0 y = y$w_buff0_used && y$r_buff0_thd0 ? y$w_buff0 : (y$w_buff1_used && y$r_buff1_thd0 ? y$w_buff1 : y) [L873] 0 y$w_buff0_used = y$w_buff0_used && y$r_buff0_thd0 ? (_Bool)0 : y$w_buff0_used [L874] 0 y$w_buff1_used = y$w_buff0_used && y$r_buff0_thd0 || y$w_buff1_used && y$r_buff1_thd0 ? (_Bool)0 : y$w_buff1_used [L875] 0 y$r_buff0_thd0 = y$w_buff0_used && y$r_buff0_thd0 ? (_Bool)0 : y$r_buff0_thd0 [L876] 0 y$r_buff1_thd0 = y$w_buff0_used && y$r_buff0_thd0 || y$w_buff1_used && y$r_buff1_thd0 ? (_Bool)0 : y$r_buff1_thd0 VAL [\result={0:0}, \result={0:0}, \result={0:0}, __unbuffered_cnt=4, __unbuffered_p1_EAX=2, __unbuffered_p1_EBX=0, __unbuffered_p3_EAX=2, __unbuffered_p3_EBX=0, a=1, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, main$tmp_guard0=1, main$tmp_guard1=0, t605={5:0}, t606={6:0}, t607={7:0}, t608={3:0}, weak$$choice2=0, x=2, y$flush_delayed=0, y$mem_tmp=0, y$r_buff0_thd0=0, y$r_buff0_thd1=0, y$r_buff0_thd2=0, y$r_buff0_thd3=1, y$r_buff0_thd4=0, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$r_buff1_thd3=0, y$r_buff1_thd4=0, y$read_delayed=0, y$read_delayed_var={0:0}, y$w_buff0=1, y$w_buff0_used=0, y$w_buff1=0, y$w_buff1_used=0, y=1, z=2] [L879] 0 main$tmp_guard1 = !(x == 2 && z == 2 && __unbuffered_p1_EAX == 2 && __unbuffered_p1_EBX == 0 && __unbuffered_p3_EAX == 2 && __unbuffered_p3_EBX == 0) [L881] 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", "mix023_power.opt_pso.opt_rmo.opt.c", 8, __extension__ __PRETTY_FUNCTION__) VAL [\read(__PRETTY_FUNCTION__)={49:50}, \result={0:0}, \result={0:0}, \result={0:0}, __unbuffered_cnt=4, __unbuffered_p1_EAX=2, __unbuffered_p1_EBX=0, __unbuffered_p3_EAX=2, __unbuffered_p3_EBX=0, a=1, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, main$tmp_guard0=1, main$tmp_guard1=0, weak$$choice2=0, x=2, y$flush_delayed=0, y$mem_tmp=0, y$r_buff0_thd0=0, y$r_buff0_thd1=0, y$r_buff0_thd2=0, y$r_buff0_thd3=1, y$r_buff0_thd4=0, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$r_buff1_thd3=0, y$r_buff1_thd4=0, y$read_delayed=0, y$read_delayed_var={0:0}, y$w_buff0=1, y$w_buff0_used=0, y$w_buff1=0, y$w_buff1_used=0, y=1, z=2] - 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: 862]: 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: 860]: 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: 864]: 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: 866]: 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, 177 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: 20.4s, OverallIterations: 14, TraceHistogramMax: 1, PathProgramHistogramMax: 3, EmptinessCheckTime: 0.0s, AutomataDifference: 12.0s, DeadEndRemovalTime: 0.0s, HoareAnnotationTime: 0.0s, InitialAbstractionConstructionTime: 4.7s, HoareTripleCheckerStatistics: 0 mSolverCounterUnknown, 392 SdHoareTripleChecker+Valid, 1.2s IncrementalHoareTripleChecker+Time, 0 mSdLazyCounter, 392 mSDsluCounter, 53 SdHoareTripleChecker+Invalid, 1.0s Time, 0 mProtectedAction, 0 SdHoareTripleChecker+Unchecked, 0 IncrementalHoareTripleChecker+Unchecked, 17 mSDsCounter, 43 IncrementalHoareTripleChecker+Valid, 0 mProtectedPredicate, 1251 IncrementalHoareTripleChecker+Invalid, 1294 SdHoareTripleChecker+Unknown, 0 mSolverCounterNotChecked, 43 mSolverCounterUnsat, 36 mSDtfsCounter, 1251 mSolverCounterSat, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Unknown, PredicateUnifierStatistics: 0 DeclaredPredicates, 50 GetRequests, 10 SyntacticMatches, 0 SemanticMatches, 40 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 8 ImplicationChecksByTransitivity, 0.2s Time, 0.0s BasicInterpolantAutomatonTime, BiggestAbstraction: size=712occurred in iteration=9, InterpolantAutomatonStates: 63, traceCheckStatistics: No data available, InterpolantConsolidationStatistics: No data available, PathInvariantsStatistics: No data available, 0/0 InterpolantCoveringCapability, TotalInterpolationStatistics: No data available, 0.0s DumpTime, AutomataMinimizationStatistics: No data available, HoareAnnotationStatistics: No data available, RefinementEngineStatistics: TRACE_CHECK: 0.0s SsaConstructionTime, 0.3s SatisfiabilityAnalysisTime, 2.8s InterpolantComputationTime, 252 NumberOfCodeBlocks, 252 NumberOfCodeBlocksAsserted, 14 NumberOfCheckSat, 212 ConstructedInterpolants, 0 QuantifiedInterpolants, 1209 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 12:02:00,272 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...