/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/mix043.oepc.i -------------------------------------------------------------------------------- This is Ultimate 0.2.3-dev-ac9dbd0-m [2023-08-26 12:05:56,283 INFO L188 SettingsManager]: Resetting all preferences to default values... [2023-08-26 12:05:56,375 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:05:56,383 WARN L101 SettingsManager]: Preference file contains the following unknown settings: [2023-08-26 12:05:56,384 WARN L103 SettingsManager]: * de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.Checked method. Library mode if empty. [2023-08-26 12:05:56,415 INFO L130 SettingsManager]: Preferences different from defaults after loading the file: [2023-08-26 12:05:56,416 INFO L151 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2023-08-26 12:05:56,416 INFO L153 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2023-08-26 12:05:56,417 INFO L151 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2023-08-26 12:05:56,422 INFO L153 SettingsManager]: * Create parallel compositions if possible=false [2023-08-26 12:05:56,422 INFO L153 SettingsManager]: * Use SBE=true [2023-08-26 12:05:56,422 INFO L151 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2023-08-26 12:05:56,423 INFO L153 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2023-08-26 12:05:56,424 INFO L153 SettingsManager]: * sizeof long=4 [2023-08-26 12:05:56,424 INFO L153 SettingsManager]: * Overapproximate operations on floating types=true [2023-08-26 12:05:56,424 INFO L153 SettingsManager]: * sizeof POINTER=4 [2023-08-26 12:05:56,425 INFO L153 SettingsManager]: * Check division by zero=IGNORE [2023-08-26 12:05:56,425 INFO L153 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2023-08-26 12:05:56,425 INFO L153 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2023-08-26 12:05:56,425 INFO L153 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2023-08-26 12:05:56,425 INFO L153 SettingsManager]: * sizeof long double=12 [2023-08-26 12:05:56,426 INFO L153 SettingsManager]: * Check if freed pointer was valid=false [2023-08-26 12:05:56,427 INFO L153 SettingsManager]: * Use constant arrays=true [2023-08-26 12:05:56,427 INFO L151 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2023-08-26 12:05:56,427 INFO L153 SettingsManager]: * Size of a code block=SequenceOfStatements [2023-08-26 12:05:56,428 INFO L153 SettingsManager]: * To the following directory=./dump/ [2023-08-26 12:05:56,428 INFO L153 SettingsManager]: * SMT solver=External_DefaultMode [2023-08-26 12:05:56,428 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2023-08-26 12:05:56,428 INFO L151 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2023-08-26 12:05:56,429 INFO L153 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2023-08-26 12:05:56,430 INFO L153 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopsAndPotentialCycles [2023-08-26 12:05:56,430 INFO L153 SettingsManager]: * Trace refinement strategy=CAMEL [2023-08-26 12:05:56,430 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2023-08-26 12:05:56,430 INFO L153 SettingsManager]: * Automaton type used in concurrency analysis=PETRI_NET [2023-08-26 12:05:56,430 INFO L153 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2023-08-26 12:05:56,431 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:05:56,719 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2023-08-26 12:05:56,737 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2023-08-26 12:05:56,739 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2023-08-26 12:05:56,740 INFO L270 PluginConnector]: Initializing CDTParser... [2023-08-26 12:05:56,741 INFO L274 PluginConnector]: CDTParser initialized [2023-08-26 12:05:56,742 INFO L431 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../../../trunk/examples/svcomp/pthread-wmm/mix043.oepc.i [2023-08-26 12:05:58,001 INFO L533 CDTParser]: Created temporary CDT project at NULL [2023-08-26 12:05:58,307 INFO L384 CDTParser]: Found 1 translation units. [2023-08-26 12:05:58,307 INFO L180 CDTParser]: Scanning /storage/repos/ultimate/trunk/examples/svcomp/pthread-wmm/mix043.oepc.i [2023-08-26 12:05:58,330 INFO L427 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/35afb9a91/ec4112138e584ca78d7c7cbc5980b06e/FLAG787b65986 [2023-08-26 12:05:58,344 INFO L435 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/35afb9a91/ec4112138e584ca78d7c7cbc5980b06e [2023-08-26 12:05:58,346 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2023-08-26 12:05:58,347 INFO L133 ToolchainWalker]: Walking toolchain with 5 elements. [2023-08-26 12:05:58,348 INFO L112 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2023-08-26 12:05:58,348 INFO L270 PluginConnector]: Initializing CACSL2BoogieTranslator... [2023-08-26 12:05:58,350 INFO L274 PluginConnector]: CACSL2BoogieTranslator initialized [2023-08-26 12:05:58,351 INFO L184 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 26.08 12:05:58" (1/1) ... [2023-08-26 12:05:58,352 INFO L204 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@2cddf41e and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 26.08 12:05:58, skipping insertion in model container [2023-08-26 12:05:58,352 INFO L184 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 26.08 12:05:58" (1/1) ... [2023-08-26 12:05:58,410 INFO L176 MainTranslator]: Built tables and reachable declarations [2023-08-26 12:05:58,806 INFO L209 PostProcessor]: Analyzing one entry point: main [2023-08-26 12:05:58,820 INFO L201 MainTranslator]: Completed pre-run [2023-08-26 12:05:58,847 WARN L75 lationResultReporter]: Unsoundness Warning: unspecified type, defaulting to int C: short [267] [2023-08-26 12:05:58,862 WARN L75 lationResultReporter]: Unsoundness Warning: unspecified type, defaulting to int C: short [267] [2023-08-26 12:05:58,897 INFO L209 PostProcessor]: Analyzing one entry point: main [2023-08-26 12:05:58,931 WARN L669 CHandler]: The function __VERIFIER_atomic_begin is called, but not defined or handled by StandardFunctionHandler. [2023-08-26 12:05:58,931 WARN L669 CHandler]: The function __VERIFIER_atomic_end is called, but not defined or handled by StandardFunctionHandler. [2023-08-26 12:05:58,937 INFO L206 MainTranslator]: Completed translation [2023-08-26 12:05:58,937 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 26.08 12:05:58 WrapperNode [2023-08-26 12:05:58,937 INFO L131 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2023-08-26 12:05:58,938 INFO L112 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2023-08-26 12:05:58,938 INFO L270 PluginConnector]: Initializing Boogie Procedure Inliner... [2023-08-26 12:05:58,939 INFO L274 PluginConnector]: Boogie Procedure Inliner initialized [2023-08-26 12:05:58,944 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:05:58" (1/1) ... [2023-08-26 12:05:58,958 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:05:58" (1/1) ... [2023-08-26 12:05:58,981 INFO L138 Inliner]: procedures = 177, calls = 72, calls flagged for inlining = 6, calls inlined = 7, statements flattened = 152 [2023-08-26 12:05:58,981 INFO L131 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2023-08-26 12:05:58,982 INFO L112 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2023-08-26 12:05:58,982 INFO L270 PluginConnector]: Initializing Boogie Preprocessor... [2023-08-26 12:05:58,982 INFO L274 PluginConnector]: Boogie Preprocessor initialized [2023-08-26 12:05:58,988 INFO L184 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 26.08 12:05:58" (1/1) ... [2023-08-26 12:05:58,989 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 26.08 12:05:58" (1/1) ... [2023-08-26 12:05:58,992 INFO L184 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 26.08 12:05:58" (1/1) ... [2023-08-26 12:05:58,992 INFO L184 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 26.08 12:05:58" (1/1) ... [2023-08-26 12:05:59,004 INFO L184 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 26.08 12:05:58" (1/1) ... [2023-08-26 12:05:59,013 INFO L184 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 26.08 12:05:58" (1/1) ... [2023-08-26 12:05:59,016 INFO L184 PluginConnector]: Executing the observer LTLStepAnnotator from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 26.08 12:05:58" (1/1) ... [2023-08-26 12:05:59,017 INFO L184 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 26.08 12:05:58" (1/1) ... [2023-08-26 12:05:59,027 INFO L131 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2023-08-26 12:05:59,028 INFO L112 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2023-08-26 12:05:59,028 INFO L270 PluginConnector]: Initializing RCFGBuilder... [2023-08-26 12:05:59,028 INFO L274 PluginConnector]: RCFGBuilder initialized [2023-08-26 12:05:59,029 INFO L184 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 26.08 12:05:58" (1/1) ... [2023-08-26 12:05:59,033 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2023-08-26 12:05:59,049 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2023-08-26 12:05:59,070 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:05:59,091 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:05:59,103 INFO L130 BoogieDeclarations]: Found specification of procedure write~int [2023-08-26 12:05:59,103 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_atomic_begin [2023-08-26 12:05:59,104 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2023-08-26 12:05:59,104 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnStack [2023-08-26 12:05:59,104 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.dealloc [2023-08-26 12:05:59,104 INFO L130 BoogieDeclarations]: Found specification of procedure P0 [2023-08-26 12:05:59,104 INFO L138 BoogieDeclarations]: Found implementation of procedure P0 [2023-08-26 12:05:59,104 INFO L130 BoogieDeclarations]: Found specification of procedure P1 [2023-08-26 12:05:59,104 INFO L138 BoogieDeclarations]: Found implementation of procedure P1 [2023-08-26 12:05:59,104 INFO L130 BoogieDeclarations]: Found specification of procedure P2 [2023-08-26 12:05:59,105 INFO L138 BoogieDeclarations]: Found implementation of procedure P2 [2023-08-26 12:05:59,105 INFO L130 BoogieDeclarations]: Found specification of procedure P3 [2023-08-26 12:05:59,105 INFO L138 BoogieDeclarations]: Found implementation of procedure P3 [2023-08-26 12:05:59,105 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int [2023-08-26 12:05:59,105 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_atomic_end [2023-08-26 12:05:59,107 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2023-08-26 12:05:59,107 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2023-08-26 12:05:59,108 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:05:59,258 INFO L236 CfgBuilder]: Building ICFG [2023-08-26 12:05:59,260 INFO L262 CfgBuilder]: Building CFG for each procedure with an implementation [2023-08-26 12:05:59,666 INFO L277 CfgBuilder]: Performing block encoding [2023-08-26 12:05:59,767 INFO L297 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2023-08-26 12:05:59,767 INFO L302 CfgBuilder]: Removed 0 assume(true) statements. [2023-08-26 12:05:59,769 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 26.08 12:05:59 BoogieIcfgContainer [2023-08-26 12:05:59,769 INFO L131 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2023-08-26 12:05:59,771 INFO L112 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2023-08-26 12:05:59,772 INFO L270 PluginConnector]: Initializing TraceAbstraction... [2023-08-26 12:05:59,774 INFO L274 PluginConnector]: TraceAbstraction initialized [2023-08-26 12:05:59,774 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 26.08 12:05:58" (1/3) ... [2023-08-26 12:05:59,775 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@2046861 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 26.08 12:05:59, skipping insertion in model container [2023-08-26 12:05:59,775 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 26.08 12:05:58" (2/3) ... [2023-08-26 12:05:59,775 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@2046861 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 26.08 12:05:59, skipping insertion in model container [2023-08-26 12:05:59,776 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 26.08 12:05:59" (3/3) ... [2023-08-26 12:05:59,777 INFO L112 eAbstractionObserver]: Analyzing ICFG mix043.oepc.i [2023-08-26 12:05:59,791 INFO L203 ceAbstractionStarter]: Automizer settings: Hoare:false NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2023-08-26 12:05:59,792 INFO L162 ceAbstractionStarter]: Applying trace abstraction to program that has 10 error locations. [2023-08-26 12:05:59,792 INFO L515 ceAbstractionStarter]: Constructing petrified ICFG for 1 thread instances. [2023-08-26 12:05:59,847 INFO L144 ThreadInstanceAdder]: Constructed 0 joinOtherThreadTransitions. [2023-08-26 12:05:59,900 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 155 places, 145 transitions, 310 flow [2023-08-26 12:05:59,949 INFO L124 PetriNetUnfolderBase]: 3/141 cut-off events. [2023-08-26 12:05:59,950 INFO L125 PetriNetUnfolderBase]: For 0/0 co-relation queries the response was YES. [2023-08-26 12:05:59,955 INFO L83 FinitePrefix]: Finished finitePrefix Result has 154 conditions, 141 events. 3/141 cut-off events. For 0/0 co-relation queries the response was YES. Maximal size of possible extension queue 4. Compared 118 event pairs, 0 based on Foata normal form. 0/128 useless extension candidates. Maximal degree in co-relation 99. Up to 2 conditions per place. [2023-08-26 12:05:59,956 INFO L82 GeneralOperation]: Start removeDead. Operand has 155 places, 145 transitions, 310 flow [2023-08-26 12:05:59,959 INFO L88 GeneralOperation]: Finished RemoveDead, result has has 151 places, 141 transitions, 294 flow [2023-08-26 12:05:59,963 INFO L124 etLargeBlockEncoding]: Petri net LBE is using variable-based independence relation. [2023-08-26 12:05:59,971 INFO L131 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 151 places, 141 transitions, 294 flow [2023-08-26 12:05:59,974 INFO L113 LiptonReduction]: Starting Lipton reduction on Petri net that has 151 places, 141 transitions, 294 flow [2023-08-26 12:05:59,974 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 151 places, 141 transitions, 294 flow [2023-08-26 12:06:00,011 INFO L124 PetriNetUnfolderBase]: 3/141 cut-off events. [2023-08-26 12:06:00,012 INFO L125 PetriNetUnfolderBase]: For 0/0 co-relation queries the response was YES. [2023-08-26 12:06:00,013 INFO L83 FinitePrefix]: Finished finitePrefix Result has 154 conditions, 141 events. 3/141 cut-off events. For 0/0 co-relation queries the response was YES. Maximal size of possible extension queue 4. Compared 117 event pairs, 0 based on Foata normal form. 0/128 useless extension candidates. Maximal degree in co-relation 99. Up to 2 conditions per place. [2023-08-26 12:06:00,015 INFO L119 LiptonReduction]: Number of co-enabled transitions 3698 [2023-08-26 12:06:05,087 INFO L134 LiptonReduction]: Checked pairs total: 11438 [2023-08-26 12:06:05,087 INFO L136 LiptonReduction]: Total number of compositions: 136 [2023-08-26 12:06:05,112 INFO L356 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2023-08-26 12:06:05,119 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;@468a6c87, mLbeIndependenceSettings=[IndependenceType=SYNTACTIC, AbstractionType=NONE, UseConditional=, UseSemiCommutativity=, Solver=, SolverTimeout=] [2023-08-26 12:06:05,119 INFO L358 AbstractCegarLoop]: Starting to check reachability of 15 error locations. [2023-08-26 12:06:05,121 INFO L185 PetriNetUnfolderBase]: Found word, exiting Unfolder. [2023-08-26 12:06:05,121 INFO L124 PetriNetUnfolderBase]: 0/0 cut-off events. [2023-08-26 12:06:05,121 INFO L125 PetriNetUnfolderBase]: For 0/0 co-relation queries the response was YES. [2023-08-26 12:06:05,121 INFO L200 CegarLoopForPetriNet]: Found error trace [2023-08-26 12:06:05,122 INFO L208 CegarLoopForPetriNet]: trace histogram [1] [2023-08-26 12:06:05,122 INFO L420 AbstractCegarLoop]: === Iteration 1 === Targeting ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [P0Err0ASSERT_VIOLATIONASSERT, ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 12 more)] === [2023-08-26 12:06:05,128 INFO L145 PredicateUnifier]: Initialized classic predicate unifier [2023-08-26 12:06:05,128 INFO L85 PathProgramCache]: Analyzing trace with hash 630, now seen corresponding path program 1 times [2023-08-26 12:06:05,136 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-08-26 12:06:05,137 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1104563778] [2023-08-26 12:06:05,137 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-08-26 12:06:05,137 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-08-26 12:06:05,229 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-08-26 12:06:05,250 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:06:05,251 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-08-26 12:06:05,251 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1104563778] [2023-08-26 12:06:05,252 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1104563778] provided 1 perfect and 0 imperfect interpolant sequences [2023-08-26 12:06:05,252 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-08-26 12:06:05,252 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [0] imperfect sequences [] total 0 [2023-08-26 12:06:05,253 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1177571516] [2023-08-26 12:06:05,255 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-08-26 12:06:05,262 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 2 states [2023-08-26 12:06:05,267 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-08-26 12:06:05,286 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 2 interpolants. [2023-08-26 12:06:05,287 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=1, Invalid=1, Unknown=0, NotChecked=0, Total=2 [2023-08-26 12:06:05,288 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 129 out of 281 [2023-08-26 12:06:05,291 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 51 places, 39 transitions, 90 flow. Second operand has 2 states, 2 states have (on average 129.5) internal successors, (259), 2 states have internal predecessors, (259), 0 states have call successors, (0), 0 states 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:06:05,291 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2023-08-26 12:06:05,291 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 129 of 281 [2023-08-26 12:06:05,292 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2023-08-26 12:06:06,552 INFO L124 PetriNetUnfolderBase]: 7479/10129 cut-off events. [2023-08-26 12:06:06,552 INFO L125 PetriNetUnfolderBase]: For 82/82 co-relation queries the response was YES. [2023-08-26 12:06:06,578 INFO L83 FinitePrefix]: Finished finitePrefix Result has 20437 conditions, 10129 events. 7479/10129 cut-off events. For 82/82 co-relation queries the response was YES. Maximal size of possible extension queue 451. Compared 50760 event pairs, 7479 based on Foata normal form. 0/9105 useless extension candidates. Maximal degree in co-relation 20425. Up to 10091 conditions per place. [2023-08-26 12:06:06,635 INFO L140 encePairwiseOnDemand]: 272/281 looper letters, 27 selfloop transitions, 0 changer transitions 0/30 dead transitions. [2023-08-26 12:06:06,635 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 44 places, 30 transitions, 126 flow [2023-08-26 12:06:06,637 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2023-08-26 12:06:06,639 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 2 states. [2023-08-26 12:06:06,645 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2 states to 2 states and 294 transitions. [2023-08-26 12:06:06,647 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.5231316725978647 [2023-08-26 12:06:06,648 INFO L72 ComplementDD]: Start complementDD. Operand 2 states and 294 transitions. [2023-08-26 12:06:06,648 INFO L73 IsDeterministic]: Start isDeterministic. Operand 2 states and 294 transitions. [2023-08-26 12:06:06,649 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2023-08-26 12:06:06,651 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 2 states and 294 transitions. [2023-08-26 12:06:06,654 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 3 states, 2 states have (on average 147.0) internal successors, (294), 2 states have internal predecessors, (294), 0 states have call successors, (0), 0 states 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:06:06,658 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 3 states, 3 states have (on average 281.0) internal successors, (843), 3 states have internal predecessors, (843), 0 states have call successors, (0), 0 states 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:06:06,658 INFO L81 ComplementDD]: Finished complementDD. Result has 3 states, 3 states have (on average 281.0) internal successors, (843), 3 states have internal predecessors, (843), 0 states have call successors, (0), 0 states 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:06:06,660 INFO L175 Difference]: Start difference. First operand has 51 places, 39 transitions, 90 flow. Second operand 2 states and 294 transitions. [2023-08-26 12:06:06,661 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 44 places, 30 transitions, 126 flow [2023-08-26 12:06:06,664 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 40 places, 30 transitions, 122 flow, removed 0 selfloop flow, removed 4 redundant places. [2023-08-26 12:06:06,666 INFO L231 Difference]: Finished difference. Result has 40 places, 30 transitions, 68 flow [2023-08-26 12:06:06,667 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=281, PETRI_DIFFERENCE_MINUEND_FLOW=68, PETRI_DIFFERENCE_MINUEND_PLACES=39, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=30, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=0, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=30, PETRI_DIFFERENCE_SUBTRAHEND_STATES=2, PETRI_FLOW=68, PETRI_PLACES=40, PETRI_TRANSITIONS=30} [2023-08-26 12:06:06,670 INFO L281 CegarLoopForPetriNet]: 51 programPoint places, -11 predicate places. [2023-08-26 12:06:06,671 INFO L495 AbstractCegarLoop]: Abstraction has has 40 places, 30 transitions, 68 flow [2023-08-26 12:06:06,671 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 2 states, 2 states have (on average 129.5) internal successors, (259), 2 states have internal predecessors, (259), 0 states have call successors, (0), 0 states 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:06:06,671 INFO L200 CegarLoopForPetriNet]: Found error trace [2023-08-26 12:06:06,671 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1] [2023-08-26 12:06:06,672 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable0 [2023-08-26 12:06:06,672 INFO L420 AbstractCegarLoop]: === Iteration 2 === Targeting P0Err0ASSERT_VIOLATIONASSERT === [P0Err0ASSERT_VIOLATIONASSERT, ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 12 more)] === [2023-08-26 12:06:06,672 INFO L145 PredicateUnifier]: Initialized classic predicate unifier [2023-08-26 12:06:06,672 INFO L85 PathProgramCache]: Analyzing trace with hash 618378, now seen corresponding path program 1 times [2023-08-26 12:06:06,673 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-08-26 12:06:06,673 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [470121469] [2023-08-26 12:06:06,673 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-08-26 12:06:06,673 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-08-26 12:06:06,710 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-08-26 12:06:06,913 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:06:06,913 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-08-26 12:06:06,914 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [470121469] [2023-08-26 12:06:06,914 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [470121469] provided 1 perfect and 0 imperfect interpolant sequences [2023-08-26 12:06:06,914 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-08-26 12:06:06,914 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [1] imperfect sequences [] total 1 [2023-08-26 12:06:06,914 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1420289328] [2023-08-26 12:06:06,914 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-08-26 12:06:06,915 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2023-08-26 12:06:06,915 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-08-26 12:06:06,916 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2023-08-26 12:06:06,916 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2023-08-26 12:06:06,917 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 128 out of 281 [2023-08-26 12:06:06,918 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 40 places, 30 transitions, 68 flow. Second operand has 3 states, 3 states have (on average 129.0) internal successors, (387), 3 states have internal predecessors, (387), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-26 12:06:06,918 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2023-08-26 12:06:06,918 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 128 of 281 [2023-08-26 12:06:06,918 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2023-08-26 12:06:07,811 INFO L124 PetriNetUnfolderBase]: 5879/8110 cut-off events. [2023-08-26 12:06:07,811 INFO L125 PetriNetUnfolderBase]: For 0/0 co-relation queries the response was YES. [2023-08-26 12:06:07,824 INFO L83 FinitePrefix]: Finished finitePrefix Result has 16251 conditions, 8110 events. 5879/8110 cut-off events. For 0/0 co-relation queries the response was YES. Maximal size of possible extension queue 365. Compared 40856 event pairs, 2239 based on Foata normal form. 0/7722 useless extension candidates. Maximal degree in co-relation 16248. Up to 6367 conditions per place. [2023-08-26 12:06:07,863 INFO L140 encePairwiseOnDemand]: 278/281 looper letters, 43 selfloop transitions, 2 changer transitions 2/50 dead transitions. [2023-08-26 12:06:07,863 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 41 places, 50 transitions, 208 flow [2023-08-26 12:06:07,864 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2023-08-26 12:06:07,864 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2023-08-26 12:06:07,866 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 432 transitions. [2023-08-26 12:06:07,867 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.5124555160142349 [2023-08-26 12:06:07,867 INFO L72 ComplementDD]: Start complementDD. Operand 3 states and 432 transitions. [2023-08-26 12:06:07,867 INFO L73 IsDeterministic]: Start isDeterministic. Operand 3 states and 432 transitions. [2023-08-26 12:06:07,867 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2023-08-26 12:06:07,867 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 3 states and 432 transitions. [2023-08-26 12:06:07,869 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 4 states, 3 states have (on average 144.0) internal successors, (432), 3 states have internal predecessors, (432), 0 states have call successors, (0), 0 states 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:06:07,871 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 4 states, 4 states have (on average 281.0) internal successors, (1124), 4 states have internal predecessors, (1124), 0 states have call successors, (0), 0 states 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:06:07,872 INFO L81 ComplementDD]: Finished complementDD. Result has 4 states, 4 states have (on average 281.0) internal successors, (1124), 4 states have internal predecessors, (1124), 0 states have call successors, (0), 0 states 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:06:07,872 INFO L175 Difference]: Start difference. First operand has 40 places, 30 transitions, 68 flow. Second operand 3 states and 432 transitions. [2023-08-26 12:06:07,872 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 41 places, 50 transitions, 208 flow [2023-08-26 12:06:07,873 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 41 places, 50 transitions, 208 flow, removed 0 selfloop flow, removed 0 redundant places. [2023-08-26 12:06:07,874 INFO L231 Difference]: Finished difference. Result has 41 places, 28 transitions, 68 flow [2023-08-26 12:06:07,874 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=281, PETRI_DIFFERENCE_MINUEND_FLOW=66, PETRI_DIFFERENCE_MINUEND_PLACES=39, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=29, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=2, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=27, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=68, PETRI_PLACES=41, PETRI_TRANSITIONS=28} [2023-08-26 12:06:07,874 INFO L281 CegarLoopForPetriNet]: 51 programPoint places, -10 predicate places. [2023-08-26 12:06:07,875 INFO L495 AbstractCegarLoop]: Abstraction has has 41 places, 28 transitions, 68 flow [2023-08-26 12:06:07,875 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 129.0) internal successors, (387), 3 states have internal predecessors, (387), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-26 12:06:07,875 INFO L200 CegarLoopForPetriNet]: Found error trace [2023-08-26 12:06:07,876 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-08-26 12:06:07,876 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1 [2023-08-26 12:06:07,876 INFO L420 AbstractCegarLoop]: === Iteration 3 === Targeting ULTIMATE.startErr8ASSERT_VIOLATIONASSERT === [P0Err0ASSERT_VIOLATIONASSERT, ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 12 more)] === [2023-08-26 12:06:07,877 INFO L145 PredicateUnifier]: Initialized classic predicate unifier [2023-08-26 12:06:07,877 INFO L85 PathProgramCache]: Analyzing trace with hash -64135266, now seen corresponding path program 1 times [2023-08-26 12:06:07,877 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-08-26 12:06:07,877 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2046507127] [2023-08-26 12:06:07,877 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-08-26 12:06:07,877 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-08-26 12:06:07,912 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-08-26 12:06:08,192 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:06:08,193 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-08-26 12:06:08,193 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2046507127] [2023-08-26 12:06:08,193 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2046507127] provided 1 perfect and 0 imperfect interpolant sequences [2023-08-26 12:06:08,194 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-08-26 12:06:08,195 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [1] imperfect sequences [] total 1 [2023-08-26 12:06:08,195 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [172423551] [2023-08-26 12:06:08,195 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-08-26 12:06:08,196 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2023-08-26 12:06:08,196 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-08-26 12:06:08,196 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2023-08-26 12:06:08,197 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2023-08-26 12:06:08,197 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 118 out of 281 [2023-08-26 12:06:08,198 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 41 places, 28 transitions, 68 flow. Second operand has 3 states, 3 states have (on average 121.66666666666667) internal successors, (365), 3 states have internal predecessors, (365), 0 states have call successors, (0), 0 states 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:06:08,198 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2023-08-26 12:06:08,198 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 118 of 281 [2023-08-26 12:06:08,198 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2023-08-26 12:06:10,057 INFO L124 PetriNetUnfolderBase]: 14367/19536 cut-off events. [2023-08-26 12:06:10,057 INFO L125 PetriNetUnfolderBase]: For 1005/1005 co-relation queries the response was YES. [2023-08-26 12:06:10,131 INFO L83 FinitePrefix]: Finished finitePrefix Result has 40521 conditions, 19536 events. 14367/19536 cut-off events. For 1005/1005 co-relation queries the response was YES. Maximal size of possible extension queue 632. Compared 100379 event pairs, 5297 based on Foata normal form. 458/19994 useless extension candidates. Maximal degree in co-relation 40517. Up to 13505 conditions per place. [2023-08-26 12:06:10,214 INFO L140 encePairwiseOnDemand]: 273/281 looper letters, 46 selfloop transitions, 7 changer transitions 0/53 dead transitions. [2023-08-26 12:06:10,215 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 42 places, 53 transitions, 232 flow [2023-08-26 12:06:10,215 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2023-08-26 12:06:10,215 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2023-08-26 12:06:10,216 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 408 transitions. [2023-08-26 12:06:10,217 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.48398576512455516 [2023-08-26 12:06:10,217 INFO L72 ComplementDD]: Start complementDD. Operand 3 states and 408 transitions. [2023-08-26 12:06:10,217 INFO L73 IsDeterministic]: Start isDeterministic. Operand 3 states and 408 transitions. [2023-08-26 12:06:10,217 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2023-08-26 12:06:10,217 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 3 states and 408 transitions. [2023-08-26 12:06:10,218 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 4 states, 3 states have (on average 136.0) internal successors, (408), 3 states have internal predecessors, (408), 0 states have call successors, (0), 0 states 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:06:10,223 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 4 states, 4 states have (on average 281.0) internal successors, (1124), 4 states have internal predecessors, (1124), 0 states have call successors, (0), 0 states 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:06:10,224 INFO L81 ComplementDD]: Finished complementDD. Result has 4 states, 4 states have (on average 281.0) internal successors, (1124), 4 states have internal predecessors, (1124), 0 states have call successors, (0), 0 states 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:06:10,224 INFO L175 Difference]: Start difference. First operand has 41 places, 28 transitions, 68 flow. Second operand 3 states and 408 transitions. [2023-08-26 12:06:10,224 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 42 places, 53 transitions, 232 flow [2023-08-26 12:06:10,226 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 40 places, 53 transitions, 226 flow, removed 0 selfloop flow, removed 2 redundant places. [2023-08-26 12:06:10,227 INFO L231 Difference]: Finished difference. Result has 42 places, 34 transitions, 118 flow [2023-08-26 12:06:10,227 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=281, PETRI_DIFFERENCE_MINUEND_FLOW=64, PETRI_DIFFERENCE_MINUEND_PLACES=38, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=28, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=1, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=21, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=118, PETRI_PLACES=42, PETRI_TRANSITIONS=34} [2023-08-26 12:06:10,228 INFO L281 CegarLoopForPetriNet]: 51 programPoint places, -9 predicate places. [2023-08-26 12:06:10,228 INFO L495 AbstractCegarLoop]: Abstraction has has 42 places, 34 transitions, 118 flow [2023-08-26 12:06:10,229 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 121.66666666666667) internal successors, (365), 3 states have internal predecessors, (365), 0 states have call successors, (0), 0 states 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:06:10,229 INFO L200 CegarLoopForPetriNet]: Found error trace [2023-08-26 12:06:10,229 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-08-26 12:06:10,230 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2 [2023-08-26 12:06:10,234 INFO L420 AbstractCegarLoop]: === Iteration 4 === Targeting ULTIMATE.startErr8ASSERT_VIOLATIONASSERT === [P0Err0ASSERT_VIOLATIONASSERT, ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 12 more)] === [2023-08-26 12:06:10,235 INFO L145 PredicateUnifier]: Initialized classic predicate unifier [2023-08-26 12:06:10,235 INFO L85 PathProgramCache]: Analyzing trace with hash -1988195829, now seen corresponding path program 1 times [2023-08-26 12:06:10,235 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-08-26 12:06:10,235 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2146192477] [2023-08-26 12:06:10,236 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-08-26 12:06:10,236 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-08-26 12:06:10,274 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-08-26 12:06:10,479 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:06:10,480 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-08-26 12:06:10,480 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2146192477] [2023-08-26 12:06:10,480 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2146192477] provided 1 perfect and 0 imperfect interpolant sequences [2023-08-26 12:06:10,480 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-08-26 12:06:10,480 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2023-08-26 12:06:10,481 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1899534068] [2023-08-26 12:06:10,481 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-08-26 12:06:10,481 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2023-08-26 12:06:10,481 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-08-26 12:06:10,485 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2023-08-26 12:06:10,486 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2023-08-26 12:06:10,487 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 118 out of 281 [2023-08-26 12:06:10,488 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 42 places, 34 transitions, 118 flow. Second operand has 4 states, 4 states have (on average 121.0) internal successors, (484), 4 states have internal predecessors, (484), 0 states have call successors, (0), 0 states 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:06:10,488 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2023-08-26 12:06:10,488 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 118 of 281 [2023-08-26 12:06:10,488 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2023-08-26 12:06:12,103 INFO L124 PetriNetUnfolderBase]: 13285/18086 cut-off events. [2023-08-26 12:06:12,104 INFO L125 PetriNetUnfolderBase]: For 5532/5532 co-relation queries the response was YES. [2023-08-26 12:06:12,172 INFO L83 FinitePrefix]: Finished finitePrefix Result has 43687 conditions, 18086 events. 13285/18086 cut-off events. For 5532/5532 co-relation queries the response was YES. Maximal size of possible extension queue 562. Compared 89836 event pairs, 3757 based on Foata normal form. 230/18316 useless extension candidates. Maximal degree in co-relation 43682. Up to 8781 conditions per place. [2023-08-26 12:06:12,247 INFO L140 encePairwiseOnDemand]: 274/281 looper letters, 55 selfloop transitions, 7 changer transitions 0/62 dead transitions. [2023-08-26 12:06:12,248 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 45 places, 62 transitions, 314 flow [2023-08-26 12:06:12,248 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2023-08-26 12:06:12,248 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 4 states. [2023-08-26 12:06:12,250 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 530 transitions. [2023-08-26 12:06:12,250 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.47153024911032027 [2023-08-26 12:06:12,250 INFO L72 ComplementDD]: Start complementDD. Operand 4 states and 530 transitions. [2023-08-26 12:06:12,251 INFO L73 IsDeterministic]: Start isDeterministic. Operand 4 states and 530 transitions. [2023-08-26 12:06:12,251 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2023-08-26 12:06:12,251 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 4 states and 530 transitions. [2023-08-26 12:06:12,253 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 5 states, 4 states have (on average 132.5) internal successors, (530), 4 states have internal predecessors, (530), 0 states have call successors, (0), 0 states 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:06:12,255 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 5 states, 5 states have (on average 281.0) internal successors, (1405), 5 states have internal predecessors, (1405), 0 states have call successors, (0), 0 states 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:06:12,255 INFO L81 ComplementDD]: Finished complementDD. Result has 5 states, 5 states have (on average 281.0) internal successors, (1405), 5 states have internal predecessors, (1405), 0 states have call successors, (0), 0 states 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:06:12,255 INFO L175 Difference]: Start difference. First operand has 42 places, 34 transitions, 118 flow. Second operand 4 states and 530 transitions. [2023-08-26 12:06:12,256 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 45 places, 62 transitions, 314 flow [2023-08-26 12:06:12,310 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 43 places, 62 transitions, 294 flow, removed 0 selfloop flow, removed 2 redundant places. [2023-08-26 12:06:12,312 INFO L231 Difference]: Finished difference. Result has 46 places, 37 transitions, 152 flow [2023-08-26 12:06:12,312 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=281, PETRI_DIFFERENCE_MINUEND_FLOW=104, PETRI_DIFFERENCE_MINUEND_PLACES=40, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=34, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=4, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=27, PETRI_DIFFERENCE_SUBTRAHEND_STATES=4, PETRI_FLOW=152, PETRI_PLACES=46, PETRI_TRANSITIONS=37} [2023-08-26 12:06:12,313 INFO L281 CegarLoopForPetriNet]: 51 programPoint places, -5 predicate places. [2023-08-26 12:06:12,314 INFO L495 AbstractCegarLoop]: Abstraction has has 46 places, 37 transitions, 152 flow [2023-08-26 12:06:12,314 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 121.0) internal successors, (484), 4 states have internal predecessors, (484), 0 states have call successors, (0), 0 states 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:06:12,315 INFO L200 CegarLoopForPetriNet]: Found error trace [2023-08-26 12:06:12,315 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-08-26 12:06:12,315 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable3 [2023-08-26 12:06:12,315 INFO L420 AbstractCegarLoop]: === Iteration 5 === Targeting ULTIMATE.startErr8ASSERT_VIOLATIONASSERT === [P0Err0ASSERT_VIOLATIONASSERT, ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 12 more)] === [2023-08-26 12:06:12,316 INFO L145 PredicateUnifier]: Initialized classic predicate unifier [2023-08-26 12:06:12,316 INFO L85 PathProgramCache]: Analyzing trace with hash -1507326842, now seen corresponding path program 1 times [2023-08-26 12:06:12,316 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-08-26 12:06:12,316 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [335950984] [2023-08-26 12:06:12,316 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-08-26 12:06:12,317 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-08-26 12:06:12,362 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-08-26 12:06:12,495 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:06:12,496 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-08-26 12:06:12,496 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [335950984] [2023-08-26 12:06:12,496 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [335950984] provided 1 perfect and 0 imperfect interpolant sequences [2023-08-26 12:06:12,496 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-08-26 12:06:12,496 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2023-08-26 12:06:12,497 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1487423445] [2023-08-26 12:06:12,499 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-08-26 12:06:12,499 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2023-08-26 12:06:12,499 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-08-26 12:06:12,500 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2023-08-26 12:06:12,500 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2023-08-26 12:06:12,500 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 119 out of 281 [2023-08-26 12:06:12,501 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 46 places, 37 transitions, 152 flow. Second operand has 4 states, 4 states have (on average 122.25) internal successors, (489), 4 states have internal predecessors, (489), 0 states have call successors, (0), 0 states 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:06:12,505 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2023-08-26 12:06:12,506 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 119 of 281 [2023-08-26 12:06:12,506 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2023-08-26 12:06:13,692 INFO L124 PetriNetUnfolderBase]: 8849/12983 cut-off events. [2023-08-26 12:06:13,692 INFO L125 PetriNetUnfolderBase]: For 6550/6691 co-relation queries the response was YES. [2023-08-26 12:06:13,731 INFO L83 FinitePrefix]: Finished finitePrefix Result has 30928 conditions, 12983 events. 8849/12983 cut-off events. For 6550/6691 co-relation queries the response was YES. Maximal size of possible extension queue 582. Compared 77635 event pairs, 1464 based on Foata normal form. 1010/13865 useless extension candidates. Maximal degree in co-relation 30921. Up to 8025 conditions per place. [2023-08-26 12:06:13,775 INFO L140 encePairwiseOnDemand]: 274/281 looper letters, 76 selfloop transitions, 10 changer transitions 0/95 dead transitions. [2023-08-26 12:06:13,775 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 50 places, 95 transitions, 518 flow [2023-08-26 12:06:13,776 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2023-08-26 12:06:13,776 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 5 states. [2023-08-26 12:06:13,778 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 671 transitions. [2023-08-26 12:06:13,778 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.47758007117437723 [2023-08-26 12:06:13,778 INFO L72 ComplementDD]: Start complementDD. Operand 5 states and 671 transitions. [2023-08-26 12:06:13,779 INFO L73 IsDeterministic]: Start isDeterministic. Operand 5 states and 671 transitions. [2023-08-26 12:06:13,780 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2023-08-26 12:06:13,780 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 5 states and 671 transitions. [2023-08-26 12:06:13,782 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 6 states, 5 states have (on average 134.2) internal successors, (671), 5 states have internal predecessors, (671), 0 states have call successors, (0), 0 states 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:06:13,785 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 6 states, 6 states have (on average 281.0) internal successors, (1686), 6 states have internal predecessors, (1686), 0 states have call successors, (0), 0 states 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:06:13,786 INFO L81 ComplementDD]: Finished complementDD. Result has 6 states, 6 states have (on average 281.0) internal successors, (1686), 6 states have internal predecessors, (1686), 0 states have call successors, (0), 0 states 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:06:13,786 INFO L175 Difference]: Start difference. First operand has 46 places, 37 transitions, 152 flow. Second operand 5 states and 671 transitions. [2023-08-26 12:06:13,786 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 50 places, 95 transitions, 518 flow [2023-08-26 12:06:13,802 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 49 places, 95 transitions, 509 flow, removed 0 selfloop flow, removed 1 redundant places. [2023-08-26 12:06:13,804 INFO L231 Difference]: Finished difference. Result has 52 places, 46 transitions, 224 flow [2023-08-26 12:06:13,804 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=281, PETRI_DIFFERENCE_MINUEND_FLOW=149, PETRI_DIFFERENCE_MINUEND_PLACES=45, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=37, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=1, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=31, PETRI_DIFFERENCE_SUBTRAHEND_STATES=5, PETRI_FLOW=224, PETRI_PLACES=52, PETRI_TRANSITIONS=46} [2023-08-26 12:06:13,806 INFO L281 CegarLoopForPetriNet]: 51 programPoint places, 1 predicate places. [2023-08-26 12:06:13,806 INFO L495 AbstractCegarLoop]: Abstraction has has 52 places, 46 transitions, 224 flow [2023-08-26 12:06:13,807 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 122.25) internal successors, (489), 4 states have internal predecessors, (489), 0 states have call successors, (0), 0 states 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:06:13,807 INFO L200 CegarLoopForPetriNet]: Found error trace [2023-08-26 12:06:13,807 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:06:13,807 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable4 [2023-08-26 12:06:13,807 INFO L420 AbstractCegarLoop]: === Iteration 6 === Targeting ULTIMATE.startErr8ASSERT_VIOLATIONASSERT === [P0Err0ASSERT_VIOLATIONASSERT, ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 12 more)] === [2023-08-26 12:06:13,808 INFO L145 PredicateUnifier]: Initialized classic predicate unifier [2023-08-26 12:06:13,808 INFO L85 PathProgramCache]: Analyzing trace with hash 134893898, now seen corresponding path program 1 times [2023-08-26 12:06:13,808 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-08-26 12:06:13,808 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [734124276] [2023-08-26 12:06:13,808 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-08-26 12:06:13,808 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-08-26 12:06:13,848 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-08-26 12:06:13,994 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:06:13,994 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-08-26 12:06:13,995 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [734124276] [2023-08-26 12:06:13,995 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [734124276] provided 1 perfect and 0 imperfect interpolant sequences [2023-08-26 12:06:13,995 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-08-26 12:06:13,995 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2023-08-26 12:06:13,995 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1442704661] [2023-08-26 12:06:13,995 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-08-26 12:06:13,996 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2023-08-26 12:06:13,996 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-08-26 12:06:13,996 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2023-08-26 12:06:13,996 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=8, Invalid=12, Unknown=0, NotChecked=0, Total=20 [2023-08-26 12:06:13,997 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 119 out of 281 [2023-08-26 12:06:13,998 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 52 places, 46 transitions, 224 flow. Second operand has 5 states, 5 states have (on average 122.2) internal successors, (611), 5 states have internal predecessors, (611), 0 states have call successors, (0), 0 states 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:06:13,998 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2023-08-26 12:06:13,998 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 119 of 281 [2023-08-26 12:06:13,998 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2023-08-26 12:06:15,013 INFO L124 PetriNetUnfolderBase]: 7087/10684 cut-off events. [2023-08-26 12:06:15,013 INFO L125 PetriNetUnfolderBase]: For 7787/7907 co-relation queries the response was YES. [2023-08-26 12:06:15,047 INFO L83 FinitePrefix]: Finished finitePrefix Result has 32561 conditions, 10684 events. 7087/10684 cut-off events. For 7787/7907 co-relation queries the response was YES. Maximal size of possible extension queue 487. Compared 65460 event pairs, 840 based on Foata normal form. 642/11211 useless extension candidates. Maximal degree in co-relation 32550. Up to 3277 conditions per place. [2023-08-26 12:06:15,081 INFO L140 encePairwiseOnDemand]: 274/281 looper letters, 106 selfloop transitions, 19 changer transitions 0/134 dead transitions. [2023-08-26 12:06:15,081 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 58 places, 134 transitions, 820 flow [2023-08-26 12:06:15,082 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2023-08-26 12:06:15,082 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 7 states. [2023-08-26 12:06:15,084 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 7 states to 7 states and 942 transitions. [2023-08-26 12:06:15,085 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.47890188103711234 [2023-08-26 12:06:15,085 INFO L72 ComplementDD]: Start complementDD. Operand 7 states and 942 transitions. [2023-08-26 12:06:15,085 INFO L73 IsDeterministic]: Start isDeterministic. Operand 7 states and 942 transitions. [2023-08-26 12:06:15,085 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2023-08-26 12:06:15,085 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 7 states and 942 transitions. [2023-08-26 12:06:15,088 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 8 states, 7 states have (on average 134.57142857142858) internal successors, (942), 7 states have internal predecessors, (942), 0 states have call successors, (0), 0 states 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:06:15,091 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 8 states, 8 states have (on average 281.0) internal successors, (2248), 8 states have internal predecessors, (2248), 0 states have call successors, (0), 0 states 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:06:15,092 INFO L81 ComplementDD]: Finished complementDD. Result has 8 states, 8 states have (on average 281.0) internal successors, (2248), 8 states have internal predecessors, (2248), 0 states have call successors, (0), 0 states 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:06:15,092 INFO L175 Difference]: Start difference. First operand has 52 places, 46 transitions, 224 flow. Second operand 7 states and 942 transitions. [2023-08-26 12:06:15,092 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 58 places, 134 transitions, 820 flow [2023-08-26 12:06:15,154 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 57 places, 134 transitions, 815 flow, removed 0 selfloop flow, removed 1 redundant places. [2023-08-26 12:06:15,156 INFO L231 Difference]: Finished difference. Result has 60 places, 55 transitions, 353 flow [2023-08-26 12:06:15,156 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=281, PETRI_DIFFERENCE_MINUEND_FLOW=219, PETRI_DIFFERENCE_MINUEND_PLACES=51, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=46, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=10, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=31, PETRI_DIFFERENCE_SUBTRAHEND_STATES=7, PETRI_FLOW=353, PETRI_PLACES=60, PETRI_TRANSITIONS=55} [2023-08-26 12:06:15,156 INFO L281 CegarLoopForPetriNet]: 51 programPoint places, 9 predicate places. [2023-08-26 12:06:15,157 INFO L495 AbstractCegarLoop]: Abstraction has has 60 places, 55 transitions, 353 flow [2023-08-26 12:06:15,157 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 122.2) internal successors, (611), 5 states have internal predecessors, (611), 0 states have call successors, (0), 0 states 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:06:15,157 INFO L200 CegarLoopForPetriNet]: Found error trace [2023-08-26 12:06:15,157 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:06:15,157 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable5 [2023-08-26 12:06:15,157 INFO L420 AbstractCegarLoop]: === Iteration 7 === Targeting ULTIMATE.startErr8ASSERT_VIOLATIONASSERT === [P0Err0ASSERT_VIOLATIONASSERT, ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 12 more)] === [2023-08-26 12:06:15,158 INFO L145 PredicateUnifier]: Initialized classic predicate unifier [2023-08-26 12:06:15,158 INFO L85 PathProgramCache]: Analyzing trace with hash -305856411, now seen corresponding path program 1 times [2023-08-26 12:06:15,158 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-08-26 12:06:15,158 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [621542280] [2023-08-26 12:06:15,158 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-08-26 12:06:15,158 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-08-26 12:06:15,208 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-08-26 12:06:15,724 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:06:15,724 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-08-26 12:06:15,724 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [621542280] [2023-08-26 12:06:15,724 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [621542280] provided 1 perfect and 0 imperfect interpolant sequences [2023-08-26 12:06:15,724 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-08-26 12:06:15,725 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2023-08-26 12:06:15,725 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1629704156] [2023-08-26 12:06:15,725 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-08-26 12:06:15,725 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2023-08-26 12:06:15,725 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-08-26 12:06:15,726 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2023-08-26 12:06:15,726 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2023-08-26 12:06:15,727 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 123 out of 281 [2023-08-26 12:06:15,727 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 60 places, 55 transitions, 353 flow. Second operand has 5 states, 5 states have (on average 126.8) internal successors, (634), 5 states have internal predecessors, (634), 0 states have call successors, (0), 0 states 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:06:15,727 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2023-08-26 12:06:15,728 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 123 of 281 [2023-08-26 12:06:15,728 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2023-08-26 12:06:17,409 INFO L124 PetriNetUnfolderBase]: 12003/18462 cut-off events. [2023-08-26 12:06:17,410 INFO L125 PetriNetUnfolderBase]: For 37374/37519 co-relation queries the response was YES. [2023-08-26 12:06:17,521 INFO L83 FinitePrefix]: Finished finitePrefix Result has 66814 conditions, 18462 events. 12003/18462 cut-off events. For 37374/37519 co-relation queries the response was YES. Maximal size of possible extension queue 860. Compared 127166 event pairs, 3327 based on Foata normal form. 91/18466 useless extension candidates. Maximal degree in co-relation 66800. Up to 10253 conditions per place. [2023-08-26 12:06:17,567 INFO L140 encePairwiseOnDemand]: 273/281 looper letters, 113 selfloop transitions, 14 changer transitions 52/188 dead transitions. [2023-08-26 12:06:17,567 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 65 places, 188 transitions, 1627 flow [2023-08-26 12:06:17,569 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2023-08-26 12:06:17,569 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 6 states. [2023-08-26 12:06:17,571 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6 states to 6 states and 828 transitions. [2023-08-26 12:06:17,571 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.49110320284697506 [2023-08-26 12:06:17,571 INFO L72 ComplementDD]: Start complementDD. Operand 6 states and 828 transitions. [2023-08-26 12:06:17,572 INFO L73 IsDeterministic]: Start isDeterministic. Operand 6 states and 828 transitions. [2023-08-26 12:06:17,572 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2023-08-26 12:06:17,572 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 6 states and 828 transitions. [2023-08-26 12:06:17,574 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 7 states, 6 states have (on average 138.0) internal successors, (828), 6 states have internal predecessors, (828), 0 states have call successors, (0), 0 states 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:06:17,577 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 7 states, 7 states have (on average 281.0) internal successors, (1967), 7 states have internal predecessors, (1967), 0 states have call successors, (0), 0 states 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:06:17,578 INFO L81 ComplementDD]: Finished complementDD. Result has 7 states, 7 states have (on average 281.0) internal successors, (1967), 7 states have internal predecessors, (1967), 0 states have call successors, (0), 0 states 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:06:17,578 INFO L175 Difference]: Start difference. First operand has 60 places, 55 transitions, 353 flow. Second operand 6 states and 828 transitions. [2023-08-26 12:06:17,578 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 65 places, 188 transitions, 1627 flow [2023-08-26 12:06:18,642 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 62 places, 188 transitions, 1407 flow, removed 77 selfloop flow, removed 3 redundant places. [2023-08-26 12:06:18,645 INFO L231 Difference]: Finished difference. Result has 66 places, 68 transitions, 420 flow [2023-08-26 12:06:18,645 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=281, PETRI_DIFFERENCE_MINUEND_FLOW=303, PETRI_DIFFERENCE_MINUEND_PLACES=57, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=55, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=6, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=47, PETRI_DIFFERENCE_SUBTRAHEND_STATES=6, PETRI_FLOW=420, PETRI_PLACES=66, PETRI_TRANSITIONS=68} [2023-08-26 12:06:18,646 INFO L281 CegarLoopForPetriNet]: 51 programPoint places, 15 predicate places. [2023-08-26 12:06:18,646 INFO L495 AbstractCegarLoop]: Abstraction has has 66 places, 68 transitions, 420 flow [2023-08-26 12:06:18,646 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 126.8) internal successors, (634), 5 states have internal predecessors, (634), 0 states have call successors, (0), 0 states 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:06:18,646 INFO L200 CegarLoopForPetriNet]: Found error trace [2023-08-26 12:06:18,646 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:06:18,647 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable6 [2023-08-26 12:06:18,647 INFO L420 AbstractCegarLoop]: === Iteration 8 === Targeting ULTIMATE.startErr8ASSERT_VIOLATIONASSERT === [P0Err0ASSERT_VIOLATIONASSERT, ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 12 more)] === [2023-08-26 12:06:18,647 INFO L145 PredicateUnifier]: Initialized classic predicate unifier [2023-08-26 12:06:18,647 INFO L85 PathProgramCache]: Analyzing trace with hash 1906783173, now seen corresponding path program 2 times [2023-08-26 12:06:18,647 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-08-26 12:06:18,648 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1309250133] [2023-08-26 12:06:18,648 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-08-26 12:06:18,648 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-08-26 12:06:18,716 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-08-26 12:06:18,991 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-08-26 12:06:18,992 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-08-26 12:06:18,992 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1309250133] [2023-08-26 12:06:18,992 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1309250133] provided 1 perfect and 0 imperfect interpolant sequences [2023-08-26 12:06:18,992 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-08-26 12:06:18,992 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2023-08-26 12:06:18,992 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2074651454] [2023-08-26 12:06:18,992 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-08-26 12:06:18,993 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2023-08-26 12:06:18,994 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-08-26 12:06:18,994 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2023-08-26 12:06:18,994 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=12, Invalid=18, Unknown=0, NotChecked=0, Total=30 [2023-08-26 12:06:18,995 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 119 out of 281 [2023-08-26 12:06:18,996 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 66 places, 68 transitions, 420 flow. Second operand has 6 states, 6 states have (on average 122.16666666666667) internal successors, (733), 6 states have internal predecessors, (733), 0 states have call successors, (0), 0 states 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:06:18,996 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2023-08-26 12:06:18,996 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 119 of 281 [2023-08-26 12:06:18,996 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2023-08-26 12:06:20,784 INFO L124 PetriNetUnfolderBase]: 10215/15583 cut-off events. [2023-08-26 12:06:20,784 INFO L125 PetriNetUnfolderBase]: For 29756/30018 co-relation queries the response was YES. [2023-08-26 12:06:20,839 INFO L83 FinitePrefix]: Finished finitePrefix Result has 58093 conditions, 15583 events. 10215/15583 cut-off events. For 29756/30018 co-relation queries the response was YES. Maximal size of possible extension queue 808. Compared 105446 event pairs, 699 based on Foata normal form. 361/15717 useless extension candidates. Maximal degree in co-relation 58075. Up to 3992 conditions per place. [2023-08-26 12:06:20,878 INFO L140 encePairwiseOnDemand]: 274/281 looper letters, 176 selfloop transitions, 28 changer transitions 38/251 dead transitions. [2023-08-26 12:06:20,878 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 74 places, 251 transitions, 1931 flow [2023-08-26 12:06:20,886 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2023-08-26 12:06:20,886 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 9 states. [2023-08-26 12:06:20,889 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 9 states to 9 states and 1211 transitions. [2023-08-26 12:06:20,890 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.47884539343614074 [2023-08-26 12:06:20,890 INFO L72 ComplementDD]: Start complementDD. Operand 9 states and 1211 transitions. [2023-08-26 12:06:20,890 INFO L73 IsDeterministic]: Start isDeterministic. Operand 9 states and 1211 transitions. [2023-08-26 12:06:20,891 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2023-08-26 12:06:20,891 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 9 states and 1211 transitions. [2023-08-26 12:06:20,893 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 10 states, 9 states have (on average 134.55555555555554) internal successors, (1211), 9 states have internal predecessors, (1211), 0 states have call successors, (0), 0 states 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:06:20,897 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 10 states, 10 states have (on average 281.0) internal successors, (2810), 10 states have internal predecessors, (2810), 0 states have call successors, (0), 0 states 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:06:20,898 INFO L81 ComplementDD]: Finished complementDD. Result has 10 states, 10 states have (on average 281.0) internal successors, (2810), 10 states have internal predecessors, (2810), 0 states have call successors, (0), 0 states 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:06:20,898 INFO L175 Difference]: Start difference. First operand has 66 places, 68 transitions, 420 flow. Second operand 9 states and 1211 transitions. [2023-08-26 12:06:20,898 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 74 places, 251 transitions, 1931 flow [2023-08-26 12:06:21,888 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 73 places, 251 transitions, 1919 flow, removed 2 selfloop flow, removed 1 redundant places. [2023-08-26 12:06:21,891 INFO L231 Difference]: Finished difference. Result has 76 places, 75 transitions, 588 flow [2023-08-26 12:06:21,891 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=281, PETRI_DIFFERENCE_MINUEND_FLOW=415, PETRI_DIFFERENCE_MINUEND_PLACES=65, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=68, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=23, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=44, PETRI_DIFFERENCE_SUBTRAHEND_STATES=9, PETRI_FLOW=588, PETRI_PLACES=76, PETRI_TRANSITIONS=75} [2023-08-26 12:06:21,892 INFO L281 CegarLoopForPetriNet]: 51 programPoint places, 25 predicate places. [2023-08-26 12:06:21,892 INFO L495 AbstractCegarLoop]: Abstraction has has 76 places, 75 transitions, 588 flow [2023-08-26 12:06:21,893 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 122.16666666666667) internal successors, (733), 6 states have internal predecessors, (733), 0 states have call successors, (0), 0 states 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:06:21,893 INFO L200 CegarLoopForPetriNet]: Found error trace [2023-08-26 12:06:21,893 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-08-26 12:06:21,893 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable7 [2023-08-26 12:06:21,893 INFO L420 AbstractCegarLoop]: === Iteration 9 === Targeting ULTIMATE.startErr8ASSERT_VIOLATIONASSERT === [P0Err0ASSERT_VIOLATIONASSERT, ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 12 more)] === [2023-08-26 12:06:21,893 INFO L145 PredicateUnifier]: Initialized classic predicate unifier [2023-08-26 12:06:21,894 INFO L85 PathProgramCache]: Analyzing trace with hash -496786963, now seen corresponding path program 1 times [2023-08-26 12:06:21,894 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-08-26 12:06:21,894 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [616048875] [2023-08-26 12:06:21,894 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-08-26 12:06:21,894 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-08-26 12:06:21,928 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-08-26 12:06:22,615 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:06:22,615 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-08-26 12:06:22,615 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [616048875] [2023-08-26 12:06:22,616 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [616048875] provided 1 perfect and 0 imperfect interpolant sequences [2023-08-26 12:06:22,616 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-08-26 12:06:22,616 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2023-08-26 12:06:22,616 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [634596526] [2023-08-26 12:06:22,616 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-08-26 12:06:22,616 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2023-08-26 12:06:22,617 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-08-26 12:06:22,617 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2023-08-26 12:06:22,620 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=12, Invalid=30, Unknown=0, NotChecked=0, Total=42 [2023-08-26 12:06:22,621 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 121 out of 281 [2023-08-26 12:06:22,621 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 76 places, 75 transitions, 588 flow. Second operand has 7 states, 7 states have (on average 124.14285714285714) internal successors, (869), 7 states have internal predecessors, (869), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-26 12:06:22,622 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2023-08-26 12:06:22,622 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 121 of 281 [2023-08-26 12:06:22,622 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2023-08-26 12:06:24,441 INFO L124 PetriNetUnfolderBase]: 11134/17207 cut-off events. [2023-08-26 12:06:24,441 INFO L125 PetriNetUnfolderBase]: For 49760/50414 co-relation queries the response was YES. [2023-08-26 12:06:24,576 INFO L83 FinitePrefix]: Finished finitePrefix Result has 71447 conditions, 17207 events. 11134/17207 cut-off events. For 49760/50414 co-relation queries the response was YES. Maximal size of possible extension queue 873. Compared 119991 event pairs, 2727 based on Foata normal form. 363/17462 useless extension candidates. Maximal degree in co-relation 71426. Up to 8783 conditions per place. [2023-08-26 12:06:24,626 INFO L140 encePairwiseOnDemand]: 273/281 looper letters, 131 selfloop transitions, 20 changer transitions 68/228 dead transitions. [2023-08-26 12:06:24,626 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 80 places, 228 transitions, 2352 flow [2023-08-26 12:06:24,627 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2023-08-26 12:06:24,627 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 7 states. [2023-08-26 12:06:24,629 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 7 states to 7 states and 932 transitions. [2023-08-26 12:06:24,629 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.47381799694966953 [2023-08-26 12:06:24,629 INFO L72 ComplementDD]: Start complementDD. Operand 7 states and 932 transitions. [2023-08-26 12:06:24,629 INFO L73 IsDeterministic]: Start isDeterministic. Operand 7 states and 932 transitions. [2023-08-26 12:06:24,630 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2023-08-26 12:06:24,630 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 7 states and 932 transitions. [2023-08-26 12:06:24,632 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 8 states, 7 states have (on average 133.14285714285714) internal successors, (932), 7 states have internal predecessors, (932), 0 states have call successors, (0), 0 states 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:06:24,635 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 8 states, 8 states have (on average 281.0) internal successors, (2248), 8 states have internal predecessors, (2248), 0 states have call successors, (0), 0 states 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:06:24,635 INFO L81 ComplementDD]: Finished complementDD. Result has 8 states, 8 states have (on average 281.0) internal successors, (2248), 8 states have internal predecessors, (2248), 0 states have call successors, (0), 0 states 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:06:24,635 INFO L175 Difference]: Start difference. First operand has 76 places, 75 transitions, 588 flow. Second operand 7 states and 932 transitions. [2023-08-26 12:06:24,636 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 80 places, 228 transitions, 2352 flow [2023-08-26 12:06:26,716 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 76 places, 228 transitions, 1915 flow, removed 154 selfloop flow, removed 4 redundant places. [2023-08-26 12:06:26,718 INFO L231 Difference]: Finished difference. Result has 79 places, 84 transitions, 640 flow [2023-08-26 12:06:26,719 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=281, PETRI_DIFFERENCE_MINUEND_FLOW=491, PETRI_DIFFERENCE_MINUEND_PLACES=70, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=75, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=14, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=58, PETRI_DIFFERENCE_SUBTRAHEND_STATES=7, PETRI_FLOW=640, PETRI_PLACES=79, PETRI_TRANSITIONS=84} [2023-08-26 12:06:26,719 INFO L281 CegarLoopForPetriNet]: 51 programPoint places, 28 predicate places. [2023-08-26 12:06:26,720 INFO L495 AbstractCegarLoop]: Abstraction has has 79 places, 84 transitions, 640 flow [2023-08-26 12:06:26,720 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 7 states, 7 states have (on average 124.14285714285714) internal successors, (869), 7 states have internal predecessors, (869), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-26 12:06:26,720 INFO L200 CegarLoopForPetriNet]: Found error trace [2023-08-26 12:06:26,720 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-08-26 12:06:26,720 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable8 [2023-08-26 12:06:26,720 INFO L420 AbstractCegarLoop]: === Iteration 10 === Targeting ULTIMATE.startErr8ASSERT_VIOLATIONASSERT === [P0Err0ASSERT_VIOLATIONASSERT, ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 12 more)] === [2023-08-26 12:06:26,721 INFO L145 PredicateUnifier]: Initialized classic predicate unifier [2023-08-26 12:06:26,721 INFO L85 PathProgramCache]: Analyzing trace with hash -464620558, now seen corresponding path program 1 times [2023-08-26 12:06:26,721 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-08-26 12:06:26,721 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [843823204] [2023-08-26 12:06:26,721 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-08-26 12:06:26,721 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-08-26 12:06:26,759 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-08-26 12:06:27,367 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:06:27,368 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-08-26 12:06:27,373 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [843823204] [2023-08-26 12:06:27,373 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [843823204] provided 1 perfect and 0 imperfect interpolant sequences [2023-08-26 12:06:27,373 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-08-26 12:06:27,373 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2023-08-26 12:06:27,373 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [814806558] [2023-08-26 12:06:27,373 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-08-26 12:06:27,374 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2023-08-26 12:06:27,374 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-08-26 12:06:27,375 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2023-08-26 12:06:27,375 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=12, Invalid=30, Unknown=0, NotChecked=0, Total=42 [2023-08-26 12:06:27,376 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 119 out of 281 [2023-08-26 12:06:27,377 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 79 places, 84 transitions, 640 flow. Second operand has 7 states, 7 states have (on average 122.14285714285714) internal successors, (855), 7 states have internal predecessors, (855), 0 states have call successors, (0), 0 states 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:06:27,377 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2023-08-26 12:06:27,377 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 119 of 281 [2023-08-26 12:06:27,377 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2023-08-26 12:06:29,544 INFO L124 PetriNetUnfolderBase]: 12561/19548 cut-off events. [2023-08-26 12:06:29,544 INFO L125 PetriNetUnfolderBase]: For 53976/54805 co-relation queries the response was YES. [2023-08-26 12:06:29,710 INFO L83 FinitePrefix]: Finished finitePrefix Result has 81616 conditions, 19548 events. 12561/19548 cut-off events. For 53976/54805 co-relation queries the response was YES. Maximal size of possible extension queue 1022. Compared 140630 event pairs, 2259 based on Foata normal form. 542/19980 useless extension candidates. Maximal degree in co-relation 81591. Up to 7004 conditions per place. [2023-08-26 12:06:29,759 INFO L140 encePairwiseOnDemand]: 274/281 looper letters, 146 selfloop transitions, 12 changer transitions 82/249 dead transitions. [2023-08-26 12:06:29,759 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 83 places, 249 transitions, 2243 flow [2023-08-26 12:06:29,760 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2023-08-26 12:06:29,760 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 7 states. [2023-08-26 12:06:29,762 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 7 states to 7 states and 919 transitions. [2023-08-26 12:06:29,762 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.4672089476359939 [2023-08-26 12:06:29,762 INFO L72 ComplementDD]: Start complementDD. Operand 7 states and 919 transitions. [2023-08-26 12:06:29,763 INFO L73 IsDeterministic]: Start isDeterministic. Operand 7 states and 919 transitions. [2023-08-26 12:06:29,763 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2023-08-26 12:06:29,763 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 7 states and 919 transitions. [2023-08-26 12:06:29,765 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 8 states, 7 states have (on average 131.28571428571428) internal successors, (919), 7 states have internal predecessors, (919), 0 states have call successors, (0), 0 states 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:06:29,768 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 8 states, 8 states have (on average 281.0) internal successors, (2248), 8 states have internal predecessors, (2248), 0 states have call successors, (0), 0 states 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:06:29,769 INFO L81 ComplementDD]: Finished complementDD. Result has 8 states, 8 states have (on average 281.0) internal successors, (2248), 8 states have internal predecessors, (2248), 0 states have call successors, (0), 0 states 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:06:29,769 INFO L175 Difference]: Start difference. First operand has 79 places, 84 transitions, 640 flow. Second operand 7 states and 919 transitions. [2023-08-26 12:06:29,769 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 83 places, 249 transitions, 2243 flow [2023-08-26 12:06:31,568 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 81 places, 249 transitions, 2224 flow, removed 9 selfloop flow, removed 2 redundant places. [2023-08-26 12:06:31,571 INFO L231 Difference]: Finished difference. Result has 84 places, 89 transitions, 728 flow [2023-08-26 12:06:31,571 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=281, PETRI_DIFFERENCE_MINUEND_FLOW=631, PETRI_DIFFERENCE_MINUEND_PLACES=75, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=84, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=9, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=74, PETRI_DIFFERENCE_SUBTRAHEND_STATES=7, PETRI_FLOW=728, PETRI_PLACES=84, PETRI_TRANSITIONS=89} [2023-08-26 12:06:31,571 INFO L281 CegarLoopForPetriNet]: 51 programPoint places, 33 predicate places. [2023-08-26 12:06:31,572 INFO L495 AbstractCegarLoop]: Abstraction has has 84 places, 89 transitions, 728 flow [2023-08-26 12:06:31,572 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 7 states, 7 states have (on average 122.14285714285714) internal successors, (855), 7 states have internal predecessors, (855), 0 states have call successors, (0), 0 states 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:06:31,572 INFO L200 CegarLoopForPetriNet]: Found error trace [2023-08-26 12:06:31,572 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-08-26 12:06:31,572 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable9 [2023-08-26 12:06:31,573 INFO L420 AbstractCegarLoop]: === Iteration 11 === Targeting ULTIMATE.startErr8ASSERT_VIOLATIONASSERT === [P0Err0ASSERT_VIOLATIONASSERT, ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 12 more)] === [2023-08-26 12:06:31,573 INFO L145 PredicateUnifier]: Initialized classic predicate unifier [2023-08-26 12:06:31,573 INFO L85 PathProgramCache]: Analyzing trace with hash -298062755, now seen corresponding path program 2 times [2023-08-26 12:06:31,573 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-08-26 12:06:31,573 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1621507613] [2023-08-26 12:06:31,573 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-08-26 12:06:31,574 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-08-26 12:06:31,598 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-08-26 12:06:31,826 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:06:31,826 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-08-26 12:06:31,826 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1621507613] [2023-08-26 12:06:31,826 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1621507613] provided 1 perfect and 0 imperfect interpolant sequences [2023-08-26 12:06:31,826 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-08-26 12:06:31,826 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2023-08-26 12:06:31,826 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [543327280] [2023-08-26 12:06:31,827 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-08-26 12:06:31,827 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2023-08-26 12:06:31,827 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-08-26 12:06:31,827 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2023-08-26 12:06:31,828 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=8, Invalid=12, Unknown=0, NotChecked=0, Total=20 [2023-08-26 12:06:31,828 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 116 out of 281 [2023-08-26 12:06:31,829 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 84 places, 89 transitions, 728 flow. Second operand has 5 states, 5 states have (on average 120.8) internal successors, (604), 5 states have internal predecessors, (604), 0 states have call successors, (0), 0 states 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:06:31,829 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2023-08-26 12:06:31,829 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 116 of 281 [2023-08-26 12:06:31,829 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2023-08-26 12:06:35,451 INFO L124 PetriNetUnfolderBase]: 21686/32182 cut-off events. [2023-08-26 12:06:35,451 INFO L125 PetriNetUnfolderBase]: For 106332/106332 co-relation queries the response was YES. [2023-08-26 12:06:35,677 INFO L83 FinitePrefix]: Finished finitePrefix Result has 141721 conditions, 32182 events. 21686/32182 cut-off events. For 106332/106332 co-relation queries the response was YES. Maximal size of possible extension queue 1321. Compared 219716 event pairs, 2466 based on Foata normal form. 16/32198 useless extension candidates. Maximal degree in co-relation 141694. Up to 14394 conditions per place. [2023-08-26 12:06:35,719 INFO L140 encePairwiseOnDemand]: 272/281 looper letters, 162 selfloop transitions, 21 changer transitions 140/323 dead transitions. [2023-08-26 12:06:35,719 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 87 places, 323 transitions, 3217 flow [2023-08-26 12:06:35,719 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2023-08-26 12:06:35,719 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 6 states. [2023-08-26 12:06:35,720 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6 states to 6 states and 809 transitions. [2023-08-26 12:06:35,721 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.47983392645314354 [2023-08-26 12:06:35,721 INFO L72 ComplementDD]: Start complementDD. Operand 6 states and 809 transitions. [2023-08-26 12:06:35,721 INFO L73 IsDeterministic]: Start isDeterministic. Operand 6 states and 809 transitions. [2023-08-26 12:06:35,722 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2023-08-26 12:06:35,722 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 6 states and 809 transitions. [2023-08-26 12:06:35,723 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 7 states, 6 states have (on average 134.83333333333334) internal successors, (809), 6 states have internal predecessors, (809), 0 states have call successors, (0), 0 states 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:06:35,726 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 7 states, 7 states have (on average 281.0) internal successors, (1967), 7 states have internal predecessors, (1967), 0 states have call successors, (0), 0 states 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:06:35,726 INFO L81 ComplementDD]: Finished complementDD. Result has 7 states, 7 states have (on average 281.0) internal successors, (1967), 7 states have internal predecessors, (1967), 0 states have call successors, (0), 0 states 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:06:35,727 INFO L175 Difference]: Start difference. First operand has 84 places, 89 transitions, 728 flow. Second operand 6 states and 809 transitions. [2023-08-26 12:06:35,727 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 87 places, 323 transitions, 3217 flow [2023-08-26 12:06:38,121 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 84 places, 323 transitions, 3185 flow, removed 5 selfloop flow, removed 3 redundant places. [2023-08-26 12:06:38,123 INFO L231 Difference]: Finished difference. Result has 86 places, 82 transitions, 729 flow [2023-08-26 12:06:38,123 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=281, PETRI_DIFFERENCE_MINUEND_FLOW=718, PETRI_DIFFERENCE_MINUEND_PLACES=79, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=89, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=13, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=75, PETRI_DIFFERENCE_SUBTRAHEND_STATES=6, PETRI_FLOW=729, PETRI_PLACES=86, PETRI_TRANSITIONS=82} [2023-08-26 12:06:38,124 INFO L281 CegarLoopForPetriNet]: 51 programPoint places, 35 predicate places. [2023-08-26 12:06:38,124 INFO L495 AbstractCegarLoop]: Abstraction has has 86 places, 82 transitions, 729 flow [2023-08-26 12:06:38,124 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 120.8) internal successors, (604), 5 states have internal predecessors, (604), 0 states have call successors, (0), 0 states 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:06:38,124 INFO L200 CegarLoopForPetriNet]: Found error trace [2023-08-26 12:06:38,124 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-08-26 12:06:38,125 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable10 [2023-08-26 12:06:38,125 INFO L420 AbstractCegarLoop]: === Iteration 12 === Targeting ULTIMATE.startErr8ASSERT_VIOLATIONASSERT === [P0Err0ASSERT_VIOLATIONASSERT, ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 12 more)] === [2023-08-26 12:06:38,125 INFO L145 PredicateUnifier]: Initialized classic predicate unifier [2023-08-26 12:06:38,125 INFO L85 PathProgramCache]: Analyzing trace with hash 749300179, now seen corresponding path program 3 times [2023-08-26 12:06:38,125 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-08-26 12:06:38,125 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [894155023] [2023-08-26 12:06:38,125 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-08-26 12:06:38,125 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-08-26 12:06:38,178 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-08-26 12:06:38,359 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:06:38,359 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-08-26 12:06:38,359 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [894155023] [2023-08-26 12:06:38,359 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [894155023] provided 1 perfect and 0 imperfect interpolant sequences [2023-08-26 12:06:38,359 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-08-26 12:06:38,359 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2023-08-26 12:06:38,360 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1529545701] [2023-08-26 12:06:38,360 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-08-26 12:06:38,360 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2023-08-26 12:06:38,360 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-08-26 12:06:38,361 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2023-08-26 12:06:38,361 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=17, Invalid=25, Unknown=0, NotChecked=0, Total=42 [2023-08-26 12:06:38,361 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 119 out of 281 [2023-08-26 12:06:38,362 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 86 places, 82 transitions, 729 flow. Second operand has 7 states, 7 states have (on average 122.14285714285714) internal successors, (855), 7 states have internal predecessors, (855), 0 states have call successors, (0), 0 states 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:06:38,362 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2023-08-26 12:06:38,362 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 119 of 281 [2023-08-26 12:06:38,362 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2023-08-26 12:06:39,424 INFO L124 PetriNetUnfolderBase]: 5451/8701 cut-off events. [2023-08-26 12:06:39,424 INFO L125 PetriNetUnfolderBase]: For 31464/31616 co-relation queries the response was YES. [2023-08-26 12:06:39,470 INFO L83 FinitePrefix]: Finished finitePrefix Result has 37447 conditions, 8701 events. 5451/8701 cut-off events. For 31464/31616 co-relation queries the response was YES. Maximal size of possible extension queue 490. Compared 57872 event pairs, 800 based on Foata normal form. 135/8698 useless extension candidates. Maximal degree in co-relation 37420. Up to 3546 conditions per place. [2023-08-26 12:06:39,486 INFO L140 encePairwiseOnDemand]: 274/281 looper letters, 141 selfloop transitions, 18 changer transitions 42/212 dead transitions. [2023-08-26 12:06:39,486 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 87 places, 212 transitions, 2098 flow [2023-08-26 12:06:39,487 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2023-08-26 12:06:39,487 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 8 states. [2023-08-26 12:06:39,488 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 8 states to 8 states and 1048 transitions. [2023-08-26 12:06:39,489 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.46619217081850534 [2023-08-26 12:06:39,489 INFO L72 ComplementDD]: Start complementDD. Operand 8 states and 1048 transitions. [2023-08-26 12:06:39,489 INFO L73 IsDeterministic]: Start isDeterministic. Operand 8 states and 1048 transitions. [2023-08-26 12:06:39,490 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2023-08-26 12:06:39,490 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 8 states and 1048 transitions. [2023-08-26 12:06:39,492 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 9 states, 8 states have (on average 131.0) internal successors, (1048), 8 states have internal predecessors, (1048), 0 states have call successors, (0), 0 states 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:06:39,495 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 9 states, 9 states have (on average 281.0) internal successors, (2529), 9 states have internal predecessors, (2529), 0 states have call successors, (0), 0 states 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:06:39,495 INFO L81 ComplementDD]: Finished complementDD. Result has 9 states, 9 states have (on average 281.0) internal successors, (2529), 9 states have internal predecessors, (2529), 0 states have call successors, (0), 0 states 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:06:39,495 INFO L175 Difference]: Start difference. First operand has 86 places, 82 transitions, 729 flow. Second operand 8 states and 1048 transitions. [2023-08-26 12:06:39,495 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 87 places, 212 transitions, 2098 flow [2023-08-26 12:06:39,831 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 81 places, 212 transitions, 2010 flow, removed 37 selfloop flow, removed 6 redundant places. [2023-08-26 12:06:39,832 INFO L231 Difference]: Finished difference. Result has 84 places, 76 transitions, 631 flow [2023-08-26 12:06:39,833 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=281, PETRI_DIFFERENCE_MINUEND_FLOW=604, PETRI_DIFFERENCE_MINUEND_PLACES=74, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=79, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=17, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=61, PETRI_DIFFERENCE_SUBTRAHEND_STATES=8, PETRI_FLOW=631, PETRI_PLACES=84, PETRI_TRANSITIONS=76} [2023-08-26 12:06:39,833 INFO L281 CegarLoopForPetriNet]: 51 programPoint places, 33 predicate places. [2023-08-26 12:06:39,834 INFO L495 AbstractCegarLoop]: Abstraction has has 84 places, 76 transitions, 631 flow [2023-08-26 12:06:39,834 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 7 states, 7 states have (on average 122.14285714285714) internal successors, (855), 7 states have internal predecessors, (855), 0 states have call successors, (0), 0 states 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:06:39,834 INFO L200 CegarLoopForPetriNet]: Found error trace [2023-08-26 12:06:39,834 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-08-26 12:06:39,834 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable11 [2023-08-26 12:06:39,835 INFO L420 AbstractCegarLoop]: === Iteration 13 === Targeting ULTIMATE.startErr8ASSERT_VIOLATIONASSERT === [P0Err0ASSERT_VIOLATIONASSERT, ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 12 more)] === [2023-08-26 12:06:39,836 INFO L145 PredicateUnifier]: Initialized classic predicate unifier [2023-08-26 12:06:39,836 INFO L85 PathProgramCache]: Analyzing trace with hash 2130327580, now seen corresponding path program 1 times [2023-08-26 12:06:39,836 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-08-26 12:06:39,836 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [142661600] [2023-08-26 12:06:39,836 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-08-26 12:06:39,836 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-08-26 12:06:39,867 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-08-26 12:06:40,040 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:06:40,040 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-08-26 12:06:40,040 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [142661600] [2023-08-26 12:06:40,041 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [142661600] provided 1 perfect and 0 imperfect interpolant sequences [2023-08-26 12:06:40,041 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-08-26 12:06:40,041 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2023-08-26 12:06:40,041 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1275894707] [2023-08-26 12:06:40,041 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-08-26 12:06:40,041 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2023-08-26 12:06:40,041 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-08-26 12:06:40,042 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2023-08-26 12:06:40,042 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2023-08-26 12:06:40,042 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 118 out of 281 [2023-08-26 12:06:40,043 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 84 places, 76 transitions, 631 flow. Second operand has 4 states, 4 states have (on average 125.0) internal successors, (500), 4 states have internal predecessors, (500), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-26 12:06:40,043 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2023-08-26 12:06:40,043 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 118 of 281 [2023-08-26 12:06:40,043 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2023-08-26 12:06:40,863 INFO L124 PetriNetUnfolderBase]: 5053/7846 cut-off events. [2023-08-26 12:06:40,863 INFO L125 PetriNetUnfolderBase]: For 29333/29333 co-relation queries the response was YES. [2023-08-26 12:06:40,899 INFO L83 FinitePrefix]: Finished finitePrefix Result has 36430 conditions, 7846 events. 5053/7846 cut-off events. For 29333/29333 co-relation queries the response was YES. Maximal size of possible extension queue 339. Compared 45514 event pairs, 1196 based on Foata normal form. 1/7847 useless extension candidates. Maximal degree in co-relation 36405. Up to 4534 conditions per place. [2023-08-26 12:06:40,916 INFO L140 encePairwiseOnDemand]: 275/281 looper letters, 92 selfloop transitions, 8 changer transitions 38/138 dead transitions. [2023-08-26 12:06:40,916 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 85 places, 138 transitions, 1368 flow [2023-08-26 12:06:40,916 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2023-08-26 12:06:40,917 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 4 states. [2023-08-26 12:06:40,918 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 533 transitions. [2023-08-26 12:06:40,918 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.47419928825622776 [2023-08-26 12:06:40,918 INFO L72 ComplementDD]: Start complementDD. Operand 4 states and 533 transitions. [2023-08-26 12:06:40,918 INFO L73 IsDeterministic]: Start isDeterministic. Operand 4 states and 533 transitions. [2023-08-26 12:06:40,918 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2023-08-26 12:06:40,918 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 4 states and 533 transitions. [2023-08-26 12:06:40,919 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 5 states, 4 states have (on average 133.25) internal successors, (533), 4 states have internal predecessors, (533), 0 states have call successors, (0), 0 states 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:06:40,921 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 5 states, 5 states have (on average 281.0) internal successors, (1405), 5 states have internal predecessors, (1405), 0 states have call successors, (0), 0 states 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:06:40,921 INFO L81 ComplementDD]: Finished complementDD. Result has 5 states, 5 states have (on average 281.0) internal successors, (1405), 5 states have internal predecessors, (1405), 0 states have call successors, (0), 0 states 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:06:40,922 INFO L175 Difference]: Start difference. First operand has 84 places, 76 transitions, 631 flow. Second operand 4 states and 533 transitions. [2023-08-26 12:06:40,922 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 85 places, 138 transitions, 1368 flow [2023-08-26 12:06:41,055 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 77 places, 138 transitions, 1231 flow, removed 39 selfloop flow, removed 8 redundant places. [2023-08-26 12:06:41,057 INFO L231 Difference]: Finished difference. Result has 79 places, 65 transitions, 452 flow [2023-08-26 12:06:41,057 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=281, PETRI_DIFFERENCE_MINUEND_FLOW=560, PETRI_DIFFERENCE_MINUEND_PLACES=74, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=76, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=7, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=68, PETRI_DIFFERENCE_SUBTRAHEND_STATES=4, PETRI_FLOW=452, PETRI_PLACES=79, PETRI_TRANSITIONS=65} [2023-08-26 12:06:41,058 INFO L281 CegarLoopForPetriNet]: 51 programPoint places, 28 predicate places. [2023-08-26 12:06:41,058 INFO L495 AbstractCegarLoop]: Abstraction has has 79 places, 65 transitions, 452 flow [2023-08-26 12:06:41,058 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 125.0) internal successors, (500), 4 states have internal predecessors, (500), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-26 12:06:41,058 INFO L200 CegarLoopForPetriNet]: Found error trace [2023-08-26 12:06:41,058 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-08-26 12:06:41,058 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable12 [2023-08-26 12:06:41,058 INFO L420 AbstractCegarLoop]: === Iteration 14 === Targeting ULTIMATE.startErr8ASSERT_VIOLATIONASSERT === [P0Err0ASSERT_VIOLATIONASSERT, ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 12 more)] === [2023-08-26 12:06:41,059 INFO L145 PredicateUnifier]: Initialized classic predicate unifier [2023-08-26 12:06:41,059 INFO L85 PathProgramCache]: Analyzing trace with hash 225847890, now seen corresponding path program 2 times [2023-08-26 12:06:41,059 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-08-26 12:06:41,059 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1027041594] [2023-08-26 12:06:41,059 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-08-26 12:06:41,059 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-08-26 12:06:41,098 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-08-26 12:06:41,264 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:06:41,264 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-08-26 12:06:41,264 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1027041594] [2023-08-26 12:06:41,264 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1027041594] provided 1 perfect and 0 imperfect interpolant sequences [2023-08-26 12:06:41,265 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-08-26 12:06:41,265 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2023-08-26 12:06:41,265 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1502067770] [2023-08-26 12:06:41,265 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-08-26 12:06:41,265 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2023-08-26 12:06:41,265 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-08-26 12:06:41,266 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2023-08-26 12:06:41,266 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2023-08-26 12:06:41,266 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 124 out of 281 [2023-08-26 12:06:41,267 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 79 places, 65 transitions, 452 flow. Second operand has 4 states, 4 states have (on average 130.5) internal successors, (522), 4 states have internal predecessors, (522), 0 states have call successors, (0), 0 states 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:06:41,267 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2023-08-26 12:06:41,267 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 124 of 281 [2023-08-26 12:06:41,267 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2023-08-26 12:06:41,769 INFO L124 PetriNetUnfolderBase]: 2535/3976 cut-off events. [2023-08-26 12:06:41,769 INFO L125 PetriNetUnfolderBase]: For 11675/11682 co-relation queries the response was YES. [2023-08-26 12:06:41,780 INFO L83 FinitePrefix]: Finished finitePrefix Result has 17025 conditions, 3976 events. 2535/3976 cut-off events. For 11675/11682 co-relation queries the response was YES. Maximal size of possible extension queue 169. Compared 20730 event pairs, 512 based on Foata normal form. 7/3979 useless extension candidates. Maximal degree in co-relation 17002. Up to 1888 conditions per place. [2023-08-26 12:06:41,786 INFO L140 encePairwiseOnDemand]: 278/281 looper letters, 59 selfloop transitions, 1 changer transitions 60/122 dead transitions. [2023-08-26 12:06:41,787 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 80 places, 122 transitions, 1073 flow [2023-08-26 12:06:41,789 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2023-08-26 12:06:41,789 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 4 states. [2023-08-26 12:06:41,790 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 548 transitions. [2023-08-26 12:06:41,790 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.4875444839857651 [2023-08-26 12:06:41,790 INFO L72 ComplementDD]: Start complementDD. Operand 4 states and 548 transitions. [2023-08-26 12:06:41,790 INFO L73 IsDeterministic]: Start isDeterministic. Operand 4 states and 548 transitions. [2023-08-26 12:06:41,791 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2023-08-26 12:06:41,791 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 4 states and 548 transitions. [2023-08-26 12:06:41,792 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 5 states, 4 states have (on average 137.0) internal successors, (548), 4 states have internal predecessors, (548), 0 states have call successors, (0), 0 states 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:06:41,793 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 5 states, 5 states have (on average 281.0) internal successors, (1405), 5 states have internal predecessors, (1405), 0 states have call successors, (0), 0 states 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:06:41,794 INFO L81 ComplementDD]: Finished complementDD. Result has 5 states, 5 states have (on average 281.0) internal successors, (1405), 5 states have internal predecessors, (1405), 0 states have call successors, (0), 0 states 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:06:41,794 INFO L175 Difference]: Start difference. First operand has 79 places, 65 transitions, 452 flow. Second operand 4 states and 548 transitions. [2023-08-26 12:06:41,794 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 80 places, 122 transitions, 1073 flow [2023-08-26 12:06:41,841 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 74 places, 122 transitions, 1013 flow, removed 16 selfloop flow, removed 6 redundant places. [2023-08-26 12:06:41,843 INFO L231 Difference]: Finished difference. Result has 76 places, 52 transitions, 329 flow [2023-08-26 12:06:41,843 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=281, PETRI_DIFFERENCE_MINUEND_FLOW=410, PETRI_DIFFERENCE_MINUEND_PLACES=71, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=65, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=1, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=64, PETRI_DIFFERENCE_SUBTRAHEND_STATES=4, PETRI_FLOW=329, PETRI_PLACES=76, PETRI_TRANSITIONS=52} [2023-08-26 12:06:41,844 INFO L281 CegarLoopForPetriNet]: 51 programPoint places, 25 predicate places. [2023-08-26 12:06:41,844 INFO L495 AbstractCegarLoop]: Abstraction has has 76 places, 52 transitions, 329 flow [2023-08-26 12:06:41,844 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 130.5) internal successors, (522), 4 states have internal predecessors, (522), 0 states have call successors, (0), 0 states 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:06:41,844 INFO L200 CegarLoopForPetriNet]: Found error trace [2023-08-26 12:06:41,844 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-08-26 12:06:41,845 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable13 [2023-08-26 12:06:41,845 INFO L420 AbstractCegarLoop]: === Iteration 15 === Targeting ULTIMATE.startErr8ASSERT_VIOLATIONASSERT === [P0Err0ASSERT_VIOLATIONASSERT, ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 12 more)] === [2023-08-26 12:06:41,845 INFO L145 PredicateUnifier]: Initialized classic predicate unifier [2023-08-26 12:06:41,845 INFO L85 PathProgramCache]: Analyzing trace with hash -1988192394, now seen corresponding path program 3 times [2023-08-26 12:06:41,845 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-08-26 12:06:41,845 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [236135157] [2023-08-26 12:06:41,845 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-08-26 12:06:41,845 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-08-26 12:06:41,873 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-08-26 12:06:42,692 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:06:42,692 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-08-26 12:06:42,692 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [236135157] [2023-08-26 12:06:42,692 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [236135157] provided 1 perfect and 0 imperfect interpolant sequences [2023-08-26 12:06:42,692 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-08-26 12:06:42,692 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2023-08-26 12:06:42,693 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [56874371] [2023-08-26 12:06:42,693 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-08-26 12:06:42,694 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 8 states [2023-08-26 12:06:42,695 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-08-26 12:06:42,695 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2023-08-26 12:06:42,695 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=16, Invalid=40, Unknown=0, NotChecked=0, Total=56 [2023-08-26 12:06:42,696 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 117 out of 281 [2023-08-26 12:06:42,697 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 76 places, 52 transitions, 329 flow. Second operand has 8 states, 8 states have (on average 120.125) internal successors, (961), 8 states have internal predecessors, (961), 0 states have call successors, (0), 0 states 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:06:42,697 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2023-08-26 12:06:42,697 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 117 of 281 [2023-08-26 12:06:42,697 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2023-08-26 12:06:43,028 INFO L124 PetriNetUnfolderBase]: 650/1074 cut-off events. [2023-08-26 12:06:43,028 INFO L125 PetriNetUnfolderBase]: For 2824/2867 co-relation queries the response was YES. [2023-08-26 12:06:43,033 INFO L83 FinitePrefix]: Finished finitePrefix Result has 4419 conditions, 1074 events. 650/1074 cut-off events. For 2824/2867 co-relation queries the response was YES. Maximal size of possible extension queue 41. Compared 4382 event pairs, 124 based on Foata normal form. 32/1102 useless extension candidates. Maximal degree in co-relation 4397. Up to 717 conditions per place. [2023-08-26 12:06:43,035 INFO L140 encePairwiseOnDemand]: 275/281 looper letters, 56 selfloop transitions, 5 changer transitions 36/100 dead transitions. [2023-08-26 12:06:43,035 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 81 places, 100 transitions, 773 flow [2023-08-26 12:06:43,036 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2023-08-26 12:06:43,036 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 7 states. [2023-08-26 12:06:43,037 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 7 states to 7 states and 876 transitions. [2023-08-26 12:06:43,038 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.44534824605998985 [2023-08-26 12:06:43,038 INFO L72 ComplementDD]: Start complementDD. Operand 7 states and 876 transitions. [2023-08-26 12:06:43,038 INFO L73 IsDeterministic]: Start isDeterministic. Operand 7 states and 876 transitions. [2023-08-26 12:06:43,038 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2023-08-26 12:06:43,038 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 7 states and 876 transitions. [2023-08-26 12:06:43,040 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 8 states, 7 states have (on average 125.14285714285714) internal successors, (876), 7 states have internal predecessors, (876), 0 states have call successors, (0), 0 states 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:06:43,042 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 8 states, 8 states have (on average 281.0) internal successors, (2248), 8 states have internal predecessors, (2248), 0 states have call successors, (0), 0 states 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:06:43,042 INFO L81 ComplementDD]: Finished complementDD. Result has 8 states, 8 states have (on average 281.0) internal successors, (2248), 8 states have internal predecessors, (2248), 0 states have call successors, (0), 0 states 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:06:43,042 INFO L175 Difference]: Start difference. First operand has 76 places, 52 transitions, 329 flow. Second operand 7 states and 876 transitions. [2023-08-26 12:06:43,043 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 81 places, 100 transitions, 773 flow [2023-08-26 12:06:43,051 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 72 places, 100 transitions, 728 flow, removed 9 selfloop flow, removed 9 redundant places. [2023-08-26 12:06:43,053 INFO L231 Difference]: Finished difference. Result has 74 places, 47 transitions, 273 flow [2023-08-26 12:06:43,053 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=281, PETRI_DIFFERENCE_MINUEND_FLOW=297, PETRI_DIFFERENCE_MINUEND_PLACES=66, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=52, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=5, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=47, PETRI_DIFFERENCE_SUBTRAHEND_STATES=7, PETRI_FLOW=273, PETRI_PLACES=74, PETRI_TRANSITIONS=47} [2023-08-26 12:06:43,054 INFO L281 CegarLoopForPetriNet]: 51 programPoint places, 23 predicate places. [2023-08-26 12:06:43,054 INFO L495 AbstractCegarLoop]: Abstraction has has 74 places, 47 transitions, 273 flow [2023-08-26 12:06:43,055 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 8 states, 8 states have (on average 120.125) internal successors, (961), 8 states have internal predecessors, (961), 0 states have call successors, (0), 0 states 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:06:43,055 INFO L200 CegarLoopForPetriNet]: Found error trace [2023-08-26 12:06:43,055 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-08-26 12:06:43,055 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable14 [2023-08-26 12:06:43,055 INFO L420 AbstractCegarLoop]: === Iteration 16 === Targeting ULTIMATE.startErr8ASSERT_VIOLATIONASSERT === [P0Err0ASSERT_VIOLATIONASSERT, ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 12 more)] === [2023-08-26 12:06:43,055 INFO L145 PredicateUnifier]: Initialized classic predicate unifier [2023-08-26 12:06:43,055 INFO L85 PathProgramCache]: Analyzing trace with hash 593971712, now seen corresponding path program 4 times [2023-08-26 12:06:43,056 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-08-26 12:06:43,056 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1089322973] [2023-08-26 12:06:43,056 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-08-26 12:06:43,056 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-08-26 12:06:43,103 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2023-08-26 12:06:43,103 INFO L356 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2023-08-26 12:06:43,184 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2023-08-26 12:06:43,232 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2023-08-26 12:06:43,233 INFO L360 BasicCegarLoop]: Counterexample is feasible [2023-08-26 12:06:43,235 INFO L805 garLoopResultBuilder]: Registering result UNSAFE for location ULTIMATE.startErr8ASSERT_VIOLATIONASSERT (14 of 15 remaining) [2023-08-26 12:06:43,237 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location P0Err0ASSERT_VIOLATIONASSERT (13 of 15 remaining) [2023-08-26 12:06:43,237 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE (12 of 15 remaining) [2023-08-26 12:06:43,237 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE (11 of 15 remaining) [2023-08-26 12:06:43,238 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (10 of 15 remaining) [2023-08-26 12:06:43,238 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr3REQUIRES_VIOLATIONMEMORY_DEREFERENCE (9 of 15 remaining) [2023-08-26 12:06:43,239 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr4REQUIRES_VIOLATIONMEMORY_DEREFERENCE (8 of 15 remaining) [2023-08-26 12:06:43,239 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr5REQUIRES_VIOLATIONMEMORY_DEREFERENCE (7 of 15 remaining) [2023-08-26 12:06:43,239 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr6REQUIRES_VIOLATIONMEMORY_DEREFERENCE (6 of 15 remaining) [2023-08-26 12:06:43,239 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr7REQUIRES_VIOLATIONMEMORY_DEREFERENCE (5 of 15 remaining) [2023-08-26 12:06:43,239 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (4 of 15 remaining) [2023-08-26 12:06:43,239 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (3 of 15 remaining) [2023-08-26 12:06:43,239 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr2INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (2 of 15 remaining) [2023-08-26 12:06:43,239 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr3INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (1 of 15 remaining) [2023-08-26 12:06:43,239 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location P0Err0ASSERT_VIOLATIONASSERT (0 of 15 remaining) [2023-08-26 12:06:43,239 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable15 [2023-08-26 12:06:43,240 INFO L445 BasicCegarLoop]: Path program histogram: [4, 3, 2, 1, 1, 1, 1, 1, 1, 1] [2023-08-26 12:06:43,245 INFO L228 ceAbstractionStarter]: Analysis of concurrent program completed with 1 thread instances [2023-08-26 12:06:43,246 INFO L178 ceAbstractionStarter]: Computing trace abstraction results [2023-08-26 12:06:43,346 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 26.08 12:06:43 BasicIcfg [2023-08-26 12:06:43,346 INFO L131 PluginConnector]: ------------------------ END TraceAbstraction---------------------------- [2023-08-26 12:06:43,347 INFO L158 Benchmark]: Toolchain (without parser) took 44999.36ms. Allocated memory was 371.2MB in the beginning and 5.5GB in the end (delta: 5.1GB). Free memory was 346.4MB in the beginning and 4.8GB in the end (delta: -4.4GB). Peak memory consumption was 705.5MB. Max. memory is 16.0GB. [2023-08-26 12:06:43,347 INFO L158 Benchmark]: CDTParser took 0.12ms. Allocated memory is still 371.2MB. Free memory was 348.6MB in the beginning and 348.6MB in the end (delta: 17.0kB). There was no memory consumed. Max. memory is 16.0GB. [2023-08-26 12:06:43,347 INFO L158 Benchmark]: CACSL2BoogieTranslator took 589.69ms. Allocated memory is still 371.2MB. Free memory was 345.7MB in the beginning and 322.0MB in the end (delta: 23.7MB). Peak memory consumption was 23.1MB. Max. memory is 16.0GB. [2023-08-26 12:06:43,347 INFO L158 Benchmark]: Boogie Procedure Inliner took 43.17ms. Allocated memory is still 371.2MB. Free memory was 322.0MB in the beginning and 319.2MB in the end (delta: 2.8MB). Peak memory consumption was 4.2MB. Max. memory is 16.0GB. [2023-08-26 12:06:43,348 INFO L158 Benchmark]: Boogie Preprocessor took 45.28ms. Allocated memory is still 371.2MB. Free memory was 319.2MB in the beginning and 317.1MB in the end (delta: 2.1MB). Peak memory consumption was 2.1MB. Max. memory is 16.0GB. [2023-08-26 12:06:43,348 INFO L158 Benchmark]: RCFGBuilder took 741.66ms. Allocated memory is still 371.2MB. Free memory was 317.1MB in the beginning and 275.1MB in the end (delta: 41.9MB). Peak memory consumption was 41.9MB. Max. memory is 16.0GB. [2023-08-26 12:06:43,348 INFO L158 Benchmark]: TraceAbstraction took 43574.62ms. Allocated memory was 371.2MB in the beginning and 5.5GB in the end (delta: 5.1GB). Free memory was 274.4MB in the beginning and 4.8GB in the end (delta: -4.5GB). Peak memory consumption was 634.2MB. Max. memory is 16.0GB. [2023-08-26 12:06:43,349 INFO L338 ainManager$Toolchain]: ####################### End [Toolchain 1] ####################### --- Results --- * Results from de.uni_freiburg.informatik.ultimate.core: - StatisticsResult: Toolchain Benchmarks Benchmark results are: * CDTParser took 0.12ms. Allocated memory is still 371.2MB. Free memory was 348.6MB in the beginning and 348.6MB in the end (delta: 17.0kB). There was no memory consumed. Max. memory is 16.0GB. * CACSL2BoogieTranslator took 589.69ms. Allocated memory is still 371.2MB. Free memory was 345.7MB in the beginning and 322.0MB in the end (delta: 23.7MB). Peak memory consumption was 23.1MB. Max. memory is 16.0GB. * Boogie Procedure Inliner took 43.17ms. Allocated memory is still 371.2MB. Free memory was 322.0MB in the beginning and 319.2MB in the end (delta: 2.8MB). Peak memory consumption was 4.2MB. Max. memory is 16.0GB. * Boogie Preprocessor took 45.28ms. Allocated memory is still 371.2MB. Free memory was 319.2MB in the beginning and 317.1MB in the end (delta: 2.1MB). Peak memory consumption was 2.1MB. Max. memory is 16.0GB. * RCFGBuilder took 741.66ms. Allocated memory is still 371.2MB. Free memory was 317.1MB in the beginning and 275.1MB in the end (delta: 41.9MB). Peak memory consumption was 41.9MB. Max. memory is 16.0GB. * TraceAbstraction took 43574.62ms. Allocated memory was 371.2MB in the beginning and 5.5GB in the end (delta: 5.1GB). Free memory was 274.4MB in the beginning and 4.8GB in the end (delta: -4.5GB). Peak memory consumption was 634.2MB. 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: 5.1s, 151 PlacesBefore, 51 PlacesAfterwards, 141 TransitionsBefore, 39 TransitionsAfterwards, 3698 CoEnabledTransitionPairs, 8 FixpointIterations, 46 TrivialSequentialCompositions, 71 ConcurrentSequentialCompositions, 0 TrivialYvCompositions, 17 ConcurrentYvCompositions, 2 ChoiceCompositions, 136 TotalNumberOfCompositions, 11438 MoverChecksTotal, Independence Relation Statistics: CachedIndependenceRelation.Independence Queries: [ total: 4938, independent: 4654, independent conditional: 0, independent unconditional: 4654, dependent: 284, dependent conditional: 0, dependent unconditional: 284, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , CachedIndependenceRelation.Statistics on underlying relation: SyntacticIndependenceRelation.Independence Queries: [ total: 2062, independent: 2005, independent conditional: 0, independent unconditional: 2005, dependent: 57, dependent conditional: 0, dependent unconditional: 57, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , Cache Queries: [ total: 4938, independent: 2649, independent conditional: 0, independent unconditional: 2649, dependent: 227, dependent conditional: 0, dependent unconditional: 227, unknown: 2062, unknown conditional: 0, unknown unconditional: 2062] , Statistics on independence cache: Total cache size (in pairs): 197, Positive cache size: 175, Positive conditional cache size: 0, Positive unconditional cache size: 175, Negative cache size: 22, Negative conditional cache size: 0, Negative unconditional cache size: 22, 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; [L722] 0 int b = 0; [L723] 0 _Bool b$flush_delayed; [L724] 0 int b$mem_tmp; [L725] 0 _Bool b$r_buff0_thd0; [L726] 0 _Bool b$r_buff0_thd1; [L727] 0 _Bool b$r_buff0_thd2; [L728] 0 _Bool b$r_buff0_thd3; [L729] 0 _Bool b$r_buff0_thd4; [L730] 0 _Bool b$r_buff1_thd0; [L731] 0 _Bool b$r_buff1_thd1; [L732] 0 _Bool b$r_buff1_thd2; [L733] 0 _Bool b$r_buff1_thd3; [L734] 0 _Bool b$r_buff1_thd4; [L735] 0 _Bool b$read_delayed; [L736] 0 int *b$read_delayed_var; [L737] 0 int b$w_buff0; [L738] 0 _Bool b$w_buff0_used; [L739] 0 int b$w_buff1; [L740] 0 _Bool b$w_buff1_used; [L741] 0 _Bool main$tmp_guard0; [L742] 0 _Bool main$tmp_guard1; [L744] 0 int x = 0; [L746] 0 int y = 0; [L748] 0 int z = 0; [L749] 0 _Bool weak$$choice0; [L750] 0 _Bool weak$$choice2; [L871] 0 pthread_t t1129; [L872] FCALL, FORK 0 pthread_create(&t1129, ((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, b$flush_delayed=0, b$mem_tmp=0, b$r_buff0_thd0=0, b$r_buff0_thd1=0, b$r_buff0_thd2=0, b$r_buff0_thd3=0, b$r_buff0_thd4=0, b$r_buff1_thd0=0, b$r_buff1_thd1=0, b$r_buff1_thd2=0, b$r_buff1_thd3=0, b$r_buff1_thd4=0, b$read_delayed=0, b$read_delayed_var={0:0}, b$w_buff0=0, b$w_buff0_used=0, b$w_buff1=0, b$w_buff1_used=0, b=0, main$tmp_guard0=0, main$tmp_guard1=0, pthread_create(&t1129, ((void *)0), P0, ((void *)0))=-2, t1129={5:0}, weak$$choice0=0, weak$$choice2=0, x=0, y=0, z=0] [L873] 0 pthread_t t1130; [L874] FCALL, FORK 0 pthread_create(&t1130, ((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}, b$flush_delayed=0, b$mem_tmp=0, b$r_buff0_thd0=0, b$r_buff0_thd1=0, b$r_buff0_thd2=0, b$r_buff0_thd3=0, b$r_buff0_thd4=0, b$r_buff1_thd0=0, b$r_buff1_thd1=0, b$r_buff1_thd2=0, b$r_buff1_thd3=0, b$r_buff1_thd4=0, b$read_delayed=0, b$read_delayed_var={0:0}, b$w_buff0=0, b$w_buff0_used=0, b$w_buff1=0, b$w_buff1_used=0, b=0, main$tmp_guard0=0, main$tmp_guard1=0, pthread_create(&t1130, ((void *)0), P1, ((void *)0))=-1, t1129={5:0}, t1130={6:0}, weak$$choice0=0, weak$$choice2=0, x=0, y=0, z=0] [L875] 0 pthread_t t1131; [L876] FCALL, FORK 0 pthread_create(&t1131, ((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}, b$flush_delayed=0, b$mem_tmp=0, b$r_buff0_thd0=0, b$r_buff0_thd1=0, b$r_buff0_thd2=0, b$r_buff0_thd3=0, b$r_buff0_thd4=0, b$r_buff1_thd0=0, b$r_buff1_thd1=0, b$r_buff1_thd2=0, b$r_buff1_thd3=0, b$r_buff1_thd4=0, b$read_delayed=0, b$read_delayed_var={0:0}, b$w_buff0=0, b$w_buff0_used=0, b$w_buff1=0, b$w_buff1_used=0, b=0, main$tmp_guard0=0, main$tmp_guard1=0, pthread_create(&t1131, ((void *)0), P2, ((void *)0))=0, t1129={5:0}, t1130={6:0}, t1131={7:0}, weak$$choice0=0, weak$$choice2=0, x=0, y=0, z=0] [L877] 0 pthread_t t1132; [L878] FCALL, FORK 0 pthread_create(&t1132, ((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}, b$flush_delayed=0, b$mem_tmp=0, b$r_buff0_thd0=0, b$r_buff0_thd1=0, b$r_buff0_thd2=0, b$r_buff0_thd3=0, b$r_buff0_thd4=0, b$r_buff1_thd0=0, b$r_buff1_thd1=0, b$r_buff1_thd2=0, b$r_buff1_thd3=0, b$r_buff1_thd4=0, b$read_delayed=0, b$read_delayed_var={0:0}, b$w_buff0=0, b$w_buff0_used=0, b$w_buff1=0, b$w_buff1_used=0, b=0, main$tmp_guard0=0, main$tmp_guard1=0, pthread_create(&t1132, ((void *)0), P3, ((void *)0))=1, t1129={5:0}, t1130={6:0}, t1131={7:0}, t1132={3:0}, weak$$choice0=0, weak$$choice2=0, x=0, y=0, z=0] [L754] 1 b$w_buff1 = b$w_buff0 [L755] 1 b$w_buff0 = 1 [L756] 1 b$w_buff1_used = b$w_buff0_used [L757] 1 b$w_buff0_used = (_Bool)1 [L758] CALL 1 __VERIFIER_assert(!(b$w_buff1_used && b$w_buff0_used)) [L18] COND FALSE 1 !(!expression) [L758] RET 1 __VERIFIER_assert(!(b$w_buff1_used && b$w_buff0_used)) [L759] 1 b$r_buff1_thd0 = b$r_buff0_thd0 [L760] 1 b$r_buff1_thd1 = b$r_buff0_thd1 [L761] 1 b$r_buff1_thd2 = b$r_buff0_thd2 [L762] 1 b$r_buff1_thd3 = b$r_buff0_thd3 [L763] 1 b$r_buff1_thd4 = b$r_buff0_thd4 [L764] 1 b$r_buff0_thd1 = (_Bool)1 VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=0, __unbuffered_p1_EAX=0, __unbuffered_p3_EAX=0, __unbuffered_p3_EBX=0, a=0, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, b$flush_delayed=0, b$mem_tmp=0, b$r_buff0_thd0=0, b$r_buff0_thd1=1, b$r_buff0_thd2=0, b$r_buff0_thd3=0, b$r_buff0_thd4=0, b$r_buff1_thd0=0, b$r_buff1_thd1=0, b$r_buff1_thd2=0, b$r_buff1_thd3=0, b$r_buff1_thd4=0, b$read_delayed=0, b$read_delayed_var={0:0}, b$w_buff0=1, b$w_buff0_used=1, b$w_buff1=0, b$w_buff1_used=0, b=0, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=0, x=0, y=0, z=0] [L767] 1 __unbuffered_p0_EAX = x 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}, b$flush_delayed=0, b$mem_tmp=0, b$r_buff0_thd0=0, b$r_buff0_thd1=1, b$r_buff0_thd2=0, b$r_buff0_thd3=0, b$r_buff0_thd4=0, b$r_buff1_thd0=0, b$r_buff1_thd1=0, b$r_buff1_thd2=0, b$r_buff1_thd3=0, b$r_buff1_thd4=0, b$read_delayed=0, b$read_delayed_var={0:0}, b$w_buff0=1, b$w_buff0_used=1, b$w_buff1=0, b$w_buff1_used=0, b=0, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=0, x=0, y=0, z=0] [L784] 2 x = 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}, b$flush_delayed=0, b$mem_tmp=0, b$r_buff0_thd0=0, b$r_buff0_thd1=1, b$r_buff0_thd2=0, b$r_buff0_thd3=0, b$r_buff0_thd4=0, b$r_buff1_thd0=0, b$r_buff1_thd1=0, b$r_buff1_thd2=0, b$r_buff1_thd3=0, b$r_buff1_thd4=0, b$read_delayed=0, b$read_delayed_var={0:0}, b$w_buff0=1, b$w_buff0_used=1, b$w_buff1=0, b$w_buff1_used=0, b=0, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=0, x=1, y=0, z=0] [L787] 2 __unbuffered_p1_EAX = y VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=0, __unbuffered_p1_EAX=0, __unbuffered_p3_EAX=0, __unbuffered_p3_EBX=0, a=0, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, b$flush_delayed=0, b$mem_tmp=0, b$r_buff0_thd0=0, b$r_buff0_thd1=1, b$r_buff0_thd2=0, b$r_buff0_thd3=0, b$r_buff0_thd4=0, b$r_buff1_thd0=0, b$r_buff1_thd1=0, b$r_buff1_thd2=0, b$r_buff1_thd3=0, b$r_buff1_thd4=0, b$read_delayed=0, b$read_delayed_var={0:0}, b$w_buff0=1, b$w_buff0_used=1, b$w_buff1=0, b$w_buff1_used=0, b=0, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=0, x=1, y=0, z=0] [L804] 3 y = 1 VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=0, __unbuffered_p1_EAX=0, __unbuffered_p3_EAX=0, __unbuffered_p3_EBX=0, a=0, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, b$flush_delayed=0, b$mem_tmp=0, b$r_buff0_thd0=0, b$r_buff0_thd1=1, b$r_buff0_thd2=0, b$r_buff0_thd3=0, b$r_buff0_thd4=0, b$r_buff1_thd0=0, b$r_buff1_thd1=0, b$r_buff1_thd2=0, b$r_buff1_thd3=0, b$r_buff1_thd4=0, b$read_delayed=0, b$read_delayed_var={0:0}, b$w_buff0=1, b$w_buff0_used=1, b$w_buff1=0, b$w_buff1_used=0, b=0, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=0, x=1, y=1, z=0] [L807] 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}, b$flush_delayed=0, b$mem_tmp=0, b$r_buff0_thd0=0, b$r_buff0_thd1=1, b$r_buff0_thd2=0, b$r_buff0_thd3=0, b$r_buff0_thd4=0, b$r_buff1_thd0=0, b$r_buff1_thd1=0, b$r_buff1_thd2=0, b$r_buff1_thd3=0, b$r_buff1_thd4=0, b$read_delayed=0, b$read_delayed_var={0:0}, b$w_buff0=1, b$w_buff0_used=1, b$w_buff1=0, b$w_buff1_used=0, b=0, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=0, x=1, y=1, z=1] [L824] 4 z = 2 VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=0, __unbuffered_p1_EAX=0, __unbuffered_p3_EAX=0, __unbuffered_p3_EBX=0, a=0, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, b$flush_delayed=0, b$mem_tmp=0, b$r_buff0_thd0=0, b$r_buff0_thd1=1, b$r_buff0_thd2=0, b$r_buff0_thd3=0, b$r_buff0_thd4=0, b$r_buff1_thd0=0, b$r_buff1_thd1=0, b$r_buff1_thd2=0, b$r_buff1_thd3=0, b$r_buff1_thd4=0, b$read_delayed=0, b$read_delayed_var={0:0}, b$w_buff0=1, b$w_buff0_used=1, b$w_buff1=0, b$w_buff1_used=0, b=0, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=0, x=1, y=1, z=2] [L790] 2 b = b$w_buff0_used && b$r_buff0_thd2 ? b$w_buff0 : (b$w_buff1_used && b$r_buff1_thd2 ? b$w_buff1 : b) [L791] 2 b$w_buff0_used = b$w_buff0_used && b$r_buff0_thd2 ? (_Bool)0 : b$w_buff0_used [L792] 2 b$w_buff1_used = b$w_buff0_used && b$r_buff0_thd2 || b$w_buff1_used && b$r_buff1_thd2 ? (_Bool)0 : b$w_buff1_used [L793] 2 b$r_buff0_thd2 = b$w_buff0_used && b$r_buff0_thd2 ? (_Bool)0 : b$r_buff0_thd2 [L794] 2 b$r_buff1_thd2 = b$w_buff0_used && b$r_buff0_thd2 || b$w_buff1_used && b$r_buff1_thd2 ? (_Bool)0 : b$r_buff1_thd2 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}, arg={0:0}, b$flush_delayed=0, b$mem_tmp=0, b$r_buff0_thd0=0, b$r_buff0_thd1=1, b$r_buff0_thd2=0, b$r_buff0_thd3=0, b$r_buff0_thd4=0, b$r_buff1_thd0=0, b$r_buff1_thd1=0, b$r_buff1_thd2=0, b$r_buff1_thd3=0, b$r_buff1_thd4=0, b$read_delayed=0, b$read_delayed_var={0:0}, b$w_buff0=1, b$w_buff0_used=1, b$w_buff1=0, b$w_buff1_used=0, b=0, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=0, x=1, y=1, z=2] [L810] 3 b = b$w_buff0_used && b$r_buff0_thd3 ? b$w_buff0 : (b$w_buff1_used && b$r_buff1_thd3 ? b$w_buff1 : b) [L811] 3 b$w_buff0_used = b$w_buff0_used && b$r_buff0_thd3 ? (_Bool)0 : b$w_buff0_used [L812] 3 b$w_buff1_used = b$w_buff0_used && b$r_buff0_thd3 || b$w_buff1_used && b$r_buff1_thd3 ? (_Bool)0 : b$w_buff1_used [L813] 3 b$r_buff0_thd3 = b$w_buff0_used && b$r_buff0_thd3 ? (_Bool)0 : b$r_buff0_thd3 [L814] 3 b$r_buff1_thd3 = b$w_buff0_used && b$r_buff0_thd3 || b$w_buff1_used && b$r_buff1_thd3 ? (_Bool)0 : b$r_buff1_thd3 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}, arg={0:0}, b$flush_delayed=0, b$mem_tmp=0, b$r_buff0_thd0=0, b$r_buff0_thd1=1, b$r_buff0_thd2=0, b$r_buff0_thd3=0, b$r_buff0_thd4=0, b$r_buff1_thd0=0, b$r_buff1_thd1=0, b$r_buff1_thd2=0, b$r_buff1_thd3=0, b$r_buff1_thd4=0, b$read_delayed=0, b$read_delayed_var={0:0}, b$w_buff0=1, b$w_buff0_used=1, b$w_buff1=0, b$w_buff1_used=0, b=0, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=0, x=1, y=1, z=2] [L827] 4 a = 1 [L830] 4 __unbuffered_p3_EAX = a VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=0, __unbuffered_p1_EAX=0, __unbuffered_p3_EAX=1, __unbuffered_p3_EBX=0, a=1, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, b$flush_delayed=0, b$mem_tmp=0, b$r_buff0_thd0=0, b$r_buff0_thd1=1, b$r_buff0_thd2=0, b$r_buff0_thd3=0, b$r_buff0_thd4=0, b$r_buff1_thd0=0, b$r_buff1_thd1=0, b$r_buff1_thd2=0, b$r_buff1_thd3=0, b$r_buff1_thd4=0, b$read_delayed=0, b$read_delayed_var={0:0}, b$w_buff0=1, b$w_buff0_used=1, b$w_buff1=0, b$w_buff1_used=0, b=0, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=0, x=1, y=1, z=2] [L833] 4 weak$$choice0 = __VERIFIER_nondet_bool() [L834] 4 weak$$choice2 = __VERIFIER_nondet_bool() [L835] 4 b$flush_delayed = weak$$choice2 [L836] 4 b$mem_tmp = b [L837] 4 b = !b$w_buff0_used || !b$r_buff0_thd4 && !b$w_buff1_used || !b$r_buff0_thd4 && !b$r_buff1_thd4 ? b : (b$w_buff0_used && b$r_buff0_thd4 ? b$w_buff0 : b$w_buff1) [L838] 4 b$w_buff0 = weak$$choice2 ? b$w_buff0 : (!b$w_buff0_used || !b$r_buff0_thd4 && !b$w_buff1_used || !b$r_buff0_thd4 && !b$r_buff1_thd4 ? b$w_buff0 : (b$w_buff0_used && b$r_buff0_thd4 ? b$w_buff0 : b$w_buff0)) [L839] 4 b$w_buff1 = weak$$choice2 ? b$w_buff1 : (!b$w_buff0_used || !b$r_buff0_thd4 && !b$w_buff1_used || !b$r_buff0_thd4 && !b$r_buff1_thd4 ? b$w_buff1 : (b$w_buff0_used && b$r_buff0_thd4 ? b$w_buff1 : b$w_buff1)) [L840] 4 b$w_buff0_used = weak$$choice2 ? b$w_buff0_used : (!b$w_buff0_used || !b$r_buff0_thd4 && !b$w_buff1_used || !b$r_buff0_thd4 && !b$r_buff1_thd4 ? b$w_buff0_used : (b$w_buff0_used && b$r_buff0_thd4 ? (_Bool)0 : b$w_buff0_used)) [L841] 4 b$w_buff1_used = weak$$choice2 ? b$w_buff1_used : (!b$w_buff0_used || !b$r_buff0_thd4 && !b$w_buff1_used || !b$r_buff0_thd4 && !b$r_buff1_thd4 ? b$w_buff1_used : (b$w_buff0_used && b$r_buff0_thd4 ? (_Bool)0 : (_Bool)0)) [L842] 4 b$r_buff0_thd4 = weak$$choice2 ? b$r_buff0_thd4 : (!b$w_buff0_used || !b$r_buff0_thd4 && !b$w_buff1_used || !b$r_buff0_thd4 && !b$r_buff1_thd4 ? b$r_buff0_thd4 : (b$w_buff0_used && b$r_buff0_thd4 ? (_Bool)0 : b$r_buff0_thd4)) [L843] 4 b$r_buff1_thd4 = weak$$choice2 ? b$r_buff1_thd4 : (!b$w_buff0_used || !b$r_buff0_thd4 && !b$w_buff1_used || !b$r_buff0_thd4 && !b$r_buff1_thd4 ? b$r_buff1_thd4 : (b$w_buff0_used && b$r_buff0_thd4 ? (_Bool)0 : (_Bool)0)) [L844] 4 __unbuffered_p3_EBX = b [L845] 4 b = b$flush_delayed ? b$mem_tmp : b [L846] 4 b$flush_delayed = (_Bool)0 VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=0, __unbuffered_p1_EAX=0, __unbuffered_p3_EAX=1, __unbuffered_p3_EBX=0, a=1, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, b$flush_delayed=0, b$mem_tmp=0, b$r_buff0_thd0=0, b$r_buff0_thd1=1, b$r_buff0_thd2=0, b$r_buff0_thd3=0, b$r_buff0_thd4=0, b$r_buff1_thd0=0, b$r_buff1_thd1=0, b$r_buff1_thd2=0, b$r_buff1_thd3=0, b$r_buff1_thd4=0, b$read_delayed=0, b$read_delayed_var={0:0}, b$w_buff0=1, b$w_buff0_used=1, b$w_buff1=0, b$w_buff1_used=0, b=0, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice2=1, x=1, y=1, z=2] [L849] 4 b = b$w_buff0_used && b$r_buff0_thd4 ? b$w_buff0 : (b$w_buff1_used && b$r_buff1_thd4 ? b$w_buff1 : b) [L850] 4 b$w_buff0_used = b$w_buff0_used && b$r_buff0_thd4 ? (_Bool)0 : b$w_buff0_used [L851] 4 b$w_buff1_used = b$w_buff0_used && b$r_buff0_thd4 || b$w_buff1_used && b$r_buff1_thd4 ? (_Bool)0 : b$w_buff1_used [L852] 4 b$r_buff0_thd4 = b$w_buff0_used && b$r_buff0_thd4 ? (_Bool)0 : b$r_buff0_thd4 [L853] 4 b$r_buff1_thd4 = b$w_buff0_used && b$r_buff0_thd4 || b$w_buff1_used && b$r_buff1_thd4 ? (_Bool)0 : b$r_buff1_thd4 VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=0, __unbuffered_p1_EAX=0, __unbuffered_p3_EAX=1, __unbuffered_p3_EBX=0, a=1, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, b$flush_delayed=0, b$mem_tmp=0, b$r_buff0_thd0=0, b$r_buff0_thd1=1, b$r_buff0_thd2=0, b$r_buff0_thd3=0, b$r_buff0_thd4=0, b$r_buff1_thd0=0, b$r_buff1_thd1=0, b$r_buff1_thd2=0, b$r_buff1_thd3=0, b$r_buff1_thd4=0, b$read_delayed=0, b$read_delayed_var={0:0}, b$w_buff0=1, b$w_buff0_used=1, b$w_buff1=0, b$w_buff1_used=0, b=0, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice2=1, x=1, y=1, z=2] [L770] 1 b = b$w_buff0_used && b$r_buff0_thd1 ? b$w_buff0 : (b$w_buff1_used && b$r_buff1_thd1 ? b$w_buff1 : b) [L771] 1 b$w_buff0_used = b$w_buff0_used && b$r_buff0_thd1 ? (_Bool)0 : b$w_buff0_used [L772] 1 b$w_buff1_used = b$w_buff0_used && b$r_buff0_thd1 || b$w_buff1_used && b$r_buff1_thd1 ? (_Bool)0 : b$w_buff1_used [L773] 1 b$r_buff0_thd1 = b$w_buff0_used && b$r_buff0_thd1 ? (_Bool)0 : b$r_buff0_thd1 [L774] 1 b$r_buff1_thd1 = b$w_buff0_used && b$r_buff0_thd1 || b$w_buff1_used && b$r_buff1_thd1 ? (_Bool)0 : b$r_buff1_thd1 VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=0, __unbuffered_p1_EAX=0, __unbuffered_p3_EAX=1, __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}, b$flush_delayed=0, b$mem_tmp=0, b$r_buff0_thd0=0, b$r_buff0_thd1=1, b$r_buff0_thd2=0, b$r_buff0_thd3=0, b$r_buff0_thd4=0, b$r_buff1_thd0=0, b$r_buff1_thd1=0, b$r_buff1_thd2=0, b$r_buff1_thd3=0, b$r_buff1_thd4=0, b$read_delayed=0, b$read_delayed_var={0:0}, b$w_buff0=1, b$w_buff0_used=0, b$w_buff1=0, b$w_buff1_used=0, b=1, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice2=1, x=1, y=1, z=2] [L777] 1 __unbuffered_cnt = __unbuffered_cnt + 1 [L779] 1 return 0; [L797] 2 __unbuffered_cnt = __unbuffered_cnt + 1 [L799] 2 return 0; [L817] 3 __unbuffered_cnt = __unbuffered_cnt + 1 [L819] 3 return 0; [L856] 4 __unbuffered_cnt = __unbuffered_cnt + 1 [L858] 4 return 0; [L880] 0 main$tmp_guard0 = __unbuffered_cnt == 4 [L882] CALL 0 assume_abort_if_not(main$tmp_guard0) [L3] COND FALSE 0 !(!cond) [L882] RET 0 assume_abort_if_not(main$tmp_guard0) [L884] 0 b = b$w_buff0_used && b$r_buff0_thd0 ? b$w_buff0 : (b$w_buff1_used && b$r_buff1_thd0 ? b$w_buff1 : b) [L885] 0 b$w_buff0_used = b$w_buff0_used && b$r_buff0_thd0 ? (_Bool)0 : b$w_buff0_used [L886] 0 b$w_buff1_used = b$w_buff0_used && b$r_buff0_thd0 || b$w_buff1_used && b$r_buff1_thd0 ? (_Bool)0 : b$w_buff1_used [L887] 0 b$r_buff0_thd0 = b$w_buff0_used && b$r_buff0_thd0 ? (_Bool)0 : b$r_buff0_thd0 [L888] 0 b$r_buff1_thd0 = b$w_buff0_used && b$r_buff0_thd0 || b$w_buff1_used && b$r_buff1_thd0 ? (_Bool)0 : b$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=1, __unbuffered_p3_EBX=0, a=1, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, b$flush_delayed=0, b$mem_tmp=0, b$r_buff0_thd0=0, b$r_buff0_thd1=1, b$r_buff0_thd2=0, b$r_buff0_thd3=0, b$r_buff0_thd4=0, b$r_buff1_thd0=0, b$r_buff1_thd1=0, b$r_buff1_thd2=0, b$r_buff1_thd3=0, b$r_buff1_thd4=0, b$read_delayed=0, b$read_delayed_var={0:0}, b$w_buff0=1, b$w_buff0_used=0, b$w_buff1=0, b$w_buff1_used=0, b=1, main$tmp_guard0=1, main$tmp_guard1=0, t1129={5:0}, t1130={6:0}, t1131={7:0}, t1132={3:0}, weak$$choice2=1, x=1, y=1, z=2] [L891] 0 main$tmp_guard1 = !(z == 2 && __unbuffered_p0_EAX == 0 && __unbuffered_p1_EAX == 0 && __unbuffered_p3_EAX == 1 && __unbuffered_p3_EBX == 0) [L893] 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", "mix043.oepc.c", 8, __extension__ __PRETTY_FUNCTION__) VAL [\read(__PRETTY_FUNCTION__)={49:50}, \result={0:0}, \result={0:0}, \result={0:0}, __unbuffered_cnt=4, __unbuffered_p0_EAX=0, __unbuffered_p1_EAX=0, __unbuffered_p3_EAX=1, __unbuffered_p3_EBX=0, a=1, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, b$flush_delayed=0, b$mem_tmp=0, b$r_buff0_thd0=0, b$r_buff0_thd1=1, b$r_buff0_thd2=0, b$r_buff0_thd3=0, b$r_buff0_thd4=0, b$r_buff1_thd0=0, b$r_buff1_thd1=0, b$r_buff1_thd2=0, b$r_buff1_thd3=0, b$r_buff1_thd4=0, b$read_delayed=0, b$read_delayed_var={0:0}, b$w_buff0=1, b$w_buff0_used=0, b$w_buff1=0, b$w_buff1_used=0, b=1, main$tmp_guard0=1, main$tmp_guard1=0, weak$$choice2=1, x=1, 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: 872]: Unable to prove that petrification did provide enough thread instances (tool internal message, not intended for end users) Unable to prove that petrification did provide enough thread instances (tool internal message, not intended for end users) Reason: Not analyzed. - UnprovableResult [Line: 876]: Unable to prove that petrification did provide enough thread instances (tool internal message, not intended for end users) Unable to prove that petrification did provide enough thread instances (tool internal message, not intended for end users) Reason: Not analyzed. - UnprovableResult [Line: 874]: Unable to prove that petrification did provide enough thread instances (tool internal message, not intended for end users) Unable to prove that petrification did provide enough thread instances (tool internal message, not intended for end users) Reason: Not analyzed. - UnprovableResult [Line: 878]: 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, 182 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: 43.3s, OverallIterations: 16, TraceHistogramMax: 1, PathProgramHistogramMax: 4, EmptinessCheckTime: 0.0s, AutomataDifference: 32.5s, DeadEndRemovalTime: 0.0s, HoareAnnotationTime: 0.0s, InitialAbstractionConstructionTime: 5.2s, HoareTripleCheckerStatistics: 0 mSolverCounterUnknown, 657 SdHoareTripleChecker+Valid, 2.1s IncrementalHoareTripleChecker+Time, 0 mSdLazyCounter, 657 mSDsluCounter, 29 SdHoareTripleChecker+Invalid, 1.7s Time, 0 mProtectedAction, 0 SdHoareTripleChecker+Unchecked, 0 IncrementalHoareTripleChecker+Unchecked, 11 mSDsCounter, 70 IncrementalHoareTripleChecker+Valid, 0 mProtectedPredicate, 2138 IncrementalHoareTripleChecker+Invalid, 2208 SdHoareTripleChecker+Unknown, 0 mSolverCounterNotChecked, 70 mSolverCounterUnsat, 18 mSDtfsCounter, 2138 mSolverCounterSat, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Unknown, PredicateUnifierStatistics: 0 DeclaredPredicates, 78 GetRequests, 11 SyntacticMatches, 0 SemanticMatches, 67 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 29 ImplicationChecksByTransitivity, 0.4s Time, 0.0s BasicInterpolantAutomatonTime, BiggestAbstraction: size=729occurred in iteration=11, InterpolantAutomatonStates: 82, traceCheckStatistics: No data available, InterpolantConsolidationStatistics: No data available, PathInvariantsStatistics: No data available, 0/0 InterpolantCoveringCapability, TotalInterpolationStatistics: No data available, 0.0s DumpTime, AutomataMinimizationStatistics: No data available, HoareAnnotationStatistics: No data available, RefinementEngineStatistics: TRACE_CHECK: 0.1s SsaConstructionTime, 0.4s SatisfiabilityAnalysisTime, 4.6s InterpolantComputationTime, 304 NumberOfCodeBlocks, 304 NumberOfCodeBlocksAsserted, 16 NumberOfCheckSat, 261 ConstructedInterpolants, 0 QuantifiedInterpolants, 1924 SizeOfPredicates, 0 NumberOfNonLiveVariables, 0 ConjunctsInSsa, 0 ConjunctsInUnsatCore, 15 InterpolantComputations, 15 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:06:43,373 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...