/usr/bin/java -Xmx16000000000 -Xss4m -jar ./plugins/org.eclipse.equinox.launcher_1.5.800.v20200727-1323.jar -data @noDefault -ultimatedata ./data -s ../../../trunk/examples/settings/automizer/concurrent/svcomp-Reach-32bit-Automizer_Default-noMmResRef-PN-VariableLbe.epf --traceabstraction.order.of.the.error.locations.to.be.checked PROGRAM_FIRST -tc ../../../trunk/examples/toolchains/AutomizerCInline.xml --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/mix053.opt.i -------------------------------------------------------------------------------- This is Ultimate 0.2.3-dev-ac9dbd0-m [2023-08-26 18:18:03,436 INFO L188 SettingsManager]: Resetting all preferences to default values... [2023-08-26 18:18:03,501 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 18:18:03,508 WARN L101 SettingsManager]: Preference file contains the following unknown settings: [2023-08-26 18:18:03,509 WARN L103 SettingsManager]: * de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.Checked method. Library mode if empty. [2023-08-26 18:18:03,530 INFO L130 SettingsManager]: Preferences different from defaults after loading the file: [2023-08-26 18:18:03,531 INFO L151 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2023-08-26 18:18:03,531 INFO L153 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2023-08-26 18:18:03,532 INFO L151 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2023-08-26 18:18:03,532 INFO L153 SettingsManager]: * Create parallel compositions if possible=false [2023-08-26 18:18:03,533 INFO L153 SettingsManager]: * Use SBE=true [2023-08-26 18:18:03,533 INFO L151 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2023-08-26 18:18:03,533 INFO L153 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2023-08-26 18:18:03,534 INFO L153 SettingsManager]: * sizeof long=4 [2023-08-26 18:18:03,534 INFO L153 SettingsManager]: * Overapproximate operations on floating types=true [2023-08-26 18:18:03,534 INFO L153 SettingsManager]: * sizeof POINTER=4 [2023-08-26 18:18:03,535 INFO L153 SettingsManager]: * Check division by zero=IGNORE [2023-08-26 18:18:03,535 INFO L153 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2023-08-26 18:18:03,535 INFO L153 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2023-08-26 18:18:03,535 INFO L153 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2023-08-26 18:18:03,536 INFO L153 SettingsManager]: * sizeof long double=12 [2023-08-26 18:18:03,541 INFO L153 SettingsManager]: * Check if freed pointer was valid=false [2023-08-26 18:18:03,541 INFO L153 SettingsManager]: * Use constant arrays=true [2023-08-26 18:18:03,542 INFO L151 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2023-08-26 18:18:03,542 INFO L153 SettingsManager]: * Size of a code block=SequenceOfStatements [2023-08-26 18:18:03,542 INFO L153 SettingsManager]: * To the following directory=./dump/ [2023-08-26 18:18:03,542 INFO L153 SettingsManager]: * SMT solver=External_DefaultMode [2023-08-26 18:18:03,543 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2023-08-26 18:18:03,543 INFO L151 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2023-08-26 18:18:03,543 INFO L153 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2023-08-26 18:18:03,543 INFO L153 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopsAndPotentialCycles [2023-08-26 18:18:03,544 INFO L153 SettingsManager]: * Trace refinement strategy=CAMEL [2023-08-26 18:18:03,544 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2023-08-26 18:18:03,544 INFO L153 SettingsManager]: * Automaton type used in concurrency analysis=PETRI_NET [2023-08-26 18:18:03,548 INFO L153 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2023-08-26 18:18:03,548 INFO L153 SettingsManager]: * Independence relation used for large block encoding in concurrent analysis=SYNTACTIC WARNING: An illegal reflective access operation has occurred WARNING: Illegal reflective access by com.sun.xml.bind.v2.runtime.reflect.opt.Injector$1 (file:/storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/plugins/com.sun.xml.bind_2.2.0.v201505121915.jar) to method java.lang.ClassLoader.defineClass(java.lang.String,byte[],int,int) WARNING: Please consider reporting this to the maintainers of com.sun.xml.bind.v2.runtime.reflect.opt.Injector$1 WARNING: Use --illegal-access=warn to enable warnings of further illegal reflective access operations WARNING: All illegal access operations will be denied in a future release Applying setting for plugin de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: Order of the error locations to be checked -> PROGRAM_FIRST 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 18:18:03,862 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2023-08-26 18:18:03,878 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2023-08-26 18:18:03,879 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2023-08-26 18:18:03,880 INFO L270 PluginConnector]: Initializing CDTParser... [2023-08-26 18:18:03,884 INFO L274 PluginConnector]: CDTParser initialized [2023-08-26 18:18:03,886 INFO L431 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../../../trunk/examples/svcomp/pthread-wmm/mix053.opt.i [2023-08-26 18:18:05,152 INFO L533 CDTParser]: Created temporary CDT project at NULL [2023-08-26 18:18:05,427 INFO L384 CDTParser]: Found 1 translation units. [2023-08-26 18:18:05,428 INFO L180 CDTParser]: Scanning /storage/repos/ultimate/trunk/examples/svcomp/pthread-wmm/mix053.opt.i [2023-08-26 18:18:05,461 INFO L427 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/cb6f6b748/ae8fdf2819014dd28ae9085d2a57477c/FLAG1fcdbc33c [2023-08-26 18:18:05,479 INFO L435 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/cb6f6b748/ae8fdf2819014dd28ae9085d2a57477c [2023-08-26 18:18:05,488 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2023-08-26 18:18:05,490 INFO L133 ToolchainWalker]: Walking toolchain with 5 elements. [2023-08-26 18:18:05,492 INFO L112 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2023-08-26 18:18:05,493 INFO L270 PluginConnector]: Initializing CACSL2BoogieTranslator... [2023-08-26 18:18:05,496 INFO L274 PluginConnector]: CACSL2BoogieTranslator initialized [2023-08-26 18:18:05,497 INFO L184 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 26.08 06:18:05" (1/1) ... [2023-08-26 18:18:05,498 INFO L204 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@7451fbad and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 26.08 06:18:05, skipping insertion in model container [2023-08-26 18:18:05,498 INFO L184 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 26.08 06:18:05" (1/1) ... [2023-08-26 18:18:05,560 INFO L176 MainTranslator]: Built tables and reachable declarations [2023-08-26 18:18:05,900 INFO L209 PostProcessor]: Analyzing one entry point: main [2023-08-26 18:18:05,914 INFO L201 MainTranslator]: Completed pre-run [2023-08-26 18:18:05,933 WARN L75 lationResultReporter]: Unsoundness Warning: unspecified type, defaulting to int C: short [267] [2023-08-26 18:18:05,935 WARN L75 lationResultReporter]: Unsoundness Warning: unspecified type, defaulting to int C: short [267] [2023-08-26 18:18:05,966 INFO L209 PostProcessor]: Analyzing one entry point: main [2023-08-26 18:18:05,999 WARN L669 CHandler]: The function __VERIFIER_atomic_begin is called, but not defined or handled by StandardFunctionHandler. [2023-08-26 18:18:06,000 WARN L669 CHandler]: The function __VERIFIER_atomic_end is called, but not defined or handled by StandardFunctionHandler. [2023-08-26 18:18:06,007 INFO L206 MainTranslator]: Completed translation [2023-08-26 18:18:06,008 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 26.08 06:18:06 WrapperNode [2023-08-26 18:18:06,008 INFO L131 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2023-08-26 18:18:06,009 INFO L112 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2023-08-26 18:18:06,009 INFO L270 PluginConnector]: Initializing Boogie Procedure Inliner... [2023-08-26 18:18:06,009 INFO L274 PluginConnector]: Boogie Procedure Inliner initialized [2023-08-26 18:18:06,015 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 26.08 06:18:06" (1/1) ... [2023-08-26 18:18:06,039 INFO L184 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 26.08 06:18:06" (1/1) ... [2023-08-26 18:18:06,074 INFO L138 Inliner]: procedures = 177, calls = 68, calls flagged for inlining = 6, calls inlined = 7, statements flattened = 149 [2023-08-26 18:18:06,074 INFO L131 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2023-08-26 18:18:06,075 INFO L112 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2023-08-26 18:18:06,075 INFO L270 PluginConnector]: Initializing Boogie Preprocessor... [2023-08-26 18:18:06,075 INFO L274 PluginConnector]: Boogie Preprocessor initialized [2023-08-26 18:18:06,083 INFO L184 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 26.08 06:18:06" (1/1) ... [2023-08-26 18:18:06,083 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 26.08 06:18:06" (1/1) ... [2023-08-26 18:18:06,097 INFO L184 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 26.08 06:18:06" (1/1) ... [2023-08-26 18:18:06,097 INFO L184 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 26.08 06:18:06" (1/1) ... [2023-08-26 18:18:06,103 INFO L184 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 26.08 06:18:06" (1/1) ... [2023-08-26 18:18:06,116 INFO L184 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 26.08 06:18:06" (1/1) ... [2023-08-26 18:18:06,118 INFO L184 PluginConnector]: Executing the observer LTLStepAnnotator from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 26.08 06:18:06" (1/1) ... [2023-08-26 18:18:06,119 INFO L184 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 26.08 06:18:06" (1/1) ... [2023-08-26 18:18:06,122 INFO L131 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2023-08-26 18:18:06,123 INFO L112 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2023-08-26 18:18:06,123 INFO L270 PluginConnector]: Initializing RCFGBuilder... [2023-08-26 18:18:06,123 INFO L274 PluginConnector]: RCFGBuilder initialized [2023-08-26 18:18:06,124 INFO L184 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 26.08 06:18:06" (1/1) ... [2023-08-26 18:18:06,137 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2023-08-26 18:18:06,149 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2023-08-26 18:18:06,161 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 18:18:06,171 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 18:18:06,197 INFO L130 BoogieDeclarations]: Found specification of procedure write~int [2023-08-26 18:18:06,197 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_atomic_begin [2023-08-26 18:18:06,198 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2023-08-26 18:18:06,198 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnStack [2023-08-26 18:18:06,198 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.dealloc [2023-08-26 18:18:06,198 INFO L130 BoogieDeclarations]: Found specification of procedure P0 [2023-08-26 18:18:06,198 INFO L138 BoogieDeclarations]: Found implementation of procedure P0 [2023-08-26 18:18:06,198 INFO L130 BoogieDeclarations]: Found specification of procedure P1 [2023-08-26 18:18:06,198 INFO L138 BoogieDeclarations]: Found implementation of procedure P1 [2023-08-26 18:18:06,199 INFO L130 BoogieDeclarations]: Found specification of procedure P2 [2023-08-26 18:18:06,199 INFO L138 BoogieDeclarations]: Found implementation of procedure P2 [2023-08-26 18:18:06,199 INFO L130 BoogieDeclarations]: Found specification of procedure P3 [2023-08-26 18:18:06,199 INFO L138 BoogieDeclarations]: Found implementation of procedure P3 [2023-08-26 18:18:06,199 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int [2023-08-26 18:18:06,199 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_atomic_end [2023-08-26 18:18:06,200 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2023-08-26 18:18:06,201 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2023-08-26 18:18:06,202 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 18:18:06,377 INFO L236 CfgBuilder]: Building ICFG [2023-08-26 18:18:06,379 INFO L262 CfgBuilder]: Building CFG for each procedure with an implementation [2023-08-26 18:18:06,671 INFO L277 CfgBuilder]: Performing block encoding [2023-08-26 18:18:06,804 INFO L297 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2023-08-26 18:18:06,804 INFO L302 CfgBuilder]: Removed 0 assume(true) statements. [2023-08-26 18:18:06,806 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 26.08 06:18:06 BoogieIcfgContainer [2023-08-26 18:18:06,807 INFO L131 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2023-08-26 18:18:06,809 INFO L112 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2023-08-26 18:18:06,809 INFO L270 PluginConnector]: Initializing TraceAbstraction... [2023-08-26 18:18:06,812 INFO L274 PluginConnector]: TraceAbstraction initialized [2023-08-26 18:18:06,812 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 26.08 06:18:05" (1/3) ... [2023-08-26 18:18:06,813 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@195ccabf and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 26.08 06:18:06, skipping insertion in model container [2023-08-26 18:18:06,813 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 26.08 06:18:06" (2/3) ... [2023-08-26 18:18:06,813 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@195ccabf and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 26.08 06:18:06, skipping insertion in model container [2023-08-26 18:18:06,813 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 26.08 06:18:06" (3/3) ... [2023-08-26 18:18:06,814 INFO L112 eAbstractionObserver]: Analyzing ICFG mix053.opt.i [2023-08-26 18:18:06,830 INFO L203 ceAbstractionStarter]: Automizer settings: Hoare:false NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2023-08-26 18:18:06,831 INFO L162 ceAbstractionStarter]: Applying trace abstraction to program that has 10 error locations. [2023-08-26 18:18:06,831 INFO L515 ceAbstractionStarter]: Constructing petrified ICFG for 1 thread instances. [2023-08-26 18:18:06,894 INFO L144 ThreadInstanceAdder]: Constructed 0 joinOtherThreadTransitions. [2023-08-26 18:18:06,926 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 147 places, 137 transitions, 294 flow [2023-08-26 18:18:07,007 INFO L124 PetriNetUnfolderBase]: 3/133 cut-off events. [2023-08-26 18:18:07,007 INFO L125 PetriNetUnfolderBase]: For 0/0 co-relation queries the response was YES. [2023-08-26 18:18:07,014 INFO L83 FinitePrefix]: Finished finitePrefix Result has 146 conditions, 133 events. 3/133 cut-off events. For 0/0 co-relation queries the response was YES. Maximal size of possible extension queue 4. Compared 106 event pairs, 0 based on Foata normal form. 0/120 useless extension candidates. Maximal degree in co-relation 94. Up to 2 conditions per place. [2023-08-26 18:18:07,015 INFO L82 GeneralOperation]: Start removeDead. Operand has 147 places, 137 transitions, 294 flow [2023-08-26 18:18:07,021 INFO L88 GeneralOperation]: Finished RemoveDead, result has has 143 places, 133 transitions, 278 flow [2023-08-26 18:18:07,025 INFO L124 etLargeBlockEncoding]: Petri net LBE is using variable-based independence relation. [2023-08-26 18:18:07,037 INFO L131 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 143 places, 133 transitions, 278 flow [2023-08-26 18:18:07,041 INFO L113 LiptonReduction]: Starting Lipton reduction on Petri net that has 143 places, 133 transitions, 278 flow [2023-08-26 18:18:07,042 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 143 places, 133 transitions, 278 flow [2023-08-26 18:18:07,085 INFO L124 PetriNetUnfolderBase]: 3/133 cut-off events. [2023-08-26 18:18:07,085 INFO L125 PetriNetUnfolderBase]: For 0/0 co-relation queries the response was YES. [2023-08-26 18:18:07,086 INFO L83 FinitePrefix]: Finished finitePrefix Result has 146 conditions, 133 events. 3/133 cut-off events. For 0/0 co-relation queries the response was YES. Maximal size of possible extension queue 4. Compared 105 event pairs, 0 based on Foata normal form. 0/120 useless extension candidates. Maximal degree in co-relation 94. Up to 2 conditions per place. [2023-08-26 18:18:07,088 INFO L119 LiptonReduction]: Number of co-enabled transitions 2972 [2023-08-26 18:18:11,451 INFO L134 LiptonReduction]: Checked pairs total: 7409 [2023-08-26 18:18:11,451 INFO L136 LiptonReduction]: Total number of compositions: 131 [2023-08-26 18:18:11,463 INFO L356 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2023-08-26 18:18:11,469 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;@459ec07a, mLbeIndependenceSettings=[IndependenceType=SYNTACTIC, AbstractionType=NONE, UseConditional=, UseSemiCommutativity=, Solver=, SolverTimeout=] [2023-08-26 18:18:11,469 INFO L358 AbstractCegarLoop]: Starting to check reachability of 15 error locations. [2023-08-26 18:18:11,471 INFO L185 PetriNetUnfolderBase]: Found word, exiting Unfolder. [2023-08-26 18:18:11,471 INFO L124 PetriNetUnfolderBase]: 0/0 cut-off events. [2023-08-26 18:18:11,471 INFO L125 PetriNetUnfolderBase]: For 0/0 co-relation queries the response was YES. [2023-08-26 18:18:11,471 INFO L200 CegarLoopForPetriNet]: Found error trace [2023-08-26 18:18:11,472 INFO L208 CegarLoopForPetriNet]: trace histogram [1] [2023-08-26 18:18:11,472 INFO L420 AbstractCegarLoop]: === Iteration 1 === Targeting ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [P3Err0ASSERT_VIOLATIONASSERT, ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 12 more)] === [2023-08-26 18:18:11,476 INFO L145 PredicateUnifier]: Initialized classic predicate unifier [2023-08-26 18:18:11,477 INFO L85 PathProgramCache]: Analyzing trace with hash 578, now seen corresponding path program 1 times [2023-08-26 18:18:11,484 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-08-26 18:18:11,484 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [380783514] [2023-08-26 18:18:11,484 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-08-26 18:18:11,485 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-08-26 18:18:11,557 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-08-26 18:18:11,576 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-08-26 18:18:11,577 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-08-26 18:18:11,577 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [380783514] [2023-08-26 18:18:11,578 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [380783514] provided 1 perfect and 0 imperfect interpolant sequences [2023-08-26 18:18:11,578 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-08-26 18:18:11,578 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [0] imperfect sequences [] total 0 [2023-08-26 18:18:11,579 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1800547212] [2023-08-26 18:18:11,580 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-08-26 18:18:11,587 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 2 states [2023-08-26 18:18:11,591 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-08-26 18:18:11,610 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 2 interpolants. [2023-08-26 18:18:11,611 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=1, Invalid=1, Unknown=0, NotChecked=0, Total=2 [2023-08-26 18:18:11,613 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 124 out of 268 [2023-08-26 18:18:11,616 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 48 places, 36 transitions, 84 flow. Second operand has 2 states, 2 states have (on average 124.5) internal successors, (249), 2 states have internal predecessors, (249), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-26 18:18:11,616 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2023-08-26 18:18:11,616 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 124 of 268 [2023-08-26 18:18:11,617 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2023-08-26 18:18:12,198 INFO L124 PetriNetUnfolderBase]: 3113/4352 cut-off events. [2023-08-26 18:18:12,198 INFO L125 PetriNetUnfolderBase]: For 35/35 co-relation queries the response was YES. [2023-08-26 18:18:12,205 INFO L83 FinitePrefix]: Finished finitePrefix Result has 8746 conditions, 4352 events. 3113/4352 cut-off events. For 35/35 co-relation queries the response was YES. Maximal size of possible extension queue 257. Compared 21192 event pairs, 3113 based on Foata normal form. 0/3907 useless extension candidates. Maximal degree in co-relation 8734. Up to 4291 conditions per place. [2023-08-26 18:18:12,226 INFO L140 encePairwiseOnDemand]: 259/268 looper letters, 24 selfloop transitions, 0 changer transitions 0/27 dead transitions. [2023-08-26 18:18:12,226 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 41 places, 27 transitions, 114 flow [2023-08-26 18:18:12,227 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2023-08-26 18:18:12,229 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 2 states. [2023-08-26 18:18:12,235 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2 states to 2 states and 281 transitions. [2023-08-26 18:18:12,238 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.5242537313432836 [2023-08-26 18:18:12,238 INFO L72 ComplementDD]: Start complementDD. Operand 2 states and 281 transitions. [2023-08-26 18:18:12,239 INFO L73 IsDeterministic]: Start isDeterministic. Operand 2 states and 281 transitions. [2023-08-26 18:18:12,240 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2023-08-26 18:18:12,242 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 2 states and 281 transitions. [2023-08-26 18:18:12,244 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 3 states, 2 states have (on average 140.5) internal successors, (281), 2 states have internal predecessors, (281), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-26 18:18:12,248 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 3 states, 3 states have (on average 268.0) internal successors, (804), 3 states have internal predecessors, (804), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-26 18:18:12,248 INFO L81 ComplementDD]: Finished complementDD. Result has 3 states, 3 states have (on average 268.0) internal successors, (804), 3 states have internal predecessors, (804), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-26 18:18:12,250 INFO L175 Difference]: Start difference. First operand has 48 places, 36 transitions, 84 flow. Second operand 2 states and 281 transitions. [2023-08-26 18:18:12,251 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 41 places, 27 transitions, 114 flow [2023-08-26 18:18:12,254 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 37 places, 27 transitions, 110 flow, removed 0 selfloop flow, removed 4 redundant places. [2023-08-26 18:18:12,255 INFO L231 Difference]: Finished difference. Result has 37 places, 27 transitions, 62 flow [2023-08-26 18:18:12,257 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=268, PETRI_DIFFERENCE_MINUEND_FLOW=62, PETRI_DIFFERENCE_MINUEND_PLACES=36, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=27, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=0, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=27, PETRI_DIFFERENCE_SUBTRAHEND_STATES=2, PETRI_FLOW=62, PETRI_PLACES=37, PETRI_TRANSITIONS=27} [2023-08-26 18:18:12,260 INFO L281 CegarLoopForPetriNet]: 48 programPoint places, -11 predicate places. [2023-08-26 18:18:12,260 INFO L495 AbstractCegarLoop]: Abstraction has has 37 places, 27 transitions, 62 flow [2023-08-26 18:18:12,260 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 2 states, 2 states have (on average 124.5) internal successors, (249), 2 states have internal predecessors, (249), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-26 18:18:12,261 INFO L200 CegarLoopForPetriNet]: Found error trace [2023-08-26 18:18:12,261 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-08-26 18:18:12,261 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable0 [2023-08-26 18:18:12,261 INFO L420 AbstractCegarLoop]: === Iteration 2 === Targeting P3Err0ASSERT_VIOLATIONASSERT === [P3Err0ASSERT_VIOLATIONASSERT, ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 12 more)] === [2023-08-26 18:18:12,262 INFO L145 PredicateUnifier]: Initialized classic predicate unifier [2023-08-26 18:18:12,262 INFO L85 PathProgramCache]: Analyzing trace with hash 896160460, now seen corresponding path program 1 times [2023-08-26 18:18:12,262 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-08-26 18:18:12,262 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [619055175] [2023-08-26 18:18:12,262 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-08-26 18:18:12,262 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-08-26 18:18:12,314 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-08-26 18:18:12,621 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 18:18:12,621 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-08-26 18:18:12,621 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [619055175] [2023-08-26 18:18:12,621 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [619055175] provided 1 perfect and 0 imperfect interpolant sequences [2023-08-26 18:18:12,621 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-08-26 18:18:12,621 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [1] imperfect sequences [] total 1 [2023-08-26 18:18:12,622 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [663078953] [2023-08-26 18:18:12,622 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-08-26 18:18:12,622 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2023-08-26 18:18:12,623 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-08-26 18:18:12,623 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2023-08-26 18:18:12,623 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2023-08-26 18:18:12,624 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 123 out of 268 [2023-08-26 18:18:12,625 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 37 places, 27 transitions, 62 flow. Second operand has 3 states, 3 states have (on average 126.0) internal successors, (378), 3 states have internal predecessors, (378), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-26 18:18:12,625 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2023-08-26 18:18:12,625 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 123 of 268 [2023-08-26 18:18:12,625 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2023-08-26 18:18:13,005 INFO L124 PetriNetUnfolderBase]: 2483/3668 cut-off events. [2023-08-26 18:18:13,005 INFO L125 PetriNetUnfolderBase]: For 0/0 co-relation queries the response was YES. [2023-08-26 18:18:13,010 INFO L83 FinitePrefix]: Finished finitePrefix Result has 7213 conditions, 3668 events. 2483/3668 cut-off events. For 0/0 co-relation queries the response was YES. Maximal size of possible extension queue 215. Compared 19432 event pairs, 593 based on Foata normal form. 0/3520 useless extension candidates. Maximal degree in co-relation 7210. Up to 2539 conditions per place. [2023-08-26 18:18:13,024 INFO L140 encePairwiseOnDemand]: 265/268 looper letters, 31 selfloop transitions, 2 changer transitions 2/38 dead transitions. [2023-08-26 18:18:13,025 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 38 places, 38 transitions, 154 flow [2023-08-26 18:18:13,025 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2023-08-26 18:18:13,026 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2023-08-26 18:18:13,030 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 405 transitions. [2023-08-26 18:18:13,031 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.503731343283582 [2023-08-26 18:18:13,031 INFO L72 ComplementDD]: Start complementDD. Operand 3 states and 405 transitions. [2023-08-26 18:18:13,031 INFO L73 IsDeterministic]: Start isDeterministic. Operand 3 states and 405 transitions. [2023-08-26 18:18:13,032 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2023-08-26 18:18:13,032 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 3 states and 405 transitions. [2023-08-26 18:18:13,034 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 4 states, 3 states have (on average 135.0) internal successors, (405), 3 states have internal predecessors, (405), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-26 18:18:13,037 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 4 states, 4 states have (on average 268.0) internal successors, (1072), 4 states have internal predecessors, (1072), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-26 18:18:13,039 INFO L81 ComplementDD]: Finished complementDD. Result has 4 states, 4 states have (on average 268.0) internal successors, (1072), 4 states have internal predecessors, (1072), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-26 18:18:13,039 INFO L175 Difference]: Start difference. First operand has 37 places, 27 transitions, 62 flow. Second operand 3 states and 405 transitions. [2023-08-26 18:18:13,041 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 38 places, 38 transitions, 154 flow [2023-08-26 18:18:13,042 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 38 places, 38 transitions, 154 flow, removed 0 selfloop flow, removed 0 redundant places. [2023-08-26 18:18:13,043 INFO L231 Difference]: Finished difference. Result has 38 places, 25 transitions, 62 flow [2023-08-26 18:18:13,043 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=268, PETRI_DIFFERENCE_MINUEND_FLOW=60, PETRI_DIFFERENCE_MINUEND_PLACES=36, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=26, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=2, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=24, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=62, PETRI_PLACES=38, PETRI_TRANSITIONS=25} [2023-08-26 18:18:13,044 INFO L281 CegarLoopForPetriNet]: 48 programPoint places, -10 predicate places. [2023-08-26 18:18:13,045 INFO L495 AbstractCegarLoop]: Abstraction has has 38 places, 25 transitions, 62 flow [2023-08-26 18:18:13,045 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 126.0) internal successors, (378), 3 states have internal predecessors, (378), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-26 18:18:13,045 INFO L200 CegarLoopForPetriNet]: Found error trace [2023-08-26 18:18:13,049 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-08-26 18:18:13,049 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1 [2023-08-26 18:18:13,049 INFO L420 AbstractCegarLoop]: === Iteration 3 === Targeting ULTIMATE.startErr8ASSERT_VIOLATIONASSERT === [P3Err0ASSERT_VIOLATIONASSERT, ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 12 more)] === [2023-08-26 18:18:13,050 INFO L145 PredicateUnifier]: Initialized classic predicate unifier [2023-08-26 18:18:13,050 INFO L85 PathProgramCache]: Analyzing trace with hash 1755805, now seen corresponding path program 1 times [2023-08-26 18:18:13,050 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-08-26 18:18:13,051 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [860493351] [2023-08-26 18:18:13,051 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-08-26 18:18:13,051 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-08-26 18:18:13,089 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-08-26 18:18:13,289 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 18:18:13,290 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-08-26 18:18:13,290 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [860493351] [2023-08-26 18:18:13,290 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [860493351] provided 1 perfect and 0 imperfect interpolant sequences [2023-08-26 18:18:13,291 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-08-26 18:18:13,291 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2023-08-26 18:18:13,292 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [244222701] [2023-08-26 18:18:13,292 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-08-26 18:18:13,292 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2023-08-26 18:18:13,292 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-08-26 18:18:13,293 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2023-08-26 18:18:13,293 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2023-08-26 18:18:13,294 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 110 out of 268 [2023-08-26 18:18:13,295 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 38 places, 25 transitions, 62 flow. Second operand has 4 states, 4 states have (on average 113.0) internal successors, (452), 4 states have internal predecessors, (452), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-26 18:18:13,295 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2023-08-26 18:18:13,295 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 110 of 268 [2023-08-26 18:18:13,295 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2023-08-26 18:18:14,403 INFO L124 PetriNetUnfolderBase]: 8983/12456 cut-off events. [2023-08-26 18:18:14,404 INFO L125 PetriNetUnfolderBase]: For 554/554 co-relation queries the response was YES. [2023-08-26 18:18:14,437 INFO L83 FinitePrefix]: Finished finitePrefix Result has 25771 conditions, 12456 events. 8983/12456 cut-off events. For 554/554 co-relation queries the response was YES. Maximal size of possible extension queue 505. Compared 64995 event pairs, 2827 based on Foata normal form. 540/12996 useless extension candidates. Maximal degree in co-relation 25767. Up to 6303 conditions per place. [2023-08-26 18:18:14,488 INFO L140 encePairwiseOnDemand]: 259/268 looper letters, 38 selfloop transitions, 7 changer transitions 27/72 dead transitions. [2023-08-26 18:18:14,488 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 41 places, 72 transitions, 310 flow [2023-08-26 18:18:14,489 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2023-08-26 18:18:14,489 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 5 states. [2023-08-26 18:18:14,490 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 624 transitions. [2023-08-26 18:18:14,491 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.46567164179104475 [2023-08-26 18:18:14,491 INFO L72 ComplementDD]: Start complementDD. Operand 5 states and 624 transitions. [2023-08-26 18:18:14,491 INFO L73 IsDeterministic]: Start isDeterministic. Operand 5 states and 624 transitions. [2023-08-26 18:18:14,491 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2023-08-26 18:18:14,491 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 5 states and 624 transitions. [2023-08-26 18:18:14,493 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 6 states, 5 states have (on average 124.8) internal successors, (624), 5 states have internal predecessors, (624), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-26 18:18:14,496 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 6 states, 6 states have (on average 268.0) internal successors, (1608), 6 states have internal predecessors, (1608), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-26 18:18:14,496 INFO L81 ComplementDD]: Finished complementDD. Result has 6 states, 6 states have (on average 268.0) internal successors, (1608), 6 states have internal predecessors, (1608), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-26 18:18:14,496 INFO L175 Difference]: Start difference. First operand has 38 places, 25 transitions, 62 flow. Second operand 5 states and 624 transitions. [2023-08-26 18:18:14,497 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 41 places, 72 transitions, 310 flow [2023-08-26 18:18:14,510 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 39 places, 72 transitions, 300 flow, removed 0 selfloop flow, removed 2 redundant places. [2023-08-26 18:18:14,511 INFO L231 Difference]: Finished difference. Result has 43 places, 31 transitions, 128 flow [2023-08-26 18:18:14,511 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=268, PETRI_DIFFERENCE_MINUEND_FLOW=58, PETRI_DIFFERENCE_MINUEND_PLACES=35, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=25, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=1, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=18, PETRI_DIFFERENCE_SUBTRAHEND_STATES=5, PETRI_FLOW=128, PETRI_PLACES=43, PETRI_TRANSITIONS=31} [2023-08-26 18:18:14,512 INFO L281 CegarLoopForPetriNet]: 48 programPoint places, -5 predicate places. [2023-08-26 18:18:14,512 INFO L495 AbstractCegarLoop]: Abstraction has has 43 places, 31 transitions, 128 flow [2023-08-26 18:18:14,512 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 113.0) internal successors, (452), 4 states have internal predecessors, (452), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-26 18:18:14,512 INFO L200 CegarLoopForPetriNet]: Found error trace [2023-08-26 18:18:14,512 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-08-26 18:18:14,513 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2 [2023-08-26 18:18:14,513 INFO L420 AbstractCegarLoop]: === Iteration 4 === Targeting ULTIMATE.startErr8ASSERT_VIOLATIONASSERT === [P3Err0ASSERT_VIOLATIONASSERT, ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 12 more)] === [2023-08-26 18:18:14,513 INFO L145 PredicateUnifier]: Initialized classic predicate unifier [2023-08-26 18:18:14,513 INFO L85 PathProgramCache]: Analyzing trace with hash 54402456, now seen corresponding path program 1 times [2023-08-26 18:18:14,513 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-08-26 18:18:14,514 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [889499093] [2023-08-26 18:18:14,514 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-08-26 18:18:14,514 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-08-26 18:18:14,570 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-08-26 18:18:14,737 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 18:18:14,737 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-08-26 18:18:14,737 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [889499093] [2023-08-26 18:18:14,737 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [889499093] provided 1 perfect and 0 imperfect interpolant sequences [2023-08-26 18:18:14,737 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-08-26 18:18:14,737 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2023-08-26 18:18:14,738 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1514588933] [2023-08-26 18:18:14,738 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-08-26 18:18:14,738 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2023-08-26 18:18:14,738 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-08-26 18:18:14,739 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2023-08-26 18:18:14,739 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=8, Invalid=12, Unknown=0, NotChecked=0, Total=20 [2023-08-26 18:18:14,739 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 110 out of 268 [2023-08-26 18:18:14,740 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 43 places, 31 transitions, 128 flow. Second operand has 5 states, 5 states have (on average 112.6) internal successors, (563), 5 states have internal predecessors, (563), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-26 18:18:14,740 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2023-08-26 18:18:14,740 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 110 of 268 [2023-08-26 18:18:14,740 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2023-08-26 18:18:15,827 INFO L124 PetriNetUnfolderBase]: 8201/11478 cut-off events. [2023-08-26 18:18:15,827 INFO L125 PetriNetUnfolderBase]: For 8856/8856 co-relation queries the response was YES. [2023-08-26 18:18:15,865 INFO L83 FinitePrefix]: Finished finitePrefix Result has 32607 conditions, 11478 events. 8201/11478 cut-off events. For 8856/8856 co-relation queries the response was YES. Maximal size of possible extension queue 462. Compared 61113 event pairs, 767 based on Foata normal form. 496/11974 useless extension candidates. Maximal degree in co-relation 32600. Up to 5631 conditions per place. [2023-08-26 18:18:15,906 INFO L140 encePairwiseOnDemand]: 259/268 looper letters, 53 selfloop transitions, 11 changer transitions 41/105 dead transitions. [2023-08-26 18:18:15,906 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 47 places, 105 transitions, 622 flow [2023-08-26 18:18:15,907 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2023-08-26 18:18:15,907 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 7 states. [2023-08-26 18:18:15,909 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 7 states to 7 states and 869 transitions. [2023-08-26 18:18:15,909 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.4632196162046908 [2023-08-26 18:18:15,909 INFO L72 ComplementDD]: Start complementDD. Operand 7 states and 869 transitions. [2023-08-26 18:18:15,910 INFO L73 IsDeterministic]: Start isDeterministic. Operand 7 states and 869 transitions. [2023-08-26 18:18:15,910 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2023-08-26 18:18:15,910 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 7 states and 869 transitions. [2023-08-26 18:18:15,912 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 8 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 18:18:15,915 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 8 states, 8 states have (on average 268.0) internal successors, (2144), 8 states have internal predecessors, (2144), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-26 18:18:15,916 INFO L81 ComplementDD]: Finished complementDD. Result has 8 states, 8 states have (on average 268.0) internal successors, (2144), 8 states have internal predecessors, (2144), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-26 18:18:15,916 INFO L175 Difference]: Start difference. First operand has 43 places, 31 transitions, 128 flow. Second operand 7 states and 869 transitions. [2023-08-26 18:18:15,916 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 47 places, 105 transitions, 622 flow [2023-08-26 18:18:15,944 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 45 places, 105 transitions, 576 flow, removed 0 selfloop flow, removed 2 redundant places. [2023-08-26 18:18:15,946 INFO L231 Difference]: Finished difference. Result has 51 places, 38 transitions, 218 flow [2023-08-26 18:18:15,946 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=268, PETRI_DIFFERENCE_MINUEND_FLOW=114, PETRI_DIFFERENCE_MINUEND_PLACES=39, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=31, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=4, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=22, PETRI_DIFFERENCE_SUBTRAHEND_STATES=7, PETRI_FLOW=218, PETRI_PLACES=51, PETRI_TRANSITIONS=38} [2023-08-26 18:18:15,947 INFO L281 CegarLoopForPetriNet]: 48 programPoint places, 3 predicate places. [2023-08-26 18:18:15,948 INFO L495 AbstractCegarLoop]: Abstraction has has 51 places, 38 transitions, 218 flow [2023-08-26 18:18:15,948 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 112.6) internal successors, (563), 5 states have internal predecessors, (563), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-26 18:18:15,948 INFO L200 CegarLoopForPetriNet]: Found error trace [2023-08-26 18:18:15,948 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-08-26 18:18:15,948 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable3 [2023-08-26 18:18:15,949 INFO L420 AbstractCegarLoop]: === Iteration 5 === Targeting ULTIMATE.startErr8ASSERT_VIOLATIONASSERT === [P3Err0ASSERT_VIOLATIONASSERT, ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 12 more)] === [2023-08-26 18:18:15,949 INFO L145 PredicateUnifier]: Initialized classic predicate unifier [2023-08-26 18:18:15,949 INFO L85 PathProgramCache]: Analyzing trace with hash 54395729, now seen corresponding path program 1 times [2023-08-26 18:18:15,949 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-08-26 18:18:15,949 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1633340452] [2023-08-26 18:18:15,949 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-08-26 18:18:15,949 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-08-26 18:18:15,977 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-08-26 18:18:16,113 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 18:18:16,114 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-08-26 18:18:16,114 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1633340452] [2023-08-26 18:18:16,114 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1633340452] provided 1 perfect and 0 imperfect interpolant sequences [2023-08-26 18:18:16,114 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-08-26 18:18:16,114 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2023-08-26 18:18:16,115 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1613187331] [2023-08-26 18:18:16,115 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-08-26 18:18:16,115 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2023-08-26 18:18:16,115 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-08-26 18:18:16,116 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2023-08-26 18:18:16,116 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=8, Invalid=12, Unknown=0, NotChecked=0, Total=20 [2023-08-26 18:18:16,116 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 110 out of 268 [2023-08-26 18:18:16,117 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 51 places, 38 transitions, 218 flow. Second operand has 5 states, 5 states have (on average 112.6) internal successors, (563), 5 states have internal predecessors, (563), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-26 18:18:16,117 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2023-08-26 18:18:16,117 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 110 of 268 [2023-08-26 18:18:16,117 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2023-08-26 18:18:17,224 INFO L124 PetriNetUnfolderBase]: 7637/10698 cut-off events. [2023-08-26 18:18:17,224 INFO L125 PetriNetUnfolderBase]: For 23516/23516 co-relation queries the response was YES. [2023-08-26 18:18:17,249 INFO L83 FinitePrefix]: Finished finitePrefix Result has 34417 conditions, 10698 events. 7637/10698 cut-off events. For 23516/23516 co-relation queries the response was YES. Maximal size of possible extension queue 408. Compared 55657 event pairs, 1367 based on Foata normal form. 400/11098 useless extension candidates. Maximal degree in co-relation 34405. Up to 5285 conditions per place. [2023-08-26 18:18:17,292 INFO L140 encePairwiseOnDemand]: 259/268 looper letters, 58 selfloop transitions, 17 changer transitions 34/109 dead transitions. [2023-08-26 18:18:17,292 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 54 places, 109 transitions, 728 flow [2023-08-26 18:18:17,293 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2023-08-26 18:18:17,293 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 7 states. [2023-08-26 18:18:17,295 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 7 states to 7 states and 870 transitions. [2023-08-26 18:18:17,295 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.46375266524520253 [2023-08-26 18:18:17,295 INFO L72 ComplementDD]: Start complementDD. Operand 7 states and 870 transitions. [2023-08-26 18:18:17,295 INFO L73 IsDeterministic]: Start isDeterministic. Operand 7 states and 870 transitions. [2023-08-26 18:18:17,296 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2023-08-26 18:18:17,296 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 7 states and 870 transitions. [2023-08-26 18:18:17,298 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 8 states, 7 states have (on average 124.28571428571429) internal successors, (870), 7 states have internal predecessors, (870), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-26 18:18:17,302 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 8 states, 8 states have (on average 268.0) internal successors, (2144), 8 states have internal predecessors, (2144), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-26 18:18:17,302 INFO L81 ComplementDD]: Finished complementDD. Result has 8 states, 8 states have (on average 268.0) internal successors, (2144), 8 states have internal predecessors, (2144), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-26 18:18:17,302 INFO L175 Difference]: Start difference. First operand has 51 places, 38 transitions, 218 flow. Second operand 7 states and 870 transitions. [2023-08-26 18:18:17,303 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 54 places, 109 transitions, 728 flow [2023-08-26 18:18:17,368 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 54 places, 109 transitions, 720 flow, removed 4 selfloop flow, removed 0 redundant places. [2023-08-26 18:18:17,370 INFO L231 Difference]: Finished difference. Result has 59 places, 45 transitions, 338 flow [2023-08-26 18:18:17,370 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=268, PETRI_DIFFERENCE_MINUEND_FLOW=214, PETRI_DIFFERENCE_MINUEND_PLACES=48, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=38, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=10, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=24, PETRI_DIFFERENCE_SUBTRAHEND_STATES=7, PETRI_FLOW=338, PETRI_PLACES=59, PETRI_TRANSITIONS=45} [2023-08-26 18:18:17,371 INFO L281 CegarLoopForPetriNet]: 48 programPoint places, 11 predicate places. [2023-08-26 18:18:17,371 INFO L495 AbstractCegarLoop]: Abstraction has has 59 places, 45 transitions, 338 flow [2023-08-26 18:18:17,372 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 112.6) internal successors, (563), 5 states have internal predecessors, (563), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-26 18:18:17,372 INFO L200 CegarLoopForPetriNet]: Found error trace [2023-08-26 18:18:17,372 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-08-26 18:18:17,372 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable4 [2023-08-26 18:18:17,372 INFO L420 AbstractCegarLoop]: === Iteration 6 === Targeting ULTIMATE.startErr8ASSERT_VIOLATIONASSERT === [P3Err0ASSERT_VIOLATIONASSERT, ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 12 more)] === [2023-08-26 18:18:17,372 INFO L145 PredicateUnifier]: Initialized classic predicate unifier [2023-08-26 18:18:17,373 INFO L85 PathProgramCache]: Analyzing trace with hash 1686441910, now seen corresponding path program 1 times [2023-08-26 18:18:17,373 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-08-26 18:18:17,373 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [147870311] [2023-08-26 18:18:17,373 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-08-26 18:18:17,373 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-08-26 18:18:17,414 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-08-26 18:18:17,551 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 18:18:17,551 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-08-26 18:18:17,551 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [147870311] [2023-08-26 18:18:17,551 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [147870311] provided 1 perfect and 0 imperfect interpolant sequences [2023-08-26 18:18:17,552 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-08-26 18:18:17,552 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2023-08-26 18:18:17,552 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [833899963] [2023-08-26 18:18:17,552 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-08-26 18:18:17,552 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2023-08-26 18:18:17,552 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-08-26 18:18:17,553 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2023-08-26 18:18:17,554 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2023-08-26 18:18:17,555 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 116 out of 268 [2023-08-26 18:18:17,555 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 59 places, 45 transitions, 338 flow. Second operand has 4 states, 4 states have (on average 119.5) internal successors, (478), 4 states have internal predecessors, (478), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-26 18:18:17,555 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2023-08-26 18:18:17,555 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 116 of 268 [2023-08-26 18:18:17,556 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2023-08-26 18:18:18,309 INFO L124 PetriNetUnfolderBase]: 4472/6664 cut-off events. [2023-08-26 18:18:18,310 INFO L125 PetriNetUnfolderBase]: For 19313/20112 co-relation queries the response was YES. [2023-08-26 18:18:18,336 INFO L83 FinitePrefix]: Finished finitePrefix Result has 22638 conditions, 6664 events. 4472/6664 cut-off events. For 19313/20112 co-relation queries the response was YES. Maximal size of possible extension queue 418. Compared 38479 event pairs, 851 based on Foata normal form. 767/7310 useless extension candidates. Maximal degree in co-relation 22620. Up to 4699 conditions per place. [2023-08-26 18:18:18,362 INFO L140 encePairwiseOnDemand]: 261/268 looper letters, 81 selfloop transitions, 10 changer transitions 0/105 dead transitions. [2023-08-26 18:18:18,362 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 60 places, 105 transitions, 903 flow [2023-08-26 18:18:18,363 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2023-08-26 18:18:18,363 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 5 states. [2023-08-26 18:18:18,364 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 641 transitions. [2023-08-26 18:18:18,365 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.4783582089552239 [2023-08-26 18:18:18,365 INFO L72 ComplementDD]: Start complementDD. Operand 5 states and 641 transitions. [2023-08-26 18:18:18,365 INFO L73 IsDeterministic]: Start isDeterministic. Operand 5 states and 641 transitions. [2023-08-26 18:18:18,365 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2023-08-26 18:18:18,365 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 5 states and 641 transitions. [2023-08-26 18:18:18,367 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 6 states, 5 states have (on average 128.2) internal successors, (641), 5 states have internal predecessors, (641), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-26 18:18:18,369 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 6 states, 6 states have (on average 268.0) internal successors, (1608), 6 states have internal predecessors, (1608), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-26 18:18:18,369 INFO L81 ComplementDD]: Finished complementDD. Result has 6 states, 6 states have (on average 268.0) internal successors, (1608), 6 states have internal predecessors, (1608), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-26 18:18:18,369 INFO L175 Difference]: Start difference. First operand has 59 places, 45 transitions, 338 flow. Second operand 5 states and 641 transitions. [2023-08-26 18:18:18,369 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 60 places, 105 transitions, 903 flow [2023-08-26 18:18:18,408 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 55 places, 105 transitions, 867 flow, removed 18 selfloop flow, removed 5 redundant places. [2023-08-26 18:18:18,411 INFO L231 Difference]: Finished difference. Result has 58 places, 54 transitions, 391 flow [2023-08-26 18:18:18,411 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=268, PETRI_DIFFERENCE_MINUEND_FLOW=316, PETRI_DIFFERENCE_MINUEND_PLACES=51, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=45, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=1, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=39, PETRI_DIFFERENCE_SUBTRAHEND_STATES=5, PETRI_FLOW=391, PETRI_PLACES=58, PETRI_TRANSITIONS=54} [2023-08-26 18:18:18,413 INFO L281 CegarLoopForPetriNet]: 48 programPoint places, 10 predicate places. [2023-08-26 18:18:18,416 INFO L495 AbstractCegarLoop]: Abstraction has has 58 places, 54 transitions, 391 flow [2023-08-26 18:18:18,416 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 119.5) internal successors, (478), 4 states have internal predecessors, (478), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-26 18:18:18,416 INFO L200 CegarLoopForPetriNet]: Found error trace [2023-08-26 18:18:18,416 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-08-26 18:18:18,416 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable5 [2023-08-26 18:18:18,416 INFO L420 AbstractCegarLoop]: === Iteration 7 === Targeting ULTIMATE.startErr8ASSERT_VIOLATIONASSERT === [P3Err0ASSERT_VIOLATIONASSERT, ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 12 more)] === [2023-08-26 18:18:18,417 INFO L145 PredicateUnifier]: Initialized classic predicate unifier [2023-08-26 18:18:18,419 INFO L85 PathProgramCache]: Analyzing trace with hash -654534897, now seen corresponding path program 1 times [2023-08-26 18:18:18,419 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-08-26 18:18:18,420 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2098422927] [2023-08-26 18:18:18,420 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-08-26 18:18:18,420 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-08-26 18:18:18,444 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-08-26 18:18:18,546 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 18:18:18,546 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-08-26 18:18:18,547 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2098422927] [2023-08-26 18:18:18,547 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2098422927] provided 1 perfect and 0 imperfect interpolant sequences [2023-08-26 18:18:18,547 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-08-26 18:18:18,547 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2023-08-26 18:18:18,547 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [440096626] [2023-08-26 18:18:18,547 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-08-26 18:18:18,548 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2023-08-26 18:18:18,548 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-08-26 18:18:18,548 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2023-08-26 18:18:18,548 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2023-08-26 18:18:18,549 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 116 out of 268 [2023-08-26 18:18:18,549 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 58 places, 54 transitions, 391 flow. Second operand has 4 states, 4 states have (on average 120.0) internal successors, (480), 4 states have internal predecessors, (480), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-26 18:18:18,549 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2023-08-26 18:18:18,549 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 116 of 268 [2023-08-26 18:18:18,549 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2023-08-26 18:18:19,518 INFO L124 PetriNetUnfolderBase]: 6740/10199 cut-off events. [2023-08-26 18:18:19,518 INFO L125 PetriNetUnfolderBase]: For 30324/30777 co-relation queries the response was YES. [2023-08-26 18:18:19,571 INFO L83 FinitePrefix]: Finished finitePrefix Result has 42225 conditions, 10199 events. 6740/10199 cut-off events. For 30324/30777 co-relation queries the response was YES. Maximal size of possible extension queue 561. Compared 63176 event pairs, 2758 based on Foata normal form. 555/10627 useless extension candidates. Maximal degree in co-relation 42208. Up to 5145 conditions per place. [2023-08-26 18:18:19,603 INFO L140 encePairwiseOnDemand]: 264/268 looper letters, 56 selfloop transitions, 8 changer transitions 31/102 dead transitions. [2023-08-26 18:18:19,604 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 62 places, 102 transitions, 857 flow [2023-08-26 18:18:19,604 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2023-08-26 18:18:19,604 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 5 states. [2023-08-26 18:18:19,605 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 640 transitions. [2023-08-26 18:18:19,606 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.47761194029850745 [2023-08-26 18:18:19,606 INFO L72 ComplementDD]: Start complementDD. Operand 5 states and 640 transitions. [2023-08-26 18:18:19,606 INFO L73 IsDeterministic]: Start isDeterministic. Operand 5 states and 640 transitions. [2023-08-26 18:18:19,606 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2023-08-26 18:18:19,607 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 5 states and 640 transitions. [2023-08-26 18:18:19,608 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 6 states, 5 states have (on average 128.0) internal successors, (640), 5 states have internal predecessors, (640), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-26 18:18:19,610 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 6 states, 6 states have (on average 268.0) internal successors, (1608), 6 states have internal predecessors, (1608), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-26 18:18:19,610 INFO L81 ComplementDD]: Finished complementDD. Result has 6 states, 6 states have (on average 268.0) internal successors, (1608), 6 states have internal predecessors, (1608), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-26 18:18:19,610 INFO L175 Difference]: Start difference. First operand has 58 places, 54 transitions, 391 flow. Second operand 5 states and 640 transitions. [2023-08-26 18:18:19,611 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 62 places, 102 transitions, 857 flow [2023-08-26 18:18:19,665 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 61 places, 102 transitions, 846 flow, removed 1 selfloop flow, removed 1 redundant places. [2023-08-26 18:18:19,667 INFO L231 Difference]: Finished difference. Result has 64 places, 48 transitions, 373 flow [2023-08-26 18:18:19,667 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=268, PETRI_DIFFERENCE_MINUEND_FLOW=384, PETRI_DIFFERENCE_MINUEND_PLACES=57, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=54, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=8, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=46, PETRI_DIFFERENCE_SUBTRAHEND_STATES=5, PETRI_FLOW=373, PETRI_PLACES=64, PETRI_TRANSITIONS=48} [2023-08-26 18:18:19,668 INFO L281 CegarLoopForPetriNet]: 48 programPoint places, 16 predicate places. [2023-08-26 18:18:19,668 INFO L495 AbstractCegarLoop]: Abstraction has has 64 places, 48 transitions, 373 flow [2023-08-26 18:18:19,668 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 120.0) internal successors, (480), 4 states have internal predecessors, (480), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-26 18:18:19,668 INFO L200 CegarLoopForPetriNet]: Found error trace [2023-08-26 18:18:19,668 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-08-26 18:18:19,669 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable6 [2023-08-26 18:18:19,669 INFO L420 AbstractCegarLoop]: === Iteration 8 === Targeting ULTIMATE.startErr8ASSERT_VIOLATIONASSERT === [P3Err0ASSERT_VIOLATIONASSERT, ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 12 more)] === [2023-08-26 18:18:19,669 INFO L145 PredicateUnifier]: Initialized classic predicate unifier [2023-08-26 18:18:19,669 INFO L85 PathProgramCache]: Analyzing trace with hash 2127388502, now seen corresponding path program 1 times [2023-08-26 18:18:19,669 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-08-26 18:18:19,669 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [596933652] [2023-08-26 18:18:19,669 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-08-26 18:18:19,669 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-08-26 18:18:19,701 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-08-26 18:18:19,836 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 18:18:19,836 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-08-26 18:18:19,837 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [596933652] [2023-08-26 18:18:19,837 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [596933652] provided 1 perfect and 0 imperfect interpolant sequences [2023-08-26 18:18:19,837 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-08-26 18:18:19,837 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2023-08-26 18:18:19,837 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2101984069] [2023-08-26 18:18:19,837 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-08-26 18:18:19,838 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2023-08-26 18:18:19,838 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-08-26 18:18:19,838 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2023-08-26 18:18:19,838 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=8, Invalid=12, Unknown=0, NotChecked=0, Total=20 [2023-08-26 18:18:19,839 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 116 out of 268 [2023-08-26 18:18:19,840 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 64 places, 48 transitions, 373 flow. Second operand has 5 states, 5 states have (on average 119.0) internal successors, (595), 5 states have internal predecessors, (595), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-26 18:18:19,840 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2023-08-26 18:18:19,840 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 116 of 268 [2023-08-26 18:18:19,840 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2023-08-26 18:18:20,404 INFO L124 PetriNetUnfolderBase]: 3375/5363 cut-off events. [2023-08-26 18:18:20,405 INFO L125 PetriNetUnfolderBase]: For 16245/16845 co-relation queries the response was YES. [2023-08-26 18:18:20,422 INFO L83 FinitePrefix]: Finished finitePrefix Result has 22093 conditions, 5363 events. 3375/5363 cut-off events. For 16245/16845 co-relation queries the response was YES. Maximal size of possible extension queue 324. Compared 33047 event pairs, 356 based on Foata normal form. 777/6044 useless extension candidates. Maximal degree in co-relation 22073. Up to 2335 conditions per place. [2023-08-26 18:18:20,440 INFO L140 encePairwiseOnDemand]: 261/268 looper letters, 105 selfloop transitions, 15 changer transitions 6/138 dead transitions. [2023-08-26 18:18:20,440 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 67 places, 138 transitions, 1305 flow [2023-08-26 18:18:20,440 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2023-08-26 18:18:20,441 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 7 states. [2023-08-26 18:18:20,442 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 7 states to 7 states and 894 transitions. [2023-08-26 18:18:20,443 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.47654584221748403 [2023-08-26 18:18:20,443 INFO L72 ComplementDD]: Start complementDD. Operand 7 states and 894 transitions. [2023-08-26 18:18:20,443 INFO L73 IsDeterministic]: Start isDeterministic. Operand 7 states and 894 transitions. [2023-08-26 18:18:20,444 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2023-08-26 18:18:20,444 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 7 states and 894 transitions. [2023-08-26 18:18:20,446 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 8 states, 7 states have (on average 127.71428571428571) internal successors, (894), 7 states have internal predecessors, (894), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-26 18:18:20,449 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 8 states, 8 states have (on average 268.0) internal successors, (2144), 8 states have internal predecessors, (2144), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-26 18:18:20,449 INFO L81 ComplementDD]: Finished complementDD. Result has 8 states, 8 states have (on average 268.0) internal successors, (2144), 8 states have internal predecessors, (2144), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-26 18:18:20,449 INFO L175 Difference]: Start difference. First operand has 64 places, 48 transitions, 373 flow. Second operand 7 states and 894 transitions. [2023-08-26 18:18:20,449 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 67 places, 138 transitions, 1305 flow [2023-08-26 18:18:20,490 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 63 places, 138 transitions, 1264 flow, removed 9 selfloop flow, removed 4 redundant places. [2023-08-26 18:18:20,492 INFO L231 Difference]: Finished difference. Result has 66 places, 57 transitions, 479 flow [2023-08-26 18:18:20,492 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=268, PETRI_DIFFERENCE_MINUEND_FLOW=357, PETRI_DIFFERENCE_MINUEND_PLACES=57, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=48, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=6, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=37, PETRI_DIFFERENCE_SUBTRAHEND_STATES=7, PETRI_FLOW=479, PETRI_PLACES=66, PETRI_TRANSITIONS=57} [2023-08-26 18:18:20,493 INFO L281 CegarLoopForPetriNet]: 48 programPoint places, 18 predicate places. [2023-08-26 18:18:20,493 INFO L495 AbstractCegarLoop]: Abstraction has has 66 places, 57 transitions, 479 flow [2023-08-26 18:18:20,493 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 119.0) internal successors, (595), 5 states have internal predecessors, (595), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-26 18:18:20,494 INFO L200 CegarLoopForPetriNet]: Found error trace [2023-08-26 18:18:20,494 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-08-26 18:18:20,494 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable7 [2023-08-26 18:18:20,494 INFO L420 AbstractCegarLoop]: === Iteration 9 === Targeting ULTIMATE.startErr8ASSERT_VIOLATIONASSERT === [P3Err0ASSERT_VIOLATIONASSERT, ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 12 more)] === [2023-08-26 18:18:20,494 INFO L145 PredicateUnifier]: Initialized classic predicate unifier [2023-08-26 18:18:20,494 INFO L85 PathProgramCache]: Analyzing trace with hash -858780348, now seen corresponding path program 1 times [2023-08-26 18:18:20,494 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-08-26 18:18:20,494 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1315184739] [2023-08-26 18:18:20,495 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-08-26 18:18:20,495 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-08-26 18:18:20,529 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-08-26 18:18:20,715 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 18:18:20,715 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-08-26 18:18:20,715 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1315184739] [2023-08-26 18:18:20,715 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1315184739] provided 1 perfect and 0 imperfect interpolant sequences [2023-08-26 18:18:20,716 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-08-26 18:18:20,716 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2023-08-26 18:18:20,716 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [168092000] [2023-08-26 18:18:20,716 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-08-26 18:18:20,716 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2023-08-26 18:18:20,716 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-08-26 18:18:20,717 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2023-08-26 18:18:20,721 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=12, Invalid=18, Unknown=0, NotChecked=0, Total=30 [2023-08-26 18:18:20,721 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 116 out of 268 [2023-08-26 18:18:20,722 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 66 places, 57 transitions, 479 flow. Second operand has 6 states, 6 states have (on average 118.83333333333333) internal successors, (713), 6 states have internal predecessors, (713), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-26 18:18:20,722 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2023-08-26 18:18:20,722 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 116 of 268 [2023-08-26 18:18:20,722 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2023-08-26 18:18:21,232 INFO L124 PetriNetUnfolderBase]: 2843/4551 cut-off events. [2023-08-26 18:18:21,233 INFO L125 PetriNetUnfolderBase]: For 16498/17314 co-relation queries the response was YES. [2023-08-26 18:18:21,245 INFO L83 FinitePrefix]: Finished finitePrefix Result has 21769 conditions, 4551 events. 2843/4551 cut-off events. For 16498/17314 co-relation queries the response was YES. Maximal size of possible extension queue 316. Compared 28100 event pairs, 176 based on Foata normal form. 616/5076 useless extension candidates. Maximal degree in co-relation 21749. Up to 2083 conditions per place. [2023-08-26 18:18:21,258 INFO L140 encePairwiseOnDemand]: 261/268 looper letters, 114 selfloop transitions, 24 changer transitions 17/167 dead transitions. [2023-08-26 18:18:21,258 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 74 places, 167 transitions, 1630 flow [2023-08-26 18:18:21,264 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2023-08-26 18:18:21,265 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 9 states. [2023-08-26 18:18:21,267 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 9 states to 9 states and 1149 transitions. [2023-08-26 18:18:21,268 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.4763681592039801 [2023-08-26 18:18:21,268 INFO L72 ComplementDD]: Start complementDD. Operand 9 states and 1149 transitions. [2023-08-26 18:18:21,268 INFO L73 IsDeterministic]: Start isDeterministic. Operand 9 states and 1149 transitions. [2023-08-26 18:18:21,269 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2023-08-26 18:18:21,269 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 9 states and 1149 transitions. [2023-08-26 18:18:21,271 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 10 states, 9 states have (on average 127.66666666666667) internal successors, (1149), 9 states have internal predecessors, (1149), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-26 18:18:21,274 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 10 states, 10 states have (on average 268.0) internal successors, (2680), 10 states have internal predecessors, (2680), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-26 18:18:21,275 INFO L81 ComplementDD]: Finished complementDD. Result has 10 states, 10 states have (on average 268.0) internal successors, (2680), 10 states have internal predecessors, (2680), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-26 18:18:21,275 INFO L175 Difference]: Start difference. First operand has 66 places, 57 transitions, 479 flow. Second operand 9 states and 1149 transitions. [2023-08-26 18:18:21,275 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 74 places, 167 transitions, 1630 flow [2023-08-26 18:18:21,446 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 72 places, 167 transitions, 1583 flow, removed 18 selfloop flow, removed 2 redundant places. [2023-08-26 18:18:21,448 INFO L231 Difference]: Finished difference. Result has 75 places, 66 transitions, 602 flow [2023-08-26 18:18:21,448 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=268, PETRI_DIFFERENCE_MINUEND_FLOW=432, PETRI_DIFFERENCE_MINUEND_PLACES=64, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=57, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=19, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=37, PETRI_DIFFERENCE_SUBTRAHEND_STATES=9, PETRI_FLOW=602, PETRI_PLACES=75, PETRI_TRANSITIONS=66} [2023-08-26 18:18:21,449 INFO L281 CegarLoopForPetriNet]: 48 programPoint places, 27 predicate places. [2023-08-26 18:18:21,450 INFO L495 AbstractCegarLoop]: Abstraction has has 75 places, 66 transitions, 602 flow [2023-08-26 18:18:21,450 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 118.83333333333333) internal successors, (713), 6 states have internal predecessors, (713), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-26 18:18:21,450 INFO L200 CegarLoopForPetriNet]: Found error trace [2023-08-26 18:18:21,450 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] [2023-08-26 18:18:21,450 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable8 [2023-08-26 18:18:21,450 INFO L420 AbstractCegarLoop]: === Iteration 10 === Targeting ULTIMATE.startErr8ASSERT_VIOLATIONASSERT === [P3Err0ASSERT_VIOLATIONASSERT, ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 12 more)] === [2023-08-26 18:18:21,451 INFO L145 PredicateUnifier]: Initialized classic predicate unifier [2023-08-26 18:18:21,451 INFO L85 PathProgramCache]: Analyzing trace with hash 1830959446, now seen corresponding path program 1 times [2023-08-26 18:18:21,451 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-08-26 18:18:21,452 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1512374406] [2023-08-26 18:18:21,452 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-08-26 18:18:21,453 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-08-26 18:18:21,483 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-08-26 18:18:21,655 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 18:18:21,655 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-08-26 18:18:21,657 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1512374406] [2023-08-26 18:18:21,657 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1512374406] provided 1 perfect and 0 imperfect interpolant sequences [2023-08-26 18:18:21,657 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-08-26 18:18:21,657 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2023-08-26 18:18:21,657 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [189412474] [2023-08-26 18:18:21,657 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-08-26 18:18:21,658 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2023-08-26 18:18:21,659 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-08-26 18:18:21,659 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2023-08-26 18:18:21,659 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=17, Invalid=25, Unknown=0, NotChecked=0, Total=42 [2023-08-26 18:18:21,660 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 116 out of 268 [2023-08-26 18:18:21,661 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 75 places, 66 transitions, 602 flow. Second operand has 7 states, 7 states have (on average 118.71428571428571) internal successors, (831), 7 states have internal predecessors, (831), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-26 18:18:21,661 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2023-08-26 18:18:21,661 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 116 of 268 [2023-08-26 18:18:21,661 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2023-08-26 18:18:22,336 INFO L124 PetriNetUnfolderBase]: 2757/4388 cut-off events. [2023-08-26 18:18:22,337 INFO L125 PetriNetUnfolderBase]: For 18582/19142 co-relation queries the response was YES. [2023-08-26 18:18:22,357 INFO L83 FinitePrefix]: Finished finitePrefix Result has 21390 conditions, 4388 events. 2757/4388 cut-off events. For 18582/19142 co-relation queries the response was YES. Maximal size of possible extension queue 316. Compared 27084 event pairs, 162 based on Foata normal form. 384/4681 useless extension candidates. Maximal degree in co-relation 21367. Up to 1296 conditions per place. [2023-08-26 18:18:22,366 INFO L140 encePairwiseOnDemand]: 261/268 looper letters, 93 selfloop transitions, 27 changer transitions 39/168 dead transitions. [2023-08-26 18:18:22,366 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 85 places, 168 transitions, 1685 flow [2023-08-26 18:18:22,366 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 11 states. [2023-08-26 18:18:22,366 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 11 states. [2023-08-26 18:18:22,370 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 11 states to 11 states and 1382 transitions. [2023-08-26 18:18:22,371 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.4687924016282225 [2023-08-26 18:18:22,371 INFO L72 ComplementDD]: Start complementDD. Operand 11 states and 1382 transitions. [2023-08-26 18:18:22,371 INFO L73 IsDeterministic]: Start isDeterministic. Operand 11 states and 1382 transitions. [2023-08-26 18:18:22,372 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2023-08-26 18:18:22,372 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 11 states and 1382 transitions. [2023-08-26 18:18:22,375 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 12 states, 11 states have (on average 125.63636363636364) internal successors, (1382), 11 states have internal predecessors, (1382), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-26 18:18:22,379 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 12 states, 12 states have (on average 268.0) internal successors, (3216), 12 states have internal predecessors, (3216), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-26 18:18:22,380 INFO L81 ComplementDD]: Finished complementDD. Result has 12 states, 12 states have (on average 268.0) internal successors, (3216), 12 states have internal predecessors, (3216), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-26 18:18:22,380 INFO L175 Difference]: Start difference. First operand has 75 places, 66 transitions, 602 flow. Second operand 11 states and 1382 transitions. [2023-08-26 18:18:22,381 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 85 places, 168 transitions, 1685 flow [2023-08-26 18:18:22,591 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 80 places, 168 transitions, 1567 flow, removed 49 selfloop flow, removed 5 redundant places. [2023-08-26 18:18:22,593 INFO L231 Difference]: Finished difference. Result has 83 places, 60 transitions, 520 flow [2023-08-26 18:18:22,593 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=268, PETRI_DIFFERENCE_MINUEND_FLOW=498, PETRI_DIFFERENCE_MINUEND_PLACES=70, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=66, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=26, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=39, PETRI_DIFFERENCE_SUBTRAHEND_STATES=11, PETRI_FLOW=520, PETRI_PLACES=83, PETRI_TRANSITIONS=60} [2023-08-26 18:18:22,593 INFO L281 CegarLoopForPetriNet]: 48 programPoint places, 35 predicate places. [2023-08-26 18:18:22,594 INFO L495 AbstractCegarLoop]: Abstraction has has 83 places, 60 transitions, 520 flow [2023-08-26 18:18:22,594 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 7 states, 7 states have (on average 118.71428571428571) internal successors, (831), 7 states have internal predecessors, (831), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-26 18:18:22,594 INFO L200 CegarLoopForPetriNet]: Found error trace [2023-08-26 18:18:22,594 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] [2023-08-26 18:18:22,594 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable9 [2023-08-26 18:18:22,594 INFO L420 AbstractCegarLoop]: === Iteration 11 === Targeting ULTIMATE.startErr8ASSERT_VIOLATIONASSERT === [P3Err0ASSERT_VIOLATIONASSERT, ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 12 more)] === [2023-08-26 18:18:22,595 INFO L145 PredicateUnifier]: Initialized classic predicate unifier [2023-08-26 18:18:22,595 INFO L85 PathProgramCache]: Analyzing trace with hash 2113944909, now seen corresponding path program 1 times [2023-08-26 18:18:22,595 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-08-26 18:18:22,595 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1136832135] [2023-08-26 18:18:22,595 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-08-26 18:18:22,595 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-08-26 18:18:22,624 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-08-26 18:18:22,996 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 18:18:22,996 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-08-26 18:18:22,996 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1136832135] [2023-08-26 18:18:22,996 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1136832135] provided 1 perfect and 0 imperfect interpolant sequences [2023-08-26 18:18:22,996 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-08-26 18:18:22,996 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2023-08-26 18:18:22,996 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [136250078] [2023-08-26 18:18:22,996 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-08-26 18:18:22,997 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 8 states [2023-08-26 18:18:22,997 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-08-26 18:18:22,997 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2023-08-26 18:18:22,997 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=15, Invalid=41, Unknown=0, NotChecked=0, Total=56 [2023-08-26 18:18:22,998 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 103 out of 268 [2023-08-26 18:18:22,999 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 83 places, 60 transitions, 520 flow. Second operand has 8 states, 8 states have (on average 106.125) internal successors, (849), 8 states have internal predecessors, (849), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-26 18:18:22,999 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2023-08-26 18:18:22,999 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 103 of 268 [2023-08-26 18:18:22,999 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2023-08-26 18:18:23,625 INFO L124 PetriNetUnfolderBase]: 2258/3589 cut-off events. [2023-08-26 18:18:23,625 INFO L125 PetriNetUnfolderBase]: For 16305/16305 co-relation queries the response was YES. [2023-08-26 18:18:23,637 INFO L83 FinitePrefix]: Finished finitePrefix Result has 18062 conditions, 3589 events. 2258/3589 cut-off events. For 16305/16305 co-relation queries the response was YES. Maximal size of possible extension queue 194. Compared 19605 event pairs, 58 based on Foata normal form. 1/3590 useless extension candidates. Maximal degree in co-relation 18037. Up to 1232 conditions per place. [2023-08-26 18:18:23,643 INFO L140 encePairwiseOnDemand]: 256/268 looper letters, 104 selfloop transitions, 46 changer transitions 111/261 dead transitions. [2023-08-26 18:18:23,643 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 92 places, 261 transitions, 2789 flow [2023-08-26 18:18:23,643 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 11 states. [2023-08-26 18:18:23,643 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 11 states. [2023-08-26 18:18:23,646 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 11 states to 11 states and 1242 transitions. [2023-08-26 18:18:23,647 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.42130257801899595 [2023-08-26 18:18:23,647 INFO L72 ComplementDD]: Start complementDD. Operand 11 states and 1242 transitions. [2023-08-26 18:18:23,647 INFO L73 IsDeterministic]: Start isDeterministic. Operand 11 states and 1242 transitions. [2023-08-26 18:18:23,648 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2023-08-26 18:18:23,648 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 11 states and 1242 transitions. [2023-08-26 18:18:23,651 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 12 states, 11 states have (on average 112.9090909090909) internal successors, (1242), 11 states have internal predecessors, (1242), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-26 18:18:23,654 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 12 states, 12 states have (on average 268.0) internal successors, (3216), 12 states have internal predecessors, (3216), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-26 18:18:23,655 INFO L81 ComplementDD]: Finished complementDD. Result has 12 states, 12 states have (on average 268.0) internal successors, (3216), 12 states have internal predecessors, (3216), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-26 18:18:23,655 INFO L175 Difference]: Start difference. First operand has 83 places, 60 transitions, 520 flow. Second operand 11 states and 1242 transitions. [2023-08-26 18:18:23,655 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 92 places, 261 transitions, 2789 flow [2023-08-26 18:18:23,724 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 78 places, 261 transitions, 2252 flow, removed 90 selfloop flow, removed 14 redundant places. [2023-08-26 18:18:23,727 INFO L231 Difference]: Finished difference. Result has 85 places, 92 transitions, 852 flow [2023-08-26 18:18:23,727 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=268, PETRI_DIFFERENCE_MINUEND_FLOW=384, PETRI_DIFFERENCE_MINUEND_PLACES=68, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=60, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=14, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=38, PETRI_DIFFERENCE_SUBTRAHEND_STATES=11, PETRI_FLOW=852, PETRI_PLACES=85, PETRI_TRANSITIONS=92} [2023-08-26 18:18:23,727 INFO L281 CegarLoopForPetriNet]: 48 programPoint places, 37 predicate places. [2023-08-26 18:18:23,728 INFO L495 AbstractCegarLoop]: Abstraction has has 85 places, 92 transitions, 852 flow [2023-08-26 18:18:23,728 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 8 states, 8 states have (on average 106.125) internal successors, (849), 8 states have internal predecessors, (849), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-26 18:18:23,728 INFO L200 CegarLoopForPetriNet]: Found error trace [2023-08-26 18:18:23,728 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-08-26 18:18:23,728 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable10 [2023-08-26 18:18:23,728 INFO L420 AbstractCegarLoop]: === Iteration 12 === Targeting ULTIMATE.startErr8ASSERT_VIOLATIONASSERT === [P3Err0ASSERT_VIOLATIONASSERT, ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 12 more)] === [2023-08-26 18:18:23,729 INFO L145 PredicateUnifier]: Initialized classic predicate unifier [2023-08-26 18:18:23,729 INFO L85 PathProgramCache]: Analyzing trace with hash 995030917, now seen corresponding path program 2 times [2023-08-26 18:18:23,729 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-08-26 18:18:23,729 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [999967118] [2023-08-26 18:18:23,729 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-08-26 18:18:23,729 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-08-26 18:18:23,759 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-08-26 18:18:23,887 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 18:18:23,888 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-08-26 18:18:23,888 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [999967118] [2023-08-26 18:18:23,888 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [999967118] provided 1 perfect and 0 imperfect interpolant sequences [2023-08-26 18:18:23,888 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-08-26 18:18:23,888 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2023-08-26 18:18:23,888 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [368384696] [2023-08-26 18:18:23,888 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-08-26 18:18:23,888 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2023-08-26 18:18:23,889 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-08-26 18:18:23,889 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2023-08-26 18:18:23,889 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2023-08-26 18:18:23,890 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 115 out of 268 [2023-08-26 18:18:23,890 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 85 places, 92 transitions, 852 flow. Second operand has 5 states, 5 states have (on average 119.6) internal successors, (598), 5 states have internal predecessors, (598), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-26 18:18:23,890 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2023-08-26 18:18:23,890 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 115 of 268 [2023-08-26 18:18:23,890 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2023-08-26 18:18:24,172 INFO L124 PetriNetUnfolderBase]: 1183/1977 cut-off events. [2023-08-26 18:18:24,172 INFO L125 PetriNetUnfolderBase]: For 8138/8192 co-relation queries the response was YES. [2023-08-26 18:18:24,178 INFO L83 FinitePrefix]: Finished finitePrefix Result has 9209 conditions, 1977 events. 1183/1977 cut-off events. For 8138/8192 co-relation queries the response was YES. Maximal size of possible extension queue 119. Compared 10181 event pairs, 169 based on Foata normal form. 26/1999 useless extension candidates. Maximal degree in co-relation 9185. Up to 954 conditions per place. [2023-08-26 18:18:24,180 INFO L140 encePairwiseOnDemand]: 264/268 looper letters, 46 selfloop transitions, 1 changer transitions 85/136 dead transitions. [2023-08-26 18:18:24,180 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 79 places, 136 transitions, 1393 flow [2023-08-26 18:18:24,180 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2023-08-26 18:18:24,180 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 5 states. [2023-08-26 18:18:24,181 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 623 transitions. [2023-08-26 18:18:24,182 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.46492537313432836 [2023-08-26 18:18:24,182 INFO L72 ComplementDD]: Start complementDD. Operand 5 states and 623 transitions. [2023-08-26 18:18:24,182 INFO L73 IsDeterministic]: Start isDeterministic. Operand 5 states and 623 transitions. [2023-08-26 18:18:24,182 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2023-08-26 18:18:24,182 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 5 states and 623 transitions. [2023-08-26 18:18:24,184 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 6 states, 5 states have (on average 124.6) internal successors, (623), 5 states have internal predecessors, (623), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-26 18:18:24,185 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 6 states, 6 states have (on average 268.0) internal successors, (1608), 6 states have internal predecessors, (1608), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-26 18:18:24,186 INFO L81 ComplementDD]: Finished complementDD. Result has 6 states, 6 states have (on average 268.0) internal successors, (1608), 6 states have internal predecessors, (1608), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-26 18:18:24,186 INFO L175 Difference]: Start difference. First operand has 85 places, 92 transitions, 852 flow. Second operand 5 states and 623 transitions. [2023-08-26 18:18:24,186 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 79 places, 136 transitions, 1393 flow [2023-08-26 18:18:24,219 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 73 places, 136 transitions, 1369 flow, removed 12 selfloop flow, removed 6 redundant places. [2023-08-26 18:18:24,220 INFO L231 Difference]: Finished difference. Result has 76 places, 48 transitions, 368 flow [2023-08-26 18:18:24,220 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=268, PETRI_DIFFERENCE_MINUEND_FLOW=838, PETRI_DIFFERENCE_MINUEND_PLACES=69, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=92, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=1, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=91, PETRI_DIFFERENCE_SUBTRAHEND_STATES=5, PETRI_FLOW=368, PETRI_PLACES=76, PETRI_TRANSITIONS=48} [2023-08-26 18:18:24,221 INFO L281 CegarLoopForPetriNet]: 48 programPoint places, 28 predicate places. [2023-08-26 18:18:24,221 INFO L495 AbstractCegarLoop]: Abstraction has has 76 places, 48 transitions, 368 flow [2023-08-26 18:18:24,221 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 119.6) internal successors, (598), 5 states have internal predecessors, (598), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-26 18:18:24,222 INFO L200 CegarLoopForPetriNet]: Found error trace [2023-08-26 18:18:24,222 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] [2023-08-26 18:18:24,222 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable11 [2023-08-26 18:18:24,222 INFO L420 AbstractCegarLoop]: === Iteration 13 === Targeting ULTIMATE.startErr8ASSERT_VIOLATIONASSERT === [P3Err0ASSERT_VIOLATIONASSERT, ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 12 more)] === [2023-08-26 18:18:24,222 INFO L145 PredicateUnifier]: Initialized classic predicate unifier [2023-08-26 18:18:24,222 INFO L85 PathProgramCache]: Analyzing trace with hash -464312433, now seen corresponding path program 3 times [2023-08-26 18:18:24,222 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-08-26 18:18:24,223 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1223651719] [2023-08-26 18:18:24,223 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-08-26 18:18:24,223 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-08-26 18:18:24,251 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-08-26 18:18:24,371 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 18:18:24,372 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-08-26 18:18:24,372 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1223651719] [2023-08-26 18:18:24,372 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1223651719] provided 1 perfect and 0 imperfect interpolant sequences [2023-08-26 18:18:24,372 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-08-26 18:18:24,372 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2023-08-26 18:18:24,372 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [632369436] [2023-08-26 18:18:24,372 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-08-26 18:18:24,372 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2023-08-26 18:18:24,373 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-08-26 18:18:24,373 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2023-08-26 18:18:24,373 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2023-08-26 18:18:24,373 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 116 out of 268 [2023-08-26 18:18:24,374 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 76 places, 48 transitions, 368 flow. Second operand has 4 states, 4 states have (on average 121.75) internal successors, (487), 4 states have internal predecessors, (487), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-26 18:18:24,374 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2023-08-26 18:18:24,374 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 116 of 268 [2023-08-26 18:18:24,374 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2023-08-26 18:18:24,486 INFO L124 PetriNetUnfolderBase]: 339/599 cut-off events. [2023-08-26 18:18:24,486 INFO L125 PetriNetUnfolderBase]: For 2724/2734 co-relation queries the response was YES. [2023-08-26 18:18:24,488 INFO L83 FinitePrefix]: Finished finitePrefix Result has 2825 conditions, 599 events. 339/599 cut-off events. For 2724/2734 co-relation queries the response was YES. Maximal size of possible extension queue 44. Compared 2459 event pairs, 112 based on Foata normal form. 9/598 useless extension candidates. Maximal degree in co-relation 2803. Up to 366 conditions per place. [2023-08-26 18:18:24,489 INFO L140 encePairwiseOnDemand]: 264/268 looper letters, 43 selfloop transitions, 2 changer transitions 22/69 dead transitions. [2023-08-26 18:18:24,489 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 72 places, 69 transitions, 624 flow [2023-08-26 18:18:24,489 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2023-08-26 18:18:24,489 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 4 states. [2023-08-26 18:18:24,490 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 498 transitions. [2023-08-26 18:18:24,491 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.46455223880597013 [2023-08-26 18:18:24,491 INFO L72 ComplementDD]: Start complementDD. Operand 4 states and 498 transitions. [2023-08-26 18:18:24,491 INFO L73 IsDeterministic]: Start isDeterministic. Operand 4 states and 498 transitions. [2023-08-26 18:18:24,491 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2023-08-26 18:18:24,491 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 4 states and 498 transitions. [2023-08-26 18:18:24,492 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 5 states, 4 states have (on average 124.5) internal successors, (498), 4 states have internal predecessors, (498), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-26 18:18:24,494 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 5 states, 5 states have (on average 268.0) internal successors, (1340), 5 states have internal predecessors, (1340), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-26 18:18:24,494 INFO L81 ComplementDD]: Finished complementDD. Result has 5 states, 5 states have (on average 268.0) internal successors, (1340), 5 states have internal predecessors, (1340), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-26 18:18:24,494 INFO L175 Difference]: Start difference. First operand has 76 places, 48 transitions, 368 flow. Second operand 4 states and 498 transitions. [2023-08-26 18:18:24,494 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 72 places, 69 transitions, 624 flow [2023-08-26 18:18:24,500 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 62 places, 69 transitions, 550 flow, removed 11 selfloop flow, removed 10 redundant places. [2023-08-26 18:18:24,501 INFO L231 Difference]: Finished difference. Result has 64 places, 37 transitions, 216 flow [2023-08-26 18:18:24,501 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=268, PETRI_DIFFERENCE_MINUEND_FLOW=303, PETRI_DIFFERENCE_MINUEND_PLACES=59, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=48, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=2, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=46, PETRI_DIFFERENCE_SUBTRAHEND_STATES=4, PETRI_FLOW=216, PETRI_PLACES=64, PETRI_TRANSITIONS=37} [2023-08-26 18:18:24,502 INFO L281 CegarLoopForPetriNet]: 48 programPoint places, 16 predicate places. [2023-08-26 18:18:24,503 INFO L495 AbstractCegarLoop]: Abstraction has has 64 places, 37 transitions, 216 flow [2023-08-26 18:18:24,503 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 121.75) internal successors, (487), 4 states have internal predecessors, (487), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-26 18:18:24,503 INFO L200 CegarLoopForPetriNet]: Found error trace [2023-08-26 18:18:24,503 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] [2023-08-26 18:18:24,503 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable12 [2023-08-26 18:18:24,503 INFO L420 AbstractCegarLoop]: === Iteration 14 === Targeting ULTIMATE.startErr8ASSERT_VIOLATIONASSERT === [P3Err0ASSERT_VIOLATIONASSERT, ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 12 more)] === [2023-08-26 18:18:24,504 INFO L145 PredicateUnifier]: Initialized classic predicate unifier [2023-08-26 18:18:24,504 INFO L85 PathProgramCache]: Analyzing trace with hash -1558414457, now seen corresponding path program 4 times [2023-08-26 18:18:24,504 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-08-26 18:18:24,504 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1404002174] [2023-08-26 18:18:24,504 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-08-26 18:18:24,504 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-08-26 18:18:24,553 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-08-26 18:18:25,036 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 18:18:25,036 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-08-26 18:18:25,036 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1404002174] [2023-08-26 18:18:25,036 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1404002174] provided 1 perfect and 0 imperfect interpolant sequences [2023-08-26 18:18:25,036 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-08-26 18:18:25,036 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2023-08-26 18:18:25,036 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1813273376] [2023-08-26 18:18:25,037 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-08-26 18:18:25,037 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2023-08-26 18:18:25,037 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-08-26 18:18:25,037 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2023-08-26 18:18:25,037 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=11, Invalid=31, Unknown=0, NotChecked=0, Total=42 [2023-08-26 18:18:25,038 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 113 out of 268 [2023-08-26 18:18:25,039 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 64 places, 37 transitions, 216 flow. Second operand has 7 states, 7 states have (on average 116.14285714285714) internal successors, (813), 7 states have internal predecessors, (813), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-26 18:18:25,039 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2023-08-26 18:18:25,039 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 113 of 268 [2023-08-26 18:18:25,039 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2023-08-26 18:18:25,164 INFO L124 PetriNetUnfolderBase]: 94/190 cut-off events. [2023-08-26 18:18:25,165 INFO L125 PetriNetUnfolderBase]: For 398/400 co-relation queries the response was YES. [2023-08-26 18:18:25,165 INFO L83 FinitePrefix]: Finished finitePrefix Result has 797 conditions, 190 events. 94/190 cut-off events. For 398/400 co-relation queries the response was YES. Maximal size of possible extension queue 16. Compared 536 event pairs, 18 based on Foata normal form. 1/190 useless extension candidates. Maximal degree in co-relation 779. Up to 61 conditions per place. [2023-08-26 18:18:25,166 INFO L140 encePairwiseOnDemand]: 261/268 looper letters, 35 selfloop transitions, 3 changer transitions 33/74 dead transitions. [2023-08-26 18:18:25,166 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 69 places, 74 transitions, 579 flow [2023-08-26 18:18:25,166 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2023-08-26 18:18:25,166 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 8 states. [2023-08-26 18:18:25,168 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 8 states to 8 states and 944 transitions. [2023-08-26 18:18:25,168 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.44029850746268656 [2023-08-26 18:18:25,168 INFO L72 ComplementDD]: Start complementDD. Operand 8 states and 944 transitions. [2023-08-26 18:18:25,169 INFO L73 IsDeterministic]: Start isDeterministic. Operand 8 states and 944 transitions. [2023-08-26 18:18:25,169 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2023-08-26 18:18:25,169 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 8 states and 944 transitions. [2023-08-26 18:18:25,171 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 9 states, 8 states have (on average 118.0) internal successors, (944), 8 states have internal predecessors, (944), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-26 18:18:25,173 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 9 states, 9 states have (on average 268.0) internal successors, (2412), 9 states have internal predecessors, (2412), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-26 18:18:25,174 INFO L81 ComplementDD]: Finished complementDD. Result has 9 states, 9 states have (on average 268.0) internal successors, (2412), 9 states have internal predecessors, (2412), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-26 18:18:25,174 INFO L175 Difference]: Start difference. First operand has 64 places, 37 transitions, 216 flow. Second operand 8 states and 944 transitions. [2023-08-26 18:18:25,174 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 69 places, 74 transitions, 579 flow [2023-08-26 18:18:25,176 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 54 places, 74 transitions, 500 flow, removed 13 selfloop flow, removed 15 redundant places. [2023-08-26 18:18:25,177 INFO L231 Difference]: Finished difference. Result has 58 places, 37 transitions, 178 flow [2023-08-26 18:18:25,177 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=268, PETRI_DIFFERENCE_MINUEND_FLOW=162, PETRI_DIFFERENCE_MINUEND_PLACES=47, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=37, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=3, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=34, PETRI_DIFFERENCE_SUBTRAHEND_STATES=8, PETRI_FLOW=178, PETRI_PLACES=58, PETRI_TRANSITIONS=37} [2023-08-26 18:18:25,178 INFO L281 CegarLoopForPetriNet]: 48 programPoint places, 10 predicate places. [2023-08-26 18:18:25,178 INFO L495 AbstractCegarLoop]: Abstraction has has 58 places, 37 transitions, 178 flow [2023-08-26 18:18:25,178 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 7 states, 7 states have (on average 116.14285714285714) internal successors, (813), 7 states have internal predecessors, (813), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-26 18:18:25,178 INFO L200 CegarLoopForPetriNet]: Found error trace [2023-08-26 18:18:25,178 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] [2023-08-26 18:18:25,178 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable13 [2023-08-26 18:18:25,179 INFO L420 AbstractCegarLoop]: === Iteration 15 === Targeting ULTIMATE.startErr8ASSERT_VIOLATIONASSERT === [P3Err0ASSERT_VIOLATIONASSERT, ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 12 more)] === [2023-08-26 18:18:25,179 INFO L145 PredicateUnifier]: Initialized classic predicate unifier [2023-08-26 18:18:25,179 INFO L85 PathProgramCache]: Analyzing trace with hash 1713530695, now seen corresponding path program 5 times [2023-08-26 18:18:25,179 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-08-26 18:18:25,179 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [445422305] [2023-08-26 18:18:25,179 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-08-26 18:18:25,179 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-08-26 18:18:25,209 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2023-08-26 18:18:25,209 INFO L356 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2023-08-26 18:18:25,231 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2023-08-26 18:18:25,257 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2023-08-26 18:18:25,257 INFO L360 BasicCegarLoop]: Counterexample is feasible [2023-08-26 18:18:25,258 INFO L805 garLoopResultBuilder]: Registering result UNSAFE for location ULTIMATE.startErr8ASSERT_VIOLATIONASSERT (14 of 15 remaining) [2023-08-26 18:18:25,259 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location P3Err0ASSERT_VIOLATIONASSERT (13 of 15 remaining) [2023-08-26 18:18:25,259 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE (12 of 15 remaining) [2023-08-26 18:18:25,259 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE (11 of 15 remaining) [2023-08-26 18:18:25,260 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (10 of 15 remaining) [2023-08-26 18:18:25,260 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr3REQUIRES_VIOLATIONMEMORY_DEREFERENCE (9 of 15 remaining) [2023-08-26 18:18:25,260 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr4REQUIRES_VIOLATIONMEMORY_DEREFERENCE (8 of 15 remaining) [2023-08-26 18:18:25,260 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr5REQUIRES_VIOLATIONMEMORY_DEREFERENCE (7 of 15 remaining) [2023-08-26 18:18:25,260 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr6REQUIRES_VIOLATIONMEMORY_DEREFERENCE (6 of 15 remaining) [2023-08-26 18:18:25,260 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr7REQUIRES_VIOLATIONMEMORY_DEREFERENCE (5 of 15 remaining) [2023-08-26 18:18:25,261 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (4 of 15 remaining) [2023-08-26 18:18:25,261 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (3 of 15 remaining) [2023-08-26 18:18:25,261 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr2INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (2 of 15 remaining) [2023-08-26 18:18:25,261 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr3INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (1 of 15 remaining) [2023-08-26 18:18:25,261 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location P3Err0ASSERT_VIOLATIONASSERT (0 of 15 remaining) [2023-08-26 18:18:25,261 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable14 [2023-08-26 18:18:25,262 INFO L445 BasicCegarLoop]: Path program histogram: [5, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-08-26 18:18:25,267 INFO L228 ceAbstractionStarter]: Analysis of concurrent program completed with 1 thread instances [2023-08-26 18:18:25,267 INFO L178 ceAbstractionStarter]: Computing trace abstraction results [2023-08-26 18:18:25,333 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 26.08 06:18:25 BasicIcfg [2023-08-26 18:18:25,333 INFO L131 PluginConnector]: ------------------------ END TraceAbstraction---------------------------- [2023-08-26 18:18:25,333 INFO L158 Benchmark]: Toolchain (without parser) took 19843.28ms. Allocated memory was 358.6MB in the beginning and 1.1GB in the end (delta: 771.8MB). Free memory was 313.0MB in the beginning and 438.1MB in the end (delta: -125.1MB). Peak memory consumption was 648.7MB. Max. memory is 16.0GB. [2023-08-26 18:18:25,333 INFO L158 Benchmark]: CDTParser took 0.16ms. Allocated memory is still 358.6MB. Free memory is still 336.3MB. There was no memory consumed. Max. memory is 16.0GB. [2023-08-26 18:18:25,334 INFO L158 Benchmark]: CACSL2BoogieTranslator took 515.62ms. Allocated memory is still 358.6MB. Free memory was 313.0MB in the beginning and 289.9MB in the end (delta: 23.1MB). Peak memory consumption was 23.1MB. Max. memory is 16.0GB. [2023-08-26 18:18:25,334 INFO L158 Benchmark]: Boogie Procedure Inliner took 65.38ms. Allocated memory is still 358.6MB. Free memory was 289.9MB in the beginning and 286.7MB in the end (delta: 3.1MB). Peak memory consumption was 2.1MB. Max. memory is 16.0GB. [2023-08-26 18:18:25,334 INFO L158 Benchmark]: Boogie Preprocessor took 47.09ms. Allocated memory is still 358.6MB. Free memory was 286.7MB in the beginning and 285.7MB in the end (delta: 1.1MB). Peak memory consumption was 2.1MB. Max. memory is 16.0GB. [2023-08-26 18:18:25,334 INFO L158 Benchmark]: RCFGBuilder took 684.19ms. Allocated memory is still 358.6MB. Free memory was 285.7MB in the beginning and 250.0MB in the end (delta: 35.7MB). Peak memory consumption was 35.7MB. Max. memory is 16.0GB. [2023-08-26 18:18:25,334 INFO L158 Benchmark]: TraceAbstraction took 18524.12ms. Allocated memory was 358.6MB in the beginning and 1.1GB in the end (delta: 771.8MB). Free memory was 250.0MB in the beginning and 438.1MB in the end (delta: -188.1MB). Peak memory consumption was 585.8MB. Max. memory is 16.0GB. [2023-08-26 18:18:25,335 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.16ms. Allocated memory is still 358.6MB. Free memory is still 336.3MB. There was no memory consumed. Max. memory is 16.0GB. * CACSL2BoogieTranslator took 515.62ms. Allocated memory is still 358.6MB. Free memory was 313.0MB in the beginning and 289.9MB in the end (delta: 23.1MB). Peak memory consumption was 23.1MB. Max. memory is 16.0GB. * Boogie Procedure Inliner took 65.38ms. Allocated memory is still 358.6MB. Free memory was 289.9MB in the beginning and 286.7MB in the end (delta: 3.1MB). Peak memory consumption was 2.1MB. Max. memory is 16.0GB. * Boogie Preprocessor took 47.09ms. Allocated memory is still 358.6MB. Free memory was 286.7MB in the beginning and 285.7MB in the end (delta: 1.1MB). Peak memory consumption was 2.1MB. Max. memory is 16.0GB. * RCFGBuilder took 684.19ms. Allocated memory is still 358.6MB. Free memory was 285.7MB in the beginning and 250.0MB in the end (delta: 35.7MB). Peak memory consumption was 35.7MB. Max. memory is 16.0GB. * TraceAbstraction took 18524.12ms. Allocated memory was 358.6MB in the beginning and 1.1GB in the end (delta: 771.8MB). Free memory was 250.0MB in the beginning and 438.1MB in the end (delta: -188.1MB). Peak memory consumption was 585.8MB. Max. memory is 16.0GB. * Results from de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator: - GenericResultAtLocation [Line: 267]: Unsoundness Warning unspecified type, defaulting to int C: short [267] - GenericResultAtLocation [Line: 267]: Unsoundness Warning unspecified type, defaulting to int C: short [267] * Results from de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: - StatisticsResult: PetriNetLargeBlockEncoding benchmarks Lipton Reduction Statistics: ReductionTime: 4.4s, 143 PlacesBefore, 48 PlacesAfterwards, 133 TransitionsBefore, 36 TransitionsAfterwards, 2972 CoEnabledTransitionPairs, 7 FixpointIterations, 47 TrivialSequentialCompositions, 68 ConcurrentSequentialCompositions, 0 TrivialYvCompositions, 14 ConcurrentYvCompositions, 2 ChoiceCompositions, 131 TotalNumberOfCompositions, 7409 MoverChecksTotal, Independence Relation Statistics: CachedIndependenceRelation.Independence Queries: [ total: 4244, independent: 4063, independent conditional: 0, independent unconditional: 4063, dependent: 181, dependent conditional: 0, dependent unconditional: 181, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , CachedIndependenceRelation.Statistics on underlying relation: SyntacticIndependenceRelation.Independence Queries: [ total: 1632, independent: 1607, independent conditional: 0, independent unconditional: 1607, dependent: 25, dependent conditional: 0, dependent unconditional: 25, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , Cache Queries: [ total: 4244, independent: 2456, independent conditional: 0, independent unconditional: 2456, dependent: 156, dependent conditional: 0, dependent unconditional: 156, unknown: 1632, unknown conditional: 0, unknown unconditional: 1632] , Statistics on independence cache: Total cache size (in pairs): 178, Positive cache size: 166, Positive conditional cache size: 0, Positive unconditional cache size: 166, Negative cache size: 12, Negative conditional cache size: 0, Negative unconditional cache size: 12, Unknown cache size: 0, Unknown conditional cache size: 0, Unknown unconditional cache size: 0 - CounterExampleResult [Line: 17]: assertion can be violated assertion can be violated We found a FailurePath: [L710] 0 int __unbuffered_cnt = 0; [L712] 0 int __unbuffered_p2_EAX = 0; [L714] 0 int __unbuffered_p3_EAX = 0; [L716] 0 int a = 0; [L717] 0 _Bool main$tmp_guard0; [L718] 0 _Bool main$tmp_guard1; [L720] 0 int x = 0; [L722] 0 int y = 0; [L724] 0 int z = 0; [L725] 0 _Bool z$flush_delayed; [L726] 0 int z$mem_tmp; [L727] 0 _Bool z$r_buff0_thd0; [L728] 0 _Bool z$r_buff0_thd1; [L729] 0 _Bool z$r_buff0_thd2; [L730] 0 _Bool z$r_buff0_thd3; [L731] 0 _Bool z$r_buff0_thd4; [L732] 0 _Bool z$r_buff1_thd0; [L733] 0 _Bool z$r_buff1_thd1; [L734] 0 _Bool z$r_buff1_thd2; [L735] 0 _Bool z$r_buff1_thd3; [L736] 0 _Bool z$r_buff1_thd4; [L737] 0 _Bool z$read_delayed; [L738] 0 int *z$read_delayed_var; [L739] 0 int z$w_buff0; [L740] 0 _Bool z$w_buff0_used; [L741] 0 int z$w_buff1; [L742] 0 _Bool z$w_buff1_used; [L743] 0 _Bool weak$$choice0; [L744] 0 _Bool weak$$choice2; [L844] 0 pthread_t t1413; [L845] FCALL, FORK 0 pthread_create(&t1413, ((void *)0), P0, ((void *)0)) VAL [__unbuffered_cnt=0, __unbuffered_p2_EAX=0, __unbuffered_p3_EAX=0, a=0, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, pthread_create(&t1413, ((void *)0), P0, ((void *)0))=-2, t1413={5:0}, weak$$choice0=0, weak$$choice2=0, x=0, y=0, z$flush_delayed=0, z$mem_tmp=0, z$r_buff0_thd0=0, z$r_buff0_thd1=0, z$r_buff0_thd2=0, z$r_buff0_thd3=0, z$r_buff0_thd4=0, z$r_buff1_thd0=0, z$r_buff1_thd1=0, z$r_buff1_thd2=0, z$r_buff1_thd3=0, z$r_buff1_thd4=0, z$read_delayed=0, z$read_delayed_var={0:0}, z$w_buff0=0, z$w_buff0_used=0, z$w_buff1=0, z$w_buff1_used=0, z=0] [L846] 0 pthread_t t1414; [L847] FCALL, FORK 0 pthread_create(&t1414, ((void *)0), P1, ((void *)0)) VAL [__unbuffered_cnt=0, __unbuffered_p2_EAX=0, __unbuffered_p3_EAX=0, a=0, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, pthread_create(&t1414, ((void *)0), P1, ((void *)0))=-1, t1413={5:0}, t1414={6:0}, weak$$choice0=0, weak$$choice2=0, x=0, y=0, z$flush_delayed=0, z$mem_tmp=0, z$r_buff0_thd0=0, z$r_buff0_thd1=0, z$r_buff0_thd2=0, z$r_buff0_thd3=0, z$r_buff0_thd4=0, z$r_buff1_thd0=0, z$r_buff1_thd1=0, z$r_buff1_thd2=0, z$r_buff1_thd3=0, z$r_buff1_thd4=0, z$read_delayed=0, z$read_delayed_var={0:0}, z$w_buff0=0, z$w_buff0_used=0, z$w_buff1=0, z$w_buff1_used=0, z=0] [L848] 0 pthread_t t1415; [L849] FCALL, FORK 0 pthread_create(&t1415, ((void *)0), P2, ((void *)0)) VAL [__unbuffered_cnt=0, __unbuffered_p2_EAX=0, __unbuffered_p3_EAX=0, a=0, arg={0:0}, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, pthread_create(&t1415, ((void *)0), P2, ((void *)0))=0, t1413={5:0}, t1414={6:0}, t1415={7:0}, weak$$choice0=0, weak$$choice2=0, x=0, y=0, z$flush_delayed=0, z$mem_tmp=0, z$r_buff0_thd0=0, z$r_buff0_thd1=0, z$r_buff0_thd2=0, z$r_buff0_thd3=0, z$r_buff0_thd4=0, z$r_buff1_thd0=0, z$r_buff1_thd1=0, z$r_buff1_thd2=0, z$r_buff1_thd3=0, z$r_buff1_thd4=0, z$read_delayed=0, z$read_delayed_var={0:0}, z$w_buff0=0, z$w_buff0_used=0, z$w_buff1=0, z$w_buff1_used=0, z=0] [L850] 0 pthread_t t1416; [L851] FCALL, FORK 0 pthread_create(&t1416, ((void *)0), P3, ((void *)0)) VAL [__unbuffered_cnt=0, __unbuffered_p2_EAX=0, __unbuffered_p3_EAX=0, a=0, arg={0:0}, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, pthread_create(&t1416, ((void *)0), P3, ((void *)0))=1, t1413={5:0}, t1414={6:0}, t1415={7:0}, t1416={3:0}, weak$$choice0=0, weak$$choice2=0, x=0, y=0, z$flush_delayed=0, z$mem_tmp=0, z$r_buff0_thd0=0, z$r_buff0_thd1=0, z$r_buff0_thd2=0, z$r_buff0_thd3=0, z$r_buff0_thd4=0, z$r_buff1_thd0=0, z$r_buff1_thd1=0, z$r_buff1_thd2=0, z$r_buff1_thd3=0, z$r_buff1_thd4=0, z$read_delayed=0, z$read_delayed_var={0:0}, z$w_buff0=0, z$w_buff0_used=0, z$w_buff1=0, z$w_buff1_used=0, z=0] [L806] 4 z$w_buff1 = z$w_buff0 [L807] 4 z$w_buff0 = 1 [L808] 4 z$w_buff1_used = z$w_buff0_used [L809] 4 z$w_buff0_used = (_Bool)1 [L810] CALL 4 __VERIFIER_assert(!(z$w_buff1_used && z$w_buff0_used)) [L18] COND FALSE 4 !(!expression) [L810] RET 4 __VERIFIER_assert(!(z$w_buff1_used && z$w_buff0_used)) [L811] 4 z$r_buff1_thd0 = z$r_buff0_thd0 [L812] 4 z$r_buff1_thd1 = z$r_buff0_thd1 [L813] 4 z$r_buff1_thd2 = z$r_buff0_thd2 [L814] 4 z$r_buff1_thd3 = z$r_buff0_thd3 [L815] 4 z$r_buff1_thd4 = z$r_buff0_thd4 [L816] 4 z$r_buff0_thd4 = (_Bool)1 VAL [__unbuffered_cnt=0, __unbuffered_p2_EAX=0, __unbuffered_p3_EAX=0, a=0, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=0, x=0, y=0, z$flush_delayed=0, z$mem_tmp=0, z$r_buff0_thd0=0, z$r_buff0_thd1=0, z$r_buff0_thd2=0, z$r_buff0_thd3=0, z$r_buff0_thd4=1, z$r_buff1_thd0=0, z$r_buff1_thd1=0, z$r_buff1_thd2=0, z$r_buff1_thd3=0, z$r_buff1_thd4=0, z$read_delayed=0, z$read_delayed_var={0:0}, z$w_buff0=1, z$w_buff0_used=1, z$w_buff1=0, z$w_buff1_used=0, z=0] [L819] 4 __unbuffered_p3_EAX = a VAL [__unbuffered_cnt=0, __unbuffered_p2_EAX=0, __unbuffered_p3_EAX=0, a=0, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=0, x=0, y=0, z$flush_delayed=0, z$mem_tmp=0, z$r_buff0_thd0=0, z$r_buff0_thd1=0, z$r_buff0_thd2=0, z$r_buff0_thd3=0, z$r_buff0_thd4=1, z$r_buff1_thd0=0, z$r_buff1_thd1=0, z$r_buff1_thd2=0, z$r_buff1_thd3=0, z$r_buff1_thd4=0, z$read_delayed=0, z$read_delayed_var={0:0}, z$w_buff0=1, z$w_buff0_used=1, z$w_buff1=0, z$w_buff1_used=0, z=0] [L748] 1 a = 1 VAL [__unbuffered_cnt=0, __unbuffered_p2_EAX=0, __unbuffered_p3_EAX=0, a=1, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=0, x=0, y=0, z$flush_delayed=0, z$mem_tmp=0, z$r_buff0_thd0=0, z$r_buff0_thd1=0, z$r_buff0_thd2=0, z$r_buff0_thd3=0, z$r_buff0_thd4=1, z$r_buff1_thd0=0, z$r_buff1_thd1=0, z$r_buff1_thd2=0, z$r_buff1_thd3=0, z$r_buff1_thd4=0, z$read_delayed=0, z$read_delayed_var={0:0}, z$w_buff0=1, z$w_buff0_used=1, z$w_buff1=0, z$w_buff1_used=0, z=0] [L751] 1 x = 1 VAL [__unbuffered_cnt=0, __unbuffered_p2_EAX=0, __unbuffered_p3_EAX=0, a=1, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=0, x=1, y=0, z$flush_delayed=0, z$mem_tmp=0, z$r_buff0_thd0=0, z$r_buff0_thd1=0, z$r_buff0_thd2=0, z$r_buff0_thd3=0, z$r_buff0_thd4=1, z$r_buff1_thd0=0, z$r_buff1_thd1=0, z$r_buff1_thd2=0, z$r_buff1_thd3=0, z$r_buff1_thd4=0, z$read_delayed=0, z$read_delayed_var={0:0}, z$w_buff0=1, z$w_buff0_used=1, z$w_buff1=0, z$w_buff1_used=0, z=0] [L756] 1 __unbuffered_cnt = __unbuffered_cnt + 1 [L758] 1 return 0; [L763] 2 x = 2 VAL [\result={0:0}, __unbuffered_cnt=1, __unbuffered_p2_EAX=0, __unbuffered_p3_EAX=0, a=1, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=0, x=2, y=0, z$flush_delayed=0, z$mem_tmp=0, z$r_buff0_thd0=0, z$r_buff0_thd1=0, z$r_buff0_thd2=0, z$r_buff0_thd3=0, z$r_buff0_thd4=1, z$r_buff1_thd0=0, z$r_buff1_thd1=0, z$r_buff1_thd2=0, z$r_buff1_thd3=0, z$r_buff1_thd4=0, z$read_delayed=0, z$read_delayed_var={0:0}, z$w_buff0=1, z$w_buff0_used=1, z$w_buff1=0, z$w_buff1_used=0, z=0] [L766] 2 y = 1 VAL [\result={0:0}, __unbuffered_cnt=1, __unbuffered_p2_EAX=0, __unbuffered_p3_EAX=0, a=1, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=0, x=2, y=1, z$flush_delayed=0, z$mem_tmp=0, z$r_buff0_thd0=0, z$r_buff0_thd1=0, z$r_buff0_thd2=0, z$r_buff0_thd3=0, z$r_buff0_thd4=1, z$r_buff1_thd0=0, z$r_buff1_thd1=0, z$r_buff1_thd2=0, z$r_buff1_thd3=0, z$r_buff1_thd4=0, z$read_delayed=0, z$read_delayed_var={0:0}, z$w_buff0=1, z$w_buff0_used=1, z$w_buff1=0, z$w_buff1_used=0, z=0] [L778] 3 y = 2 VAL [\result={0:0}, __unbuffered_cnt=1, __unbuffered_p2_EAX=0, __unbuffered_p3_EAX=0, a=1, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=0, x=2, y=2, z$flush_delayed=0, z$mem_tmp=0, z$r_buff0_thd0=0, z$r_buff0_thd1=0, z$r_buff0_thd2=0, z$r_buff0_thd3=0, z$r_buff0_thd4=1, z$r_buff1_thd0=0, z$r_buff1_thd1=0, z$r_buff1_thd2=0, z$r_buff1_thd3=0, z$r_buff1_thd4=0, z$read_delayed=0, z$read_delayed_var={0:0}, z$w_buff0=1, z$w_buff0_used=1, z$w_buff1=0, z$w_buff1_used=0, z=0] [L771] 2 __unbuffered_cnt = __unbuffered_cnt + 1 [L773] 2 return 0; [L781] 3 weak$$choice0 = __VERIFIER_nondet_bool() [L782] 3 weak$$choice2 = __VERIFIER_nondet_bool() [L783] 3 z$flush_delayed = weak$$choice2 [L784] 3 z$mem_tmp = z [L785] 3 z = !z$w_buff0_used || !z$r_buff0_thd3 && !z$w_buff1_used || !z$r_buff0_thd3 && !z$r_buff1_thd3 ? z : (z$w_buff0_used && z$r_buff0_thd3 ? z$w_buff0 : z$w_buff1) [L786] 3 z$w_buff0 = weak$$choice2 ? z$w_buff0 : (!z$w_buff0_used || !z$r_buff0_thd3 && !z$w_buff1_used || !z$r_buff0_thd3 && !z$r_buff1_thd3 ? z$w_buff0 : (z$w_buff0_used && z$r_buff0_thd3 ? z$w_buff0 : z$w_buff0)) [L787] 3 z$w_buff1 = weak$$choice2 ? z$w_buff1 : (!z$w_buff0_used || !z$r_buff0_thd3 && !z$w_buff1_used || !z$r_buff0_thd3 && !z$r_buff1_thd3 ? z$w_buff1 : (z$w_buff0_used && z$r_buff0_thd3 ? z$w_buff1 : z$w_buff1)) [L788] 3 z$w_buff0_used = weak$$choice2 ? z$w_buff0_used : (!z$w_buff0_used || !z$r_buff0_thd3 && !z$w_buff1_used || !z$r_buff0_thd3 && !z$r_buff1_thd3 ? z$w_buff0_used : (z$w_buff0_used && z$r_buff0_thd3 ? (_Bool)0 : z$w_buff0_used)) [L789] 3 z$w_buff1_used = weak$$choice2 ? z$w_buff1_used : (!z$w_buff0_used || !z$r_buff0_thd3 && !z$w_buff1_used || !z$r_buff0_thd3 && !z$r_buff1_thd3 ? z$w_buff1_used : (z$w_buff0_used && z$r_buff0_thd3 ? (_Bool)0 : (_Bool)0)) [L790] 3 z$r_buff0_thd3 = weak$$choice2 ? z$r_buff0_thd3 : (!z$w_buff0_used || !z$r_buff0_thd3 && !z$w_buff1_used || !z$r_buff0_thd3 && !z$r_buff1_thd3 ? z$r_buff0_thd3 : (z$w_buff0_used && z$r_buff0_thd3 ? (_Bool)0 : z$r_buff0_thd3)) [L791] 3 z$r_buff1_thd3 = weak$$choice2 ? z$r_buff1_thd3 : (!z$w_buff0_used || !z$r_buff0_thd3 && !z$w_buff1_used || !z$r_buff0_thd3 && !z$r_buff1_thd3 ? z$r_buff1_thd3 : (z$w_buff0_used && z$r_buff0_thd3 ? (_Bool)0 : (_Bool)0)) [L792] 3 __unbuffered_p2_EAX = z [L793] 3 z = z$flush_delayed ? z$mem_tmp : z [L794] 3 z$flush_delayed = (_Bool)0 VAL [\result={0:0}, \result={0:0}, __unbuffered_cnt=2, __unbuffered_p2_EAX=0, __unbuffered_p3_EAX=0, a=1, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice2=0, x=2, y=2, z$flush_delayed=0, z$mem_tmp=0, z$r_buff0_thd0=0, z$r_buff0_thd1=0, z$r_buff0_thd2=0, z$r_buff0_thd3=0, z$r_buff0_thd4=1, z$r_buff1_thd0=0, z$r_buff1_thd1=0, z$r_buff1_thd2=0, z$r_buff1_thd3=0, z$r_buff1_thd4=0, z$read_delayed=0, z$read_delayed_var={0:0}, z$w_buff0=1, z$w_buff0_used=1, z$w_buff1=0, z$w_buff1_used=0, z=0] [L822] 4 z = z$w_buff0_used && z$r_buff0_thd4 ? z$w_buff0 : (z$w_buff1_used && z$r_buff1_thd4 ? z$w_buff1 : z) [L823] 4 z$w_buff0_used = z$w_buff0_used && z$r_buff0_thd4 ? (_Bool)0 : z$w_buff0_used [L824] 4 z$w_buff1_used = z$w_buff0_used && z$r_buff0_thd4 || z$w_buff1_used && z$r_buff1_thd4 ? (_Bool)0 : z$w_buff1_used [L825] 4 z$r_buff0_thd4 = z$w_buff0_used && z$r_buff0_thd4 ? (_Bool)0 : z$r_buff0_thd4 [L826] 4 z$r_buff1_thd4 = z$w_buff0_used && z$r_buff0_thd4 || z$w_buff1_used && z$r_buff1_thd4 ? (_Bool)0 : z$r_buff1_thd4 VAL [\result={0:0}, \result={0:0}, __unbuffered_cnt=2, __unbuffered_p2_EAX=0, __unbuffered_p3_EAX=0, a=1, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice2=0, x=2, y=2, z$flush_delayed=0, z$mem_tmp=0, z$r_buff0_thd0=0, z$r_buff0_thd1=0, z$r_buff0_thd2=0, z$r_buff0_thd3=0, z$r_buff0_thd4=1, z$r_buff1_thd0=0, z$r_buff1_thd1=0, z$r_buff1_thd2=0, z$r_buff1_thd3=0, z$r_buff1_thd4=0, z$read_delayed=0, z$read_delayed_var={0:0}, z$w_buff0=1, z$w_buff0_used=0, z$w_buff1=0, z$w_buff1_used=0, z=1] [L799] 3 __unbuffered_cnt = __unbuffered_cnt + 1 [L801] 3 return 0; [L829] 4 __unbuffered_cnt = __unbuffered_cnt + 1 [L831] 4 return 0; [L853] 0 main$tmp_guard0 = __unbuffered_cnt == 4 [L855] CALL 0 assume_abort_if_not(main$tmp_guard0) [L3] COND FALSE 0 !(!cond) [L855] RET 0 assume_abort_if_not(main$tmp_guard0) [L857] 0 z = z$w_buff0_used && z$r_buff0_thd0 ? z$w_buff0 : (z$w_buff1_used && z$r_buff1_thd0 ? z$w_buff1 : z) [L858] 0 z$w_buff0_used = z$w_buff0_used && z$r_buff0_thd0 ? (_Bool)0 : z$w_buff0_used [L859] 0 z$w_buff1_used = z$w_buff0_used && z$r_buff0_thd0 || z$w_buff1_used && z$r_buff1_thd0 ? (_Bool)0 : z$w_buff1_used [L860] 0 z$r_buff0_thd0 = z$w_buff0_used && z$r_buff0_thd0 ? (_Bool)0 : z$r_buff0_thd0 [L861] 0 z$r_buff1_thd0 = z$w_buff0_used && z$r_buff0_thd0 || z$w_buff1_used && z$r_buff1_thd0 ? (_Bool)0 : z$r_buff1_thd0 VAL [\result={0:0}, \result={0:0}, \result={0:0}, __unbuffered_cnt=4, __unbuffered_p2_EAX=0, __unbuffered_p3_EAX=0, a=1, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, main$tmp_guard0=1, main$tmp_guard1=0, t1413={5:0}, t1414={6:0}, t1415={7:0}, t1416={3:0}, weak$$choice2=0, x=2, y=2, z$flush_delayed=0, z$mem_tmp=0, z$r_buff0_thd0=0, z$r_buff0_thd1=0, z$r_buff0_thd2=0, z$r_buff0_thd3=0, z$r_buff0_thd4=1, z$r_buff1_thd0=0, z$r_buff1_thd1=0, z$r_buff1_thd2=0, z$r_buff1_thd3=0, z$r_buff1_thd4=0, z$read_delayed=0, z$read_delayed_var={0:0}, z$w_buff0=1, z$w_buff0_used=0, z$w_buff1=0, z$w_buff1_used=0, z=1] [L864] 0 main$tmp_guard1 = !(x == 2 && y == 2 && __unbuffered_p2_EAX == 0 && __unbuffered_p3_EAX == 0) [L866] 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", "mix053.opt.c", 8, __extension__ __PRETTY_FUNCTION__) VAL [\read(__PRETTY_FUNCTION__)={50:49}, \result={0:0}, \result={0:0}, \result={0:0}, __unbuffered_cnt=4, __unbuffered_p2_EAX=0, __unbuffered_p3_EAX=0, a=1, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, main$tmp_guard0=1, main$tmp_guard1=0, weak$$choice2=0, x=2, y=2, z$flush_delayed=0, z$mem_tmp=0, z$r_buff0_thd0=0, z$r_buff0_thd1=0, z$r_buff0_thd2=0, z$r_buff0_thd3=0, z$r_buff0_thd4=1, z$r_buff1_thd0=0, z$r_buff1_thd1=0, z$r_buff1_thd2=0, z$r_buff1_thd3=0, z$r_buff1_thd4=0, z$read_delayed=0, z$read_delayed_var={0:0}, z$w_buff0=1, z$w_buff0_used=0, z$w_buff1=0, z$w_buff1_used=0, z=1] - UnprovableResult [Line: 17]: Unable to prove that assertion always holds Unable to prove that assertion always holds Reason: Not analyzed. - UnprovableResult [Line: -1]: Unable to prove that pointer dereference always succeeds Unable to prove that pointer dereference always succeeds Reason: Not analyzed. - UnprovableResult [Line: -1]: Unable to prove that pointer dereference always succeeds Unable to prove that pointer dereference always succeeds Reason: Not analyzed. - UnprovableResult [Line: -1]: Unable to prove that pointer dereference always succeeds Unable to prove that pointer dereference always succeeds Reason: Not analyzed. - UnprovableResult [Line: -1]: Unable to prove that pointer dereference always succeeds Unable to prove that pointer dereference always succeeds Reason: Not analyzed. - UnprovableResult [Line: -1]: Unable to prove that pointer dereference always succeeds Unable to prove that pointer dereference always succeeds Reason: Not analyzed. - UnprovableResult [Line: -1]: Unable to prove that pointer dereference always succeeds Unable to prove that pointer dereference always succeeds Reason: Not analyzed. - UnprovableResult [Line: -1]: Unable to prove that pointer dereference always succeeds Unable to prove that pointer dereference always succeeds Reason: Not analyzed. - UnprovableResult [Line: -1]: Unable to prove that pointer dereference always succeeds Unable to prove that pointer dereference always succeeds Reason: Not analyzed. - UnprovableResult [Line: 845]: 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: 847]: 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: 849]: 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: 851]: 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, 169 locations, 15 error locations. Started 1 CEGAR loops. EmptinessCheckTime: 0.0s, RemoveRedundantFlowTime: 0.0s, RemoveRedundantFlowUnfoldingTime: 0.0s, BackfoldingTime: 0.0s, BackfoldingUnfoldingTime: 0.0s, FlowIncreaseByBackfolding: 0, BasicCegarLoop: OverallTime: 18.3s, OverallIterations: 15, TraceHistogramMax: 1, PathProgramHistogramMax: 5, EmptinessCheckTime: 0.0s, AutomataDifference: 10.4s, DeadEndRemovalTime: 0.0s, HoareAnnotationTime: 0.0s, InitialAbstractionConstructionTime: 4.5s, HoareTripleCheckerStatistics: 0 mSolverCounterUnknown, 515 SdHoareTripleChecker+Valid, 1.4s IncrementalHoareTripleChecker+Time, 0 mSdLazyCounter, 515 mSDsluCounter, 77 SdHoareTripleChecker+Invalid, 1.2s Time, 0 mProtectedAction, 0 SdHoareTripleChecker+Unchecked, 0 IncrementalHoareTripleChecker+Unchecked, 45 mSDsCounter, 48 IncrementalHoareTripleChecker+Valid, 0 mProtectedPredicate, 1645 IncrementalHoareTripleChecker+Invalid, 1693 SdHoareTripleChecker+Unknown, 0 mSolverCounterNotChecked, 48 mSolverCounterUnsat, 32 mSDtfsCounter, 1645 mSolverCounterSat, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Unknown, PredicateUnifierStatistics: 0 DeclaredPredicates, 74 GetRequests, 7 SyntacticMatches, 0 SemanticMatches, 67 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 37 ImplicationChecksByTransitivity, 0.3s Time, 0.0s BasicInterpolantAutomatonTime, BiggestAbstraction: size=852occurred in iteration=11, InterpolantAutomatonStates: 89, traceCheckStatistics: No data available, InterpolantConsolidationStatistics: No data available, PathInvariantsStatistics: No data available, 0/0 InterpolantCoveringCapability, TotalInterpolationStatistics: No data available, 0.0s DumpTime, AutomataMinimizationStatistics: No data available, HoareAnnotationStatistics: No data available, RefinementEngineStatistics: TRACE_CHECK: 0.0s SsaConstructionTime, 0.4s SatisfiabilityAnalysisTime, 2.7s InterpolantComputationTime, 258 NumberOfCodeBlocks, 258 NumberOfCodeBlocksAsserted, 15 NumberOfCheckSat, 219 ConstructedInterpolants, 0 QuantifiedInterpolants, 1163 SizeOfPredicates, 0 NumberOfNonLiveVariables, 0 ConjunctsInSsa, 0 ConjunctsInUnsatCore, 14 InterpolantComputations, 14 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 18:18:25,363 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...