/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/mix026_pso.opt_rmo.opt.i -------------------------------------------------------------------------------- This is Ultimate 0.2.3-dev-ac9dbd0-m [2023-08-26 12:02:34,534 INFO L188 SettingsManager]: Resetting all preferences to default values... [2023-08-26 12:02:34,603 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:02:34,610 WARN L101 SettingsManager]: Preference file contains the following unknown settings: [2023-08-26 12:02:34,611 WARN L103 SettingsManager]: * de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.Checked method. Library mode if empty. [2023-08-26 12:02:34,652 INFO L130 SettingsManager]: Preferences different from defaults after loading the file: [2023-08-26 12:02:34,653 INFO L151 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2023-08-26 12:02:34,653 INFO L153 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2023-08-26 12:02:34,654 INFO L151 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2023-08-26 12:02:34,658 INFO L153 SettingsManager]: * Create parallel compositions if possible=false [2023-08-26 12:02:34,658 INFO L153 SettingsManager]: * Use SBE=true [2023-08-26 12:02:34,658 INFO L151 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2023-08-26 12:02:34,658 INFO L153 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2023-08-26 12:02:34,660 INFO L153 SettingsManager]: * sizeof long=4 [2023-08-26 12:02:34,660 INFO L153 SettingsManager]: * Overapproximate operations on floating types=true [2023-08-26 12:02:34,660 INFO L153 SettingsManager]: * sizeof POINTER=4 [2023-08-26 12:02:34,660 INFO L153 SettingsManager]: * Check division by zero=IGNORE [2023-08-26 12:02:34,660 INFO L153 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2023-08-26 12:02:34,661 INFO L153 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2023-08-26 12:02:34,661 INFO L153 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2023-08-26 12:02:34,661 INFO L153 SettingsManager]: * sizeof long double=12 [2023-08-26 12:02:34,662 INFO L153 SettingsManager]: * Check if freed pointer was valid=false [2023-08-26 12:02:34,662 INFO L153 SettingsManager]: * Use constant arrays=true [2023-08-26 12:02:34,662 INFO L151 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2023-08-26 12:02:34,663 INFO L153 SettingsManager]: * Size of a code block=SequenceOfStatements [2023-08-26 12:02:34,663 INFO L153 SettingsManager]: * To the following directory=./dump/ [2023-08-26 12:02:34,663 INFO L153 SettingsManager]: * SMT solver=External_DefaultMode [2023-08-26 12:02:34,663 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2023-08-26 12:02:34,663 INFO L151 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2023-08-26 12:02:34,664 INFO L153 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2023-08-26 12:02:34,665 INFO L153 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopsAndPotentialCycles [2023-08-26 12:02:34,665 INFO L153 SettingsManager]: * Trace refinement strategy=CAMEL [2023-08-26 12:02:34,665 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2023-08-26 12:02:34,665 INFO L153 SettingsManager]: * Automaton type used in concurrency analysis=PETRI_NET [2023-08-26 12:02:34,665 INFO L153 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2023-08-26 12:02:34,666 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:02:35,017 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2023-08-26 12:02:35,046 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2023-08-26 12:02:35,049 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2023-08-26 12:02:35,050 INFO L270 PluginConnector]: Initializing CDTParser... [2023-08-26 12:02:35,050 INFO L274 PluginConnector]: CDTParser initialized [2023-08-26 12:02:35,051 INFO L431 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../../../trunk/examples/svcomp/pthread-wmm/mix026_pso.opt_rmo.opt.i [2023-08-26 12:02:36,313 INFO L533 CDTParser]: Created temporary CDT project at NULL [2023-08-26 12:02:36,603 INFO L384 CDTParser]: Found 1 translation units. [2023-08-26 12:02:36,604 INFO L180 CDTParser]: Scanning /storage/repos/ultimate/trunk/examples/svcomp/pthread-wmm/mix026_pso.opt_rmo.opt.i [2023-08-26 12:02:36,620 INFO L427 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/d9b6b1244/92978ab7c1794b5e8a3d10e6a7244c51/FLAG57a1df9dc [2023-08-26 12:02:36,633 INFO L435 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/d9b6b1244/92978ab7c1794b5e8a3d10e6a7244c51 [2023-08-26 12:02:36,635 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2023-08-26 12:02:36,636 INFO L133 ToolchainWalker]: Walking toolchain with 5 elements. [2023-08-26 12:02:36,637 INFO L112 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2023-08-26 12:02:36,637 INFO L270 PluginConnector]: Initializing CACSL2BoogieTranslator... [2023-08-26 12:02:36,639 INFO L274 PluginConnector]: CACSL2BoogieTranslator initialized [2023-08-26 12:02:36,640 INFO L184 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 26.08 12:02:36" (1/1) ... [2023-08-26 12:02:36,641 INFO L204 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@20ef656a and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 26.08 12:02:36, skipping insertion in model container [2023-08-26 12:02:36,641 INFO L184 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 26.08 12:02:36" (1/1) ... [2023-08-26 12:02:36,700 INFO L176 MainTranslator]: Built tables and reachable declarations [2023-08-26 12:02:37,082 INFO L209 PostProcessor]: Analyzing one entry point: main [2023-08-26 12:02:37,091 INFO L201 MainTranslator]: Completed pre-run [2023-08-26 12:02:37,124 WARN L75 lationResultReporter]: Unsoundness Warning: unspecified type, defaulting to int C: short [267] [2023-08-26 12:02:37,132 WARN L75 lationResultReporter]: Unsoundness Warning: unspecified type, defaulting to int C: short [267] [2023-08-26 12:02:37,179 INFO L209 PostProcessor]: Analyzing one entry point: main [2023-08-26 12:02:37,213 WARN L669 CHandler]: The function __VERIFIER_atomic_begin is called, but not defined or handled by StandardFunctionHandler. [2023-08-26 12:02:37,214 WARN L669 CHandler]: The function __VERIFIER_atomic_end is called, but not defined or handled by StandardFunctionHandler. [2023-08-26 12:02:37,220 INFO L206 MainTranslator]: Completed translation [2023-08-26 12:02:37,221 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 26.08 12:02:37 WrapperNode [2023-08-26 12:02:37,221 INFO L131 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2023-08-26 12:02:37,222 INFO L112 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2023-08-26 12:02:37,222 INFO L270 PluginConnector]: Initializing Boogie Procedure Inliner... [2023-08-26 12:02:37,222 INFO L274 PluginConnector]: Boogie Procedure Inliner initialized [2023-08-26 12:02:37,228 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:02:37" (1/1) ... [2023-08-26 12:02:37,258 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:02:37" (1/1) ... [2023-08-26 12:02:37,301 INFO L138 Inliner]: procedures = 177, calls = 70, calls flagged for inlining = 6, calls inlined = 7, statements flattened = 151 [2023-08-26 12:02:37,302 INFO L131 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2023-08-26 12:02:37,303 INFO L112 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2023-08-26 12:02:37,303 INFO L270 PluginConnector]: Initializing Boogie Preprocessor... [2023-08-26 12:02:37,303 INFO L274 PluginConnector]: Boogie Preprocessor initialized [2023-08-26 12:02:37,311 INFO L184 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 26.08 12:02:37" (1/1) ... [2023-08-26 12:02:37,312 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 26.08 12:02:37" (1/1) ... [2023-08-26 12:02:37,328 INFO L184 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 26.08 12:02:37" (1/1) ... [2023-08-26 12:02:37,328 INFO L184 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 26.08 12:02:37" (1/1) ... [2023-08-26 12:02:37,336 INFO L184 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 26.08 12:02:37" (1/1) ... [2023-08-26 12:02:37,338 INFO L184 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 26.08 12:02:37" (1/1) ... [2023-08-26 12:02:37,340 INFO L184 PluginConnector]: Executing the observer LTLStepAnnotator from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 26.08 12:02:37" (1/1) ... [2023-08-26 12:02:37,341 INFO L184 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 26.08 12:02:37" (1/1) ... [2023-08-26 12:02:37,344 INFO L131 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2023-08-26 12:02:37,345 INFO L112 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2023-08-26 12:02:37,345 INFO L270 PluginConnector]: Initializing RCFGBuilder... [2023-08-26 12:02:37,345 INFO L274 PluginConnector]: RCFGBuilder initialized [2023-08-26 12:02:37,357 INFO L184 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 26.08 12:02:37" (1/1) ... [2023-08-26 12:02:37,361 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2023-08-26 12:02:37,369 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2023-08-26 12:02:37,382 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:02:37,392 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:02:37,414 INFO L130 BoogieDeclarations]: Found specification of procedure write~int [2023-08-26 12:02:37,415 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_atomic_begin [2023-08-26 12:02:37,415 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2023-08-26 12:02:37,415 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnStack [2023-08-26 12:02:37,415 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.dealloc [2023-08-26 12:02:37,415 INFO L130 BoogieDeclarations]: Found specification of procedure P0 [2023-08-26 12:02:37,415 INFO L138 BoogieDeclarations]: Found implementation of procedure P0 [2023-08-26 12:02:37,415 INFO L130 BoogieDeclarations]: Found specification of procedure P1 [2023-08-26 12:02:37,416 INFO L138 BoogieDeclarations]: Found implementation of procedure P1 [2023-08-26 12:02:37,416 INFO L130 BoogieDeclarations]: Found specification of procedure P2 [2023-08-26 12:02:37,416 INFO L138 BoogieDeclarations]: Found implementation of procedure P2 [2023-08-26 12:02:37,416 INFO L130 BoogieDeclarations]: Found specification of procedure P3 [2023-08-26 12:02:37,416 INFO L138 BoogieDeclarations]: Found implementation of procedure P3 [2023-08-26 12:02:37,416 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int [2023-08-26 12:02:37,416 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_atomic_end [2023-08-26 12:02:37,416 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2023-08-26 12:02:37,418 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2023-08-26 12:02:37,419 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:02:37,540 INFO L236 CfgBuilder]: Building ICFG [2023-08-26 12:02:37,541 INFO L262 CfgBuilder]: Building CFG for each procedure with an implementation [2023-08-26 12:02:37,861 INFO L277 CfgBuilder]: Performing block encoding [2023-08-26 12:02:37,996 INFO L297 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2023-08-26 12:02:37,996 INFO L302 CfgBuilder]: Removed 0 assume(true) statements. [2023-08-26 12:02:37,999 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 26.08 12:02:37 BoogieIcfgContainer [2023-08-26 12:02:37,999 INFO L131 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2023-08-26 12:02:38,002 INFO L112 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2023-08-26 12:02:38,003 INFO L270 PluginConnector]: Initializing TraceAbstraction... [2023-08-26 12:02:38,006 INFO L274 PluginConnector]: TraceAbstraction initialized [2023-08-26 12:02:38,006 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 26.08 12:02:36" (1/3) ... [2023-08-26 12:02:38,007 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@31360edf and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 26.08 12:02:38, skipping insertion in model container [2023-08-26 12:02:38,007 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 26.08 12:02:37" (2/3) ... [2023-08-26 12:02:38,007 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@31360edf and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 26.08 12:02:38, skipping insertion in model container [2023-08-26 12:02:38,007 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 26.08 12:02:37" (3/3) ... [2023-08-26 12:02:38,009 INFO L112 eAbstractionObserver]: Analyzing ICFG mix026_pso.opt_rmo.opt.i [2023-08-26 12:02:38,029 INFO L203 ceAbstractionStarter]: Automizer settings: Hoare:false NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2023-08-26 12:02:38,029 INFO L162 ceAbstractionStarter]: Applying trace abstraction to program that has 10 error locations. [2023-08-26 12:02:38,030 INFO L515 ceAbstractionStarter]: Constructing petrified ICFG for 1 thread instances. [2023-08-26 12:02:38,101 INFO L144 ThreadInstanceAdder]: Constructed 0 joinOtherThreadTransitions. [2023-08-26 12:02:38,131 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 151 places, 141 transitions, 302 flow [2023-08-26 12:02:38,183 INFO L124 PetriNetUnfolderBase]: 3/137 cut-off events. [2023-08-26 12:02:38,183 INFO L125 PetriNetUnfolderBase]: For 0/0 co-relation queries the response was YES. [2023-08-26 12:02:38,189 INFO L83 FinitePrefix]: Finished finitePrefix Result has 150 conditions, 137 events. 3/137 cut-off events. For 0/0 co-relation queries the response was YES. Maximal size of possible extension queue 4. Compared 105 event pairs, 0 based on Foata normal form. 0/124 useless extension candidates. Maximal degree in co-relation 96. Up to 2 conditions per place. [2023-08-26 12:02:38,189 INFO L82 GeneralOperation]: Start removeDead. Operand has 151 places, 141 transitions, 302 flow [2023-08-26 12:02:38,195 INFO L88 GeneralOperation]: Finished RemoveDead, result has has 147 places, 137 transitions, 286 flow [2023-08-26 12:02:38,198 INFO L124 etLargeBlockEncoding]: Petri net LBE is using variable-based independence relation. [2023-08-26 12:02:38,206 INFO L131 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 147 places, 137 transitions, 286 flow [2023-08-26 12:02:38,209 INFO L113 LiptonReduction]: Starting Lipton reduction on Petri net that has 147 places, 137 transitions, 286 flow [2023-08-26 12:02:38,209 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 147 places, 137 transitions, 286 flow [2023-08-26 12:02:38,236 INFO L124 PetriNetUnfolderBase]: 3/137 cut-off events. [2023-08-26 12:02:38,236 INFO L125 PetriNetUnfolderBase]: For 0/0 co-relation queries the response was YES. [2023-08-26 12:02:38,237 INFO L83 FinitePrefix]: Finished finitePrefix Result has 150 conditions, 137 events. 3/137 cut-off events. For 0/0 co-relation queries the response was YES. Maximal size of possible extension queue 4. Compared 105 event pairs, 0 based on Foata normal form. 0/124 useless extension candidates. Maximal degree in co-relation 96. Up to 2 conditions per place. [2023-08-26 12:02:38,239 INFO L119 LiptonReduction]: Number of co-enabled transitions 3228 [2023-08-26 12:02:42,727 INFO L134 LiptonReduction]: Checked pairs total: 8347 [2023-08-26 12:02:42,727 INFO L136 LiptonReduction]: Total number of compositions: 147 [2023-08-26 12:02:42,738 INFO L356 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2023-08-26 12:02:42,744 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;@be23c09, mLbeIndependenceSettings=[IndependenceType=SYNTACTIC, AbstractionType=NONE, UseConditional=, UseSemiCommutativity=, Solver=, SolverTimeout=] [2023-08-26 12:02:42,744 INFO L358 AbstractCegarLoop]: Starting to check reachability of 15 error locations. [2023-08-26 12:02:42,745 INFO L185 PetriNetUnfolderBase]: Found word, exiting Unfolder. [2023-08-26 12:02:42,746 INFO L124 PetriNetUnfolderBase]: 0/0 cut-off events. [2023-08-26 12:02:42,746 INFO L125 PetriNetUnfolderBase]: For 0/0 co-relation queries the response was YES. [2023-08-26 12:02:42,746 INFO L200 CegarLoopForPetriNet]: Found error trace [2023-08-26 12:02:42,746 INFO L208 CegarLoopForPetriNet]: trace histogram [1] [2023-08-26 12:02:42,747 INFO L420 AbstractCegarLoop]: === Iteration 1 === Targeting ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [P2Err0ASSERT_VIOLATIONASSERT, ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 12 more)] === [2023-08-26 12:02:42,751 INFO L145 PredicateUnifier]: Initialized classic predicate unifier [2023-08-26 12:02:42,751 INFO L85 PathProgramCache]: Analyzing trace with hash 612, now seen corresponding path program 1 times [2023-08-26 12:02:42,758 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-08-26 12:02:42,759 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [181669075] [2023-08-26 12:02:42,759 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-08-26 12:02:42,759 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-08-26 12:02:42,828 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-08-26 12:02:42,852 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:02:42,852 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-08-26 12:02:42,853 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [181669075] [2023-08-26 12:02:42,853 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [181669075] provided 1 perfect and 0 imperfect interpolant sequences [2023-08-26 12:02:42,853 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-08-26 12:02:42,853 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [0] imperfect sequences [] total 0 [2023-08-26 12:02:42,854 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1548883691] [2023-08-26 12:02:42,855 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-08-26 12:02:42,862 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 2 states [2023-08-26 12:02:42,869 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-08-26 12:02:42,892 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 2 interpolants. [2023-08-26 12:02:42,892 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=1, Invalid=1, Unknown=0, NotChecked=0, Total=2 [2023-08-26 12:02:42,894 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 127 out of 288 [2023-08-26 12:02:42,898 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 49 places, 37 transitions, 86 flow. Second operand has 2 states, 2 states have (on average 127.5) internal successors, (255), 2 states have internal predecessors, (255), 0 states have call successors, (0), 0 states 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:02:42,898 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2023-08-26 12:02:42,898 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 127 of 288 [2023-08-26 12:02:42,899 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2023-08-26 12:02:43,475 INFO L124 PetriNetUnfolderBase]: 3625/5182 cut-off events. [2023-08-26 12:02:43,475 INFO L125 PetriNetUnfolderBase]: For 20/20 co-relation queries the response was YES. [2023-08-26 12:02:43,488 INFO L83 FinitePrefix]: Finished finitePrefix Result has 10316 conditions, 5182 events. 3625/5182 cut-off events. For 20/20 co-relation queries the response was YES. Maximal size of possible extension queue 286. Compared 26674 event pairs, 3625 based on Foata normal form. 0/4485 useless extension candidates. Maximal degree in co-relation 10304. Up to 4977 conditions per place. [2023-08-26 12:02:43,517 INFO L140 encePairwiseOnDemand]: 279/288 looper letters, 24 selfloop transitions, 0 changer transitions 0/28 dead transitions. [2023-08-26 12:02:43,518 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 42 places, 28 transitions, 116 flow [2023-08-26 12:02:43,519 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2023-08-26 12:02:43,521 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 2 states. [2023-08-26 12:02:43,527 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2 states to 2 states and 287 transitions. [2023-08-26 12:02:43,530 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.4982638888888889 [2023-08-26 12:02:43,530 INFO L72 ComplementDD]: Start complementDD. Operand 2 states and 287 transitions. [2023-08-26 12:02:43,531 INFO L73 IsDeterministic]: Start isDeterministic. Operand 2 states and 287 transitions. [2023-08-26 12:02:43,532 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2023-08-26 12:02:43,534 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 2 states and 287 transitions. [2023-08-26 12:02:43,536 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 3 states, 2 states have (on average 143.5) internal successors, (287), 2 states have internal predecessors, (287), 0 states have call successors, (0), 0 states 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:02:43,540 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:02:43,541 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:02:43,543 INFO L175 Difference]: Start difference. First operand has 49 places, 37 transitions, 86 flow. Second operand 2 states and 287 transitions. [2023-08-26 12:02:43,543 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 42 places, 28 transitions, 116 flow [2023-08-26 12:02:43,548 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 38 places, 28 transitions, 112 flow, removed 0 selfloop flow, removed 4 redundant places. [2023-08-26 12:02:43,550 INFO L231 Difference]: Finished difference. Result has 38 places, 28 transitions, 64 flow [2023-08-26 12:02:43,551 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=288, PETRI_DIFFERENCE_MINUEND_FLOW=64, PETRI_DIFFERENCE_MINUEND_PLACES=37, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=28, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=0, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=28, PETRI_DIFFERENCE_SUBTRAHEND_STATES=2, PETRI_FLOW=64, PETRI_PLACES=38, PETRI_TRANSITIONS=28} [2023-08-26 12:02:43,555 INFO L281 CegarLoopForPetriNet]: 49 programPoint places, -11 predicate places. [2023-08-26 12:02:43,555 INFO L495 AbstractCegarLoop]: Abstraction has has 38 places, 28 transitions, 64 flow [2023-08-26 12:02:43,555 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 2 states, 2 states have (on average 127.5) internal successors, (255), 2 states have internal predecessors, (255), 0 states have call successors, (0), 0 states 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:02:43,555 INFO L200 CegarLoopForPetriNet]: Found error trace [2023-08-26 12:02:43,555 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1] [2023-08-26 12:02:43,556 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable0 [2023-08-26 12:02:43,556 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:02:43,556 INFO L145 PredicateUnifier]: Initialized classic predicate unifier [2023-08-26 12:02:43,556 INFO L85 PathProgramCache]: Analyzing trace with hash 1047737000, now seen corresponding path program 1 times [2023-08-26 12:02:43,557 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-08-26 12:02:43,557 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1111159314] [2023-08-26 12:02:43,557 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-08-26 12:02:43,557 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-08-26 12:02:43,614 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-08-26 12:02:43,941 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:02:43,942 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-08-26 12:02:43,942 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1111159314] [2023-08-26 12:02:43,942 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1111159314] provided 1 perfect and 0 imperfect interpolant sequences [2023-08-26 12:02:43,942 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-08-26 12:02:43,943 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [1] imperfect sequences [] total 1 [2023-08-26 12:02:43,943 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1328179518] [2023-08-26 12:02:43,943 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-08-26 12:02:43,945 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2023-08-26 12:02:43,945 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-08-26 12:02:43,946 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2023-08-26 12:02:43,946 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2023-08-26 12:02:43,948 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 126 out of 288 [2023-08-26 12:02:43,949 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 38 places, 28 transitions, 64 flow. Second operand has 3 states, 3 states have (on average 128.33333333333334) internal successors, (385), 3 states have internal predecessors, (385), 0 states have call successors, (0), 0 states 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:02:43,949 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2023-08-26 12:02:43,949 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 126 of 288 [2023-08-26 12:02:43,950 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2023-08-26 12:02:44,450 INFO L124 PetriNetUnfolderBase]: 2855/4136 cut-off events. [2023-08-26 12:02:44,450 INFO L125 PetriNetUnfolderBase]: For 0/0 co-relation queries the response was YES. [2023-08-26 12:02:44,456 INFO L83 FinitePrefix]: Finished finitePrefix Result has 8209 conditions, 4136 events. 2855/4136 cut-off events. For 0/0 co-relation queries the response was YES. Maximal size of possible extension queue 239. Compared 21064 event pairs, 785 based on Foata normal form. 0/3895 useless extension candidates. Maximal degree in co-relation 8206. Up to 3103 conditions per place. [2023-08-26 12:02:44,474 INFO L140 encePairwiseOnDemand]: 285/288 looper letters, 33 selfloop transitions, 2 changer transitions 2/41 dead transitions. [2023-08-26 12:02:44,475 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 39 places, 41 transitions, 166 flow [2023-08-26 12:02:44,476 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2023-08-26 12:02:44,476 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2023-08-26 12:02:44,479 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 416 transitions. [2023-08-26 12:02:44,480 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.48148148148148145 [2023-08-26 12:02:44,480 INFO L72 ComplementDD]: Start complementDD. Operand 3 states and 416 transitions. [2023-08-26 12:02:44,480 INFO L73 IsDeterministic]: Start isDeterministic. Operand 3 states and 416 transitions. [2023-08-26 12:02:44,481 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2023-08-26 12:02:44,481 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 3 states and 416 transitions. [2023-08-26 12:02:44,483 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 4 states, 3 states have (on average 138.66666666666666) internal successors, (416), 3 states have internal predecessors, (416), 0 states have call successors, (0), 0 states 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:02:44,486 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:02:44,487 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:02:44,488 INFO L175 Difference]: Start difference. First operand has 38 places, 28 transitions, 64 flow. Second operand 3 states and 416 transitions. [2023-08-26 12:02:44,489 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 39 places, 41 transitions, 166 flow [2023-08-26 12:02:44,491 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 39 places, 41 transitions, 166 flow, removed 0 selfloop flow, removed 0 redundant places. [2023-08-26 12:02:44,492 INFO L231 Difference]: Finished difference. Result has 39 places, 26 transitions, 64 flow [2023-08-26 12:02:44,492 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=64, PETRI_PLACES=39, PETRI_TRANSITIONS=26} [2023-08-26 12:02:44,493 INFO L281 CegarLoopForPetriNet]: 49 programPoint places, -10 predicate places. [2023-08-26 12:02:44,494 INFO L495 AbstractCegarLoop]: Abstraction has has 39 places, 26 transitions, 64 flow [2023-08-26 12:02:44,494 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 128.33333333333334) internal successors, (385), 3 states have internal predecessors, (385), 0 states have call successors, (0), 0 states 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:02:44,495 INFO L200 CegarLoopForPetriNet]: Found error trace [2023-08-26 12:02:44,497 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-08-26 12:02:44,497 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1 [2023-08-26 12:02:44,497 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:02:44,497 INFO L145 PredicateUnifier]: Initialized classic predicate unifier [2023-08-26 12:02:44,497 INFO L85 PathProgramCache]: Analyzing trace with hash -1695315027, now seen corresponding path program 1 times [2023-08-26 12:02:44,498 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-08-26 12:02:44,498 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1593523919] [2023-08-26 12:02:44,498 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-08-26 12:02:44,498 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-08-26 12:02:44,539 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-08-26 12:02:44,786 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:02:44,786 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-08-26 12:02:44,787 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1593523919] [2023-08-26 12:02:44,787 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1593523919] provided 1 perfect and 0 imperfect interpolant sequences [2023-08-26 12:02:44,788 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-08-26 12:02:44,788 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [1] imperfect sequences [] total 1 [2023-08-26 12:02:44,788 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [20455506] [2023-08-26 12:02:44,789 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-08-26 12:02:44,789 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2023-08-26 12:02:44,789 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-08-26 12:02:44,790 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2023-08-26 12:02:44,790 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2023-08-26 12:02:44,790 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 116 out of 288 [2023-08-26 12:02:44,791 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 39 places, 26 transitions, 64 flow. Second operand has 3 states, 3 states have (on average 119.66666666666667) internal successors, (359), 3 states have internal predecessors, (359), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-26 12:02:44,791 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2023-08-26 12:02:44,791 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 116 of 288 [2023-08-26 12:02:44,791 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2023-08-26 12:02:45,811 INFO L124 PetriNetUnfolderBase]: 8755/12032 cut-off events. [2023-08-26 12:02:45,811 INFO L125 PetriNetUnfolderBase]: For 408/408 co-relation queries the response was YES. [2023-08-26 12:02:45,838 INFO L83 FinitePrefix]: Finished finitePrefix Result has 24755 conditions, 12032 events. 8755/12032 cut-off events. For 408/408 co-relation queries the response was YES. Maximal size of possible extension queue 429. Compared 59489 event pairs, 2987 based on Foata normal form. 296/12328 useless extension candidates. Maximal degree in co-relation 24751. Up to 8389 conditions per place. [2023-08-26 12:02:45,898 INFO L140 encePairwiseOnDemand]: 280/288 looper letters, 42 selfloop transitions, 7 changer transitions 0/49 dead transitions. [2023-08-26 12:02:45,899 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 40 places, 49 transitions, 216 flow [2023-08-26 12:02:45,899 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2023-08-26 12:02:45,899 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2023-08-26 12:02:45,900 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 398 transitions. [2023-08-26 12:02:45,900 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.46064814814814814 [2023-08-26 12:02:45,900 INFO L72 ComplementDD]: Start complementDD. Operand 3 states and 398 transitions. [2023-08-26 12:02:45,900 INFO L73 IsDeterministic]: Start isDeterministic. Operand 3 states and 398 transitions. [2023-08-26 12:02:45,901 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2023-08-26 12:02:45,901 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 3 states and 398 transitions. [2023-08-26 12:02:45,902 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 4 states, 3 states have (on average 132.66666666666666) internal successors, (398), 3 states have internal predecessors, (398), 0 states have call successors, (0), 0 states 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:02:45,903 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:02:45,904 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:02:45,905 INFO L175 Difference]: Start difference. First operand has 39 places, 26 transitions, 64 flow. Second operand 3 states and 398 transitions. [2023-08-26 12:02:45,905 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 40 places, 49 transitions, 216 flow [2023-08-26 12:02:45,906 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 38 places, 49 transitions, 210 flow, removed 0 selfloop flow, removed 2 redundant places. [2023-08-26 12:02:45,907 INFO L231 Difference]: Finished difference. Result has 40 places, 32 transitions, 114 flow [2023-08-26 12:02:45,907 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=288, PETRI_DIFFERENCE_MINUEND_FLOW=60, PETRI_DIFFERENCE_MINUEND_PLACES=36, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=26, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=1, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=19, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=114, PETRI_PLACES=40, PETRI_TRANSITIONS=32} [2023-08-26 12:02:45,909 INFO L281 CegarLoopForPetriNet]: 49 programPoint places, -9 predicate places. [2023-08-26 12:02:45,909 INFO L495 AbstractCegarLoop]: Abstraction has has 40 places, 32 transitions, 114 flow [2023-08-26 12:02:45,909 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 119.66666666666667) internal successors, (359), 3 states have internal predecessors, (359), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-26 12:02:45,909 INFO L200 CegarLoopForPetriNet]: Found error trace [2023-08-26 12:02:45,909 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-08-26 12:02:45,909 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2 [2023-08-26 12:02:45,913 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:02:45,913 INFO L145 PredicateUnifier]: Initialized classic predicate unifier [2023-08-26 12:02:45,913 INFO L85 PathProgramCache]: Analyzing trace with hash -1015159834, now seen corresponding path program 1 times [2023-08-26 12:02:45,913 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-08-26 12:02:45,914 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [26537356] [2023-08-26 12:02:45,914 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-08-26 12:02:45,914 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-08-26 12:02:45,934 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-08-26 12:02:46,051 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:02:46,052 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-08-26 12:02:46,052 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [26537356] [2023-08-26 12:02:46,052 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [26537356] provided 1 perfect and 0 imperfect interpolant sequences [2023-08-26 12:02:46,052 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-08-26 12:02:46,052 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2023-08-26 12:02:46,053 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2138975196] [2023-08-26 12:02:46,053 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-08-26 12:02:46,053 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2023-08-26 12:02:46,053 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-08-26 12:02:46,053 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2023-08-26 12:02:46,054 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2023-08-26 12:02:46,054 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 116 out of 288 [2023-08-26 12:02:46,055 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 40 places, 32 transitions, 114 flow. Second operand has 4 states, 4 states have (on average 119.0) internal successors, (476), 4 states have internal predecessors, (476), 0 states have call successors, (0), 0 states 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:02:46,055 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2023-08-26 12:02:46,055 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 116 of 288 [2023-08-26 12:02:46,055 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2023-08-26 12:02:46,977 INFO L124 PetriNetUnfolderBase]: 8127/11180 cut-off events. [2023-08-26 12:02:46,977 INFO L125 PetriNetUnfolderBase]: For 3939/3939 co-relation queries the response was YES. [2023-08-26 12:02:46,996 INFO L83 FinitePrefix]: Finished finitePrefix Result has 27577 conditions, 11180 events. 8127/11180 cut-off events. For 3939/3939 co-relation queries the response was YES. Maximal size of possible extension queue 381. Compared 53672 event pairs, 2207 based on Foata normal form. 140/11320 useless extension candidates. Maximal degree in co-relation 27572. Up to 5569 conditions per place. [2023-08-26 12:02:47,039 INFO L140 encePairwiseOnDemand]: 281/288 looper letters, 49 selfloop transitions, 7 changer transitions 0/56 dead transitions. [2023-08-26 12:02:47,039 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 43 places, 56 transitions, 290 flow [2023-08-26 12:02:47,040 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2023-08-26 12:02:47,040 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 4 states. [2023-08-26 12:02:47,041 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 516 transitions. [2023-08-26 12:02:47,042 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.4479166666666667 [2023-08-26 12:02:47,042 INFO L72 ComplementDD]: Start complementDD. Operand 4 states and 516 transitions. [2023-08-26 12:02:47,042 INFO L73 IsDeterministic]: Start isDeterministic. Operand 4 states and 516 transitions. [2023-08-26 12:02:47,042 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2023-08-26 12:02:47,042 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 4 states and 516 transitions. [2023-08-26 12:02:47,044 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 5 states, 4 states have (on average 129.0) internal successors, (516), 4 states have internal predecessors, (516), 0 states have call successors, (0), 0 states 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:02:47,045 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:02:47,046 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:02:47,046 INFO L175 Difference]: Start difference. First operand has 40 places, 32 transitions, 114 flow. Second operand 4 states and 516 transitions. [2023-08-26 12:02:47,046 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 43 places, 56 transitions, 290 flow [2023-08-26 12:02:47,065 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 41 places, 56 transitions, 270 flow, removed 0 selfloop flow, removed 2 redundant places. [2023-08-26 12:02:47,066 INFO L231 Difference]: Finished difference. Result has 44 places, 35 transitions, 148 flow [2023-08-26 12:02:47,066 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=288, PETRI_DIFFERENCE_MINUEND_FLOW=100, PETRI_DIFFERENCE_MINUEND_PLACES=38, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=32, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=4, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=25, PETRI_DIFFERENCE_SUBTRAHEND_STATES=4, PETRI_FLOW=148, PETRI_PLACES=44, PETRI_TRANSITIONS=35} [2023-08-26 12:02:47,068 INFO L281 CegarLoopForPetriNet]: 49 programPoint places, -5 predicate places. [2023-08-26 12:02:47,068 INFO L495 AbstractCegarLoop]: Abstraction has has 44 places, 35 transitions, 148 flow [2023-08-26 12:02:47,068 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 119.0) internal successors, (476), 4 states have internal predecessors, (476), 0 states have call successors, (0), 0 states 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:02:47,068 INFO L200 CegarLoopForPetriNet]: Found error trace [2023-08-26 12:02:47,068 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-08-26 12:02:47,069 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable3 [2023-08-26 12:02:47,069 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:02:47,070 INFO L145 PredicateUnifier]: Initialized classic predicate unifier [2023-08-26 12:02:47,070 INFO L85 PathProgramCache]: Analyzing trace with hash -1447250409, now seen corresponding path program 1 times [2023-08-26 12:02:47,070 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-08-26 12:02:47,070 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [246413117] [2023-08-26 12:02:47,070 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-08-26 12:02:47,070 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-08-26 12:02:47,124 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-08-26 12:02:47,268 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:02:47,268 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-08-26 12:02:47,268 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [246413117] [2023-08-26 12:02:47,269 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [246413117] provided 1 perfect and 0 imperfect interpolant sequences [2023-08-26 12:02:47,269 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-08-26 12:02:47,269 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2023-08-26 12:02:47,272 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1075034449] [2023-08-26 12:02:47,272 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-08-26 12:02:47,273 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2023-08-26 12:02:47,273 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-08-26 12:02:47,273 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2023-08-26 12:02:47,274 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2023-08-26 12:02:47,274 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 119 out of 288 [2023-08-26 12:02:47,275 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 44 places, 35 transitions, 148 flow. Second operand has 4 states, 4 states have (on average 122.0) internal successors, (488), 4 states have internal predecessors, (488), 0 states have call successors, (0), 0 states 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:02:47,277 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2023-08-26 12:02:47,277 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 119 of 288 [2023-08-26 12:02:47,278 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2023-08-26 12:02:47,949 INFO L292 olderBase$Statistics]: inserting event number 4 for the transition-marking pair ([425] L832-->L839: Formula: (let ((.cse2 (not (= (mod v_~y$w_buff0_used~0_97 256) 0))) (.cse5 (not (= (mod v_~y$r_buff0_thd4~0_26 256) 0))) (.cse3 (not (= (mod v_~y$r_buff1_thd4~0_24 256) 0)))) (let ((.cse1 (and (not (= (mod v_~y$w_buff1_used~0_81 256) 0)) .cse3)) (.cse4 (and (not (= (mod v_~y$w_buff0_used~0_98 256) 0)) .cse5)) (.cse0 (and .cse2 .cse5))) (and (= v_~y$w_buff1_used~0_80 (ite (or .cse0 .cse1) 0 v_~y$w_buff1_used~0_81)) (= (ite (or (and (not (= (mod v_~y$r_buff0_thd4~0_25 256) 0)) .cse2) (and (not (= (mod v_~y$w_buff1_used~0_80 256) 0)) .cse3)) 0 v_~y$r_buff1_thd4~0_24) v_~y$r_buff1_thd4~0_23) (= v_~y~0_62 (ite .cse4 v_~y$w_buff0~0_46 (ite .cse1 v_~y$w_buff1~0_45 v_~y~0_63))) (= v_~y$w_buff0_used~0_97 (ite .cse4 0 v_~y$w_buff0_used~0_98)) (= v_~y$r_buff0_thd4~0_25 (ite .cse0 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_24, ~y$w_buff0_used~0=v_~y$w_buff0_used~0_98, ~y$w_buff1~0=v_~y$w_buff1~0_45, ~y$w_buff0~0=v_~y$w_buff0~0_46, ~y~0=v_~y~0_63, ~y$w_buff1_used~0=v_~y$w_buff1_used~0_81} OutVars{~y$r_buff0_thd4~0=v_~y$r_buff0_thd4~0_25, ~y$r_buff1_thd4~0=v_~y$r_buff1_thd4~0_23, ~y$w_buff0_used~0=v_~y$w_buff0_used~0_97, ~y$w_buff1~0=v_~y$w_buff1~0_45, ~y$w_buff0~0=v_~y$w_buff0~0_46, ~y~0=v_~y~0_62, ~y$w_buff1_used~0=v_~y$w_buff1_used~0_80} AuxVars[] AssignedVars[~y$r_buff0_thd4~0, ~y$r_buff1_thd4~0, ~y$w_buff0_used~0, ~y~0, ~y$w_buff1_used~0][69], [154#true, Black: 163#(or (not (= 2 ~__unbuffered_p3_EAX~0)) (not (= ~__unbuffered_p1_EAX~0 0)) (not (= ~__unbuffered_p3_EBX~0 0)) (not (= ~__unbuffered_p0_EAX~0 0)) (not (= 2 ~z~0))), 63#L756true, 43#L784true, Black: 170#(or (not (= 2 ~__unbuffered_p3_EAX~0)) (not (= ~__unbuffered_p1_EAX~0 0)) (not (= ~__unbuffered_p3_EBX~0 0)) (not (= ~__unbuffered_p0_EAX~0 0)) (not (= 2 ~z~0))), Black: 169#(= ~__unbuffered_p3_EAX~0 0), 167#true, P1Thread1of1ForFork2InUse, P2Thread1of1ForFork1InUse, P0Thread1of1ForFork0InUse, 78#L2true, 175#true, P3Thread1of1ForFork3InUse, 58#L839true, 19#P2EXITtrue]) [2023-08-26 12:02:47,950 INFO L294 olderBase$Statistics]: this new event has 21 ancestors and is cut-off event [2023-08-26 12:02:47,950 INFO L297 olderBase$Statistics]: existing Event has 21 ancestors and is cut-off event [2023-08-26 12:02:47,950 INFO L297 olderBase$Statistics]: existing Event has 21 ancestors and is cut-off event [2023-08-26 12:02:47,950 INFO L297 olderBase$Statistics]: existing Event has 21 ancestors and is cut-off event [2023-08-26 12:02:48,053 INFO L292 olderBase$Statistics]: inserting event number 4 for the transition-marking pair ([425] L832-->L839: Formula: (let ((.cse2 (not (= (mod v_~y$w_buff0_used~0_97 256) 0))) (.cse5 (not (= (mod v_~y$r_buff0_thd4~0_26 256) 0))) (.cse3 (not (= (mod v_~y$r_buff1_thd4~0_24 256) 0)))) (let ((.cse1 (and (not (= (mod v_~y$w_buff1_used~0_81 256) 0)) .cse3)) (.cse4 (and (not (= (mod v_~y$w_buff0_used~0_98 256) 0)) .cse5)) (.cse0 (and .cse2 .cse5))) (and (= v_~y$w_buff1_used~0_80 (ite (or .cse0 .cse1) 0 v_~y$w_buff1_used~0_81)) (= (ite (or (and (not (= (mod v_~y$r_buff0_thd4~0_25 256) 0)) .cse2) (and (not (= (mod v_~y$w_buff1_used~0_80 256) 0)) .cse3)) 0 v_~y$r_buff1_thd4~0_24) v_~y$r_buff1_thd4~0_23) (= v_~y~0_62 (ite .cse4 v_~y$w_buff0~0_46 (ite .cse1 v_~y$w_buff1~0_45 v_~y~0_63))) (= v_~y$w_buff0_used~0_97 (ite .cse4 0 v_~y$w_buff0_used~0_98)) (= v_~y$r_buff0_thd4~0_25 (ite .cse0 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_24, ~y$w_buff0_used~0=v_~y$w_buff0_used~0_98, ~y$w_buff1~0=v_~y$w_buff1~0_45, ~y$w_buff0~0=v_~y$w_buff0~0_46, ~y~0=v_~y~0_63, ~y$w_buff1_used~0=v_~y$w_buff1_used~0_81} OutVars{~y$r_buff0_thd4~0=v_~y$r_buff0_thd4~0_25, ~y$r_buff1_thd4~0=v_~y$r_buff1_thd4~0_23, ~y$w_buff0_used~0=v_~y$w_buff0_used~0_97, ~y$w_buff1~0=v_~y$w_buff1~0_45, ~y$w_buff0~0=v_~y$w_buff0~0_46, ~y~0=v_~y~0_62, ~y$w_buff1_used~0=v_~y$w_buff1_used~0_80} AuxVars[] AssignedVars[~y$r_buff0_thd4~0, ~y$r_buff1_thd4~0, ~y$w_buff0_used~0, ~y~0, ~y$w_buff1_used~0][69], [154#true, Black: 163#(or (not (= 2 ~__unbuffered_p3_EAX~0)) (not (= ~__unbuffered_p1_EAX~0 0)) (not (= ~__unbuffered_p3_EBX~0 0)) (not (= ~__unbuffered_p0_EAX~0 0)) (not (= 2 ~z~0))), 63#L756true, 97#P1EXITtrue, Black: 170#(or (not (= 2 ~__unbuffered_p3_EAX~0)) (not (= ~__unbuffered_p1_EAX~0 0)) (not (= ~__unbuffered_p3_EBX~0 0)) (not (= ~__unbuffered_p0_EAX~0 0)) (not (= 2 ~z~0))), Black: 169#(= ~__unbuffered_p3_EAX~0 0), 167#true, P1Thread1of1ForFork2InUse, P2Thread1of1ForFork1InUse, P0Thread1of1ForFork0InUse, 78#L2true, P3Thread1of1ForFork3InUse, 175#true, 58#L839true, 19#P2EXITtrue]) [2023-08-26 12:02:48,053 INFO L294 olderBase$Statistics]: this new event has 22 ancestors and is cut-off event [2023-08-26 12:02:48,053 INFO L297 olderBase$Statistics]: existing Event has 22 ancestors and is cut-off event [2023-08-26 12:02:48,053 INFO L297 olderBase$Statistics]: existing Event has 22 ancestors and is cut-off event [2023-08-26 12:02:48,053 INFO L297 olderBase$Statistics]: existing Event has 22 ancestors and is cut-off event [2023-08-26 12:02:48,054 INFO L292 olderBase$Statistics]: inserting event number 4 for the transition-marking pair ([559] L874-->ULTIMATE.startErr8ASSERT_VIOLATIONASSERT: Formula: (and (= v_~main$tmp_guard1~0_16 (ite (= (ite (not (and (= v_~__unbuffered_p0_EAX~0_18 0) (= 2 v_~__unbuffered_p3_EAX~0_18) (= v_~__unbuffered_p1_EAX~0_26 0) (= 0 v_~__unbuffered_p3_EBX~0_16) (= v_~z~0_20 2))) 1 0) 0) 0 1)) (= |v_ULTIMATE.start___VERIFIER_assert_~expression#1_35| 0) (= (mod v_~main$tmp_guard1~0_16 256) |v_ULTIMATE.start___VERIFIER_assert_#in~expression#1_25|) (= |v_ULTIMATE.start___VERIFIER_assert_#in~expression#1_25| |v_ULTIMATE.start___VERIFIER_assert_~expression#1_35|)) InVars {~__unbuffered_p0_EAX~0=v_~__unbuffered_p0_EAX~0_18, ~__unbuffered_p1_EAX~0=v_~__unbuffered_p1_EAX~0_26, ~__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} 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_35|, ~__unbuffered_p0_EAX~0=v_~__unbuffered_p0_EAX~0_18, 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_26, 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} 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][78], [154#true, Black: 163#(or (not (= 2 ~__unbuffered_p3_EAX~0)) (not (= ~__unbuffered_p1_EAX~0 0)) (not (= ~__unbuffered_p3_EBX~0 0)) (not (= ~__unbuffered_p0_EAX~0 0)) (not (= 2 ~z~0))), 63#L756true, 62#L832true, 43#L784true, Black: 170#(or (not (= 2 ~__unbuffered_p3_EAX~0)) (not (= ~__unbuffered_p1_EAX~0 0)) (not (= ~__unbuffered_p3_EBX~0 0)) (not (= ~__unbuffered_p0_EAX~0 0)) (not (= 2 ~z~0))), Black: 169#(= ~__unbuffered_p3_EAX~0 0), 167#true, P1Thread1of1ForFork2InUse, P2Thread1of1ForFork1InUse, P0Thread1of1ForFork0InUse, P3Thread1of1ForFork3InUse, 175#true, 13#ULTIMATE.startErr8ASSERT_VIOLATIONASSERTtrue, 19#P2EXITtrue]) [2023-08-26 12:02:48,054 INFO L294 olderBase$Statistics]: this new event has 22 ancestors and is cut-off event [2023-08-26 12:02:48,054 INFO L297 olderBase$Statistics]: existing Event has 22 ancestors and is cut-off event [2023-08-26 12:02:48,055 INFO L297 olderBase$Statistics]: existing Event has 22 ancestors and is cut-off event [2023-08-26 12:02:48,055 INFO L297 olderBase$Statistics]: existing Event has 22 ancestors and is cut-off event [2023-08-26 12:02:48,055 INFO L292 olderBase$Statistics]: inserting event number 4 for the transition-marking pair ([425] L832-->L839: Formula: (let ((.cse2 (not (= (mod v_~y$w_buff0_used~0_97 256) 0))) (.cse5 (not (= (mod v_~y$r_buff0_thd4~0_26 256) 0))) (.cse3 (not (= (mod v_~y$r_buff1_thd4~0_24 256) 0)))) (let ((.cse1 (and (not (= (mod v_~y$w_buff1_used~0_81 256) 0)) .cse3)) (.cse4 (and (not (= (mod v_~y$w_buff0_used~0_98 256) 0)) .cse5)) (.cse0 (and .cse2 .cse5))) (and (= v_~y$w_buff1_used~0_80 (ite (or .cse0 .cse1) 0 v_~y$w_buff1_used~0_81)) (= (ite (or (and (not (= (mod v_~y$r_buff0_thd4~0_25 256) 0)) .cse2) (and (not (= (mod v_~y$w_buff1_used~0_80 256) 0)) .cse3)) 0 v_~y$r_buff1_thd4~0_24) v_~y$r_buff1_thd4~0_23) (= v_~y~0_62 (ite .cse4 v_~y$w_buff0~0_46 (ite .cse1 v_~y$w_buff1~0_45 v_~y~0_63))) (= v_~y$w_buff0_used~0_97 (ite .cse4 0 v_~y$w_buff0_used~0_98)) (= v_~y$r_buff0_thd4~0_25 (ite .cse0 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_24, ~y$w_buff0_used~0=v_~y$w_buff0_used~0_98, ~y$w_buff1~0=v_~y$w_buff1~0_45, ~y$w_buff0~0=v_~y$w_buff0~0_46, ~y~0=v_~y~0_63, ~y$w_buff1_used~0=v_~y$w_buff1_used~0_81} OutVars{~y$r_buff0_thd4~0=v_~y$r_buff0_thd4~0_25, ~y$r_buff1_thd4~0=v_~y$r_buff1_thd4~0_23, ~y$w_buff0_used~0=v_~y$w_buff0_used~0_97, ~y$w_buff1~0=v_~y$w_buff1~0_45, ~y$w_buff0~0=v_~y$w_buff0~0_46, ~y~0=v_~y~0_62, ~y$w_buff1_used~0=v_~y$w_buff1_used~0_80} AuxVars[] AssignedVars[~y$r_buff0_thd4~0, ~y$r_buff1_thd4~0, ~y$w_buff0_used~0, ~y~0, ~y$w_buff1_used~0][69], [154#true, Black: 163#(or (not (= 2 ~__unbuffered_p3_EAX~0)) (not (= ~__unbuffered_p1_EAX~0 0)) (not (= ~__unbuffered_p3_EBX~0 0)) (not (= ~__unbuffered_p0_EAX~0 0)) (not (= 2 ~z~0))), 63#L756true, 84#L874true, 43#L784true, Black: 170#(or (not (= 2 ~__unbuffered_p3_EAX~0)) (not (= ~__unbuffered_p1_EAX~0 0)) (not (= ~__unbuffered_p3_EBX~0 0)) (not (= ~__unbuffered_p0_EAX~0 0)) (not (= 2 ~z~0))), Black: 169#(= ~__unbuffered_p3_EAX~0 0), 167#true, P1Thread1of1ForFork2InUse, P2Thread1of1ForFork1InUse, P0Thread1of1ForFork0InUse, P3Thread1of1ForFork3InUse, 175#true, 19#P2EXITtrue, 58#L839true]) [2023-08-26 12:02:48,055 INFO L294 olderBase$Statistics]: this new event has 22 ancestors and is cut-off event [2023-08-26 12:02:48,055 INFO L297 olderBase$Statistics]: existing Event has 22 ancestors and is cut-off event [2023-08-26 12:02:48,055 INFO L297 olderBase$Statistics]: existing Event has 22 ancestors and is cut-off event [2023-08-26 12:02:48,055 INFO L297 olderBase$Statistics]: existing Event has 22 ancestors and is cut-off event [2023-08-26 12:02:48,094 INFO L292 olderBase$Statistics]: inserting event number 4 for the transition-marking pair ([559] L874-->ULTIMATE.startErr8ASSERT_VIOLATIONASSERT: Formula: (and (= v_~main$tmp_guard1~0_16 (ite (= (ite (not (and (= v_~__unbuffered_p0_EAX~0_18 0) (= 2 v_~__unbuffered_p3_EAX~0_18) (= v_~__unbuffered_p1_EAX~0_26 0) (= 0 v_~__unbuffered_p3_EBX~0_16) (= v_~z~0_20 2))) 1 0) 0) 0 1)) (= |v_ULTIMATE.start___VERIFIER_assert_~expression#1_35| 0) (= (mod v_~main$tmp_guard1~0_16 256) |v_ULTIMATE.start___VERIFIER_assert_#in~expression#1_25|) (= |v_ULTIMATE.start___VERIFIER_assert_#in~expression#1_25| |v_ULTIMATE.start___VERIFIER_assert_~expression#1_35|)) InVars {~__unbuffered_p0_EAX~0=v_~__unbuffered_p0_EAX~0_18, ~__unbuffered_p1_EAX~0=v_~__unbuffered_p1_EAX~0_26, ~__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} 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_35|, ~__unbuffered_p0_EAX~0=v_~__unbuffered_p0_EAX~0_18, 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_26, 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} 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][78], [154#true, Black: 163#(or (not (= 2 ~__unbuffered_p3_EAX~0)) (not (= ~__unbuffered_p1_EAX~0 0)) (not (= ~__unbuffered_p3_EBX~0 0)) (not (= ~__unbuffered_p0_EAX~0 0)) (not (= 2 ~z~0))), 63#L756true, 62#L832true, 97#P1EXITtrue, Black: 170#(or (not (= 2 ~__unbuffered_p3_EAX~0)) (not (= ~__unbuffered_p1_EAX~0 0)) (not (= ~__unbuffered_p3_EBX~0 0)) (not (= ~__unbuffered_p0_EAX~0 0)) (not (= 2 ~z~0))), Black: 169#(= ~__unbuffered_p3_EAX~0 0), 167#true, P1Thread1of1ForFork2InUse, P2Thread1of1ForFork1InUse, P0Thread1of1ForFork0InUse, P3Thread1of1ForFork3InUse, 175#true, 13#ULTIMATE.startErr8ASSERT_VIOLATIONASSERTtrue, 19#P2EXITtrue]) [2023-08-26 12:02:48,095 INFO L294 olderBase$Statistics]: this new event has 23 ancestors and is cut-off event [2023-08-26 12:02:48,095 INFO L297 olderBase$Statistics]: existing Event has 23 ancestors and is cut-off event [2023-08-26 12:02:48,095 INFO L297 olderBase$Statistics]: existing Event has 23 ancestors and is cut-off event [2023-08-26 12:02:48,095 INFO L297 olderBase$Statistics]: existing Event has 23 ancestors and is cut-off event [2023-08-26 12:02:48,095 INFO L292 olderBase$Statistics]: inserting event number 4 for the transition-marking pair ([425] L832-->L839: Formula: (let ((.cse2 (not (= (mod v_~y$w_buff0_used~0_97 256) 0))) (.cse5 (not (= (mod v_~y$r_buff0_thd4~0_26 256) 0))) (.cse3 (not (= (mod v_~y$r_buff1_thd4~0_24 256) 0)))) (let ((.cse1 (and (not (= (mod v_~y$w_buff1_used~0_81 256) 0)) .cse3)) (.cse4 (and (not (= (mod v_~y$w_buff0_used~0_98 256) 0)) .cse5)) (.cse0 (and .cse2 .cse5))) (and (= v_~y$w_buff1_used~0_80 (ite (or .cse0 .cse1) 0 v_~y$w_buff1_used~0_81)) (= (ite (or (and (not (= (mod v_~y$r_buff0_thd4~0_25 256) 0)) .cse2) (and (not (= (mod v_~y$w_buff1_used~0_80 256) 0)) .cse3)) 0 v_~y$r_buff1_thd4~0_24) v_~y$r_buff1_thd4~0_23) (= v_~y~0_62 (ite .cse4 v_~y$w_buff0~0_46 (ite .cse1 v_~y$w_buff1~0_45 v_~y~0_63))) (= v_~y$w_buff0_used~0_97 (ite .cse4 0 v_~y$w_buff0_used~0_98)) (= v_~y$r_buff0_thd4~0_25 (ite .cse0 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_24, ~y$w_buff0_used~0=v_~y$w_buff0_used~0_98, ~y$w_buff1~0=v_~y$w_buff1~0_45, ~y$w_buff0~0=v_~y$w_buff0~0_46, ~y~0=v_~y~0_63, ~y$w_buff1_used~0=v_~y$w_buff1_used~0_81} OutVars{~y$r_buff0_thd4~0=v_~y$r_buff0_thd4~0_25, ~y$r_buff1_thd4~0=v_~y$r_buff1_thd4~0_23, ~y$w_buff0_used~0=v_~y$w_buff0_used~0_97, ~y$w_buff1~0=v_~y$w_buff1~0_45, ~y$w_buff0~0=v_~y$w_buff0~0_46, ~y~0=v_~y~0_62, ~y$w_buff1_used~0=v_~y$w_buff1_used~0_80} AuxVars[] AssignedVars[~y$r_buff0_thd4~0, ~y$r_buff1_thd4~0, ~y$w_buff0_used~0, ~y~0, ~y$w_buff1_used~0][69], [154#true, Black: 163#(or (not (= 2 ~__unbuffered_p3_EAX~0)) (not (= ~__unbuffered_p1_EAX~0 0)) (not (= ~__unbuffered_p3_EBX~0 0)) (not (= ~__unbuffered_p0_EAX~0 0)) (not (= 2 ~z~0))), 63#L756true, 84#L874true, 97#P1EXITtrue, Black: 170#(or (not (= 2 ~__unbuffered_p3_EAX~0)) (not (= ~__unbuffered_p1_EAX~0 0)) (not (= ~__unbuffered_p3_EBX~0 0)) (not (= ~__unbuffered_p0_EAX~0 0)) (not (= 2 ~z~0))), Black: 169#(= ~__unbuffered_p3_EAX~0 0), 167#true, P1Thread1of1ForFork2InUse, P2Thread1of1ForFork1InUse, P0Thread1of1ForFork0InUse, P3Thread1of1ForFork3InUse, 175#true, 19#P2EXITtrue, 58#L839true]) [2023-08-26 12:02:48,095 INFO L294 olderBase$Statistics]: this new event has 23 ancestors and is cut-off event [2023-08-26 12:02:48,095 INFO L297 olderBase$Statistics]: existing Event has 23 ancestors and is cut-off event [2023-08-26 12:02:48,096 INFO L297 olderBase$Statistics]: existing Event has 23 ancestors and is cut-off event [2023-08-26 12:02:48,096 INFO L297 olderBase$Statistics]: existing Event has 23 ancestors and is cut-off event [2023-08-26 12:02:48,121 INFO L124 PetriNetUnfolderBase]: 5046/7553 cut-off events. [2023-08-26 12:02:48,121 INFO L125 PetriNetUnfolderBase]: For 2698/2829 co-relation queries the response was YES. [2023-08-26 12:02:48,134 INFO L83 FinitePrefix]: Finished finitePrefix Result has 17727 conditions, 7553 events. 5046/7553 cut-off events. For 2698/2829 co-relation queries the response was YES. Maximal size of possible extension queue 519. Compared 45209 event pairs, 929 based on Foata normal form. 594/7862 useless extension candidates. Maximal degree in co-relation 17720. Up to 4925 conditions per place. [2023-08-26 12:02:48,157 INFO L140 encePairwiseOnDemand]: 281/288 looper letters, 64 selfloop transitions, 10 changer transitions 0/84 dead transitions. [2023-08-26 12:02:48,157 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 48 places, 84 transitions, 448 flow [2023-08-26 12:02:48,158 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2023-08-26 12:02:48,158 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 5 states. [2023-08-26 12:02:48,159 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 659 transitions. [2023-08-26 12:02:48,160 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.4576388888888889 [2023-08-26 12:02:48,160 INFO L72 ComplementDD]: Start complementDD. Operand 5 states and 659 transitions. [2023-08-26 12:02:48,160 INFO L73 IsDeterministic]: Start isDeterministic. Operand 5 states and 659 transitions. [2023-08-26 12:02:48,160 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2023-08-26 12:02:48,160 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 5 states and 659 transitions. [2023-08-26 12:02:48,162 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 6 states, 5 states have (on average 131.8) internal successors, (659), 5 states have internal predecessors, (659), 0 states have call successors, (0), 0 states 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:02:48,164 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:02:48,165 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:02:48,165 INFO L175 Difference]: Start difference. First operand has 44 places, 35 transitions, 148 flow. Second operand 5 states and 659 transitions. [2023-08-26 12:02:48,165 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 48 places, 84 transitions, 448 flow [2023-08-26 12:02:48,172 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 47 places, 84 transitions, 445 flow, removed 0 selfloop flow, removed 1 redundant places. [2023-08-26 12:02:48,173 INFO L231 Difference]: Finished difference. Result has 50 places, 44 transitions, 220 flow [2023-08-26 12:02:48,173 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=288, PETRI_DIFFERENCE_MINUEND_FLOW=145, PETRI_DIFFERENCE_MINUEND_PLACES=43, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=35, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=1, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=29, PETRI_DIFFERENCE_SUBTRAHEND_STATES=5, PETRI_FLOW=220, PETRI_PLACES=50, PETRI_TRANSITIONS=44} [2023-08-26 12:02:48,174 INFO L281 CegarLoopForPetriNet]: 49 programPoint places, 1 predicate places. [2023-08-26 12:02:48,174 INFO L495 AbstractCegarLoop]: Abstraction has has 50 places, 44 transitions, 220 flow [2023-08-26 12:02:48,175 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 122.0) internal successors, (488), 4 states have internal predecessors, (488), 0 states have call successors, (0), 0 states 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:02:48,175 INFO L200 CegarLoopForPetriNet]: Found error trace [2023-08-26 12:02:48,175 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-08-26 12:02:48,175 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable4 [2023-08-26 12:02:48,175 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:02:48,175 INFO L145 PredicateUnifier]: Initialized classic predicate unifier [2023-08-26 12:02:48,175 INFO L85 PathProgramCache]: Analyzing trace with hash 1449693287, now seen corresponding path program 1 times [2023-08-26 12:02:48,176 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-08-26 12:02:48,176 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1347360361] [2023-08-26 12:02:48,176 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-08-26 12:02:48,176 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-08-26 12:02:48,198 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-08-26 12:02:48,311 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:02:48,311 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-08-26 12:02:48,311 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1347360361] [2023-08-26 12:02:48,312 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1347360361] provided 1 perfect and 0 imperfect interpolant sequences [2023-08-26 12:02:48,312 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-08-26 12:02:48,312 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2023-08-26 12:02:48,312 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1133653766] [2023-08-26 12:02:48,312 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-08-26 12:02:48,312 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2023-08-26 12:02:48,312 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-08-26 12:02:48,313 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2023-08-26 12:02:48,313 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=8, Invalid=12, Unknown=0, NotChecked=0, Total=20 [2023-08-26 12:02:48,313 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 119 out of 288 [2023-08-26 12:02:48,314 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 50 places, 44 transitions, 220 flow. Second operand has 5 states, 5 states have (on average 121.8) internal successors, (609), 5 states have internal predecessors, (609), 0 states have call successors, (0), 0 states 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:02:48,314 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2023-08-26 12:02:48,314 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 119 of 288 [2023-08-26 12:02:48,314 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2023-08-26 12:02:48,915 INFO L292 olderBase$Statistics]: inserting event number 4 for the transition-marking pair ([425] L832-->L839: Formula: (let ((.cse2 (not (= (mod v_~y$w_buff0_used~0_97 256) 0))) (.cse5 (not (= (mod v_~y$r_buff0_thd4~0_26 256) 0))) (.cse3 (not (= (mod v_~y$r_buff1_thd4~0_24 256) 0)))) (let ((.cse1 (and (not (= (mod v_~y$w_buff1_used~0_81 256) 0)) .cse3)) (.cse4 (and (not (= (mod v_~y$w_buff0_used~0_98 256) 0)) .cse5)) (.cse0 (and .cse2 .cse5))) (and (= v_~y$w_buff1_used~0_80 (ite (or .cse0 .cse1) 0 v_~y$w_buff1_used~0_81)) (= (ite (or (and (not (= (mod v_~y$r_buff0_thd4~0_25 256) 0)) .cse2) (and (not (= (mod v_~y$w_buff1_used~0_80 256) 0)) .cse3)) 0 v_~y$r_buff1_thd4~0_24) v_~y$r_buff1_thd4~0_23) (= v_~y~0_62 (ite .cse4 v_~y$w_buff0~0_46 (ite .cse1 v_~y$w_buff1~0_45 v_~y~0_63))) (= v_~y$w_buff0_used~0_97 (ite .cse4 0 v_~y$w_buff0_used~0_98)) (= v_~y$r_buff0_thd4~0_25 (ite .cse0 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_24, ~y$w_buff0_used~0=v_~y$w_buff0_used~0_98, ~y$w_buff1~0=v_~y$w_buff1~0_45, ~y$w_buff0~0=v_~y$w_buff0~0_46, ~y~0=v_~y~0_63, ~y$w_buff1_used~0=v_~y$w_buff1_used~0_81} OutVars{~y$r_buff0_thd4~0=v_~y$r_buff0_thd4~0_25, ~y$r_buff1_thd4~0=v_~y$r_buff1_thd4~0_23, ~y$w_buff0_used~0=v_~y$w_buff0_used~0_97, ~y$w_buff1~0=v_~y$w_buff1~0_45, ~y$w_buff0~0=v_~y$w_buff0~0_46, ~y~0=v_~y~0_62, ~y$w_buff1_used~0=v_~y$w_buff1_used~0_80} AuxVars[] AssignedVars[~y$r_buff0_thd4~0, ~y$r_buff1_thd4~0, ~y$w_buff0_used~0, ~y~0, ~y$w_buff1_used~0][75], [154#true, 193#(and (<= ~__unbuffered_cnt~0 1) (= |ULTIMATE.start_assume_abort_if_not_#in~cond#1| 0)), Black: 163#(or (not (= 2 ~__unbuffered_p3_EAX~0)) (not (= ~__unbuffered_p1_EAX~0 0)) (not (= ~__unbuffered_p3_EBX~0 0)) (not (= ~__unbuffered_p0_EAX~0 0)) (not (= 2 ~z~0))), 63#L756true, 43#L784true, Black: 170#(or (not (= 2 ~__unbuffered_p3_EAX~0)) (not (= ~__unbuffered_p1_EAX~0 0)) (not (= ~__unbuffered_p3_EBX~0 0)) (not (= ~__unbuffered_p0_EAX~0 0)) (not (= 2 ~z~0))), Black: 169#(= ~__unbuffered_p3_EAX~0 0), 167#true, P1Thread1of1ForFork2InUse, P2Thread1of1ForFork1InUse, 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, Black: 178#(= |ULTIMATE.start_assume_abort_if_not_#in~cond#1| 0), P3Thread1of1ForFork3InUse, 175#true, 58#L839true, 19#P2EXITtrue]) [2023-08-26 12:02:48,915 INFO L294 olderBase$Statistics]: this new event has 21 ancestors and is cut-off event [2023-08-26 12:02:48,915 INFO L297 olderBase$Statistics]: existing Event has 21 ancestors and is cut-off event [2023-08-26 12:02:48,915 INFO L297 olderBase$Statistics]: existing Event has 21 ancestors and is cut-off event [2023-08-26 12:02:48,915 INFO L297 olderBase$Statistics]: existing Event has 21 ancestors and is cut-off event [2023-08-26 12:02:48,946 INFO L292 olderBase$Statistics]: inserting event number 4 for the transition-marking pair ([425] L832-->L839: Formula: (let ((.cse2 (not (= (mod v_~y$w_buff0_used~0_97 256) 0))) (.cse5 (not (= (mod v_~y$r_buff0_thd4~0_26 256) 0))) (.cse3 (not (= (mod v_~y$r_buff1_thd4~0_24 256) 0)))) (let ((.cse1 (and (not (= (mod v_~y$w_buff1_used~0_81 256) 0)) .cse3)) (.cse4 (and (not (= (mod v_~y$w_buff0_used~0_98 256) 0)) .cse5)) (.cse0 (and .cse2 .cse5))) (and (= v_~y$w_buff1_used~0_80 (ite (or .cse0 .cse1) 0 v_~y$w_buff1_used~0_81)) (= (ite (or (and (not (= (mod v_~y$r_buff0_thd4~0_25 256) 0)) .cse2) (and (not (= (mod v_~y$w_buff1_used~0_80 256) 0)) .cse3)) 0 v_~y$r_buff1_thd4~0_24) v_~y$r_buff1_thd4~0_23) (= v_~y~0_62 (ite .cse4 v_~y$w_buff0~0_46 (ite .cse1 v_~y$w_buff1~0_45 v_~y~0_63))) (= v_~y$w_buff0_used~0_97 (ite .cse4 0 v_~y$w_buff0_used~0_98)) (= v_~y$r_buff0_thd4~0_25 (ite .cse0 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_24, ~y$w_buff0_used~0=v_~y$w_buff0_used~0_98, ~y$w_buff1~0=v_~y$w_buff1~0_45, ~y$w_buff0~0=v_~y$w_buff0~0_46, ~y~0=v_~y~0_63, ~y$w_buff1_used~0=v_~y$w_buff1_used~0_81} OutVars{~y$r_buff0_thd4~0=v_~y$r_buff0_thd4~0_25, ~y$r_buff1_thd4~0=v_~y$r_buff1_thd4~0_23, ~y$w_buff0_used~0=v_~y$w_buff0_used~0_97, ~y$w_buff1~0=v_~y$w_buff1~0_45, ~y$w_buff0~0=v_~y$w_buff0~0_46, ~y~0=v_~y~0_62, ~y$w_buff1_used~0=v_~y$w_buff1_used~0_80} AuxVars[] AssignedVars[~y$r_buff0_thd4~0, ~y$r_buff1_thd4~0, ~y$w_buff0_used~0, ~y~0, ~y$w_buff1_used~0][103], [154#true, 189#(= |ULTIMATE.start_assume_abort_if_not_#in~cond#1| 0), Black: 163#(or (not (= 2 ~__unbuffered_p3_EAX~0)) (not (= ~__unbuffered_p1_EAX~0 0)) (not (= ~__unbuffered_p3_EBX~0 0)) (not (= ~__unbuffered_p0_EAX~0 0)) (not (= 2 ~z~0))), 63#L756true, 97#P1EXITtrue, Black: 170#(or (not (= 2 ~__unbuffered_p3_EAX~0)) (not (= ~__unbuffered_p1_EAX~0 0)) (not (= ~__unbuffered_p3_EBX~0 0)) (not (= ~__unbuffered_p0_EAX~0 0)) (not (= 2 ~z~0))), Black: 169#(= ~__unbuffered_p3_EAX~0 0), 167#true, P1Thread1of1ForFork2InUse, P2Thread1of1ForFork1InUse, 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)), Black: 178#(= |ULTIMATE.start_assume_abort_if_not_#in~cond#1| 0), P3Thread1of1ForFork3InUse, 175#true, 19#P2EXITtrue, 58#L839true]) [2023-08-26 12:02:48,946 INFO L294 olderBase$Statistics]: this new event has 22 ancestors and is cut-off event [2023-08-26 12:02:48,946 INFO L297 olderBase$Statistics]: existing Event has 22 ancestors and is cut-off event [2023-08-26 12:02:48,946 INFO L297 olderBase$Statistics]: existing Event has 22 ancestors and is cut-off event [2023-08-26 12:02:48,946 INFO L297 olderBase$Statistics]: existing Event has 22 ancestors and is cut-off event [2023-08-26 12:02:48,991 INFO L124 PetriNetUnfolderBase]: 4011/6223 cut-off events. [2023-08-26 12:02:48,991 INFO L125 PetriNetUnfolderBase]: For 4711/4786 co-relation queries the response was YES. [2023-08-26 12:02:49,005 INFO L83 FinitePrefix]: Finished finitePrefix Result has 19237 conditions, 6223 events. 4011/6223 cut-off events. For 4711/4786 co-relation queries the response was YES. Maximal size of possible extension queue 418. Compared 38037 event pairs, 409 based on Foata normal form. 416/6446 useless extension candidates. Maximal degree in co-relation 19226. Up to 2171 conditions per place. [2023-08-26 12:02:49,026 INFO L140 encePairwiseOnDemand]: 281/288 looper letters, 87 selfloop transitions, 19 changer transitions 1/117 dead transitions. [2023-08-26 12:02:49,026 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 56 places, 117 transitions, 720 flow [2023-08-26 12:02:49,027 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2023-08-26 12:02:49,027 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 7 states. [2023-08-26 12:02:49,029 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 7 states to 7 states and 924 transitions. [2023-08-26 12:02:49,029 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.4583333333333333 [2023-08-26 12:02:49,029 INFO L72 ComplementDD]: Start complementDD. Operand 7 states and 924 transitions. [2023-08-26 12:02:49,030 INFO L73 IsDeterministic]: Start isDeterministic. Operand 7 states and 924 transitions. [2023-08-26 12:02:49,030 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2023-08-26 12:02:49,030 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 7 states and 924 transitions. [2023-08-26 12:02:49,032 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 8 states, 7 states have (on average 132.0) internal successors, (924), 7 states have internal predecessors, (924), 0 states have call successors, (0), 0 states 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:02:49,036 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 8 states, 8 states have (on average 288.0) internal successors, (2304), 8 states have internal predecessors, (2304), 0 states have call successors, (0), 0 states 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:02:49,037 INFO L81 ComplementDD]: Finished complementDD. Result has 8 states, 8 states have (on average 288.0) internal successors, (2304), 8 states have internal predecessors, (2304), 0 states have call successors, (0), 0 states 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:02:49,037 INFO L175 Difference]: Start difference. First operand has 50 places, 44 transitions, 220 flow. Second operand 7 states and 924 transitions. [2023-08-26 12:02:49,037 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 56 places, 117 transitions, 720 flow [2023-08-26 12:02:49,053 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 55 places, 117 transitions, 715 flow, removed 0 selfloop flow, removed 1 redundant places. [2023-08-26 12:02:49,055 INFO L231 Difference]: Finished difference. Result has 58 places, 53 transitions, 349 flow [2023-08-26 12:02:49,056 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=288, PETRI_DIFFERENCE_MINUEND_FLOW=215, PETRI_DIFFERENCE_MINUEND_PLACES=49, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=44, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=10, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=29, PETRI_DIFFERENCE_SUBTRAHEND_STATES=7, PETRI_FLOW=349, PETRI_PLACES=58, PETRI_TRANSITIONS=53} [2023-08-26 12:02:49,058 INFO L281 CegarLoopForPetriNet]: 49 programPoint places, 9 predicate places. [2023-08-26 12:02:49,058 INFO L495 AbstractCegarLoop]: Abstraction has has 58 places, 53 transitions, 349 flow [2023-08-26 12:02:49,059 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 121.8) internal successors, (609), 5 states have internal predecessors, (609), 0 states have call successors, (0), 0 states 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:02:49,059 INFO L200 CegarLoopForPetriNet]: Found error trace [2023-08-26 12:02:49,059 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:02:49,059 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable5 [2023-08-26 12:02:49,059 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:02:49,059 INFO L145 PredicateUnifier]: Initialized classic predicate unifier [2023-08-26 12:02:49,060 INFO L85 PathProgramCache]: Analyzing trace with hash 1656246752, now seen corresponding path program 1 times [2023-08-26 12:02:49,060 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-08-26 12:02:49,060 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2107167880] [2023-08-26 12:02:49,061 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-08-26 12:02:49,061 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-08-26 12:02:49,081 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-08-26 12:02:49,266 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:02:49,267 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-08-26 12:02:49,267 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2107167880] [2023-08-26 12:02:49,267 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2107167880] provided 1 perfect and 0 imperfect interpolant sequences [2023-08-26 12:02:49,267 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-08-26 12:02:49,267 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2023-08-26 12:02:49,267 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [180437567] [2023-08-26 12:02:49,268 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-08-26 12:02:49,268 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2023-08-26 12:02:49,268 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-08-26 12:02:49,268 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2023-08-26 12:02:49,268 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2023-08-26 12:02:49,269 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 114 out of 288 [2023-08-26 12:02:49,269 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 58 places, 53 transitions, 349 flow. Second operand has 4 states, 4 states have (on average 119.0) internal successors, (476), 4 states have internal predecessors, (476), 0 states have call successors, (0), 0 states 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:02:49,270 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2023-08-26 12:02:49,270 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 114 of 288 [2023-08-26 12:02:49,270 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2023-08-26 12:02:50,142 INFO L124 PetriNetUnfolderBase]: 7067/10435 cut-off events. [2023-08-26 12:02:50,143 INFO L125 PetriNetUnfolderBase]: For 25569/25569 co-relation queries the response was YES. [2023-08-26 12:02:50,158 INFO L83 FinitePrefix]: Finished finitePrefix Result has 40377 conditions, 10435 events. 7067/10435 cut-off events. For 25569/25569 co-relation queries the response was YES. Maximal size of possible extension queue 424. Compared 59516 event pairs, 706 based on Foata normal form. 56/10491 useless extension candidates. Maximal degree in co-relation 40363. Up to 4947 conditions per place. [2023-08-26 12:02:50,181 INFO L140 encePairwiseOnDemand]: 279/288 looper letters, 103 selfloop transitions, 21 changer transitions 36/160 dead transitions. [2023-08-26 12:02:50,182 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 62 places, 160 transitions, 1381 flow [2023-08-26 12:02:50,182 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2023-08-26 12:02:50,182 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 5 states. [2023-08-26 12:02:50,183 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 659 transitions. [2023-08-26 12:02:50,184 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.4576388888888889 [2023-08-26 12:02:50,184 INFO L72 ComplementDD]: Start complementDD. Operand 5 states and 659 transitions. [2023-08-26 12:02:50,184 INFO L73 IsDeterministic]: Start isDeterministic. Operand 5 states and 659 transitions. [2023-08-26 12:02:50,185 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2023-08-26 12:02:50,185 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 5 states and 659 transitions. [2023-08-26 12:02:50,186 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 6 states, 5 states have (on average 131.8) internal successors, (659), 5 states have internal predecessors, (659), 0 states have call successors, (0), 0 states 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:02:50,188 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:02:50,188 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:02:50,188 INFO L175 Difference]: Start difference. First operand has 58 places, 53 transitions, 349 flow. Second operand 5 states and 659 transitions. [2023-08-26 12:02:50,189 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 62 places, 160 transitions, 1381 flow [2023-08-26 12:02:50,454 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 59 places, 160 transitions, 1209 flow, removed 60 selfloop flow, removed 3 redundant places. [2023-08-26 12:02:50,457 INFO L231 Difference]: Finished difference. Result has 62 places, 55 transitions, 387 flow [2023-08-26 12:02:50,457 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=288, PETRI_DIFFERENCE_MINUEND_FLOW=299, PETRI_DIFFERENCE_MINUEND_PLACES=55, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=53, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=10, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=39, PETRI_DIFFERENCE_SUBTRAHEND_STATES=5, PETRI_FLOW=387, PETRI_PLACES=62, PETRI_TRANSITIONS=55} [2023-08-26 12:02:50,458 INFO L281 CegarLoopForPetriNet]: 49 programPoint places, 13 predicate places. [2023-08-26 12:02:50,458 INFO L495 AbstractCegarLoop]: Abstraction has has 62 places, 55 transitions, 387 flow [2023-08-26 12:02:50,458 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 119.0) internal successors, (476), 4 states have internal predecessors, (476), 0 states have call successors, (0), 0 states 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:02:50,459 INFO L200 CegarLoopForPetriNet]: Found error trace [2023-08-26 12:02:50,459 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-08-26 12:02:50,459 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable6 [2023-08-26 12:02:50,459 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:02:50,459 INFO L145 PredicateUnifier]: Initialized classic predicate unifier [2023-08-26 12:02:50,459 INFO L85 PathProgramCache]: Analyzing trace with hash -732804720, now seen corresponding path program 1 times [2023-08-26 12:02:50,459 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-08-26 12:02:50,460 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [912525409] [2023-08-26 12:02:50,460 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-08-26 12:02:50,460 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-08-26 12:02:50,485 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-08-26 12:02:50,653 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:02:50,653 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-08-26 12:02:50,653 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [912525409] [2023-08-26 12:02:50,654 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [912525409] provided 1 perfect and 0 imperfect interpolant sequences [2023-08-26 12:02:50,654 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-08-26 12:02:50,654 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2023-08-26 12:02:50,654 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1895015351] [2023-08-26 12:02:50,654 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-08-26 12:02:50,655 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2023-08-26 12:02:50,655 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-08-26 12:02:50,656 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2023-08-26 12:02:50,656 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=8, Invalid=12, Unknown=0, NotChecked=0, Total=20 [2023-08-26 12:02:50,657 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 114 out of 288 [2023-08-26 12:02:50,657 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 62 places, 55 transitions, 387 flow. Second operand has 5 states, 5 states have (on average 117.8) internal successors, (589), 5 states have internal predecessors, (589), 0 states have call successors, (0), 0 states 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:02:50,657 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2023-08-26 12:02:50,657 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 114 of 288 [2023-08-26 12:02:50,658 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2023-08-26 12:02:51,512 INFO L124 PetriNetUnfolderBase]: 4838/7450 cut-off events. [2023-08-26 12:02:51,512 INFO L125 PetriNetUnfolderBase]: For 20140/20140 co-relation queries the response was YES. [2023-08-26 12:02:51,528 INFO L83 FinitePrefix]: Finished finitePrefix Result has 30311 conditions, 7450 events. 4838/7450 cut-off events. For 20140/20140 co-relation queries the response was YES. Maximal size of possible extension queue 265. Compared 42229 event pairs, 713 based on Foata normal form. 46/7496 useless extension candidates. Maximal degree in co-relation 30294. Up to 2925 conditions per place. [2023-08-26 12:02:51,549 INFO L140 encePairwiseOnDemand]: 279/288 looper letters, 113 selfloop transitions, 34 changer transitions 25/172 dead transitions. [2023-08-26 12:02:51,549 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 63 places, 172 transitions, 1464 flow [2023-08-26 12:02:51,549 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2023-08-26 12:02:51,549 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 6 states. [2023-08-26 12:02:51,552 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6 states to 6 states and 789 transitions. [2023-08-26 12:02:51,552 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.4565972222222222 [2023-08-26 12:02:51,552 INFO L72 ComplementDD]: Start complementDD. Operand 6 states and 789 transitions. [2023-08-26 12:02:51,552 INFO L73 IsDeterministic]: Start isDeterministic. Operand 6 states and 789 transitions. [2023-08-26 12:02:51,553 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2023-08-26 12:02:51,553 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 6 states and 789 transitions. [2023-08-26 12:02:51,555 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 7 states, 6 states have (on average 131.5) internal successors, (789), 6 states have internal predecessors, (789), 0 states have call successors, (0), 0 states 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:02:51,558 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:02:51,558 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:02:51,558 INFO L175 Difference]: Start difference. First operand has 62 places, 55 transitions, 387 flow. Second operand 6 states and 789 transitions. [2023-08-26 12:02:51,558 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 63 places, 172 transitions, 1464 flow [2023-08-26 12:02:51,649 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 60 places, 172 transitions, 1398 flow, removed 33 selfloop flow, removed 3 redundant places. [2023-08-26 12:02:51,652 INFO L231 Difference]: Finished difference. Result has 62 places, 71 transitions, 619 flow [2023-08-26 12:02:51,653 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=288, PETRI_DIFFERENCE_MINUEND_FLOW=373, PETRI_DIFFERENCE_MINUEND_PLACES=55, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=55, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=19, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=34, PETRI_DIFFERENCE_SUBTRAHEND_STATES=6, PETRI_FLOW=619, PETRI_PLACES=62, PETRI_TRANSITIONS=71} [2023-08-26 12:02:51,655 INFO L281 CegarLoopForPetriNet]: 49 programPoint places, 13 predicate places. [2023-08-26 12:02:51,656 INFO L495 AbstractCegarLoop]: Abstraction has has 62 places, 71 transitions, 619 flow [2023-08-26 12:02:51,656 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 117.8) internal successors, (589), 5 states have internal predecessors, (589), 0 states have call successors, (0), 0 states 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:02:51,656 INFO L200 CegarLoopForPetriNet]: Found error trace [2023-08-26 12:02:51,656 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-08-26 12:02:51,656 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable7 [2023-08-26 12:02:51,657 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:02:51,657 INFO L145 PredicateUnifier]: Initialized classic predicate unifier [2023-08-26 12:02:51,657 INFO L85 PathProgramCache]: Analyzing trace with hash 1575728822, now seen corresponding path program 2 times [2023-08-26 12:02:51,657 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-08-26 12:02:51,657 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1352379374] [2023-08-26 12:02:51,658 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-08-26 12:02:51,658 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-08-26 12:02:51,693 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-08-26 12:02:51,914 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:02:51,914 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-08-26 12:02:51,914 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1352379374] [2023-08-26 12:02:51,915 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1352379374] provided 1 perfect and 0 imperfect interpolant sequences [2023-08-26 12:02:51,915 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-08-26 12:02:51,915 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2023-08-26 12:02:51,915 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1873846630] [2023-08-26 12:02:51,915 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-08-26 12:02:51,915 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2023-08-26 12:02:51,916 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-08-26 12:02:51,917 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2023-08-26 12:02:51,920 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=12, Invalid=18, Unknown=0, NotChecked=0, Total=30 [2023-08-26 12:02:51,921 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 119 out of 288 [2023-08-26 12:02:51,922 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 62 places, 71 transitions, 619 flow. Second operand has 6 states, 6 states have (on average 121.83333333333333) internal successors, (731), 6 states have internal predecessors, (731), 0 states have call successors, (0), 0 states 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:02:51,923 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2023-08-26 12:02:51,923 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 119 of 288 [2023-08-26 12:02:51,923 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2023-08-26 12:02:52,625 INFO L124 PetriNetUnfolderBase]: 2826/4658 cut-off events. [2023-08-26 12:02:52,625 INFO L125 PetriNetUnfolderBase]: For 9469/9691 co-relation queries the response was YES. [2023-08-26 12:02:52,633 INFO L83 FinitePrefix]: Finished finitePrefix Result has 16751 conditions, 4658 events. 2826/4658 cut-off events. For 9469/9691 co-relation queries the response was YES. Maximal size of possible extension queue 273. Compared 28882 event pairs, 299 based on Foata normal form. 391/4908 useless extension candidates. Maximal degree in co-relation 16734. Up to 1447 conditions per place. [2023-08-26 12:02:52,641 INFO L140 encePairwiseOnDemand]: 281/288 looper letters, 97 selfloop transitions, 17 changer transitions 27/170 dead transitions. [2023-08-26 12:02:52,641 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 68 places, 170 transitions, 1549 flow [2023-08-26 12:02:52,642 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2023-08-26 12:02:52,642 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 7 states. [2023-08-26 12:02:52,644 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 7 states to 7 states and 925 transitions. [2023-08-26 12:02:52,644 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.45882936507936506 [2023-08-26 12:02:52,644 INFO L72 ComplementDD]: Start complementDD. Operand 7 states and 925 transitions. [2023-08-26 12:02:52,644 INFO L73 IsDeterministic]: Start isDeterministic. Operand 7 states and 925 transitions. [2023-08-26 12:02:52,645 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2023-08-26 12:02:52,645 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 7 states and 925 transitions. [2023-08-26 12:02:52,646 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 8 states, 7 states have (on average 132.14285714285714) internal successors, (925), 7 states have internal predecessors, (925), 0 states have call successors, (0), 0 states 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:02:52,649 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 8 states, 8 states have (on average 288.0) internal successors, (2304), 8 states have internal predecessors, (2304), 0 states have call successors, (0), 0 states 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:02:52,649 INFO L81 ComplementDD]: Finished complementDD. Result has 8 states, 8 states have (on average 288.0) internal successors, (2304), 8 states have internal predecessors, (2304), 0 states have call successors, (0), 0 states 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:02:52,649 INFO L175 Difference]: Start difference. First operand has 62 places, 71 transitions, 619 flow. Second operand 7 states and 925 transitions. [2023-08-26 12:02:52,649 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 68 places, 170 transitions, 1549 flow [2023-08-26 12:02:52,665 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 68 places, 170 transitions, 1549 flow, removed 0 selfloop flow, removed 0 redundant places. [2023-08-26 12:02:52,668 INFO L231 Difference]: Finished difference. Result has 71 places, 78 transitions, 733 flow [2023-08-26 12:02:52,668 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=288, PETRI_DIFFERENCE_MINUEND_FLOW=619, PETRI_DIFFERENCE_MINUEND_PLACES=62, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=71, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=12, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=57, PETRI_DIFFERENCE_SUBTRAHEND_STATES=7, PETRI_FLOW=733, PETRI_PLACES=71, PETRI_TRANSITIONS=78} [2023-08-26 12:02:52,669 INFO L281 CegarLoopForPetriNet]: 49 programPoint places, 22 predicate places. [2023-08-26 12:02:52,669 INFO L495 AbstractCegarLoop]: Abstraction has has 71 places, 78 transitions, 733 flow [2023-08-26 12:02:52,670 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 121.83333333333333) internal successors, (731), 6 states have internal predecessors, (731), 0 states have call successors, (0), 0 states 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:02:52,670 INFO L200 CegarLoopForPetriNet]: Found error trace [2023-08-26 12:02:52,670 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-08-26 12:02:52,670 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable8 [2023-08-26 12:02:52,671 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:02:52,671 INFO L145 PredicateUnifier]: Initialized classic predicate unifier [2023-08-26 12:02:52,671 INFO L85 PathProgramCache]: Analyzing trace with hash -1456993783, now seen corresponding path program 1 times [2023-08-26 12:02:52,671 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-08-26 12:02:52,674 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2083642178] [2023-08-26 12:02:52,674 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-08-26 12:02:52,675 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-08-26 12:02:52,697 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-08-26 12:02:52,888 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:02:52,888 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-08-26 12:02:52,890 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2083642178] [2023-08-26 12:02:52,890 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2083642178] provided 1 perfect and 0 imperfect interpolant sequences [2023-08-26 12:02:52,890 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-08-26 12:02:52,890 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2023-08-26 12:02:52,890 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [36647884] [2023-08-26 12:02:52,891 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-08-26 12:02:52,891 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2023-08-26 12:02:52,892 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-08-26 12:02:52,892 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2023-08-26 12:02:52,892 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2023-08-26 12:02:52,893 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 116 out of 288 [2023-08-26 12:02:52,893 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 71 places, 78 transitions, 733 flow. Second operand has 4 states, 4 states have (on average 121.75) internal successors, (487), 4 states have internal predecessors, (487), 0 states have call successors, (0), 0 states 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:02:52,893 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2023-08-26 12:02:52,893 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 116 of 288 [2023-08-26 12:02:52,893 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2023-08-26 12:02:53,592 INFO L124 PetriNetUnfolderBase]: 4607/7330 cut-off events. [2023-08-26 12:02:53,592 INFO L125 PetriNetUnfolderBase]: For 26916/26916 co-relation queries the response was YES. [2023-08-26 12:02:53,614 INFO L83 FinitePrefix]: Finished finitePrefix Result has 32632 conditions, 7330 events. 4607/7330 cut-off events. For 26916/26916 co-relation queries the response was YES. Maximal size of possible extension queue 312. Compared 43573 event pairs, 1178 based on Foata normal form. 12/7342 useless extension candidates. Maximal degree in co-relation 32611. Up to 3759 conditions per place. [2023-08-26 12:02:53,628 INFO L140 encePairwiseOnDemand]: 282/288 looper letters, 71 selfloop transitions, 15 changer transitions 46/132 dead transitions. [2023-08-26 12:02:53,628 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 74 places, 132 transitions, 1411 flow [2023-08-26 12:02:53,629 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2023-08-26 12:02:53,629 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 4 states. [2023-08-26 12:02:53,630 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 521 transitions. [2023-08-26 12:02:53,630 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.4522569444444444 [2023-08-26 12:02:53,630 INFO L72 ComplementDD]: Start complementDD. Operand 4 states and 521 transitions. [2023-08-26 12:02:53,630 INFO L73 IsDeterministic]: Start isDeterministic. Operand 4 states and 521 transitions. [2023-08-26 12:02:53,631 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2023-08-26 12:02:53,631 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 4 states and 521 transitions. [2023-08-26 12:02:53,632 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 5 states, 4 states have (on average 130.25) internal successors, (521), 4 states have internal predecessors, (521), 0 states have call successors, (0), 0 states 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:02:53,634 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:02:53,634 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:02:53,634 INFO L175 Difference]: Start difference. First operand has 71 places, 78 transitions, 733 flow. Second operand 4 states and 521 transitions. [2023-08-26 12:02:53,634 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 74 places, 132 transitions, 1411 flow [2023-08-26 12:02:53,875 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 72 places, 132 transitions, 1294 flow, removed 46 selfloop flow, removed 2 redundant places. [2023-08-26 12:02:53,876 INFO L231 Difference]: Finished difference. Result has 74 places, 60 transitions, 502 flow [2023-08-26 12:02:53,877 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=288, PETRI_DIFFERENCE_MINUEND_FLOW=674, PETRI_DIFFERENCE_MINUEND_PLACES=69, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=78, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=10, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=65, PETRI_DIFFERENCE_SUBTRAHEND_STATES=4, PETRI_FLOW=502, PETRI_PLACES=74, PETRI_TRANSITIONS=60} [2023-08-26 12:02:53,877 INFO L281 CegarLoopForPetriNet]: 49 programPoint places, 25 predicate places. [2023-08-26 12:02:53,877 INFO L495 AbstractCegarLoop]: Abstraction has has 74 places, 60 transitions, 502 flow [2023-08-26 12:02:53,878 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 121.75) internal successors, (487), 4 states have internal predecessors, (487), 0 states have call successors, (0), 0 states 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:02:53,878 INFO L200 CegarLoopForPetriNet]: Found error trace [2023-08-26 12:02:53,878 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] [2023-08-26 12:02:53,878 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable9 [2023-08-26 12:02:53,878 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:02:53,878 INFO L145 PredicateUnifier]: Initialized classic predicate unifier [2023-08-26 12:02:53,878 INFO L85 PathProgramCache]: Analyzing trace with hash -2058495673, now seen corresponding path program 1 times [2023-08-26 12:02:53,878 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-08-26 12:02:53,878 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1909037905] [2023-08-26 12:02:53,878 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-08-26 12:02:53,879 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-08-26 12:02:53,897 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-08-26 12:02:54,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:02:54,035 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-08-26 12:02:54,035 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1909037905] [2023-08-26 12:02:54,036 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1909037905] provided 1 perfect and 0 imperfect interpolant sequences [2023-08-26 12:02:54,036 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-08-26 12:02:54,036 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2023-08-26 12:02:54,036 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [175393472] [2023-08-26 12:02:54,036 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-08-26 12:02:54,036 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2023-08-26 12:02:54,036 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-08-26 12:02:54,037 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2023-08-26 12:02:54,037 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2023-08-26 12:02:54,037 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 122 out of 288 [2023-08-26 12:02:54,038 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 74 places, 60 transitions, 502 flow. Second operand has 4 states, 4 states have (on average 127.0) internal successors, (508), 4 states have internal predecessors, (508), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-26 12:02:54,038 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2023-08-26 12:02:54,038 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 122 of 288 [2023-08-26 12:02:54,038 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2023-08-26 12:02:54,621 INFO L124 PetriNetUnfolderBase]: 2956/5130 cut-off events. [2023-08-26 12:02:54,621 INFO L125 PetriNetUnfolderBase]: For 12481/12592 co-relation queries the response was YES. [2023-08-26 12:02:54,638 INFO L83 FinitePrefix]: Finished finitePrefix Result has 19671 conditions, 5130 events. 2956/5130 cut-off events. For 12481/12592 co-relation queries the response was YES. Maximal size of possible extension queue 273. Compared 33414 event pairs, 605 based on Foata normal form. 28/5056 useless extension candidates. Maximal degree in co-relation 19647. Up to 2337 conditions per place. [2023-08-26 12:02:54,648 INFO L140 encePairwiseOnDemand]: 285/288 looper letters, 70 selfloop transitions, 3 changer transitions 26/109 dead transitions. [2023-08-26 12:02:54,648 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 75 places, 109 transitions, 972 flow [2023-08-26 12:02:54,648 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2023-08-26 12:02:54,649 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 4 states. [2023-08-26 12:02:54,650 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 542 transitions. [2023-08-26 12:02:54,650 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.4704861111111111 [2023-08-26 12:02:54,650 INFO L72 ComplementDD]: Start complementDD. Operand 4 states and 542 transitions. [2023-08-26 12:02:54,650 INFO L73 IsDeterministic]: Start isDeterministic. Operand 4 states and 542 transitions. [2023-08-26 12:02:54,651 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2023-08-26 12:02:54,651 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 4 states and 542 transitions. [2023-08-26 12:02:54,652 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 5 states, 4 states have (on average 135.5) internal successors, (542), 4 states have internal predecessors, (542), 0 states have call successors, (0), 0 states 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:02:54,654 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:02:54,654 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:02:54,654 INFO L175 Difference]: Start difference. First operand has 74 places, 60 transitions, 502 flow. Second operand 4 states and 542 transitions. [2023-08-26 12:02:54,654 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 75 places, 109 transitions, 972 flow [2023-08-26 12:02:54,726 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 72 places, 109 transitions, 938 flow, removed 13 selfloop flow, removed 3 redundant places. [2023-08-26 12:02:54,727 INFO L231 Difference]: Finished difference. Result has 73 places, 56 transitions, 450 flow [2023-08-26 12:02:54,727 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=288, PETRI_DIFFERENCE_MINUEND_FLOW=478, PETRI_DIFFERENCE_MINUEND_PLACES=69, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=60, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=3, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=57, PETRI_DIFFERENCE_SUBTRAHEND_STATES=4, PETRI_FLOW=450, PETRI_PLACES=73, PETRI_TRANSITIONS=56} [2023-08-26 12:02:54,728 INFO L281 CegarLoopForPetriNet]: 49 programPoint places, 24 predicate places. [2023-08-26 12:02:54,728 INFO L495 AbstractCegarLoop]: Abstraction has has 73 places, 56 transitions, 450 flow [2023-08-26 12:02:54,728 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 127.0) internal successors, (508), 4 states have internal predecessors, (508), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-26 12:02:54,728 INFO L200 CegarLoopForPetriNet]: Found error trace [2023-08-26 12:02:54,729 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:02:54,729 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable10 [2023-08-26 12:02:54,729 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:02:54,729 INFO L145 PredicateUnifier]: Initialized classic predicate unifier [2023-08-26 12:02:54,729 INFO L85 PathProgramCache]: Analyzing trace with hash -1463084041, now seen corresponding path program 2 times [2023-08-26 12:02:54,729 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-08-26 12:02:54,729 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1764606385] [2023-08-26 12:02:54,730 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-08-26 12:02:54,730 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-08-26 12:02:54,772 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-08-26 12:02:55,141 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:02:55,141 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-08-26 12:02:55,141 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1764606385] [2023-08-26 12:02:55,141 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1764606385] provided 1 perfect and 0 imperfect interpolant sequences [2023-08-26 12:02:55,141 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-08-26 12:02:55,142 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2023-08-26 12:02:55,142 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1077654833] [2023-08-26 12:02:55,142 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-08-26 12:02:55,142 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2023-08-26 12:02:55,142 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-08-26 12:02:55,142 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2023-08-26 12:02:55,143 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=11, Invalid=19, Unknown=0, NotChecked=0, Total=30 [2023-08-26 12:02:55,143 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 119 out of 288 [2023-08-26 12:02:55,144 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 73 places, 56 transitions, 450 flow. Second operand has 6 states, 6 states have (on average 122.33333333333333) internal successors, (734), 6 states have internal predecessors, (734), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-26 12:02:55,144 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2023-08-26 12:02:55,144 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 119 of 288 [2023-08-26 12:02:55,144 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2023-08-26 12:02:55,737 INFO L124 PetriNetUnfolderBase]: 2690/4883 cut-off events. [2023-08-26 12:02:55,737 INFO L125 PetriNetUnfolderBase]: For 12928/13050 co-relation queries the response was YES. [2023-08-26 12:02:55,748 INFO L83 FinitePrefix]: Finished finitePrefix Result has 18661 conditions, 4883 events. 2690/4883 cut-off events. For 12928/13050 co-relation queries the response was YES. Maximal size of possible extension queue 292. Compared 34298 event pairs, 381 based on Foata normal form. 20/4739 useless extension candidates. Maximal degree in co-relation 18638. Up to 1938 conditions per place. [2023-08-26 12:02:55,754 INFO L140 encePairwiseOnDemand]: 281/288 looper letters, 86 selfloop transitions, 7 changer transitions 46/151 dead transitions. [2023-08-26 12:02:55,754 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 79 places, 151 transitions, 1349 flow [2023-08-26 12:02:55,757 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2023-08-26 12:02:55,757 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 7 states. [2023-08-26 12:02:55,759 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 7 states to 7 states and 902 transitions. [2023-08-26 12:02:55,759 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.44742063492063494 [2023-08-26 12:02:55,759 INFO L72 ComplementDD]: Start complementDD. Operand 7 states and 902 transitions. [2023-08-26 12:02:55,760 INFO L73 IsDeterministic]: Start isDeterministic. Operand 7 states and 902 transitions. [2023-08-26 12:02:55,760 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2023-08-26 12:02:55,760 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 7 states and 902 transitions. [2023-08-26 12:02:55,762 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 8 states, 7 states have (on average 128.85714285714286) internal successors, (902), 7 states have internal predecessors, (902), 0 states have call successors, (0), 0 states 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:02:55,765 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 8 states, 8 states have (on average 288.0) internal successors, (2304), 8 states have internal predecessors, (2304), 0 states have call successors, (0), 0 states 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:02:55,765 INFO L81 ComplementDD]: Finished complementDD. Result has 8 states, 8 states have (on average 288.0) internal successors, (2304), 8 states have internal predecessors, (2304), 0 states have call successors, (0), 0 states 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:02:55,765 INFO L175 Difference]: Start difference. First operand has 73 places, 56 transitions, 450 flow. Second operand 7 states and 902 transitions. [2023-08-26 12:02:55,765 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 79 places, 151 transitions, 1349 flow [2023-08-26 12:02:55,828 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 75 places, 151 transitions, 1303 flow, removed 2 selfloop flow, removed 4 redundant places. [2023-08-26 12:02:55,830 INFO L231 Difference]: Finished difference. Result has 78 places, 61 transitions, 476 flow [2023-08-26 12:02:55,830 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=288, PETRI_DIFFERENCE_MINUEND_FLOW=427, PETRI_DIFFERENCE_MINUEND_PLACES=69, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=56, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=4, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=51, PETRI_DIFFERENCE_SUBTRAHEND_STATES=7, PETRI_FLOW=476, PETRI_PLACES=78, PETRI_TRANSITIONS=61} [2023-08-26 12:02:55,831 INFO L281 CegarLoopForPetriNet]: 49 programPoint places, 29 predicate places. [2023-08-26 12:02:55,831 INFO L495 AbstractCegarLoop]: Abstraction has has 78 places, 61 transitions, 476 flow [2023-08-26 12:02:55,831 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 122.33333333333333) internal successors, (734), 6 states have internal predecessors, (734), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-26 12:02:55,831 INFO L200 CegarLoopForPetriNet]: Found error trace [2023-08-26 12:02:55,831 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] [2023-08-26 12:02:55,831 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable11 [2023-08-26 12:02:55,831 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:02:55,832 INFO L145 PredicateUnifier]: Initialized classic predicate unifier [2023-08-26 12:02:55,832 INFO L85 PathProgramCache]: Analyzing trace with hash -1893042311, now seen corresponding path program 2 times [2023-08-26 12:02:55,832 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-08-26 12:02:55,832 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [750861044] [2023-08-26 12:02:55,832 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-08-26 12:02:55,832 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-08-26 12:02:55,867 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-08-26 12:02:56,025 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:02:56,025 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-08-26 12:02:56,025 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [750861044] [2023-08-26 12:02:56,026 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [750861044] provided 1 perfect and 0 imperfect interpolant sequences [2023-08-26 12:02:56,026 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-08-26 12:02:56,026 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2023-08-26 12:02:56,026 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1982501589] [2023-08-26 12:02:56,026 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-08-26 12:02:56,026 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2023-08-26 12:02:56,026 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-08-26 12:02:56,027 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2023-08-26 12:02:56,027 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=17, Invalid=25, Unknown=0, NotChecked=0, Total=42 [2023-08-26 12:02:56,027 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 119 out of 288 [2023-08-26 12:02:56,028 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 78 places, 61 transitions, 476 flow. Second operand has 7 states, 7 states have (on average 121.71428571428571) internal successors, (852), 7 states have internal predecessors, (852), 0 states have call successors, (0), 0 states 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:02:56,028 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2023-08-26 12:02:56,028 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 119 of 288 [2023-08-26 12:02:56,028 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2023-08-26 12:02:56,552 INFO L124 PetriNetUnfolderBase]: 2081/3681 cut-off events. [2023-08-26 12:02:56,553 INFO L125 PetriNetUnfolderBase]: For 8470/8643 co-relation queries the response was YES. [2023-08-26 12:02:56,565 INFO L83 FinitePrefix]: Finished finitePrefix Result has 14606 conditions, 3681 events. 2081/3681 cut-off events. For 8470/8643 co-relation queries the response was YES. Maximal size of possible extension queue 260. Compared 24537 event pairs, 249 based on Foata normal form. 155/3725 useless extension candidates. Maximal degree in co-relation 14581. Up to 1305 conditions per place. [2023-08-26 12:02:56,570 INFO L140 encePairwiseOnDemand]: 281/288 looper letters, 40 selfloop transitions, 17 changer transitions 66/127 dead transitions. [2023-08-26 12:02:56,571 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 83 places, 127 transitions, 1123 flow [2023-08-26 12:02:56,571 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2023-08-26 12:02:56,571 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 8 states. [2023-08-26 12:02:56,573 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 8 states to 8 states and 1033 transitions. [2023-08-26 12:02:56,574 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.4483506944444444 [2023-08-26 12:02:56,574 INFO L72 ComplementDD]: Start complementDD. Operand 8 states and 1033 transitions. [2023-08-26 12:02:56,574 INFO L73 IsDeterministic]: Start isDeterministic. Operand 8 states and 1033 transitions. [2023-08-26 12:02:56,575 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2023-08-26 12:02:56,575 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 8 states and 1033 transitions. [2023-08-26 12:02:56,577 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 9 states, 8 states have (on average 129.125) internal successors, (1033), 8 states have internal predecessors, (1033), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-26 12:02:56,580 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:02:56,580 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:02:56,580 INFO L175 Difference]: Start difference. First operand has 78 places, 61 transitions, 476 flow. Second operand 8 states and 1033 transitions. [2023-08-26 12:02:56,580 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 83 places, 127 transitions, 1123 flow [2023-08-26 12:02:56,670 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 80 places, 127 transitions, 1100 flow, removed 10 selfloop flow, removed 3 redundant places. [2023-08-26 12:02:56,672 INFO L231 Difference]: Finished difference. Result has 83 places, 40 transitions, 289 flow [2023-08-26 12:02:56,673 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=288, PETRI_DIFFERENCE_MINUEND_FLOW=454, PETRI_DIFFERENCE_MINUEND_PLACES=73, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=60, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=17, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=43, PETRI_DIFFERENCE_SUBTRAHEND_STATES=8, PETRI_FLOW=289, PETRI_PLACES=83, PETRI_TRANSITIONS=40} [2023-08-26 12:02:56,673 INFO L281 CegarLoopForPetriNet]: 49 programPoint places, 34 predicate places. [2023-08-26 12:02:56,674 INFO L495 AbstractCegarLoop]: Abstraction has has 83 places, 40 transitions, 289 flow [2023-08-26 12:02:56,674 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 7 states, 7 states have (on average 121.71428571428571) internal successors, (852), 7 states have internal predecessors, (852), 0 states have call successors, (0), 0 states 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:02:56,674 INFO L200 CegarLoopForPetriNet]: Found error trace [2023-08-26 12:02:56,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, 1, 1, 1, 1, 1, 1] [2023-08-26 12:02:56,674 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable12 [2023-08-26 12:02:56,675 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:02:56,675 INFO L145 PredicateUnifier]: Initialized classic predicate unifier [2023-08-26 12:02:56,675 INFO L85 PathProgramCache]: Analyzing trace with hash 672361416, now seen corresponding path program 1 times [2023-08-26 12:02:56,675 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-08-26 12:02:56,675 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [944258108] [2023-08-26 12:02:56,675 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-08-26 12:02:56,675 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-08-26 12:02:56,729 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2023-08-26 12:02:56,730 INFO L356 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2023-08-26 12:02:56,781 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2023-08-26 12:02:56,823 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2023-08-26 12:02:56,823 INFO L360 BasicCegarLoop]: Counterexample is feasible [2023-08-26 12:02:56,824 INFO L805 garLoopResultBuilder]: Registering result UNSAFE for location ULTIMATE.startErr8ASSERT_VIOLATIONASSERT (14 of 15 remaining) [2023-08-26 12:02:56,826 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location P2Err0ASSERT_VIOLATIONASSERT (13 of 15 remaining) [2023-08-26 12:02:56,826 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE (12 of 15 remaining) [2023-08-26 12:02:56,826 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE (11 of 15 remaining) [2023-08-26 12:02:56,828 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (10 of 15 remaining) [2023-08-26 12:02:56,829 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr3REQUIRES_VIOLATIONMEMORY_DEREFERENCE (9 of 15 remaining) [2023-08-26 12:02:56,829 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr4REQUIRES_VIOLATIONMEMORY_DEREFERENCE (8 of 15 remaining) [2023-08-26 12:02:56,829 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr5REQUIRES_VIOLATIONMEMORY_DEREFERENCE (7 of 15 remaining) [2023-08-26 12:02:56,829 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr6REQUIRES_VIOLATIONMEMORY_DEREFERENCE (6 of 15 remaining) [2023-08-26 12:02:56,829 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr7REQUIRES_VIOLATIONMEMORY_DEREFERENCE (5 of 15 remaining) [2023-08-26 12:02:56,829 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (4 of 15 remaining) [2023-08-26 12:02:56,829 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (3 of 15 remaining) [2023-08-26 12:02:56,829 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr2INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (2 of 15 remaining) [2023-08-26 12:02:56,829 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr3INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (1 of 15 remaining) [2023-08-26 12:02:56,830 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location P2Err0ASSERT_VIOLATIONASSERT (0 of 15 remaining) [2023-08-26 12:02:56,830 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable13 [2023-08-26 12:02:56,830 INFO L445 BasicCegarLoop]: Path program histogram: [2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1] [2023-08-26 12:02:56,838 INFO L228 ceAbstractionStarter]: Analysis of concurrent program completed with 1 thread instances [2023-08-26 12:02:56,838 INFO L178 ceAbstractionStarter]: Computing trace abstraction results [2023-08-26 12:02:56,937 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 26.08 12:02:56 BasicIcfg [2023-08-26 12:02:56,938 INFO L131 PluginConnector]: ------------------------ END TraceAbstraction---------------------------- [2023-08-26 12:02:56,938 INFO L158 Benchmark]: Toolchain (without parser) took 20302.21ms. Allocated memory was 360.7MB in the beginning and 1.2GB in the end (delta: 851.4MB). Free memory was 335.1MB in the beginning and 542.6MB in the end (delta: -207.4MB). Peak memory consumption was 645.9MB. Max. memory is 16.0GB. [2023-08-26 12:02:56,938 INFO L158 Benchmark]: CDTParser took 0.10ms. Allocated memory is still 360.7MB. Free memory is still 336.9MB. There was no memory consumed. Max. memory is 16.0GB. [2023-08-26 12:02:56,938 INFO L158 Benchmark]: CACSL2BoogieTranslator took 584.27ms. Allocated memory is still 360.7MB. Free memory was 335.1MB in the beginning and 311.7MB in the end (delta: 23.4MB). Peak memory consumption was 23.1MB. Max. memory is 16.0GB. [2023-08-26 12:02:56,939 INFO L158 Benchmark]: Boogie Procedure Inliner took 80.17ms. Allocated memory is still 360.7MB. Free memory was 311.7MB in the beginning and 309.1MB in the end (delta: 2.6MB). Peak memory consumption was 2.1MB. Max. memory is 16.0GB. [2023-08-26 12:02:56,939 INFO L158 Benchmark]: Boogie Preprocessor took 41.12ms. Allocated memory is still 360.7MB. Free memory was 309.1MB in the beginning and 307.1MB in the end (delta: 2.0MB). Peak memory consumption was 2.1MB. Max. memory is 16.0GB. [2023-08-26 12:02:56,939 INFO L158 Benchmark]: RCFGBuilder took 654.32ms. Allocated memory is still 360.7MB. Free memory was 307.1MB in the beginning and 320.4MB in the end (delta: -13.3MB). Peak memory consumption was 27.3MB. Max. memory is 16.0GB. [2023-08-26 12:02:56,939 INFO L158 Benchmark]: TraceAbstraction took 18935.62ms. Allocated memory was 360.7MB in the beginning and 1.2GB in the end (delta: 851.4MB). Free memory was 319.5MB in the beginning and 542.6MB in the end (delta: -223.0MB). Peak memory consumption was 629.1MB. Max. memory is 16.0GB. [2023-08-26 12:02:56,940 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.10ms. Allocated memory is still 360.7MB. Free memory is still 336.9MB. There was no memory consumed. Max. memory is 16.0GB. * CACSL2BoogieTranslator took 584.27ms. Allocated memory is still 360.7MB. Free memory was 335.1MB in the beginning and 311.7MB in the end (delta: 23.4MB). Peak memory consumption was 23.1MB. Max. memory is 16.0GB. * Boogie Procedure Inliner took 80.17ms. Allocated memory is still 360.7MB. Free memory was 311.7MB in the beginning and 309.1MB in the end (delta: 2.6MB). Peak memory consumption was 2.1MB. Max. memory is 16.0GB. * Boogie Preprocessor took 41.12ms. Allocated memory is still 360.7MB. Free memory was 309.1MB in the beginning and 307.1MB in the end (delta: 2.0MB). Peak memory consumption was 2.1MB. Max. memory is 16.0GB. * RCFGBuilder took 654.32ms. Allocated memory is still 360.7MB. Free memory was 307.1MB in the beginning and 320.4MB in the end (delta: -13.3MB). Peak memory consumption was 27.3MB. Max. memory is 16.0GB. * TraceAbstraction took 18935.62ms. Allocated memory was 360.7MB in the beginning and 1.2GB in the end (delta: 851.4MB). Free memory was 319.5MB in the beginning and 542.6MB in the end (delta: -223.0MB). Peak memory consumption was 629.1MB. 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.5s, 147 PlacesBefore, 49 PlacesAfterwards, 137 TransitionsBefore, 37 TransitionsAfterwards, 3228 CoEnabledTransitionPairs, 6 FixpointIterations, 51 TrivialSequentialCompositions, 78 ConcurrentSequentialCompositions, 0 TrivialYvCompositions, 16 ConcurrentYvCompositions, 2 ChoiceCompositions, 147 TotalNumberOfCompositions, 8347 MoverChecksTotal, Independence Relation Statistics: CachedIndependenceRelation.Independence Queries: [ total: 3860, independent: 3669, independent conditional: 0, independent unconditional: 3669, dependent: 191, dependent conditional: 0, dependent unconditional: 191, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , CachedIndependenceRelation.Statistics on underlying relation: SyntacticIndependenceRelation.Independence Queries: [ total: 1868, independent: 1832, independent conditional: 0, independent unconditional: 1832, dependent: 36, dependent conditional: 0, dependent unconditional: 36, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , Cache Queries: [ total: 3860, independent: 1837, independent conditional: 0, independent unconditional: 1837, dependent: 155, dependent conditional: 0, dependent unconditional: 155, unknown: 1868, unknown conditional: 0, unknown unconditional: 1868] , Statistics on independence cache: Total cache size (in pairs): 156, Positive cache size: 138, Positive conditional cache size: 0, Positive unconditional cache size: 138, Negative cache size: 18, Negative conditional cache size: 0, Negative unconditional cache size: 18, 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_p0_EAX = 0; [L714] 0 int __unbuffered_p1_EAX = 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; [L856] 0 pthread_t t693; [L857] FCALL, FORK 0 pthread_create(&t693, ((void *)0), P0, ((void *)0)) VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=0, __unbuffered_p1_EAX=0, __unbuffered_p3_EAX=0, __unbuffered_p3_EBX=0, a=0, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, pthread_create(&t693, ((void *)0), P0, ((void *)0))=-3, t693={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] [L858] 0 pthread_t t694; [L859] FCALL, FORK 0 pthread_create(&t694, ((void *)0), P1, ((void *)0)) VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=0, __unbuffered_p1_EAX=0, __unbuffered_p3_EAX=0, __unbuffered_p3_EBX=0, a=0, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, pthread_create(&t694, ((void *)0), P1, ((void *)0))=-2, t693={5:0}, t694={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] [L860] 0 pthread_t t695; [L861] FCALL, FORK 0 pthread_create(&t695, ((void *)0), P2, ((void *)0)) VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=0, __unbuffered_p1_EAX=0, __unbuffered_p3_EAX=0, __unbuffered_p3_EBX=0, a=0, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, pthread_create(&t695, ((void *)0), P2, ((void *)0))=-1, t693={5:0}, t694={6:0}, t695={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] [L795] 3 y$w_buff1 = y$w_buff0 [L796] 3 y$w_buff0 = 1 [L797] 3 y$w_buff1_used = y$w_buff0_used [L798] 3 y$w_buff0_used = (_Bool)1 [L799] CALL 3 __VERIFIER_assert(!(y$w_buff1_used && y$w_buff0_used)) [L18] COND FALSE 3 !(!expression) [L799] RET 3 __VERIFIER_assert(!(y$w_buff1_used && y$w_buff0_used)) [L800] 3 y$r_buff1_thd0 = y$r_buff0_thd0 [L801] 3 y$r_buff1_thd1 = y$r_buff0_thd1 [L802] 3 y$r_buff1_thd2 = y$r_buff0_thd2 [L803] 3 y$r_buff1_thd3 = y$r_buff0_thd3 [L804] 3 y$r_buff1_thd4 = y$r_buff0_thd4 [L805] 3 y$r_buff0_thd3 = (_Bool)1 VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=0, __unbuffered_p1_EAX=0, __unbuffered_p3_EAX=0, __unbuffered_p3_EBX=0, a=0, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, 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] [L862] 0 pthread_t t696; [L863] FCALL, FORK 0 pthread_create(&t696, ((void *)0), P3, ((void *)0)) VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=0, __unbuffered_p1_EAX=0, __unbuffered_p3_EAX=0, __unbuffered_p3_EBX=0, a=0, arg={0:0}, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, pthread_create(&t696, ((void *)0), P3, ((void *)0))=0, t693={5:0}, t694={6:0}, t695={7:0}, t696={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=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] [L808] 3 z = 1 VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=0, __unbuffered_p1_EAX=0, __unbuffered_p3_EAX=0, __unbuffered_p3_EBX=0, a=0, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, 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] [L825] 4 z = 2 VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=0, __unbuffered_p1_EAX=0, __unbuffered_p3_EAX=0, __unbuffered_p3_EBX=0, a=0, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, 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] [L828] 4 __unbuffered_p3_EAX = z VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=0, __unbuffered_p1_EAX=0, __unbuffered_p3_EAX=2, __unbuffered_p3_EBX=0, a=0, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, 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_EBX = a VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=0, __unbuffered_p1_EAX=0, __unbuffered_p3_EAX=2, __unbuffered_p3_EBX=0, a=0, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, 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_p0_EAX=0, __unbuffered_p1_EAX=0, __unbuffered_p3_EAX=2, __unbuffered_p3_EBX=0, a=1, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, 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 __unbuffered_p0_EAX = x VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=0, __unbuffered_p1_EAX=0, __unbuffered_p3_EAX=2, __unbuffered_p3_EBX=0, a=1, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, 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] [L767] 2 x = 1 VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=0, __unbuffered_p1_EAX=0, __unbuffered_p3_EAX=2, __unbuffered_p3_EBX=0, a=1, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=0, x=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] [L770] 2 weak$$choice0 = __VERIFIER_nondet_bool() [L771] 2 weak$$choice2 = __VERIFIER_nondet_bool() [L772] 2 y$flush_delayed = weak$$choice2 [L773] 2 y$mem_tmp = y [L774] 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) [L775] 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)) [L776] 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)) [L777] 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)) [L778] 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)) [L779] 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)) [L780] 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)) [L781] 2 __unbuffered_p1_EAX = y [L782] 2 y = y$flush_delayed ? y$mem_tmp : y [L783] 2 y$flush_delayed = (_Bool)0 VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=0, __unbuffered_p1_EAX=0, __unbuffered_p3_EAX=2, __unbuffered_p3_EBX=0, a=1, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice2=0, x=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] [L811] 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) [L812] 3 y$w_buff0_used = y$w_buff0_used && y$r_buff0_thd3 ? (_Bool)0 : y$w_buff0_used [L813] 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 [L814] 3 y$r_buff0_thd3 = y$w_buff0_used && y$r_buff0_thd3 ? (_Bool)0 : y$r_buff0_thd3 [L815] 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_p0_EAX=0, __unbuffered_p1_EAX=0, __unbuffered_p3_EAX=2, __unbuffered_p3_EBX=0, a=1, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice2=0, x=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=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; [L834] 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) [L835] 4 y$w_buff0_used = y$w_buff0_used && y$r_buff0_thd4 ? (_Bool)0 : y$w_buff0_used [L836] 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 [L837] 4 y$r_buff0_thd4 = y$w_buff0_used && y$r_buff0_thd4 ? (_Bool)0 : y$r_buff0_thd4 [L838] 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 [\result={0:0}, __unbuffered_cnt=1, __unbuffered_p0_EAX=0, __unbuffered_p1_EAX=0, __unbuffered_p3_EAX=2, __unbuffered_p3_EBX=0, a=1, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=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=0, y$w_buff1=0, y$w_buff1_used=0, y=1, z=2] [L788] 2 __unbuffered_cnt = __unbuffered_cnt + 1 [L790] 2 return 0; [L818] 3 __unbuffered_cnt = __unbuffered_cnt + 1 [L820] 3 return 0; [L841] 4 __unbuffered_cnt = __unbuffered_cnt + 1 [L843] 4 return 0; [L865] 0 main$tmp_guard0 = __unbuffered_cnt == 4 [L867] CALL 0 assume_abort_if_not(main$tmp_guard0) [L3] COND FALSE 0 !(!cond) [L867] RET 0 assume_abort_if_not(main$tmp_guard0) [L869] 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) [L870] 0 y$w_buff0_used = y$w_buff0_used && y$r_buff0_thd0 ? (_Bool)0 : y$w_buff0_used [L871] 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 [L872] 0 y$r_buff0_thd0 = y$w_buff0_used && y$r_buff0_thd0 ? (_Bool)0 : y$r_buff0_thd0 [L873] 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_p0_EAX=0, __unbuffered_p1_EAX=0, __unbuffered_p3_EAX=2, __unbuffered_p3_EBX=0, a=1, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, main$tmp_guard0=1, main$tmp_guard1=0, t693={5:0}, t694={6:0}, t695={7:0}, t696={3: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=0, y$w_buff1=0, y$w_buff1_used=0, y=1, z=2] [L876] 0 main$tmp_guard1 = !(z == 2 && __unbuffered_p0_EAX == 0 && __unbuffered_p1_EAX == 0 && __unbuffered_p3_EAX == 2 && __unbuffered_p3_EBX == 0) [L878] 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", "mix026_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_p0_EAX=0, __unbuffered_p1_EAX=0, __unbuffered_p3_EAX=2, __unbuffered_p3_EBX=0, a=1, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, main$tmp_guard0=1, main$tmp_guard1=0, weak$$choice2=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=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: 859]: 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: 861]: 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: 857]: Unable to prove that petrification did provide enough thread instances (tool internal message, not intended for end users) Unable to prove that petrification did provide enough thread instances (tool internal message, not intended for end users) Reason: Not analyzed. - UnprovableResult [Line: 863]: Unable to prove that petrification did provide enough thread instances (tool internal message, not intended for end users) Unable to prove that petrification did provide enough thread instances (tool internal message, not intended for end users) Reason: Not analyzed. - StatisticsResult: Ultimate Automizer benchmark data with 1 thread instances CFG has 9 procedures, 175 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: 18.7s, OverallIterations: 14, TraceHistogramMax: 1, PathProgramHistogramMax: 2, EmptinessCheckTime: 0.0s, AutomataDifference: 10.9s, DeadEndRemovalTime: 0.0s, HoareAnnotationTime: 0.0s, InitialAbstractionConstructionTime: 4.6s, HoareTripleCheckerStatistics: 0 mSolverCounterUnknown, 426 SdHoareTripleChecker+Valid, 1.3s IncrementalHoareTripleChecker+Time, 0 mSdLazyCounter, 426 mSDsluCounter, 46 SdHoareTripleChecker+Invalid, 1.1s Time, 0 mProtectedAction, 0 SdHoareTripleChecker+Unchecked, 0 IncrementalHoareTripleChecker+Unchecked, 11 mSDsCounter, 38 IncrementalHoareTripleChecker+Valid, 0 mProtectedPredicate, 1260 IncrementalHoareTripleChecker+Invalid, 1298 SdHoareTripleChecker+Unknown, 0 mSolverCounterNotChecked, 38 mSolverCounterUnsat, 35 mSDtfsCounter, 1260 mSolverCounterSat, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Unknown, PredicateUnifierStatistics: 0 DeclaredPredicates, 51 GetRequests, 9 SyntacticMatches, 0 SemanticMatches, 42 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 10 ImplicationChecksByTransitivity, 0.2s Time, 0.0s BasicInterpolantAutomatonTime, BiggestAbstraction: size=733occurred in iteration=9, InterpolantAutomatonStates: 65, traceCheckStatistics: No data available, InterpolantConsolidationStatistics: No data available, PathInvariantsStatistics: No data available, 0/0 InterpolantCoveringCapability, TotalInterpolationStatistics: No data available, 0.0s DumpTime, AutomataMinimizationStatistics: No data available, HoareAnnotationStatistics: No data available, RefinementEngineStatistics: TRACE_CHECK: 0.1s SsaConstructionTime, 0.3s SatisfiabilityAnalysisTime, 2.4s InterpolantComputationTime, 234 NumberOfCodeBlocks, 234 NumberOfCodeBlocksAsserted, 14 NumberOfCheckSat, 195 ConstructedInterpolants, 0 QuantifiedInterpolants, 1097 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:56,968 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...