/usr/bin/java -Xmx16000000000 -Xss4m -jar ./plugins/org.eclipse.equinox.launcher_1.5.800.v20200727-1323.jar -data @noDefault -ultimatedata ./data -s ../../../trunk/examples/settings/automizer/concurrent/svcomp-Reach-32bit-Automizer_Default-noMmResRef-PN-VariableLbe.epf -tc ../../../trunk/examples/toolchains/AutomizerCInline.xml --cacsl2boogietranslator.check.unreachability.of.reach_error.function false --cacsl2boogietranslator.pointer.base.address.is.valid.at.dereference ASSERTandASSUME --cacsl2boogietranslator.pointer.to.allocated.memory.at.dereference ASSERTandASSUME --cacsl2boogietranslator.check.array.bounds.for.arrays.that.are.off.heap ASSERTandASSUME --cacsl2boogietranslator.check.if.freed.pointer.was.valid true --cacsl2boogietranslator.adapt.memory.model.on.pointer.casts.if.necessary true -i ../../../trunk/examples/svcomp/pthread-wmm/safe002_power.opt_pso.oepc_pso.opt_rmo.opt.i -------------------------------------------------------------------------------- This is Ultimate 0.2.3-dev-ac9dbd0-m [2023-08-26 12:10:06,486 INFO L188 SettingsManager]: Resetting all preferences to default values... [2023-08-26 12:10:06,576 INFO L114 SettingsManager]: Loading settings from /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../../../trunk/examples/settings/automizer/concurrent/svcomp-Reach-32bit-Automizer_Default-noMmResRef-PN-VariableLbe.epf [2023-08-26 12:10:06,582 WARN L101 SettingsManager]: Preference file contains the following unknown settings: [2023-08-26 12:10:06,583 WARN L103 SettingsManager]: * de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.Checked method. Library mode if empty. [2023-08-26 12:10:06,614 INFO L130 SettingsManager]: Preferences different from defaults after loading the file: [2023-08-26 12:10:06,615 INFO L151 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2023-08-26 12:10:06,615 INFO L153 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2023-08-26 12:10:06,616 INFO L151 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2023-08-26 12:10:06,620 INFO L153 SettingsManager]: * Create parallel compositions if possible=false [2023-08-26 12:10:06,620 INFO L153 SettingsManager]: * Use SBE=true [2023-08-26 12:10:06,621 INFO L151 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2023-08-26 12:10:06,621 INFO L153 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2023-08-26 12:10:06,622 INFO L153 SettingsManager]: * sizeof long=4 [2023-08-26 12:10:06,622 INFO L153 SettingsManager]: * Overapproximate operations on floating types=true [2023-08-26 12:10:06,623 INFO L153 SettingsManager]: * sizeof POINTER=4 [2023-08-26 12:10:06,623 INFO L153 SettingsManager]: * Check division by zero=IGNORE [2023-08-26 12:10:06,623 INFO L153 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2023-08-26 12:10:06,623 INFO L153 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2023-08-26 12:10:06,624 INFO L153 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2023-08-26 12:10:06,624 INFO L153 SettingsManager]: * sizeof long double=12 [2023-08-26 12:10:06,624 INFO L153 SettingsManager]: * Check if freed pointer was valid=false [2023-08-26 12:10:06,624 INFO L153 SettingsManager]: * Use constant arrays=true [2023-08-26 12:10:06,625 INFO L151 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2023-08-26 12:10:06,625 INFO L153 SettingsManager]: * Size of a code block=SequenceOfStatements [2023-08-26 12:10:06,626 INFO L153 SettingsManager]: * To the following directory=./dump/ [2023-08-26 12:10:06,626 INFO L153 SettingsManager]: * SMT solver=External_DefaultMode [2023-08-26 12:10:06,626 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2023-08-26 12:10:06,626 INFO L151 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2023-08-26 12:10:06,626 INFO L153 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2023-08-26 12:10:06,628 INFO L153 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopsAndPotentialCycles [2023-08-26 12:10:06,628 INFO L153 SettingsManager]: * Trace refinement strategy=CAMEL [2023-08-26 12:10:06,628 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2023-08-26 12:10:06,628 INFO L153 SettingsManager]: * Automaton type used in concurrency analysis=PETRI_NET [2023-08-26 12:10:06,628 INFO L153 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2023-08-26 12:10:06,629 INFO L153 SettingsManager]: * Independence relation used for large block encoding in concurrent analysis=SYNTACTIC WARNING: An illegal reflective access operation has occurred WARNING: Illegal reflective access by com.sun.xml.bind.v2.runtime.reflect.opt.Injector$1 (file:/storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/plugins/com.sun.xml.bind_2.2.0.v201505121915.jar) to method java.lang.ClassLoader.defineClass(java.lang.String,byte[],int,int) WARNING: Please consider reporting this to the maintainers of com.sun.xml.bind.v2.runtime.reflect.opt.Injector$1 WARNING: Use --illegal-access=warn to enable warnings of further illegal reflective access operations WARNING: All illegal access operations will be denied in a future release Applying setting for plugin de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator: Check unreachability of reach_error function -> false Applying setting for plugin de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator: Pointer base address is valid at dereference -> ASSERTandASSUME Applying setting for plugin de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator: Pointer to allocated memory at dereference -> ASSERTandASSUME Applying setting for plugin de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator: Check array bounds for arrays that are off heap -> ASSERTandASSUME Applying setting for plugin de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator: Check if freed pointer was valid -> true Applying setting for plugin de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator: Adapt memory model on pointer casts if necessary -> true [2023-08-26 12:10:06,997 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2023-08-26 12:10:07,017 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2023-08-26 12:10:07,020 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2023-08-26 12:10:07,021 INFO L270 PluginConnector]: Initializing CDTParser... [2023-08-26 12:10:07,023 INFO L274 PluginConnector]: CDTParser initialized [2023-08-26 12:10:07,024 INFO L431 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../../../trunk/examples/svcomp/pthread-wmm/safe002_power.opt_pso.oepc_pso.opt_rmo.opt.i [2023-08-26 12:10:08,245 INFO L533 CDTParser]: Created temporary CDT project at NULL [2023-08-26 12:10:08,547 INFO L384 CDTParser]: Found 1 translation units. [2023-08-26 12:10:08,547 INFO L180 CDTParser]: Scanning /storage/repos/ultimate/trunk/examples/svcomp/pthread-wmm/safe002_power.opt_pso.oepc_pso.opt_rmo.opt.i [2023-08-26 12:10:08,574 INFO L427 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/1a638ce7b/16d889a9fd5f4583a810ef7315dbd1e8/FLAGc49f85398 [2023-08-26 12:10:08,590 INFO L435 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/1a638ce7b/16d889a9fd5f4583a810ef7315dbd1e8 [2023-08-26 12:10:08,594 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2023-08-26 12:10:08,596 INFO L133 ToolchainWalker]: Walking toolchain with 5 elements. [2023-08-26 12:10:08,599 INFO L112 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2023-08-26 12:10:08,599 INFO L270 PluginConnector]: Initializing CACSL2BoogieTranslator... [2023-08-26 12:10:08,602 INFO L274 PluginConnector]: CACSL2BoogieTranslator initialized [2023-08-26 12:10:08,603 INFO L184 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 26.08 12:10:08" (1/1) ... [2023-08-26 12:10:08,604 INFO L204 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@30e6f7e7 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 26.08 12:10:08, skipping insertion in model container [2023-08-26 12:10:08,604 INFO L184 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 26.08 12:10:08" (1/1) ... [2023-08-26 12:10:08,658 INFO L176 MainTranslator]: Built tables and reachable declarations [2023-08-26 12:10:09,038 INFO L209 PostProcessor]: Analyzing one entry point: main [2023-08-26 12:10:09,050 INFO L201 MainTranslator]: Completed pre-run [2023-08-26 12:10:09,083 WARN L75 lationResultReporter]: Unsoundness Warning: unspecified type, defaulting to int C: short [268] [2023-08-26 12:10:09,085 WARN L75 lationResultReporter]: Unsoundness Warning: unspecified type, defaulting to int C: short [268] [2023-08-26 12:10:09,128 INFO L209 PostProcessor]: Analyzing one entry point: main [2023-08-26 12:10:09,159 WARN L669 CHandler]: The function __VERIFIER_atomic_begin is called, but not defined or handled by StandardFunctionHandler. [2023-08-26 12:10:09,160 WARN L669 CHandler]: The function __VERIFIER_atomic_end is called, but not defined or handled by StandardFunctionHandler. [2023-08-26 12:10:09,166 INFO L206 MainTranslator]: Completed translation [2023-08-26 12:10:09,167 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 26.08 12:10:09 WrapperNode [2023-08-26 12:10:09,167 INFO L131 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2023-08-26 12:10:09,169 INFO L112 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2023-08-26 12:10:09,169 INFO L270 PluginConnector]: Initializing Boogie Procedure Inliner... [2023-08-26 12:10:09,169 INFO L274 PluginConnector]: Boogie Procedure Inliner initialized [2023-08-26 12:10:09,175 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 26.08 12:10:09" (1/1) ... [2023-08-26 12:10:09,198 INFO L184 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 26.08 12:10:09" (1/1) ... [2023-08-26 12:10:09,223 INFO L138 Inliner]: procedures = 176, calls = 55, calls flagged for inlining = 6, calls inlined = 7, statements flattened = 134 [2023-08-26 12:10:09,224 INFO L131 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2023-08-26 12:10:09,224 INFO L112 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2023-08-26 12:10:09,224 INFO L270 PluginConnector]: Initializing Boogie Preprocessor... [2023-08-26 12:10:09,225 INFO L274 PluginConnector]: Boogie Preprocessor initialized [2023-08-26 12:10:09,232 INFO L184 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 26.08 12:10:09" (1/1) ... [2023-08-26 12:10:09,232 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 26.08 12:10:09" (1/1) ... [2023-08-26 12:10:09,235 INFO L184 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 26.08 12:10:09" (1/1) ... [2023-08-26 12:10:09,235 INFO L184 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 26.08 12:10:09" (1/1) ... [2023-08-26 12:10:09,244 INFO L184 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 26.08 12:10:09" (1/1) ... [2023-08-26 12:10:09,246 INFO L184 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 26.08 12:10:09" (1/1) ... [2023-08-26 12:10:09,249 INFO L184 PluginConnector]: Executing the observer LTLStepAnnotator from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 26.08 12:10:09" (1/1) ... [2023-08-26 12:10:09,250 INFO L184 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 26.08 12:10:09" (1/1) ... [2023-08-26 12:10:09,254 INFO L131 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2023-08-26 12:10:09,255 INFO L112 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2023-08-26 12:10:09,255 INFO L270 PluginConnector]: Initializing RCFGBuilder... [2023-08-26 12:10:09,255 INFO L274 PluginConnector]: RCFGBuilder initialized [2023-08-26 12:10:09,256 INFO L184 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 26.08 12:10:09" (1/1) ... [2023-08-26 12:10:09,263 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2023-08-26 12:10:09,281 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2023-08-26 12:10:09,303 INFO L229 MonitoredProcess]: Starting monitored process 1 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 (exit command is (exit), workingDir is null) [2023-08-26 12:10:09,323 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 (1)] Waiting until timeout for monitored process [2023-08-26 12:10:09,340 INFO L130 BoogieDeclarations]: Found specification of procedure write~int [2023-08-26 12:10:09,340 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_atomic_begin [2023-08-26 12:10:09,340 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2023-08-26 12:10:09,340 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnStack [2023-08-26 12:10:09,340 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.dealloc [2023-08-26 12:10:09,340 INFO L130 BoogieDeclarations]: Found specification of procedure P0 [2023-08-26 12:10:09,340 INFO L138 BoogieDeclarations]: Found implementation of procedure P0 [2023-08-26 12:10:09,341 INFO L130 BoogieDeclarations]: Found specification of procedure P1 [2023-08-26 12:10:09,341 INFO L138 BoogieDeclarations]: Found implementation of procedure P1 [2023-08-26 12:10:09,341 INFO L130 BoogieDeclarations]: Found specification of procedure P2 [2023-08-26 12:10:09,341 INFO L138 BoogieDeclarations]: Found implementation of procedure P2 [2023-08-26 12:10:09,341 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int [2023-08-26 12:10:09,341 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_atomic_end [2023-08-26 12:10:09,341 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2023-08-26 12:10:09,341 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2023-08-26 12:10:09,343 WARN L210 CfgBuilder]: User set CodeBlockSize to SequenceOfStatements but program contains fork statements. Overwriting the user preferences and setting CodeBlockSize to OneNontrivialStatement [2023-08-26 12:10:09,477 INFO L236 CfgBuilder]: Building ICFG [2023-08-26 12:10:09,479 INFO L262 CfgBuilder]: Building CFG for each procedure with an implementation [2023-08-26 12:10:09,883 INFO L277 CfgBuilder]: Performing block encoding [2023-08-26 12:10:09,991 INFO L297 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2023-08-26 12:10:09,991 INFO L302 CfgBuilder]: Removed 0 assume(true) statements. [2023-08-26 12:10:09,993 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 26.08 12:10:09 BoogieIcfgContainer [2023-08-26 12:10:09,993 INFO L131 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2023-08-26 12:10:09,995 INFO L112 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2023-08-26 12:10:09,996 INFO L270 PluginConnector]: Initializing TraceAbstraction... [2023-08-26 12:10:09,998 INFO L274 PluginConnector]: TraceAbstraction initialized [2023-08-26 12:10:09,999 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 26.08 12:10:08" (1/3) ... [2023-08-26 12:10:10,000 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@4cf3f8ab and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 26.08 12:10:09, skipping insertion in model container [2023-08-26 12:10:10,000 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 26.08 12:10:09" (2/3) ... [2023-08-26 12:10:10,000 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@4cf3f8ab and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 26.08 12:10:10, skipping insertion in model container [2023-08-26 12:10:10,000 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 26.08 12:10:09" (3/3) ... [2023-08-26 12:10:10,002 INFO L112 eAbstractionObserver]: Analyzing ICFG safe002_power.opt_pso.oepc_pso.opt_rmo.opt.i [2023-08-26 12:10:10,018 INFO L203 ceAbstractionStarter]: Automizer settings: Hoare:false NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2023-08-26 12:10:10,019 INFO L162 ceAbstractionStarter]: Applying trace abstraction to program that has 8 error locations. [2023-08-26 12:10:10,019 INFO L515 ceAbstractionStarter]: Constructing petrified ICFG for 1 thread instances. [2023-08-26 12:10:10,072 INFO L144 ThreadInstanceAdder]: Constructed 0 joinOtherThreadTransitions. [2023-08-26 12:10:10,103 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 124 places, 117 transitions, 249 flow [2023-08-26 12:10:10,142 INFO L124 PetriNetUnfolderBase]: 3/114 cut-off events. [2023-08-26 12:10:10,142 INFO L125 PetriNetUnfolderBase]: For 0/0 co-relation queries the response was YES. [2023-08-26 12:10:10,147 INFO L83 FinitePrefix]: Finished finitePrefix Result has 124 conditions, 114 events. 3/114 cut-off events. For 0/0 co-relation queries the response was YES. Maximal size of possible extension queue 4. Compared 86 event pairs, 0 based on Foata normal form. 0/103 useless extension candidates. Maximal degree in co-relation 76. Up to 2 conditions per place. [2023-08-26 12:10:10,148 INFO L82 GeneralOperation]: Start removeDead. Operand has 124 places, 117 transitions, 249 flow [2023-08-26 12:10:10,151 INFO L88 GeneralOperation]: Finished RemoveDead, result has has 121 places, 114 transitions, 237 flow [2023-08-26 12:10:10,154 INFO L124 etLargeBlockEncoding]: Petri net LBE is using variable-based independence relation. [2023-08-26 12:10:10,162 INFO L131 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 121 places, 114 transitions, 237 flow [2023-08-26 12:10:10,164 INFO L113 LiptonReduction]: Starting Lipton reduction on Petri net that has 121 places, 114 transitions, 237 flow [2023-08-26 12:10:10,165 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 121 places, 114 transitions, 237 flow [2023-08-26 12:10:10,187 INFO L124 PetriNetUnfolderBase]: 3/114 cut-off events. [2023-08-26 12:10:10,187 INFO L125 PetriNetUnfolderBase]: For 0/0 co-relation queries the response was YES. [2023-08-26 12:10:10,188 INFO L83 FinitePrefix]: Finished finitePrefix Result has 124 conditions, 114 events. 3/114 cut-off events. For 0/0 co-relation queries the response was YES. Maximal size of possible extension queue 4. Compared 86 event pairs, 0 based on Foata normal form. 0/103 useless extension candidates. Maximal degree in co-relation 76. Up to 2 conditions per place. [2023-08-26 12:10:10,190 INFO L119 LiptonReduction]: Number of co-enabled transitions 2038 [2023-08-26 12:10:14,150 INFO L134 LiptonReduction]: Checked pairs total: 5046 [2023-08-26 12:10:14,150 INFO L136 LiptonReduction]: Total number of compositions: 122 [2023-08-26 12:10:14,161 INFO L356 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2023-08-26 12:10:14,166 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;@23c97a35, mLbeIndependenceSettings=[IndependenceType=SYNTACTIC, AbstractionType=NONE, UseConditional=, UseSemiCommutativity=, Solver=, SolverTimeout=] [2023-08-26 12:10:14,167 INFO L358 AbstractCegarLoop]: Starting to check reachability of 12 error locations. [2023-08-26 12:10:14,168 INFO L185 PetriNetUnfolderBase]: Found word, exiting Unfolder. [2023-08-26 12:10:14,168 INFO L124 PetriNetUnfolderBase]: 0/0 cut-off events. [2023-08-26 12:10:14,168 INFO L125 PetriNetUnfolderBase]: For 0/0 co-relation queries the response was YES. [2023-08-26 12:10:14,168 INFO L200 CegarLoopForPetriNet]: Found error trace [2023-08-26 12:10:14,168 INFO L208 CegarLoopForPetriNet]: trace histogram [1] [2023-08-26 12:10:14,169 INFO L420 AbstractCegarLoop]: === Iteration 1 === Targeting ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [P1Err0ASSERT_VIOLATIONASSERT, ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 9 more)] === [2023-08-26 12:10:14,173 INFO L145 PredicateUnifier]: Initialized classic predicate unifier [2023-08-26 12:10:14,173 INFO L85 PathProgramCache]: Analyzing trace with hash 533, now seen corresponding path program 1 times [2023-08-26 12:10:14,180 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-08-26 12:10:14,181 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [326948563] [2023-08-26 12:10:14,181 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-08-26 12:10:14,181 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-08-26 12:10:14,244 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-08-26 12:10:14,261 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-08-26 12:10:14,261 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-08-26 12:10:14,262 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [326948563] [2023-08-26 12:10:14,262 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [326948563] provided 1 perfect and 0 imperfect interpolant sequences [2023-08-26 12:10:14,262 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-08-26 12:10:14,263 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [0] imperfect sequences [] total 0 [2023-08-26 12:10:14,264 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [191033266] [2023-08-26 12:10:14,264 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-08-26 12:10:14,271 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 2 states [2023-08-26 12:10:14,275 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-08-26 12:10:14,291 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 2 interpolants. [2023-08-26 12:10:14,292 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=1, Invalid=1, Unknown=0, NotChecked=0, Total=2 [2023-08-26 12:10:14,293 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 104 out of 239 [2023-08-26 12:10:14,295 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 39 places, 30 transitions, 69 flow. Second operand has 2 states, 2 states have (on average 104.5) internal successors, (209), 2 states have internal predecessors, (209), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-26 12:10:14,295 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2023-08-26 12:10:14,295 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 104 of 239 [2023-08-26 12:10:14,296 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2023-08-26 12:10:14,605 INFO L124 PetriNetUnfolderBase]: 1093/1641 cut-off events. [2023-08-26 12:10:14,606 INFO L125 PetriNetUnfolderBase]: For 11/11 co-relation queries the response was YES. [2023-08-26 12:10:14,612 INFO L83 FinitePrefix]: Finished finitePrefix Result has 3318 conditions, 1641 events. 1093/1641 cut-off events. For 11/11 co-relation queries the response was YES. Maximal size of possible extension queue 103. Compared 7331 event pairs, 1093 based on Foata normal form. 0/1433 useless extension candidates. Maximal degree in co-relation 3307. Up to 1623 conditions per place. [2023-08-26 12:10:14,625 INFO L140 encePairwiseOnDemand]: 232/239 looper letters, 21 selfloop transitions, 0 changer transitions 0/23 dead transitions. [2023-08-26 12:10:14,625 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 34 places, 23 transitions, 97 flow [2023-08-26 12:10:14,626 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2023-08-26 12:10:14,628 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 2 states. [2023-08-26 12:10:14,633 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2 states to 2 states and 236 transitions. [2023-08-26 12:10:14,635 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.49372384937238495 [2023-08-26 12:10:14,635 INFO L72 ComplementDD]: Start complementDD. Operand 2 states and 236 transitions. [2023-08-26 12:10:14,635 INFO L73 IsDeterministic]: Start isDeterministic. Operand 2 states and 236 transitions. [2023-08-26 12:10:14,636 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2023-08-26 12:10:14,638 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 2 states and 236 transitions. [2023-08-26 12:10:14,641 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 3 states, 2 states have (on average 118.0) internal successors, (236), 2 states have internal predecessors, (236), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-26 12:10:14,645 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 3 states, 3 states have (on average 239.0) internal successors, (717), 3 states have internal predecessors, (717), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-26 12:10:14,646 INFO L81 ComplementDD]: Finished complementDD. Result has 3 states, 3 states have (on average 239.0) internal successors, (717), 3 states have internal predecessors, (717), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-26 12:10:14,647 INFO L175 Difference]: Start difference. First operand has 39 places, 30 transitions, 69 flow. Second operand 2 states and 236 transitions. [2023-08-26 12:10:14,648 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 34 places, 23 transitions, 97 flow [2023-08-26 12:10:14,650 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 31 places, 23 transitions, 94 flow, removed 0 selfloop flow, removed 3 redundant places. [2023-08-26 12:10:14,651 INFO L231 Difference]: Finished difference. Result has 31 places, 23 transitions, 52 flow [2023-08-26 12:10:14,653 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=239, PETRI_DIFFERENCE_MINUEND_FLOW=52, PETRI_DIFFERENCE_MINUEND_PLACES=30, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=23, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=0, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=23, PETRI_DIFFERENCE_SUBTRAHEND_STATES=2, PETRI_FLOW=52, PETRI_PLACES=31, PETRI_TRANSITIONS=23} [2023-08-26 12:10:14,655 INFO L281 CegarLoopForPetriNet]: 39 programPoint places, -8 predicate places. [2023-08-26 12:10:14,656 INFO L495 AbstractCegarLoop]: Abstraction has has 31 places, 23 transitions, 52 flow [2023-08-26 12:10:14,656 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 2 states, 2 states have (on average 104.5) internal successors, (209), 2 states have internal predecessors, (209), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-26 12:10:14,656 INFO L200 CegarLoopForPetriNet]: Found error trace [2023-08-26 12:10:14,656 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1] [2023-08-26 12:10:14,657 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable0 [2023-08-26 12:10:14,657 INFO L420 AbstractCegarLoop]: === Iteration 2 === Targeting P1Err0ASSERT_VIOLATIONASSERT === [P1Err0ASSERT_VIOLATIONASSERT, ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 9 more)] === [2023-08-26 12:10:14,657 INFO L145 PredicateUnifier]: Initialized classic predicate unifier [2023-08-26 12:10:14,658 INFO L85 PathProgramCache]: Analyzing trace with hash 503020782, now seen corresponding path program 1 times [2023-08-26 12:10:14,658 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-08-26 12:10:14,658 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1462812387] [2023-08-26 12:10:14,658 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-08-26 12:10:14,658 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-08-26 12:10:14,713 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-08-26 12:10:14,937 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-08-26 12:10:14,937 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-08-26 12:10:14,938 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1462812387] [2023-08-26 12:10:14,938 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1462812387] provided 1 perfect and 0 imperfect interpolant sequences [2023-08-26 12:10:14,938 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-08-26 12:10:14,938 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [1] imperfect sequences [] total 1 [2023-08-26 12:10:14,938 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [853395188] [2023-08-26 12:10:14,938 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-08-26 12:10:14,939 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2023-08-26 12:10:14,940 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-08-26 12:10:14,940 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2023-08-26 12:10:14,940 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2023-08-26 12:10:14,941 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 103 out of 239 [2023-08-26 12:10:14,941 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 31 places, 23 transitions, 52 flow. Second operand has 3 states, 3 states have (on average 104.66666666666667) internal successors, (314), 3 states have internal predecessors, (314), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-26 12:10:14,942 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2023-08-26 12:10:14,942 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 103 of 239 [2023-08-26 12:10:14,942 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2023-08-26 12:10:15,128 INFO L124 PetriNetUnfolderBase]: 855/1340 cut-off events. [2023-08-26 12:10:15,129 INFO L125 PetriNetUnfolderBase]: For 0/0 co-relation queries the response was YES. [2023-08-26 12:10:15,131 INFO L83 FinitePrefix]: Finished finitePrefix Result has 2665 conditions, 1340 events. 855/1340 cut-off events. For 0/0 co-relation queries the response was YES. Maximal size of possible extension queue 82. Compared 6067 event pairs, 237 based on Foata normal form. 0/1272 useless extension candidates. Maximal degree in co-relation 2662. Up to 1027 conditions per place. [2023-08-26 12:10:15,137 INFO L140 encePairwiseOnDemand]: 236/239 looper letters, 29 selfloop transitions, 2 changer transitions 2/35 dead transitions. [2023-08-26 12:10:15,138 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 32 places, 35 transitions, 144 flow [2023-08-26 12:10:15,138 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2023-08-26 12:10:15,139 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2023-08-26 12:10:15,142 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 343 transitions. [2023-08-26 12:10:15,144 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.4783821478382148 [2023-08-26 12:10:15,144 INFO L72 ComplementDD]: Start complementDD. Operand 3 states and 343 transitions. [2023-08-26 12:10:15,144 INFO L73 IsDeterministic]: Start isDeterministic. Operand 3 states and 343 transitions. [2023-08-26 12:10:15,145 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2023-08-26 12:10:15,145 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 3 states and 343 transitions. [2023-08-26 12:10:15,147 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 4 states, 3 states have (on average 114.33333333333333) internal successors, (343), 3 states have internal predecessors, (343), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-26 12:10:15,150 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 4 states, 4 states have (on average 239.0) internal successors, (956), 4 states have internal predecessors, (956), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-26 12:10:15,151 INFO L81 ComplementDD]: Finished complementDD. Result has 4 states, 4 states have (on average 239.0) internal successors, (956), 4 states have internal predecessors, (956), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-26 12:10:15,151 INFO L175 Difference]: Start difference. First operand has 31 places, 23 transitions, 52 flow. Second operand 3 states and 343 transitions. [2023-08-26 12:10:15,151 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 32 places, 35 transitions, 144 flow [2023-08-26 12:10:15,152 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 32 places, 35 transitions, 144 flow, removed 0 selfloop flow, removed 0 redundant places. [2023-08-26 12:10:15,153 INFO L231 Difference]: Finished difference. Result has 32 places, 21 transitions, 52 flow [2023-08-26 12:10:15,156 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=239, PETRI_DIFFERENCE_MINUEND_FLOW=50, PETRI_DIFFERENCE_MINUEND_PLACES=30, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=22, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=2, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=20, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=52, PETRI_PLACES=32, PETRI_TRANSITIONS=21} [2023-08-26 12:10:15,157 INFO L281 CegarLoopForPetriNet]: 39 programPoint places, -7 predicate places. [2023-08-26 12:10:15,157 INFO L495 AbstractCegarLoop]: Abstraction has has 32 places, 21 transitions, 52 flow [2023-08-26 12:10:15,158 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 104.66666666666667) internal successors, (314), 3 states have internal predecessors, (314), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-26 12:10:15,158 INFO L200 CegarLoopForPetriNet]: Found error trace [2023-08-26 12:10:15,158 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-08-26 12:10:15,159 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1 [2023-08-26 12:10:15,163 INFO L420 AbstractCegarLoop]: === Iteration 3 === Targeting ULTIMATE.startErr6ASSERT_VIOLATIONASSERT === [P1Err0ASSERT_VIOLATIONASSERT, ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 9 more)] === [2023-08-26 12:10:15,166 INFO L145 PredicateUnifier]: Initialized classic predicate unifier [2023-08-26 12:10:15,166 INFO L85 PathProgramCache]: Analyzing trace with hash -155797047, now seen corresponding path program 1 times [2023-08-26 12:10:15,166 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-08-26 12:10:15,166 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [357250281] [2023-08-26 12:10:15,166 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-08-26 12:10:15,166 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-08-26 12:10:15,233 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-08-26 12:10:15,418 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-08-26 12:10:15,418 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-08-26 12:10:15,418 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [357250281] [2023-08-26 12:10:15,419 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [357250281] provided 1 perfect and 0 imperfect interpolant sequences [2023-08-26 12:10:15,419 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-08-26 12:10:15,420 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2023-08-26 12:10:15,420 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1948423934] [2023-08-26 12:10:15,420 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-08-26 12:10:15,421 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2023-08-26 12:10:15,421 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-08-26 12:10:15,421 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2023-08-26 12:10:15,422 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2023-08-26 12:10:15,423 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 93 out of 239 [2023-08-26 12:10:15,424 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 32 places, 21 transitions, 52 flow. Second operand has 4 states, 4 states have (on average 95.5) internal successors, (382), 4 states have internal predecessors, (382), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-26 12:10:15,424 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2023-08-26 12:10:15,424 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 93 of 239 [2023-08-26 12:10:15,424 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2023-08-26 12:10:15,836 INFO L124 PetriNetUnfolderBase]: 1935/2942 cut-off events. [2023-08-26 12:10:15,836 INFO L125 PetriNetUnfolderBase]: For 141/141 co-relation queries the response was YES. [2023-08-26 12:10:15,841 INFO L83 FinitePrefix]: Finished finitePrefix Result has 6099 conditions, 2942 events. 1935/2942 cut-off events. For 141/141 co-relation queries the response was YES. Maximal size of possible extension queue 149. Compared 14540 event pairs, 536 based on Foata normal form. 160/3102 useless extension candidates. Maximal degree in co-relation 6095. Up to 1577 conditions per place. [2023-08-26 12:10:15,852 INFO L140 encePairwiseOnDemand]: 231/239 looper letters, 33 selfloop transitions, 6 changer transitions 23/62 dead transitions. [2023-08-26 12:10:15,852 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 35 places, 62 transitions, 268 flow [2023-08-26 12:10:15,853 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2023-08-26 12:10:15,853 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 5 states. [2023-08-26 12:10:15,854 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 529 transitions. [2023-08-26 12:10:15,854 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.4426778242677824 [2023-08-26 12:10:15,855 INFO L72 ComplementDD]: Start complementDD. Operand 5 states and 529 transitions. [2023-08-26 12:10:15,855 INFO L73 IsDeterministic]: Start isDeterministic. Operand 5 states and 529 transitions. [2023-08-26 12:10:15,855 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2023-08-26 12:10:15,855 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 5 states and 529 transitions. [2023-08-26 12:10:15,856 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 6 states, 5 states have (on average 105.8) internal successors, (529), 5 states have internal predecessors, (529), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-26 12:10:15,859 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 6 states, 6 states have (on average 239.0) internal successors, (1434), 6 states have internal predecessors, (1434), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-26 12:10:15,860 INFO L81 ComplementDD]: Finished complementDD. Result has 6 states, 6 states have (on average 239.0) internal successors, (1434), 6 states have internal predecessors, (1434), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-26 12:10:15,860 INFO L175 Difference]: Start difference. First operand has 32 places, 21 transitions, 52 flow. Second operand 5 states and 529 transitions. [2023-08-26 12:10:15,860 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 35 places, 62 transitions, 268 flow [2023-08-26 12:10:15,862 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 33 places, 62 transitions, 258 flow, removed 0 selfloop flow, removed 2 redundant places. [2023-08-26 12:10:15,863 INFO L231 Difference]: Finished difference. Result has 37 places, 26 transitions, 108 flow [2023-08-26 12:10:15,863 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=239, PETRI_DIFFERENCE_MINUEND_FLOW=48, PETRI_DIFFERENCE_MINUEND_PLACES=29, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=21, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=1, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=15, PETRI_DIFFERENCE_SUBTRAHEND_STATES=5, PETRI_FLOW=108, PETRI_PLACES=37, PETRI_TRANSITIONS=26} [2023-08-26 12:10:15,864 INFO L281 CegarLoopForPetriNet]: 39 programPoint places, -2 predicate places. [2023-08-26 12:10:15,864 INFO L495 AbstractCegarLoop]: Abstraction has has 37 places, 26 transitions, 108 flow [2023-08-26 12:10:15,865 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 95.5) internal successors, (382), 4 states have internal predecessors, (382), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-26 12:10:15,865 INFO L200 CegarLoopForPetriNet]: Found error trace [2023-08-26 12:10:15,865 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-08-26 12:10:15,865 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2 [2023-08-26 12:10:15,869 INFO L420 AbstractCegarLoop]: === Iteration 4 === Targeting ULTIMATE.startErr6ASSERT_VIOLATIONASSERT === [P1Err0ASSERT_VIOLATIONASSERT, ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 9 more)] === [2023-08-26 12:10:15,869 INFO L145 PredicateUnifier]: Initialized classic predicate unifier [2023-08-26 12:10:15,869 INFO L85 PathProgramCache]: Analyzing trace with hash -534758676, now seen corresponding path program 1 times [2023-08-26 12:10:15,869 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-08-26 12:10:15,870 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1211120926] [2023-08-26 12:10:15,870 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-08-26 12:10:15,870 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-08-26 12:10:15,920 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-08-26 12:10:16,092 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-08-26 12:10:16,093 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-08-26 12:10:16,093 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1211120926] [2023-08-26 12:10:16,093 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1211120926] provided 1 perfect and 0 imperfect interpolant sequences [2023-08-26 12:10:16,093 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-08-26 12:10:16,093 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2023-08-26 12:10:16,093 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1282744185] [2023-08-26 12:10:16,094 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-08-26 12:10:16,094 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2023-08-26 12:10:16,094 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-08-26 12:10:16,095 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2023-08-26 12:10:16,096 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=8, Invalid=12, Unknown=0, NotChecked=0, Total=20 [2023-08-26 12:10:16,096 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 93 out of 239 [2023-08-26 12:10:16,097 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 37 places, 26 transitions, 108 flow. Second operand has 5 states, 5 states have (on average 95.2) internal successors, (476), 5 states have internal predecessors, (476), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-26 12:10:16,097 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2023-08-26 12:10:16,097 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 93 of 239 [2023-08-26 12:10:16,097 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2023-08-26 12:10:16,542 INFO L124 PetriNetUnfolderBase]: 1692/2605 cut-off events. [2023-08-26 12:10:16,542 INFO L125 PetriNetUnfolderBase]: For 2094/2094 co-relation queries the response was YES. [2023-08-26 12:10:16,547 INFO L83 FinitePrefix]: Finished finitePrefix Result has 7265 conditions, 2605 events. 1692/2605 cut-off events. For 2094/2094 co-relation queries the response was YES. Maximal size of possible extension queue 130. Compared 12708 event pairs, 208 based on Foata normal form. 120/2725 useless extension candidates. Maximal degree in co-relation 7258. Up to 1365 conditions per place. [2023-08-26 12:10:16,559 INFO L140 encePairwiseOnDemand]: 231/239 looper letters, 40 selfloop transitions, 10 changer transitions 28/78 dead transitions. [2023-08-26 12:10:16,559 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 41 places, 78 transitions, 466 flow [2023-08-26 12:10:16,559 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2023-08-26 12:10:16,560 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 7 states. [2023-08-26 12:10:16,561 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 7 states to 7 states and 725 transitions. [2023-08-26 12:10:16,562 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.43335325762104004 [2023-08-26 12:10:16,562 INFO L72 ComplementDD]: Start complementDD. Operand 7 states and 725 transitions. [2023-08-26 12:10:16,562 INFO L73 IsDeterministic]: Start isDeterministic. Operand 7 states and 725 transitions. [2023-08-26 12:10:16,562 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2023-08-26 12:10:16,562 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 7 states and 725 transitions. [2023-08-26 12:10:16,564 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 8 states, 7 states have (on average 103.57142857142857) internal successors, (725), 7 states have internal predecessors, (725), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-26 12:10:16,567 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 8 states, 8 states have (on average 239.0) internal successors, (1912), 8 states have internal predecessors, (1912), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-26 12:10:16,568 INFO L81 ComplementDD]: Finished complementDD. Result has 8 states, 8 states have (on average 239.0) internal successors, (1912), 8 states have internal predecessors, (1912), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-26 12:10:16,568 INFO L175 Difference]: Start difference. First operand has 37 places, 26 transitions, 108 flow. Second operand 7 states and 725 transitions. [2023-08-26 12:10:16,568 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 41 places, 78 transitions, 466 flow [2023-08-26 12:10:16,575 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 39 places, 78 transitions, 428 flow, removed 0 selfloop flow, removed 2 redundant places. [2023-08-26 12:10:16,576 INFO L231 Difference]: Finished difference. Result has 45 places, 32 transitions, 184 flow [2023-08-26 12:10:16,576 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=239, PETRI_DIFFERENCE_MINUEND_FLOW=96, PETRI_DIFFERENCE_MINUEND_PLACES=33, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=26, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=4, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=18, PETRI_DIFFERENCE_SUBTRAHEND_STATES=7, PETRI_FLOW=184, PETRI_PLACES=45, PETRI_TRANSITIONS=32} [2023-08-26 12:10:16,577 INFO L281 CegarLoopForPetriNet]: 39 programPoint places, 6 predicate places. [2023-08-26 12:10:16,577 INFO L495 AbstractCegarLoop]: Abstraction has has 45 places, 32 transitions, 184 flow [2023-08-26 12:10:16,578 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 95.2) internal successors, (476), 5 states have internal predecessors, (476), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-26 12:10:16,578 INFO L200 CegarLoopForPetriNet]: Found error trace [2023-08-26 12:10:16,578 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-08-26 12:10:16,578 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable3 [2023-08-26 12:10:16,578 INFO L420 AbstractCegarLoop]: === Iteration 5 === Targeting ULTIMATE.startErr6ASSERT_VIOLATIONASSERT === [P1Err0ASSERT_VIOLATIONASSERT, ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 9 more)] === [2023-08-26 12:10:16,578 INFO L145 PredicateUnifier]: Initialized classic predicate unifier [2023-08-26 12:10:16,578 INFO L85 PathProgramCache]: Analyzing trace with hash -357972484, now seen corresponding path program 1 times [2023-08-26 12:10:16,579 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-08-26 12:10:16,579 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [651184405] [2023-08-26 12:10:16,579 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-08-26 12:10:16,579 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-08-26 12:10:16,604 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-08-26 12:10:16,711 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-08-26 12:10:16,711 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-08-26 12:10:16,711 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [651184405] [2023-08-26 12:10:16,711 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [651184405] provided 1 perfect and 0 imperfect interpolant sequences [2023-08-26 12:10:16,711 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-08-26 12:10:16,711 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2023-08-26 12:10:16,712 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [60900387] [2023-08-26 12:10:16,712 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-08-26 12:10:16,712 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2023-08-26 12:10:16,712 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-08-26 12:10:16,713 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2023-08-26 12:10:16,713 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=8, Invalid=12, Unknown=0, NotChecked=0, Total=20 [2023-08-26 12:10:16,714 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 93 out of 239 [2023-08-26 12:10:16,714 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 45 places, 32 transitions, 184 flow. Second operand has 5 states, 5 states have (on average 95.4) internal successors, (477), 5 states have internal predecessors, (477), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-26 12:10:16,714 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2023-08-26 12:10:16,715 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 93 of 239 [2023-08-26 12:10:16,715 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2023-08-26 12:10:17,113 INFO L124 PetriNetUnfolderBase]: 1554/2395 cut-off events. [2023-08-26 12:10:17,114 INFO L125 PetriNetUnfolderBase]: For 4866/4866 co-relation queries the response was YES. [2023-08-26 12:10:17,119 INFO L83 FinitePrefix]: Finished finitePrefix Result has 7515 conditions, 2395 events. 1554/2395 cut-off events. For 4866/4866 co-relation queries the response was YES. Maximal size of possible extension queue 113. Compared 11451 event pairs, 361 based on Foata normal form. 96/2491 useless extension candidates. Maximal degree in co-relation 7503. Up to 1273 conditions per place. [2023-08-26 12:10:17,129 INFO L140 encePairwiseOnDemand]: 231/239 looper letters, 47 selfloop transitions, 12 changer transitions 23/82 dead transitions. [2023-08-26 12:10:17,129 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 48 places, 82 transitions, 530 flow [2023-08-26 12:10:17,130 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2023-08-26 12:10:17,130 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 7 states. [2023-08-26 12:10:17,131 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 7 states to 7 states and 726 transitions. [2023-08-26 12:10:17,132 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.4339509862522415 [2023-08-26 12:10:17,132 INFO L72 ComplementDD]: Start complementDD. Operand 7 states and 726 transitions. [2023-08-26 12:10:17,132 INFO L73 IsDeterministic]: Start isDeterministic. Operand 7 states and 726 transitions. [2023-08-26 12:10:17,133 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2023-08-26 12:10:17,133 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 7 states and 726 transitions. [2023-08-26 12:10:17,134 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 8 states, 7 states have (on average 103.71428571428571) internal successors, (726), 7 states have internal predecessors, (726), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-26 12:10:17,137 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 8 states, 8 states have (on average 239.0) internal successors, (1912), 8 states have internal predecessors, (1912), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-26 12:10:17,138 INFO L81 ComplementDD]: Finished complementDD. Result has 8 states, 8 states have (on average 239.0) internal successors, (1912), 8 states have internal predecessors, (1912), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-26 12:10:17,138 INFO L175 Difference]: Start difference. First operand has 45 places, 32 transitions, 184 flow. Second operand 7 states and 726 transitions. [2023-08-26 12:10:17,138 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 48 places, 82 transitions, 530 flow [2023-08-26 12:10:17,160 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 47 places, 82 transitions, 508 flow, removed 11 selfloop flow, removed 1 redundant places. [2023-08-26 12:10:17,161 INFO L231 Difference]: Finished difference. Result has 53 places, 35 transitions, 260 flow [2023-08-26 12:10:17,161 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=239, PETRI_DIFFERENCE_MINUEND_FLOW=172, PETRI_DIFFERENCE_MINUEND_PLACES=41, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=32, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=9, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=20, PETRI_DIFFERENCE_SUBTRAHEND_STATES=7, PETRI_FLOW=260, PETRI_PLACES=53, PETRI_TRANSITIONS=35} [2023-08-26 12:10:17,162 INFO L281 CegarLoopForPetriNet]: 39 programPoint places, 14 predicate places. [2023-08-26 12:10:17,162 INFO L495 AbstractCegarLoop]: Abstraction has has 53 places, 35 transitions, 260 flow [2023-08-26 12:10:17,162 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 95.4) internal successors, (477), 5 states have internal predecessors, (477), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-26 12:10:17,162 INFO L200 CegarLoopForPetriNet]: Found error trace [2023-08-26 12:10:17,163 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-08-26 12:10:17,163 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable4 [2023-08-26 12:10:17,163 INFO L420 AbstractCegarLoop]: === Iteration 6 === Targeting ULTIMATE.startErr6ASSERT_VIOLATIONASSERT === [P1Err0ASSERT_VIOLATIONASSERT, ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 9 more)] === [2023-08-26 12:10:17,163 INFO L145 PredicateUnifier]: Initialized classic predicate unifier [2023-08-26 12:10:17,163 INFO L85 PathProgramCache]: Analyzing trace with hash 1789294189, now seen corresponding path program 1 times [2023-08-26 12:10:17,163 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-08-26 12:10:17,163 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [656228430] [2023-08-26 12:10:17,163 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-08-26 12:10:17,164 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-08-26 12:10:17,185 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-08-26 12:10:17,300 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-08-26 12:10:17,300 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-08-26 12:10:17,301 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [656228430] [2023-08-26 12:10:17,301 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [656228430] provided 1 perfect and 0 imperfect interpolant sequences [2023-08-26 12:10:17,301 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-08-26 12:10:17,301 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2023-08-26 12:10:17,301 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [912034066] [2023-08-26 12:10:17,301 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-08-26 12:10:17,301 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2023-08-26 12:10:17,302 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-08-26 12:10:17,302 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2023-08-26 12:10:17,302 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=11, Invalid=19, Unknown=0, NotChecked=0, Total=30 [2023-08-26 12:10:17,303 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 93 out of 239 [2023-08-26 12:10:17,304 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 53 places, 35 transitions, 260 flow. Second operand has 6 states, 6 states have (on average 95.16666666666667) internal successors, (571), 6 states have internal predecessors, (571), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-26 12:10:17,304 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2023-08-26 12:10:17,304 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 93 of 239 [2023-08-26 12:10:17,304 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2023-08-26 12:10:17,739 INFO L124 PetriNetUnfolderBase]: 1716/2638 cut-off events. [2023-08-26 12:10:17,740 INFO L125 PetriNetUnfolderBase]: For 6927/6927 co-relation queries the response was YES. [2023-08-26 12:10:17,749 INFO L83 FinitePrefix]: Finished finitePrefix Result has 8740 conditions, 2638 events. 1716/2638 cut-off events. For 6927/6927 co-relation queries the response was YES. Maximal size of possible extension queue 136. Compared 12646 event pairs, 338 based on Foata normal form. 132/2770 useless extension candidates. Maximal degree in co-relation 8723. Up to 1320 conditions per place. [2023-08-26 12:10:17,757 INFO L140 encePairwiseOnDemand]: 231/239 looper letters, 38 selfloop transitions, 9 changer transitions 39/86 dead transitions. [2023-08-26 12:10:17,757 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 57 places, 86 transitions, 674 flow [2023-08-26 12:10:17,757 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2023-08-26 12:10:17,757 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 8 states. [2023-08-26 12:10:17,759 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 8 states to 8 states and 820 transitions. [2023-08-26 12:10:17,760 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.42887029288702927 [2023-08-26 12:10:17,760 INFO L72 ComplementDD]: Start complementDD. Operand 8 states and 820 transitions. [2023-08-26 12:10:17,760 INFO L73 IsDeterministic]: Start isDeterministic. Operand 8 states and 820 transitions. [2023-08-26 12:10:17,760 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2023-08-26 12:10:17,761 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 8 states and 820 transitions. [2023-08-26 12:10:17,762 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 9 states, 8 states have (on average 102.5) internal successors, (820), 8 states have internal predecessors, (820), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-26 12:10:17,765 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 9 states, 9 states have (on average 239.0) internal successors, (2151), 9 states have internal predecessors, (2151), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-26 12:10:17,766 INFO L81 ComplementDD]: Finished complementDD. Result has 9 states, 9 states have (on average 239.0) internal successors, (2151), 9 states have internal predecessors, (2151), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-26 12:10:17,766 INFO L175 Difference]: Start difference. First operand has 53 places, 35 transitions, 260 flow. Second operand 8 states and 820 transitions. [2023-08-26 12:10:17,766 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 57 places, 86 transitions, 674 flow [2023-08-26 12:10:17,779 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 50 places, 86 transitions, 650 flow, removed 9 selfloop flow, removed 7 redundant places. [2023-08-26 12:10:17,780 INFO L231 Difference]: Finished difference. Result has 55 places, 30 transitions, 231 flow [2023-08-26 12:10:17,780 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=239, PETRI_DIFFERENCE_MINUEND_FLOW=240, PETRI_DIFFERENCE_MINUEND_PLACES=43, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=35, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=7, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=26, PETRI_DIFFERENCE_SUBTRAHEND_STATES=8, PETRI_FLOW=231, PETRI_PLACES=55, PETRI_TRANSITIONS=30} [2023-08-26 12:10:17,781 INFO L281 CegarLoopForPetriNet]: 39 programPoint places, 16 predicate places. [2023-08-26 12:10:17,781 INFO L495 AbstractCegarLoop]: Abstraction has has 55 places, 30 transitions, 231 flow [2023-08-26 12:10:17,781 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 95.16666666666667) internal successors, (571), 6 states have internal predecessors, (571), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-26 12:10:17,782 INFO L200 CegarLoopForPetriNet]: Found error trace [2023-08-26 12:10:17,782 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-08-26 12:10:17,782 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable5 [2023-08-26 12:10:17,782 INFO L420 AbstractCegarLoop]: === Iteration 7 === Targeting ULTIMATE.startErr6ASSERT_VIOLATIONASSERT === [P1Err0ASSERT_VIOLATIONASSERT, ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 9 more)] === [2023-08-26 12:10:17,782 INFO L145 PredicateUnifier]: Initialized classic predicate unifier [2023-08-26 12:10:17,782 INFO L85 PathProgramCache]: Analyzing trace with hash -341633620, now seen corresponding path program 1 times [2023-08-26 12:10:17,782 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-08-26 12:10:17,783 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2147328218] [2023-08-26 12:10:17,783 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-08-26 12:10:17,783 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-08-26 12:10:17,804 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-08-26 12:10:17,937 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-08-26 12:10:17,938 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-08-26 12:10:17,938 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2147328218] [2023-08-26 12:10:17,938 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2147328218] provided 1 perfect and 0 imperfect interpolant sequences [2023-08-26 12:10:17,938 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-08-26 12:10:17,938 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2023-08-26 12:10:17,938 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [102326070] [2023-08-26 12:10:17,938 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-08-26 12:10:17,939 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2023-08-26 12:10:17,939 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-08-26 12:10:17,939 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2023-08-26 12:10:17,939 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=8, Invalid=12, Unknown=0, NotChecked=0, Total=20 [2023-08-26 12:10:17,940 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 93 out of 239 [2023-08-26 12:10:17,940 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 55 places, 30 transitions, 231 flow. Second operand has 5 states, 5 states have (on average 95.8) internal successors, (479), 5 states have internal predecessors, (479), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-26 12:10:17,941 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2023-08-26 12:10:17,941 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 93 of 239 [2023-08-26 12:10:17,941 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2023-08-26 12:10:18,151 INFO L124 PetriNetUnfolderBase]: 730/1145 cut-off events. [2023-08-26 12:10:18,152 INFO L125 PetriNetUnfolderBase]: For 2895/2895 co-relation queries the response was YES. [2023-08-26 12:10:18,155 INFO L83 FinitePrefix]: Finished finitePrefix Result has 4026 conditions, 1145 events. 730/1145 cut-off events. For 2895/2895 co-relation queries the response was YES. Maximal size of possible extension queue 50. Compared 4538 event pairs, 202 based on Foata normal form. 36/1181 useless extension candidates. Maximal degree in co-relation 4009. Up to 604 conditions per place. [2023-08-26 12:10:18,160 INFO L140 encePairwiseOnDemand]: 233/239 looper letters, 38 selfloop transitions, 7 changer transitions 12/57 dead transitions. [2023-08-26 12:10:18,160 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 57 places, 57 transitions, 431 flow [2023-08-26 12:10:18,161 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2023-08-26 12:10:18,161 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 6 states. [2023-08-26 12:10:18,162 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6 states to 6 states and 611 transitions. [2023-08-26 12:10:18,163 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.42608089260808923 [2023-08-26 12:10:18,163 INFO L72 ComplementDD]: Start complementDD. Operand 6 states and 611 transitions. [2023-08-26 12:10:18,163 INFO L73 IsDeterministic]: Start isDeterministic. Operand 6 states and 611 transitions. [2023-08-26 12:10:18,163 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2023-08-26 12:10:18,163 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 6 states and 611 transitions. [2023-08-26 12:10:18,165 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 7 states, 6 states have (on average 101.83333333333333) internal successors, (611), 6 states have internal predecessors, (611), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-26 12:10:18,167 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 7 states, 7 states have (on average 239.0) internal successors, (1673), 7 states have internal predecessors, (1673), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-26 12:10:18,167 INFO L81 ComplementDD]: Finished complementDD. Result has 7 states, 7 states have (on average 239.0) internal successors, (1673), 7 states have internal predecessors, (1673), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-26 12:10:18,167 INFO L175 Difference]: Start difference. First operand has 55 places, 30 transitions, 231 flow. Second operand 6 states and 611 transitions. [2023-08-26 12:10:18,167 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 57 places, 57 transitions, 431 flow [2023-08-26 12:10:18,174 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 49 places, 57 transitions, 394 flow, removed 4 selfloop flow, removed 8 redundant places. [2023-08-26 12:10:18,175 INFO L231 Difference]: Finished difference. Result has 52 places, 30 transitions, 219 flow [2023-08-26 12:10:18,175 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=239, PETRI_DIFFERENCE_MINUEND_FLOW=194, PETRI_DIFFERENCE_MINUEND_PLACES=44, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=30, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=7, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=23, PETRI_DIFFERENCE_SUBTRAHEND_STATES=6, PETRI_FLOW=219, PETRI_PLACES=52, PETRI_TRANSITIONS=30} [2023-08-26 12:10:18,175 INFO L281 CegarLoopForPetriNet]: 39 programPoint places, 13 predicate places. [2023-08-26 12:10:18,176 INFO L495 AbstractCegarLoop]: Abstraction has has 52 places, 30 transitions, 219 flow [2023-08-26 12:10:18,176 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 95.8) internal successors, (479), 5 states have internal predecessors, (479), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-26 12:10:18,176 INFO L200 CegarLoopForPetriNet]: Found error trace [2023-08-26 12:10:18,176 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-08-26 12:10:18,176 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable6 [2023-08-26 12:10:18,176 INFO L420 AbstractCegarLoop]: === Iteration 8 === Targeting ULTIMATE.startErr6ASSERT_VIOLATIONASSERT === [P1Err0ASSERT_VIOLATIONASSERT, ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 9 more)] === [2023-08-26 12:10:18,177 INFO L145 PredicateUnifier]: Initialized classic predicate unifier [2023-08-26 12:10:18,177 INFO L85 PathProgramCache]: Analyzing trace with hash -299115117, now seen corresponding path program 1 times [2023-08-26 12:10:18,177 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-08-26 12:10:18,177 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2144366320] [2023-08-26 12:10:18,177 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-08-26 12:10:18,177 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-08-26 12:10:18,195 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-08-26 12:10:18,292 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-08-26 12:10:18,293 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-08-26 12:10:18,293 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2144366320] [2023-08-26 12:10:18,293 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2144366320] provided 1 perfect and 0 imperfect interpolant sequences [2023-08-26 12:10:18,293 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-08-26 12:10:18,293 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2023-08-26 12:10:18,293 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [702807811] [2023-08-26 12:10:18,293 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-08-26 12:10:18,294 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2023-08-26 12:10:18,294 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-08-26 12:10:18,294 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2023-08-26 12:10:18,294 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2023-08-26 12:10:18,295 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 95 out of 239 [2023-08-26 12:10:18,295 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 52 places, 30 transitions, 219 flow. Second operand has 5 states, 5 states have (on average 98.0) internal successors, (490), 5 states have internal predecessors, (490), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-26 12:10:18,295 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2023-08-26 12:10:18,295 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 95 of 239 [2023-08-26 12:10:18,296 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2023-08-26 12:10:18,547 INFO L124 PetriNetUnfolderBase]: 1005/1567 cut-off events. [2023-08-26 12:10:18,548 INFO L125 PetriNetUnfolderBase]: For 3174/3174 co-relation queries the response was YES. [2023-08-26 12:10:18,553 INFO L83 FinitePrefix]: Finished finitePrefix Result has 5469 conditions, 1567 events. 1005/1567 cut-off events. For 3174/3174 co-relation queries the response was YES. Maximal size of possible extension queue 77. Compared 6636 event pairs, 312 based on Foata normal form. 27/1594 useless extension candidates. Maximal degree in co-relation 5452. Up to 715 conditions per place. [2023-08-26 12:10:18,559 INFO L140 encePairwiseOnDemand]: 234/239 looper letters, 34 selfloop transitions, 5 changer transitions 18/57 dead transitions. [2023-08-26 12:10:18,559 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 54 places, 57 transitions, 457 flow [2023-08-26 12:10:18,559 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2023-08-26 12:10:18,559 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 5 states. [2023-08-26 12:10:18,561 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 523 transitions. [2023-08-26 12:10:18,561 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.4376569037656904 [2023-08-26 12:10:18,561 INFO L72 ComplementDD]: Start complementDD. Operand 5 states and 523 transitions. [2023-08-26 12:10:18,561 INFO L73 IsDeterministic]: Start isDeterministic. Operand 5 states and 523 transitions. [2023-08-26 12:10:18,561 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2023-08-26 12:10:18,561 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 5 states and 523 transitions. [2023-08-26 12:10:18,563 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 6 states, 5 states have (on average 104.6) internal successors, (523), 5 states have internal predecessors, (523), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-26 12:10:18,565 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 6 states, 6 states have (on average 239.0) internal successors, (1434), 6 states have internal predecessors, (1434), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-26 12:10:18,565 INFO L81 ComplementDD]: Finished complementDD. Result has 6 states, 6 states have (on average 239.0) internal successors, (1434), 6 states have internal predecessors, (1434), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-26 12:10:18,565 INFO L175 Difference]: Start difference. First operand has 52 places, 30 transitions, 219 flow. Second operand 5 states and 523 transitions. [2023-08-26 12:10:18,565 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 54 places, 57 transitions, 457 flow [2023-08-26 12:10:18,572 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 49 places, 57 transitions, 417 flow, removed 8 selfloop flow, removed 5 redundant places. [2023-08-26 12:10:18,573 INFO L231 Difference]: Finished difference. Result has 51 places, 27 transitions, 176 flow [2023-08-26 12:10:18,573 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=239, PETRI_DIFFERENCE_MINUEND_FLOW=189, PETRI_DIFFERENCE_MINUEND_PLACES=45, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=30, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=5, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=25, PETRI_DIFFERENCE_SUBTRAHEND_STATES=5, PETRI_FLOW=176, PETRI_PLACES=51, PETRI_TRANSITIONS=27} [2023-08-26 12:10:18,573 INFO L281 CegarLoopForPetriNet]: 39 programPoint places, 12 predicate places. [2023-08-26 12:10:18,574 INFO L495 AbstractCegarLoop]: Abstraction has has 51 places, 27 transitions, 176 flow [2023-08-26 12:10:18,574 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 98.0) internal successors, (490), 5 states have internal predecessors, (490), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-26 12:10:18,574 INFO L200 CegarLoopForPetriNet]: Found error trace [2023-08-26 12:10:18,574 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-08-26 12:10:18,574 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable7 [2023-08-26 12:10:18,574 INFO L420 AbstractCegarLoop]: === Iteration 9 === Targeting ULTIMATE.startErr6ASSERT_VIOLATIONASSERT === [P1Err0ASSERT_VIOLATIONASSERT, ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 9 more)] === [2023-08-26 12:10:18,575 INFO L145 PredicateUnifier]: Initialized classic predicate unifier [2023-08-26 12:10:18,575 INFO L85 PathProgramCache]: Analyzing trace with hash -1989158547, now seen corresponding path program 2 times [2023-08-26 12:10:18,575 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-08-26 12:10:18,575 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [728428108] [2023-08-26 12:10:18,575 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-08-26 12:10:18,575 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-08-26 12:10:18,594 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-08-26 12:10:18,739 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-08-26 12:10:18,740 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-08-26 12:10:18,740 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [728428108] [2023-08-26 12:10:18,740 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [728428108] provided 1 perfect and 0 imperfect interpolant sequences [2023-08-26 12:10:18,740 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-08-26 12:10:18,740 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2023-08-26 12:10:18,740 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1753710059] [2023-08-26 12:10:18,740 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-08-26 12:10:18,741 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2023-08-26 12:10:18,741 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-08-26 12:10:18,741 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2023-08-26 12:10:18,744 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2023-08-26 12:10:18,745 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 95 out of 239 [2023-08-26 12:10:18,745 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 51 places, 27 transitions, 176 flow. Second operand has 5 states, 5 states have (on average 98.0) internal successors, (490), 5 states have internal predecessors, (490), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-26 12:10:18,745 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2023-08-26 12:10:18,745 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 95 of 239 [2023-08-26 12:10:18,745 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2023-08-26 12:10:18,984 INFO L124 PetriNetUnfolderBase]: 733/1139 cut-off events. [2023-08-26 12:10:18,984 INFO L125 PetriNetUnfolderBase]: For 1496/1496 co-relation queries the response was YES. [2023-08-26 12:10:18,987 INFO L83 FinitePrefix]: Finished finitePrefix Result has 3708 conditions, 1139 events. 733/1139 cut-off events. For 1496/1496 co-relation queries the response was YES. Maximal size of possible extension queue 59. Compared 4555 event pairs, 217 based on Foata normal form. 27/1166 useless extension candidates. Maximal degree in co-relation 3692. Up to 486 conditions per place. [2023-08-26 12:10:18,995 INFO L140 encePairwiseOnDemand]: 234/239 looper letters, 25 selfloop transitions, 2 changer transitions 29/56 dead transitions. [2023-08-26 12:10:18,996 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 55 places, 56 transitions, 372 flow [2023-08-26 12:10:18,996 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2023-08-26 12:10:18,996 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 6 states. [2023-08-26 12:10:18,998 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6 states to 6 states and 624 transitions. [2023-08-26 12:10:18,998 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.4351464435146444 [2023-08-26 12:10:18,998 INFO L72 ComplementDD]: Start complementDD. Operand 6 states and 624 transitions. [2023-08-26 12:10:18,998 INFO L73 IsDeterministic]: Start isDeterministic. Operand 6 states and 624 transitions. [2023-08-26 12:10:18,999 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2023-08-26 12:10:18,999 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 6 states and 624 transitions. [2023-08-26 12:10:19,000 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 7 states, 6 states have (on average 104.0) internal successors, (624), 6 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 12:10:19,003 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 7 states, 7 states have (on average 239.0) internal successors, (1673), 7 states have internal predecessors, (1673), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-26 12:10:19,004 INFO L81 ComplementDD]: Finished complementDD. Result has 7 states, 7 states have (on average 239.0) internal successors, (1673), 7 states have internal predecessors, (1673), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-26 12:10:19,004 INFO L175 Difference]: Start difference. First operand has 51 places, 27 transitions, 176 flow. Second operand 6 states and 624 transitions. [2023-08-26 12:10:19,004 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 55 places, 56 transitions, 372 flow [2023-08-26 12:10:19,008 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 46 places, 56 transitions, 333 flow, removed 5 selfloop flow, removed 9 redundant places. [2023-08-26 12:10:19,009 INFO L231 Difference]: Finished difference. Result has 48 places, 21 transitions, 92 flow [2023-08-26 12:10:19,009 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=239, PETRI_DIFFERENCE_MINUEND_FLOW=141, PETRI_DIFFERENCE_MINUEND_PLACES=41, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=27, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=2, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=25, PETRI_DIFFERENCE_SUBTRAHEND_STATES=6, PETRI_FLOW=92, PETRI_PLACES=48, PETRI_TRANSITIONS=21} [2023-08-26 12:10:19,010 INFO L281 CegarLoopForPetriNet]: 39 programPoint places, 9 predicate places. [2023-08-26 12:10:19,010 INFO L495 AbstractCegarLoop]: Abstraction has has 48 places, 21 transitions, 92 flow [2023-08-26 12:10:19,010 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 98.0) internal successors, (490), 5 states have internal predecessors, (490), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-26 12:10:19,010 INFO L200 CegarLoopForPetriNet]: Found error trace [2023-08-26 12:10:19,011 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-08-26 12:10:19,011 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable8 [2023-08-26 12:10:19,011 INFO L420 AbstractCegarLoop]: === Iteration 10 === Targeting ULTIMATE.startErr6ASSERT_VIOLATIONASSERT === [P1Err0ASSERT_VIOLATIONASSERT, ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 9 more)] === [2023-08-26 12:10:19,011 INFO L145 PredicateUnifier]: Initialized classic predicate unifier [2023-08-26 12:10:19,011 INFO L85 PathProgramCache]: Analyzing trace with hash 779523323, now seen corresponding path program 3 times [2023-08-26 12:10:19,011 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-08-26 12:10:19,013 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1174262034] [2023-08-26 12:10:19,013 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-08-26 12:10:19,014 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-08-26 12:10:19,047 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-08-26 12:10:19,203 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-08-26 12:10:19,203 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-08-26 12:10:19,205 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1174262034] [2023-08-26 12:10:19,205 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1174262034] provided 1 perfect and 0 imperfect interpolant sequences [2023-08-26 12:10:19,205 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-08-26 12:10:19,205 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2023-08-26 12:10:19,206 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1357250811] [2023-08-26 12:10:19,206 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-08-26 12:10:19,206 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2023-08-26 12:10:19,207 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-08-26 12:10:19,207 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2023-08-26 12:10:19,207 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2023-08-26 12:10:19,207 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 97 out of 239 [2023-08-26 12:10:19,208 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 48 places, 21 transitions, 92 flow. Second operand has 4 states, 4 states have (on average 100.25) internal successors, (401), 4 states have internal predecessors, (401), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-26 12:10:19,208 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2023-08-26 12:10:19,208 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 97 of 239 [2023-08-26 12:10:19,208 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2023-08-26 12:10:19,325 INFO L124 PetriNetUnfolderBase]: 244/426 cut-off events. [2023-08-26 12:10:19,325 INFO L125 PetriNetUnfolderBase]: For 308/308 co-relation queries the response was YES. [2023-08-26 12:10:19,326 INFO L83 FinitePrefix]: Finished finitePrefix Result has 1178 conditions, 426 events. 244/426 cut-off events. For 308/308 co-relation queries the response was YES. Maximal size of possible extension queue 28. Compared 1588 event pairs, 54 based on Foata normal form. 40/465 useless extension candidates. Maximal degree in co-relation 1165. Up to 290 conditions per place. [2023-08-26 12:10:19,327 INFO L140 encePairwiseOnDemand]: 233/239 looper letters, 25 selfloop transitions, 4 changer transitions 18/49 dead transitions. [2023-08-26 12:10:19,327 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 48 places, 49 transitions, 283 flow [2023-08-26 12:10:19,328 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2023-08-26 12:10:19,328 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 5 states. [2023-08-26 12:10:19,329 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 534 transitions. [2023-08-26 12:10:19,330 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.44686192468619246 [2023-08-26 12:10:19,330 INFO L72 ComplementDD]: Start complementDD. Operand 5 states and 534 transitions. [2023-08-26 12:10:19,330 INFO L73 IsDeterministic]: Start isDeterministic. Operand 5 states and 534 transitions. [2023-08-26 12:10:19,330 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2023-08-26 12:10:19,330 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 5 states and 534 transitions. [2023-08-26 12:10:19,332 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 6 states, 5 states have (on average 106.8) internal successors, (534), 5 states have internal predecessors, (534), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-26 12:10:19,334 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 6 states, 6 states have (on average 239.0) internal successors, (1434), 6 states have internal predecessors, (1434), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-26 12:10:19,334 INFO L81 ComplementDD]: Finished complementDD. Result has 6 states, 6 states have (on average 239.0) internal successors, (1434), 6 states have internal predecessors, (1434), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-26 12:10:19,334 INFO L175 Difference]: Start difference. First operand has 48 places, 21 transitions, 92 flow. Second operand 5 states and 534 transitions. [2023-08-26 12:10:19,334 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 48 places, 49 transitions, 283 flow [2023-08-26 12:10:19,336 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 37 places, 49 transitions, 242 flow, removed 8 selfloop flow, removed 11 redundant places. [2023-08-26 12:10:19,337 INFO L231 Difference]: Finished difference. Result has 40 places, 24 transitions, 102 flow [2023-08-26 12:10:19,337 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=239, PETRI_DIFFERENCE_MINUEND_FLOW=66, PETRI_DIFFERENCE_MINUEND_PLACES=33, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=21, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=1, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=17, PETRI_DIFFERENCE_SUBTRAHEND_STATES=5, PETRI_FLOW=102, PETRI_PLACES=40, PETRI_TRANSITIONS=24} [2023-08-26 12:10:19,338 INFO L281 CegarLoopForPetriNet]: 39 programPoint places, 1 predicate places. [2023-08-26 12:10:19,338 INFO L495 AbstractCegarLoop]: Abstraction has has 40 places, 24 transitions, 102 flow [2023-08-26 12:10:19,338 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 100.25) internal successors, (401), 4 states have internal predecessors, (401), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-26 12:10:19,339 INFO L200 CegarLoopForPetriNet]: Found error trace [2023-08-26 12:10:19,339 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-08-26 12:10:19,339 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable9 [2023-08-26 12:10:19,339 INFO L420 AbstractCegarLoop]: === Iteration 11 === Targeting ULTIMATE.startErr6ASSERT_VIOLATIONASSERT === [P1Err0ASSERT_VIOLATIONASSERT, ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 9 more)] === [2023-08-26 12:10:19,339 INFO L145 PredicateUnifier]: Initialized classic predicate unifier [2023-08-26 12:10:19,339 INFO L85 PathProgramCache]: Analyzing trace with hash 1719157, now seen corresponding path program 1 times [2023-08-26 12:10:19,339 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-08-26 12:10:19,339 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1108986892] [2023-08-26 12:10:19,340 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-08-26 12:10:19,340 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-08-26 12:10:19,370 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-08-26 12:10:19,526 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-08-26 12:10:19,526 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-08-26 12:10:19,526 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1108986892] [2023-08-26 12:10:19,526 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1108986892] provided 1 perfect and 0 imperfect interpolant sequences [2023-08-26 12:10:19,526 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-08-26 12:10:19,526 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2023-08-26 12:10:19,526 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1369975039] [2023-08-26 12:10:19,526 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-08-26 12:10:19,527 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2023-08-26 12:10:19,527 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-08-26 12:10:19,527 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2023-08-26 12:10:19,528 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=8, Invalid=12, Unknown=0, NotChecked=0, Total=20 [2023-08-26 12:10:19,528 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 97 out of 239 [2023-08-26 12:10:19,529 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 40 places, 24 transitions, 102 flow. Second operand has 5 states, 5 states have (on average 100.0) internal successors, (500), 5 states have internal predecessors, (500), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-26 12:10:19,529 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2023-08-26 12:10:19,529 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 97 of 239 [2023-08-26 12:10:19,529 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2023-08-26 12:10:19,650 INFO L124 PetriNetUnfolderBase]: 106/215 cut-off events. [2023-08-26 12:10:19,650 INFO L125 PetriNetUnfolderBase]: For 162/162 co-relation queries the response was YES. [2023-08-26 12:10:19,651 INFO L83 FinitePrefix]: Finished finitePrefix Result has 713 conditions, 215 events. 106/215 cut-off events. For 162/162 co-relation queries the response was YES. Maximal size of possible extension queue 15. Compared 702 event pairs, 18 based on Foata normal form. 25/239 useless extension candidates. Maximal degree in co-relation 703. Up to 91 conditions per place. [2023-08-26 12:10:19,652 INFO L140 encePairwiseOnDemand]: 233/239 looper letters, 29 selfloop transitions, 7 changer transitions 16/54 dead transitions. [2023-08-26 12:10:19,652 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 43 places, 54 transitions, 336 flow [2023-08-26 12:10:19,652 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2023-08-26 12:10:19,652 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 6 states. [2023-08-26 12:10:19,654 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6 states to 6 states and 636 transitions. [2023-08-26 12:10:19,654 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.4435146443514644 [2023-08-26 12:10:19,654 INFO L72 ComplementDD]: Start complementDD. Operand 6 states and 636 transitions. [2023-08-26 12:10:19,655 INFO L73 IsDeterministic]: Start isDeterministic. Operand 6 states and 636 transitions. [2023-08-26 12:10:19,655 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2023-08-26 12:10:19,655 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 6 states and 636 transitions. [2023-08-26 12:10:19,656 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 7 states, 6 states have (on average 106.0) internal successors, (636), 6 states have internal predecessors, (636), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-26 12:10:19,658 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 7 states, 7 states have (on average 239.0) internal successors, (1673), 7 states have internal predecessors, (1673), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-26 12:10:19,659 INFO L81 ComplementDD]: Finished complementDD. Result has 7 states, 7 states have (on average 239.0) internal successors, (1673), 7 states have internal predecessors, (1673), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-26 12:10:19,659 INFO L175 Difference]: Start difference. First operand has 40 places, 24 transitions, 102 flow. Second operand 6 states and 636 transitions. [2023-08-26 12:10:19,659 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 43 places, 54 transitions, 336 flow [2023-08-26 12:10:19,660 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 41 places, 54 transitions, 330 flow, removed 1 selfloop flow, removed 2 redundant places. [2023-08-26 12:10:19,662 INFO L231 Difference]: Finished difference. Result has 44 places, 27 transitions, 152 flow [2023-08-26 12:10:19,662 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=239, PETRI_DIFFERENCE_MINUEND_FLOW=96, PETRI_DIFFERENCE_MINUEND_PLACES=36, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=24, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=4, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=17, PETRI_DIFFERENCE_SUBTRAHEND_STATES=6, PETRI_FLOW=152, PETRI_PLACES=44, PETRI_TRANSITIONS=27} [2023-08-26 12:10:19,662 INFO L281 CegarLoopForPetriNet]: 39 programPoint places, 5 predicate places. [2023-08-26 12:10:19,663 INFO L495 AbstractCegarLoop]: Abstraction has has 44 places, 27 transitions, 152 flow [2023-08-26 12:10:19,663 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 100.0) internal successors, (500), 5 states have internal predecessors, (500), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-26 12:10:19,663 INFO L200 CegarLoopForPetriNet]: Found error trace [2023-08-26 12:10:19,663 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-08-26 12:10:19,663 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable10 [2023-08-26 12:10:19,663 INFO L420 AbstractCegarLoop]: === Iteration 12 === Targeting ULTIMATE.startErr6ASSERT_VIOLATIONASSERT === [P1Err0ASSERT_VIOLATIONASSERT, ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 9 more)] === [2023-08-26 12:10:19,664 INFO L145 PredicateUnifier]: Initialized classic predicate unifier [2023-08-26 12:10:19,664 INFO L85 PathProgramCache]: Analyzing trace with hash -1950671353, now seen corresponding path program 1 times [2023-08-26 12:10:19,664 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-08-26 12:10:19,664 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [364129950] [2023-08-26 12:10:19,664 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-08-26 12:10:19,664 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-08-26 12:10:19,702 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-08-26 12:10:19,908 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-08-26 12:10:19,909 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-08-26 12:10:19,909 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [364129950] [2023-08-26 12:10:19,909 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [364129950] provided 1 perfect and 0 imperfect interpolant sequences [2023-08-26 12:10:19,909 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-08-26 12:10:19,909 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2023-08-26 12:10:19,909 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2109459239] [2023-08-26 12:10:19,910 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-08-26 12:10:19,910 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2023-08-26 12:10:19,910 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-08-26 12:10:19,910 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2023-08-26 12:10:19,911 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=12, Invalid=18, Unknown=0, NotChecked=0, Total=30 [2023-08-26 12:10:19,911 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 97 out of 239 [2023-08-26 12:10:19,912 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 44 places, 27 transitions, 152 flow. Second operand has 6 states, 6 states have (on average 99.83333333333333) internal successors, (599), 6 states have internal predecessors, (599), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-26 12:10:19,912 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2023-08-26 12:10:19,912 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 97 of 239 [2023-08-26 12:10:19,912 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2023-08-26 12:10:20,023 INFO L124 PetriNetUnfolderBase]: 54/120 cut-off events. [2023-08-26 12:10:20,024 INFO L125 PetriNetUnfolderBase]: For 174/174 co-relation queries the response was YES. [2023-08-26 12:10:20,024 INFO L83 FinitePrefix]: Finished finitePrefix Result has 446 conditions, 120 events. 54/120 cut-off events. For 174/174 co-relation queries the response was YES. Maximal size of possible extension queue 10. Compared 308 event pairs, 14 based on Foata normal form. 8/127 useless extension candidates. Maximal degree in co-relation 434. Up to 48 conditions per place. [2023-08-26 12:10:20,025 INFO L140 encePairwiseOnDemand]: 233/239 looper letters, 26 selfloop transitions, 10 changer transitions 8/46 dead transitions. [2023-08-26 12:10:20,025 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 48 places, 46 transitions, 330 flow [2023-08-26 12:10:20,025 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2023-08-26 12:10:20,026 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 7 states. [2023-08-26 12:10:20,027 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 7 states to 7 states and 725 transitions. [2023-08-26 12:10:20,028 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.43335325762104004 [2023-08-26 12:10:20,028 INFO L72 ComplementDD]: Start complementDD. Operand 7 states and 725 transitions. [2023-08-26 12:10:20,028 INFO L73 IsDeterministic]: Start isDeterministic. Operand 7 states and 725 transitions. [2023-08-26 12:10:20,029 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2023-08-26 12:10:20,029 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 7 states and 725 transitions. [2023-08-26 12:10:20,030 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 8 states, 7 states have (on average 103.57142857142857) internal successors, (725), 7 states have internal predecessors, (725), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-26 12:10:20,033 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 8 states, 8 states have (on average 239.0) internal successors, (1912), 8 states have internal predecessors, (1912), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-26 12:10:20,034 INFO L81 ComplementDD]: Finished complementDD. Result has 8 states, 8 states have (on average 239.0) internal successors, (1912), 8 states have internal predecessors, (1912), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-26 12:10:20,034 INFO L175 Difference]: Start difference. First operand has 44 places, 27 transitions, 152 flow. Second operand 7 states and 725 transitions. [2023-08-26 12:10:20,034 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 48 places, 46 transitions, 330 flow [2023-08-26 12:10:20,035 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 42 places, 46 transitions, 267 flow, removed 25 selfloop flow, removed 6 redundant places. [2023-08-26 12:10:20,036 INFO L231 Difference]: Finished difference. Result has 45 places, 27 transitions, 142 flow [2023-08-26 12:10:20,036 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=239, PETRI_DIFFERENCE_MINUEND_FLOW=110, PETRI_DIFFERENCE_MINUEND_PLACES=36, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=27, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=10, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=17, PETRI_DIFFERENCE_SUBTRAHEND_STATES=7, PETRI_FLOW=142, PETRI_PLACES=45, PETRI_TRANSITIONS=27} [2023-08-26 12:10:20,037 INFO L281 CegarLoopForPetriNet]: 39 programPoint places, 6 predicate places. [2023-08-26 12:10:20,037 INFO L495 AbstractCegarLoop]: Abstraction has has 45 places, 27 transitions, 142 flow [2023-08-26 12:10:20,038 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 99.83333333333333) internal successors, (599), 6 states have internal predecessors, (599), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-26 12:10:20,038 INFO L200 CegarLoopForPetriNet]: Found error trace [2023-08-26 12:10:20,038 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 12:10:20,038 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable11 [2023-08-26 12:10:20,038 INFO L420 AbstractCegarLoop]: === Iteration 13 === Targeting ULTIMATE.startErr6ASSERT_VIOLATIONASSERT === [P1Err0ASSERT_VIOLATIONASSERT, ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 9 more)] === [2023-08-26 12:10:20,039 INFO L145 PredicateUnifier]: Initialized classic predicate unifier [2023-08-26 12:10:20,039 INFO L85 PathProgramCache]: Analyzing trace with hash 1037459371, now seen corresponding path program 1 times [2023-08-26 12:10:20,039 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-08-26 12:10:20,039 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1349674189] [2023-08-26 12:10:20,039 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-08-26 12:10:20,039 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-08-26 12:10:20,087 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-08-26 12:10:20,723 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-08-26 12:10:20,723 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-08-26 12:10:20,723 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1349674189] [2023-08-26 12:10:20,724 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1349674189] provided 1 perfect and 0 imperfect interpolant sequences [2023-08-26 12:10:20,724 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-08-26 12:10:20,724 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2023-08-26 12:10:20,724 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1806598137] [2023-08-26 12:10:20,724 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-08-26 12:10:20,724 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 8 states [2023-08-26 12:10:20,724 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-08-26 12:10:20,725 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2023-08-26 12:10:20,726 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=16, Invalid=40, Unknown=0, NotChecked=0, Total=56 [2023-08-26 12:10:20,726 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 92 out of 239 [2023-08-26 12:10:20,727 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 45 places, 27 transitions, 142 flow. Second operand has 8 states, 8 states have (on average 94.375) internal successors, (755), 8 states have internal predecessors, (755), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-26 12:10:20,727 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2023-08-26 12:10:20,727 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 92 of 239 [2023-08-26 12:10:20,727 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2023-08-26 12:10:20,893 INFO L124 PetriNetUnfolderBase]: 56/130 cut-off events. [2023-08-26 12:10:20,893 INFO L125 PetriNetUnfolderBase]: For 210/210 co-relation queries the response was YES. [2023-08-26 12:10:20,894 INFO L83 FinitePrefix]: Finished finitePrefix Result has 454 conditions, 130 events. 56/130 cut-off events. For 210/210 co-relation queries the response was YES. Maximal size of possible extension queue 13. Compared 349 event pairs, 14 based on Foata normal form. 1/131 useless extension candidates. Maximal degree in co-relation 443. Up to 65 conditions per place. [2023-08-26 12:10:20,894 INFO L140 encePairwiseOnDemand]: 232/239 looper letters, 28 selfloop transitions, 4 changer transitions 18/52 dead transitions. [2023-08-26 12:10:20,894 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 50 places, 52 transitions, 393 flow [2023-08-26 12:10:20,895 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2023-08-26 12:10:20,895 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 8 states. [2023-08-26 12:10:20,897 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 8 states to 8 states and 773 transitions. [2023-08-26 12:10:20,897 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.4042887029288703 [2023-08-26 12:10:20,897 INFO L72 ComplementDD]: Start complementDD. Operand 8 states and 773 transitions. [2023-08-26 12:10:20,897 INFO L73 IsDeterministic]: Start isDeterministic. Operand 8 states and 773 transitions. [2023-08-26 12:10:20,898 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2023-08-26 12:10:20,898 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 8 states and 773 transitions. [2023-08-26 12:10:20,900 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 9 states, 8 states have (on average 96.625) internal successors, (773), 8 states have internal predecessors, (773), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-26 12:10:20,902 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 9 states, 9 states have (on average 239.0) internal successors, (2151), 9 states have internal predecessors, (2151), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-26 12:10:20,903 INFO L81 ComplementDD]: Finished complementDD. Result has 9 states, 9 states have (on average 239.0) internal successors, (2151), 9 states have internal predecessors, (2151), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-26 12:10:20,903 INFO L175 Difference]: Start difference. First operand has 45 places, 27 transitions, 142 flow. Second operand 8 states and 773 transitions. [2023-08-26 12:10:20,903 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 50 places, 52 transitions, 393 flow [2023-08-26 12:10:20,904 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 44 places, 52 transitions, 313 flow, removed 24 selfloop flow, removed 6 redundant places. [2023-08-26 12:10:20,905 INFO L231 Difference]: Finished difference. Result has 47 places, 27 transitions, 120 flow [2023-08-26 12:10:20,905 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=239, PETRI_DIFFERENCE_MINUEND_FLOW=104, PETRI_DIFFERENCE_MINUEND_PLACES=37, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=27, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=4, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=23, PETRI_DIFFERENCE_SUBTRAHEND_STATES=8, PETRI_FLOW=120, PETRI_PLACES=47, PETRI_TRANSITIONS=27} [2023-08-26 12:10:20,906 INFO L281 CegarLoopForPetriNet]: 39 programPoint places, 8 predicate places. [2023-08-26 12:10:20,906 INFO L495 AbstractCegarLoop]: Abstraction has has 47 places, 27 transitions, 120 flow [2023-08-26 12:10:20,906 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 8 states, 8 states have (on average 94.375) internal successors, (755), 8 states have internal predecessors, (755), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-26 12:10:20,906 INFO L200 CegarLoopForPetriNet]: Found error trace [2023-08-26 12:10:20,906 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 12:10:20,906 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable12 [2023-08-26 12:10:20,907 INFO L420 AbstractCegarLoop]: === Iteration 14 === Targeting ULTIMATE.startErr6ASSERT_VIOLATIONASSERT === [P1Err0ASSERT_VIOLATIONASSERT, ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 9 more)] === [2023-08-26 12:10:20,907 INFO L145 PredicateUnifier]: Initialized classic predicate unifier [2023-08-26 12:10:20,907 INFO L85 PathProgramCache]: Analyzing trace with hash 1375196871, now seen corresponding path program 2 times [2023-08-26 12:10:20,907 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-08-26 12:10:20,907 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [124225979] [2023-08-26 12:10:20,907 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-08-26 12:10:20,907 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-08-26 12:10:20,942 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2023-08-26 12:10:20,942 INFO L356 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2023-08-26 12:10:20,970 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2023-08-26 12:10:20,995 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2023-08-26 12:10:20,995 INFO L360 BasicCegarLoop]: Counterexample is feasible [2023-08-26 12:10:20,996 INFO L805 garLoopResultBuilder]: Registering result UNSAFE for location ULTIMATE.startErr6ASSERT_VIOLATIONASSERT (11 of 12 remaining) [2023-08-26 12:10:20,997 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location P1Err0ASSERT_VIOLATIONASSERT (10 of 12 remaining) [2023-08-26 12:10:20,997 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE (9 of 12 remaining) [2023-08-26 12:10:20,997 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE (8 of 12 remaining) [2023-08-26 12:10:20,998 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (7 of 12 remaining) [2023-08-26 12:10:20,998 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr3REQUIRES_VIOLATIONMEMORY_DEREFERENCE (6 of 12 remaining) [2023-08-26 12:10:20,998 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr4REQUIRES_VIOLATIONMEMORY_DEREFERENCE (5 of 12 remaining) [2023-08-26 12:10:20,998 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr5REQUIRES_VIOLATIONMEMORY_DEREFERENCE (4 of 12 remaining) [2023-08-26 12:10:20,998 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (3 of 12 remaining) [2023-08-26 12:10:20,998 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (2 of 12 remaining) [2023-08-26 12:10:20,998 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr2INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (1 of 12 remaining) [2023-08-26 12:10:20,998 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location P1Err0ASSERT_VIOLATIONASSERT (0 of 12 remaining) [2023-08-26 12:10:20,998 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable13 [2023-08-26 12:10:20,999 INFO L445 BasicCegarLoop]: Path program histogram: [3, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-08-26 12:10:21,004 INFO L228 ceAbstractionStarter]: Analysis of concurrent program completed with 1 thread instances [2023-08-26 12:10:21,004 INFO L178 ceAbstractionStarter]: Computing trace abstraction results [2023-08-26 12:10:21,077 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 26.08 12:10:21 BasicIcfg [2023-08-26 12:10:21,077 INFO L131 PluginConnector]: ------------------------ END TraceAbstraction---------------------------- [2023-08-26 12:10:21,078 INFO L158 Benchmark]: Toolchain (without parser) took 12481.76ms. Allocated memory was 352.3MB in the beginning and 641.7MB in the end (delta: 289.4MB). Free memory was 327.5MB in the beginning and 313.4MB in the end (delta: 14.1MB). Peak memory consumption was 305.0MB. Max. memory is 16.0GB. [2023-08-26 12:10:21,078 INFO L158 Benchmark]: CDTParser took 0.14ms. Allocated memory is still 352.3MB. Free memory is still 328.8MB. There was no memory consumed. Max. memory is 16.0GB. [2023-08-26 12:10:21,078 INFO L158 Benchmark]: CACSL2BoogieTranslator took 568.63ms. Allocated memory is still 352.3MB. Free memory was 327.5MB in the beginning and 304.4MB in the end (delta: 23.1MB). Peak memory consumption was 23.1MB. Max. memory is 16.0GB. [2023-08-26 12:10:21,078 INFO L158 Benchmark]: Boogie Procedure Inliner took 54.96ms. Allocated memory is still 352.3MB. Free memory was 304.4MB in the beginning and 301.9MB in the end (delta: 2.6MB). Peak memory consumption was 2.1MB. Max. memory is 16.0GB. [2023-08-26 12:10:21,079 INFO L158 Benchmark]: Boogie Preprocessor took 29.54ms. Allocated memory is still 352.3MB. Free memory was 301.9MB in the beginning and 300.1MB in the end (delta: 1.8MB). Peak memory consumption was 2.1MB. Max. memory is 16.0GB. [2023-08-26 12:10:21,079 INFO L158 Benchmark]: RCFGBuilder took 738.85ms. Allocated memory is still 352.3MB. Free memory was 300.1MB in the beginning and 311.5MB in the end (delta: -11.4MB). Peak memory consumption was 24.8MB. Max. memory is 16.0GB. [2023-08-26 12:10:21,079 INFO L158 Benchmark]: TraceAbstraction took 11081.80ms. Allocated memory was 352.3MB in the beginning and 641.7MB in the end (delta: 289.4MB). Free memory was 310.6MB in the beginning and 313.4MB in the end (delta: -2.8MB). Peak memory consumption was 286.5MB. Max. memory is 16.0GB. [2023-08-26 12:10:21,080 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.14ms. Allocated memory is still 352.3MB. Free memory is still 328.8MB. There was no memory consumed. Max. memory is 16.0GB. * CACSL2BoogieTranslator took 568.63ms. Allocated memory is still 352.3MB. Free memory was 327.5MB in the beginning and 304.4MB in the end (delta: 23.1MB). Peak memory consumption was 23.1MB. Max. memory is 16.0GB. * Boogie Procedure Inliner took 54.96ms. Allocated memory is still 352.3MB. Free memory was 304.4MB in the beginning and 301.9MB in the end (delta: 2.6MB). Peak memory consumption was 2.1MB. Max. memory is 16.0GB. * Boogie Preprocessor took 29.54ms. Allocated memory is still 352.3MB. Free memory was 301.9MB in the beginning and 300.1MB in the end (delta: 1.8MB). Peak memory consumption was 2.1MB. Max. memory is 16.0GB. * RCFGBuilder took 738.85ms. Allocated memory is still 352.3MB. Free memory was 300.1MB in the beginning and 311.5MB in the end (delta: -11.4MB). Peak memory consumption was 24.8MB. Max. memory is 16.0GB. * TraceAbstraction took 11081.80ms. Allocated memory was 352.3MB in the beginning and 641.7MB in the end (delta: 289.4MB). Free memory was 310.6MB in the beginning and 313.4MB in the end (delta: -2.8MB). Peak memory consumption was 286.5MB. Max. memory is 16.0GB. * Results from de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator: - GenericResultAtLocation [Line: 268]: Unsoundness Warning unspecified type, defaulting to int C: short [268] - GenericResultAtLocation [Line: 268]: Unsoundness Warning unspecified type, defaulting to int C: short [268] * Results from de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: - StatisticsResult: PetriNetLargeBlockEncoding benchmarks Lipton Reduction Statistics: ReductionTime: 4.0s, 121 PlacesBefore, 39 PlacesAfterwards, 114 TransitionsBefore, 30 TransitionsAfterwards, 2038 CoEnabledTransitionPairs, 6 FixpointIterations, 50 TrivialSequentialCompositions, 58 ConcurrentSequentialCompositions, 0 TrivialYvCompositions, 12 ConcurrentYvCompositions, 2 ChoiceCompositions, 122 TotalNumberOfCompositions, 5046 MoverChecksTotal, Independence Relation Statistics: CachedIndependenceRelation.Independence Queries: [ total: 2303, independent: 2158, independent conditional: 0, independent unconditional: 2158, dependent: 145, dependent conditional: 0, dependent unconditional: 145, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , CachedIndependenceRelation.Statistics on underlying relation: SyntacticIndependenceRelation.Independence Queries: [ total: 1099, independent: 1064, independent conditional: 0, independent unconditional: 1064, dependent: 35, dependent conditional: 0, dependent unconditional: 35, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , Cache Queries: [ total: 2303, independent: 1094, independent conditional: 0, independent unconditional: 1094, dependent: 110, dependent conditional: 0, dependent unconditional: 110, unknown: 1099, unknown conditional: 0, unknown unconditional: 1099] , Statistics on independence cache: Total cache size (in pairs): 83, Positive cache size: 69, Positive conditional cache size: 0, Positive unconditional cache size: 69, Negative cache size: 14, Negative conditional cache size: 0, Negative unconditional cache size: 14, Unknown cache size: 0, Unknown conditional cache size: 0, Unknown unconditional cache size: 0 - CounterExampleResult [Line: 18]: assertion can be violated assertion can be violated We found a FailurePath: [L710] 0 int __unbuffered_cnt = 0; [L712] 0 int __unbuffered_p0_EAX = 0; [L714] 0 int __unbuffered_p0_EBX = 0; [L716] 0 int __unbuffered_p2_EAX = 0; [L717] 0 _Bool main$tmp_guard0; [L718] 0 _Bool main$tmp_guard1; [L720] 0 int x = 0; [L721] 0 _Bool x$flush_delayed; [L722] 0 int x$mem_tmp; [L723] 0 _Bool x$r_buff0_thd0; [L724] 0 _Bool x$r_buff0_thd1; [L725] 0 _Bool x$r_buff0_thd2; [L726] 0 _Bool x$r_buff0_thd3; [L727] 0 _Bool x$r_buff1_thd0; [L728] 0 _Bool x$r_buff1_thd1; [L729] 0 _Bool x$r_buff1_thd2; [L730] 0 _Bool x$r_buff1_thd3; [L731] 0 _Bool x$read_delayed; [L732] 0 int *x$read_delayed_var; [L733] 0 int x$w_buff0; [L734] 0 _Bool x$w_buff0_used; [L735] 0 int x$w_buff1; [L736] 0 _Bool x$w_buff1_used; [L738] 0 int y = 0; [L739] 0 _Bool weak$$choice0; [L740] 0 _Bool weak$$choice2; [L829] 0 pthread_t t1828; [L830] FCALL, FORK 0 pthread_create(&t1828, ((void *)0), P0, ((void *)0)) VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=0, __unbuffered_p0_EBX=0, __unbuffered_p2_EAX=0, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, pthread_create(&t1828, ((void *)0), P0, ((void *)0))=-3, t1828={5:0}, weak$$choice0=0, weak$$choice2=0, x$flush_delayed=0, x$mem_tmp=0, x$r_buff0_thd0=0, x$r_buff0_thd1=0, x$r_buff0_thd2=0, x$r_buff0_thd3=0, x$r_buff1_thd0=0, x$r_buff1_thd1=0, x$r_buff1_thd2=0, x$r_buff1_thd3=0, x$read_delayed=0, x$read_delayed_var={0:0}, x$w_buff0=0, x$w_buff0_used=0, x$w_buff1=0, x$w_buff1_used=0, x=0, y=0] [L831] 0 pthread_t t1829; [L832] FCALL, FORK 0 pthread_create(&t1829, ((void *)0), P1, ((void *)0)) VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=0, __unbuffered_p0_EBX=0, __unbuffered_p2_EAX=0, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, pthread_create(&t1829, ((void *)0), P1, ((void *)0))=-2, t1828={5:0}, t1829={6:0}, weak$$choice0=0, weak$$choice2=0, x$flush_delayed=0, x$mem_tmp=0, x$r_buff0_thd0=0, x$r_buff0_thd1=0, x$r_buff0_thd2=0, x$r_buff0_thd3=0, x$r_buff1_thd0=0, x$r_buff1_thd1=0, x$r_buff1_thd2=0, x$r_buff1_thd3=0, x$read_delayed=0, x$read_delayed_var={0:0}, x$w_buff0=0, x$w_buff0_used=0, x$w_buff1=0, x$w_buff1_used=0, x=0, y=0] [L833] 0 pthread_t t1830; [L834] FCALL, FORK 0 pthread_create(&t1830, ((void *)0), P2, ((void *)0)) VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=0, __unbuffered_p0_EBX=0, __unbuffered_p2_EAX=0, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, pthread_create(&t1830, ((void *)0), P2, ((void *)0))=-1, t1828={5:0}, t1829={6:0}, t1830={3:0}, weak$$choice0=0, weak$$choice2=0, x$flush_delayed=0, x$mem_tmp=0, x$r_buff0_thd0=0, x$r_buff0_thd1=0, x$r_buff0_thd2=0, x$r_buff0_thd3=0, x$r_buff1_thd0=0, x$r_buff1_thd1=0, x$r_buff1_thd2=0, x$r_buff1_thd3=0, x$read_delayed=0, x$read_delayed_var={0:0}, x$w_buff0=0, x$w_buff0_used=0, x$w_buff1=0, x$w_buff1_used=0, x=0, y=0] [L772] 2 x$w_buff1 = x$w_buff0 [L773] 2 x$w_buff0 = 1 [L774] 2 x$w_buff1_used = x$w_buff0_used [L775] 2 x$w_buff0_used = (_Bool)1 [L776] CALL 2 __VERIFIER_assert(!(x$w_buff1_used && x$w_buff0_used)) [L19] COND FALSE 2 !(!expression) [L776] RET 2 __VERIFIER_assert(!(x$w_buff1_used && x$w_buff0_used)) [L777] 2 x$r_buff1_thd0 = x$r_buff0_thd0 [L778] 2 x$r_buff1_thd1 = x$r_buff0_thd1 [L779] 2 x$r_buff1_thd2 = x$r_buff0_thd2 [L780] 2 x$r_buff1_thd3 = x$r_buff0_thd3 [L781] 2 x$r_buff0_thd2 = (_Bool)1 VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=0, __unbuffered_p0_EBX=0, __unbuffered_p2_EAX=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$flush_delayed=0, x$mem_tmp=0, x$r_buff0_thd0=0, x$r_buff0_thd1=0, x$r_buff0_thd2=1, x$r_buff0_thd3=0, x$r_buff1_thd0=0, x$r_buff1_thd1=0, x$r_buff1_thd2=0, x$r_buff1_thd3=0, x$read_delayed=0, x$read_delayed_var={0:0}, x$w_buff0=1, x$w_buff0_used=1, x$w_buff1=0, x$w_buff1_used=0, x=0, y=0] [L784] 2 y = 1 VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=0, __unbuffered_p0_EBX=0, __unbuffered_p2_EAX=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$flush_delayed=0, x$mem_tmp=0, x$r_buff0_thd0=0, x$r_buff0_thd1=0, x$r_buff0_thd2=1, x$r_buff0_thd3=0, x$r_buff1_thd0=0, x$r_buff1_thd1=0, x$r_buff1_thd2=0, x$r_buff1_thd3=0, x$read_delayed=0, x$read_delayed_var={0:0}, x$w_buff0=1, x$w_buff0_used=1, x$w_buff1=0, x$w_buff1_used=0, x=0, y=1] [L801] 3 __unbuffered_p2_EAX = y VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=0, __unbuffered_p0_EBX=0, __unbuffered_p2_EAX=1, arg={0:0}, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=0, x$flush_delayed=0, x$mem_tmp=0, x$r_buff0_thd0=0, x$r_buff0_thd1=0, x$r_buff0_thd2=1, x$r_buff0_thd3=0, x$r_buff1_thd0=0, x$r_buff1_thd1=0, x$r_buff1_thd2=0, x$r_buff1_thd3=0, x$read_delayed=0, x$read_delayed_var={0:0}, x$w_buff0=1, x$w_buff0_used=1, x$w_buff1=0, x$w_buff1_used=0, x=0, y=1] [L804] 3 y = 2 VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=0, __unbuffered_p0_EBX=0, __unbuffered_p2_EAX=1, arg={0:0}, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=0, x$flush_delayed=0, x$mem_tmp=0, x$r_buff0_thd0=0, x$r_buff0_thd1=0, x$r_buff0_thd2=1, x$r_buff0_thd3=0, x$r_buff1_thd0=0, x$r_buff1_thd1=0, x$r_buff1_thd2=0, x$r_buff1_thd3=0, x$read_delayed=0, x$read_delayed_var={0:0}, x$w_buff0=1, x$w_buff0_used=1, x$w_buff1=0, x$w_buff1_used=0, x=0, y=2] [L744] 1 __unbuffered_p0_EAX = y VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=2, __unbuffered_p0_EBX=0, __unbuffered_p2_EAX=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$flush_delayed=0, x$mem_tmp=0, x$r_buff0_thd0=0, x$r_buff0_thd1=0, x$r_buff0_thd2=1, x$r_buff0_thd3=0, x$r_buff1_thd0=0, x$r_buff1_thd1=0, x$r_buff1_thd2=0, x$r_buff1_thd3=0, x$read_delayed=0, x$read_delayed_var={0:0}, x$w_buff0=1, x$w_buff0_used=1, x$w_buff1=0, x$w_buff1_used=0, x=0, y=2] [L747] 1 weak$$choice0 = __VERIFIER_nondet_bool() [L748] 1 weak$$choice2 = __VERIFIER_nondet_bool() [L749] 1 x$flush_delayed = weak$$choice2 [L750] 1 x$mem_tmp = x [L751] 1 x = !x$w_buff0_used || !x$r_buff0_thd1 && !x$w_buff1_used || !x$r_buff0_thd1 && !x$r_buff1_thd1 ? x : (x$w_buff0_used && x$r_buff0_thd1 ? x$w_buff0 : x$w_buff1) [L752] 1 x$w_buff0 = weak$$choice2 ? x$w_buff0 : (!x$w_buff0_used || !x$r_buff0_thd1 && !x$w_buff1_used || !x$r_buff0_thd1 && !x$r_buff1_thd1 ? x$w_buff0 : (x$w_buff0_used && x$r_buff0_thd1 ? x$w_buff0 : x$w_buff0)) [L753] 1 x$w_buff1 = weak$$choice2 ? x$w_buff1 : (!x$w_buff0_used || !x$r_buff0_thd1 && !x$w_buff1_used || !x$r_buff0_thd1 && !x$r_buff1_thd1 ? x$w_buff1 : (x$w_buff0_used && x$r_buff0_thd1 ? x$w_buff1 : x$w_buff1)) [L754] 1 x$w_buff0_used = weak$$choice2 ? x$w_buff0_used : (!x$w_buff0_used || !x$r_buff0_thd1 && !x$w_buff1_used || !x$r_buff0_thd1 && !x$r_buff1_thd1 ? x$w_buff0_used : (x$w_buff0_used && x$r_buff0_thd1 ? (_Bool)0 : x$w_buff0_used)) [L755] 1 x$w_buff1_used = weak$$choice2 ? x$w_buff1_used : (!x$w_buff0_used || !x$r_buff0_thd1 && !x$w_buff1_used || !x$r_buff0_thd1 && !x$r_buff1_thd1 ? x$w_buff1_used : (x$w_buff0_used && x$r_buff0_thd1 ? (_Bool)0 : (_Bool)0)) [L756] 1 x$r_buff0_thd1 = weak$$choice2 ? x$r_buff0_thd1 : (!x$w_buff0_used || !x$r_buff0_thd1 && !x$w_buff1_used || !x$r_buff0_thd1 && !x$r_buff1_thd1 ? x$r_buff0_thd1 : (x$w_buff0_used && x$r_buff0_thd1 ? (_Bool)0 : x$r_buff0_thd1)) [L757] 1 x$r_buff1_thd1 = weak$$choice2 ? x$r_buff1_thd1 : (!x$w_buff0_used || !x$r_buff0_thd1 && !x$w_buff1_used || !x$r_buff0_thd1 && !x$r_buff1_thd1 ? x$r_buff1_thd1 : (x$w_buff0_used && x$r_buff0_thd1 ? (_Bool)0 : (_Bool)0)) [L758] 1 __unbuffered_p0_EBX = x [L759] 1 x = x$flush_delayed ? x$mem_tmp : x [L760] 1 x$flush_delayed = (_Bool)0 VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=2, __unbuffered_p0_EBX=0, __unbuffered_p2_EAX=1, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice2=1, x$flush_delayed=0, x$mem_tmp=0, x$r_buff0_thd0=0, x$r_buff0_thd1=0, x$r_buff0_thd2=1, x$r_buff0_thd3=0, x$r_buff1_thd0=0, x$r_buff1_thd1=0, x$r_buff1_thd2=0, x$r_buff1_thd3=0, x$read_delayed=0, x$read_delayed_var={0:0}, x$w_buff0=1, x$w_buff0_used=1, x$w_buff1=0, x$w_buff1_used=0, x=0, y=2] [L787] 2 x = x$w_buff0_used && x$r_buff0_thd2 ? x$w_buff0 : (x$w_buff1_used && x$r_buff1_thd2 ? x$w_buff1 : x) [L788] 2 x$w_buff0_used = x$w_buff0_used && x$r_buff0_thd2 ? (_Bool)0 : x$w_buff0_used [L789] 2 x$w_buff1_used = x$w_buff0_used && x$r_buff0_thd2 || x$w_buff1_used && x$r_buff1_thd2 ? (_Bool)0 : x$w_buff1_used [L790] 2 x$r_buff0_thd2 = x$w_buff0_used && x$r_buff0_thd2 ? (_Bool)0 : x$r_buff0_thd2 [L791] 2 x$r_buff1_thd2 = x$w_buff0_used && x$r_buff0_thd2 || x$w_buff1_used && x$r_buff1_thd2 ? (_Bool)0 : x$r_buff1_thd2 VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=2, __unbuffered_p0_EBX=0, __unbuffered_p2_EAX=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=1, x$flush_delayed=0, x$mem_tmp=0, x$r_buff0_thd0=0, x$r_buff0_thd1=0, x$r_buff0_thd2=1, x$r_buff0_thd3=0, x$r_buff1_thd0=0, x$r_buff1_thd1=0, x$r_buff1_thd2=0, x$r_buff1_thd3=0, x$read_delayed=0, x$read_delayed_var={0:0}, x$w_buff0=1, x$w_buff0_used=0, x$w_buff1=0, x$w_buff1_used=0, x=1, y=2] [L794] 2 __unbuffered_cnt = __unbuffered_cnt + 1 [L796] 2 return 0; [L807] 3 x = x$w_buff0_used && x$r_buff0_thd3 ? x$w_buff0 : (x$w_buff1_used && x$r_buff1_thd3 ? x$w_buff1 : x) [L808] 3 x$w_buff0_used = x$w_buff0_used && x$r_buff0_thd3 ? (_Bool)0 : x$w_buff0_used [L809] 3 x$w_buff1_used = x$w_buff0_used && x$r_buff0_thd3 || x$w_buff1_used && x$r_buff1_thd3 ? (_Bool)0 : x$w_buff1_used [L810] 3 x$r_buff0_thd3 = x$w_buff0_used && x$r_buff0_thd3 ? (_Bool)0 : x$r_buff0_thd3 [L811] 3 x$r_buff1_thd3 = x$w_buff0_used && x$r_buff0_thd3 || x$w_buff1_used && x$r_buff1_thd3 ? (_Bool)0 : x$r_buff1_thd3 VAL [__unbuffered_cnt=1, __unbuffered_p0_EAX=2, __unbuffered_p0_EBX=0, __unbuffered_p2_EAX=1, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice2=1, x$flush_delayed=0, x$mem_tmp=0, x$r_buff0_thd0=0, x$r_buff0_thd1=0, x$r_buff0_thd2=1, x$r_buff0_thd3=0, x$r_buff1_thd0=0, x$r_buff1_thd1=0, x$r_buff1_thd2=0, x$r_buff1_thd3=0, x$read_delayed=0, x$read_delayed_var={0:0}, x$w_buff0=1, x$w_buff0_used=0, x$w_buff1=0, x$w_buff1_used=0, x=1, y=2] [L814] 3 __unbuffered_cnt = __unbuffered_cnt + 1 [L816] 3 return 0; [L765] 1 __unbuffered_cnt = __unbuffered_cnt + 1 [L767] 1 return 0; [L836] 0 main$tmp_guard0 = __unbuffered_cnt == 3 [L838] CALL 0 assume_abort_if_not(main$tmp_guard0) [L4] COND FALSE 0 !(!cond) [L838] RET 0 assume_abort_if_not(main$tmp_guard0) [L840] 0 x = x$w_buff0_used && x$r_buff0_thd0 ? x$w_buff0 : (x$w_buff1_used && x$r_buff1_thd0 ? x$w_buff1 : x) [L841] 0 x$w_buff0_used = x$w_buff0_used && x$r_buff0_thd0 ? (_Bool)0 : x$w_buff0_used [L842] 0 x$w_buff1_used = x$w_buff0_used && x$r_buff0_thd0 || x$w_buff1_used && x$r_buff1_thd0 ? (_Bool)0 : x$w_buff1_used [L843] 0 x$r_buff0_thd0 = x$w_buff0_used && x$r_buff0_thd0 ? (_Bool)0 : x$r_buff0_thd0 [L844] 0 x$r_buff1_thd0 = x$w_buff0_used && x$r_buff0_thd0 || x$w_buff1_used && x$r_buff1_thd0 ? (_Bool)0 : x$r_buff1_thd0 VAL [\result={0:0}, \result={0:0}, __unbuffered_cnt=3, __unbuffered_p0_EAX=2, __unbuffered_p0_EBX=0, __unbuffered_p2_EAX=1, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, main$tmp_guard0=1, main$tmp_guard1=0, t1828={5:0}, t1829={6:0}, t1830={3:0}, weak$$choice2=1, x$flush_delayed=0, x$mem_tmp=0, x$r_buff0_thd0=0, x$r_buff0_thd1=0, x$r_buff0_thd2=1, x$r_buff0_thd3=0, x$r_buff1_thd0=0, x$r_buff1_thd1=0, x$r_buff1_thd2=0, x$r_buff1_thd3=0, x$read_delayed=0, x$read_delayed_var={0:0}, x$w_buff0=1, x$w_buff0_used=0, x$w_buff1=0, x$w_buff1_used=0, x=1, y=2] [L847] 0 main$tmp_guard1 = !(y == 2 && __unbuffered_p0_EAX == 2 && __unbuffered_p0_EBX == 0 && __unbuffered_p2_EAX == 1) [L849] CALL 0 __VERIFIER_assert(main$tmp_guard1) [L19] COND TRUE 0 !expression [L19] CALL 0 reach_error() [L18] COND FALSE 0 !(0) [L18] 0 __assert_fail ("0", "safe002_power.opt_pso.oepc_pso.opt_rmo.opt.c", 9, __extension__ __PRETTY_FUNCTION__) VAL [\read(__PRETTY_FUNCTION__)={49:50}, \result={0:0}, \result={0:0}, __unbuffered_cnt=3, __unbuffered_p0_EAX=2, __unbuffered_p0_EBX=0, __unbuffered_p2_EAX=1, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, main$tmp_guard0=1, main$tmp_guard1=0, weak$$choice2=1, x$flush_delayed=0, x$mem_tmp=0, x$r_buff0_thd0=0, x$r_buff0_thd1=0, x$r_buff0_thd2=1, x$r_buff0_thd3=0, x$r_buff1_thd0=0, x$r_buff1_thd1=0, x$r_buff1_thd2=0, x$r_buff1_thd3=0, x$read_delayed=0, x$read_delayed_var={0:0}, x$w_buff0=1, x$w_buff0_used=0, x$w_buff1=0, x$w_buff1_used=0, x=1, y=2] - UnprovableResult [Line: 18]: 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: 834]: 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: 830]: 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: 832]: 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 7 procedures, 142 locations, 12 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: 10.9s, OverallIterations: 14, TraceHistogramMax: 1, PathProgramHistogramMax: 3, EmptinessCheckTime: 0.0s, AutomataDifference: 3.8s, DeadEndRemovalTime: 0.0s, HoareAnnotationTime: 0.0s, InitialAbstractionConstructionTime: 4.1s, HoareTripleCheckerStatistics: 0 mSolverCounterUnknown, 375 SdHoareTripleChecker+Valid, 1.2s IncrementalHoareTripleChecker+Time, 0 mSdLazyCounter, 375 mSDsluCounter, 44 SdHoareTripleChecker+Invalid, 1.0s Time, 0 mProtectedAction, 0 SdHoareTripleChecker+Unchecked, 0 IncrementalHoareTripleChecker+Unchecked, 21 mSDsCounter, 30 IncrementalHoareTripleChecker+Valid, 0 mProtectedPredicate, 1141 IncrementalHoareTripleChecker+Invalid, 1171 SdHoareTripleChecker+Unknown, 0 mSolverCounterNotChecked, 30 mSolverCounterUnsat, 23 mSDtfsCounter, 1141 mSolverCounterSat, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Unknown, PredicateUnifierStatistics: 0 DeclaredPredicates, 62 GetRequests, 6 SyntacticMatches, 0 SemanticMatches, 56 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 24 ImplicationChecksByTransitivity, 0.3s Time, 0.0s BasicInterpolantAutomatonTime, BiggestAbstraction: size=260occurred in iteration=5, InterpolantAutomatonStates: 75, traceCheckStatistics: No data available, InterpolantConsolidationStatistics: No data available, PathInvariantsStatistics: No data available, 0/0 InterpolantCoveringCapability, TotalInterpolationStatistics: No data available, 0.0s DumpTime, AutomataMinimizationStatistics: No data available, HoareAnnotationStatistics: No data available, RefinementEngineStatistics: TRACE_CHECK: 0.0s SsaConstructionTime, 0.3s SatisfiabilityAnalysisTime, 2.3s InterpolantComputationTime, 189 NumberOfCodeBlocks, 189 NumberOfCodeBlocksAsserted, 14 NumberOfCheckSat, 155 ConstructedInterpolants, 0 QuantifiedInterpolants, 764 SizeOfPredicates, 0 NumberOfNonLiveVariables, 0 ConjunctsInSsa, 0 ConjunctsInUnsatCore, 13 InterpolantComputations, 13 PerfectInterpolantSequences, 0/0 InterpolantCoveringCapability, INVARIANT_SYNTHESIS: No data available, INTERPOLANT_CONSOLIDATION: No data available, ABSTRACT_INTERPRETATION: No data available, PDR: No data available, ACCELERATED_INTERPOLATION: No data available, SIFA: No data available, ReuseStatistics: No data available RESULT: Ultimate proved your program to be incorrect! [2023-08-26 12:10:21,102 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 (1)] Ended with exit code 0 Received shutdown request...