/usr/bin/java -Xmx16000000000 -Xss4m -jar ./plugins/org.eclipse.equinox.launcher_1.5.800.v20200727-1323.jar -data @noDefault -ultimatedata ./data -s ../../../trunk/examples/settings/automizer/concurrent/svcomp-Reach-32bit-Automizer_Default-noMmResRef-PN-VariableLbe.epf --traceabstraction.order.of.the.error.locations.to.be.checked INSUFFICIENT_FIRST -tc ../../../trunk/examples/toolchains/AutomizerCInline.xml --cacsl2boogietranslator.check.unreachability.of.reach_error.function false --cacsl2boogietranslator.pointer.base.address.is.valid.at.dereference ASSERTandASSUME --cacsl2boogietranslator.pointer.to.allocated.memory.at.dereference ASSERTandASSUME --cacsl2boogietranslator.check.array.bounds.for.arrays.that.are.off.heap ASSERTandASSUME --cacsl2boogietranslator.check.if.freed.pointer.was.valid true --cacsl2boogietranslator.adapt.memory.model.on.pointer.casts.if.necessary true -i ../../../trunk/examples/svcomp/pthread-wmm/safe030_power.oepc_pso.oepc_rmo.oepc.i -------------------------------------------------------------------------------- This is Ultimate 0.2.3-dev-ac9dbd0-m [2023-08-26 15:24:41,333 INFO L188 SettingsManager]: Resetting all preferences to default values... [2023-08-26 15:24:41,418 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 15:24:41,423 WARN L101 SettingsManager]: Preference file contains the following unknown settings: [2023-08-26 15:24:41,423 WARN L103 SettingsManager]: * de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.Checked method. Library mode if empty. [2023-08-26 15:24:41,454 INFO L130 SettingsManager]: Preferences different from defaults after loading the file: [2023-08-26 15:24:41,455 INFO L151 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2023-08-26 15:24:41,455 INFO L153 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2023-08-26 15:24:41,456 INFO L151 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2023-08-26 15:24:41,456 INFO L153 SettingsManager]: * Create parallel compositions if possible=false [2023-08-26 15:24:41,456 INFO L153 SettingsManager]: * Use SBE=true [2023-08-26 15:24:41,457 INFO L151 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2023-08-26 15:24:41,457 INFO L153 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2023-08-26 15:24:41,461 INFO L153 SettingsManager]: * sizeof long=4 [2023-08-26 15:24:41,461 INFO L153 SettingsManager]: * Overapproximate operations on floating types=true [2023-08-26 15:24:41,462 INFO L153 SettingsManager]: * sizeof POINTER=4 [2023-08-26 15:24:41,463 INFO L153 SettingsManager]: * Check division by zero=IGNORE [2023-08-26 15:24:41,463 INFO L153 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2023-08-26 15:24:41,463 INFO L153 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2023-08-26 15:24:41,463 INFO L153 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2023-08-26 15:24:41,464 INFO L153 SettingsManager]: * sizeof long double=12 [2023-08-26 15:24:41,464 INFO L153 SettingsManager]: * Check if freed pointer was valid=false [2023-08-26 15:24:41,464 INFO L153 SettingsManager]: * Use constant arrays=true [2023-08-26 15:24:41,465 INFO L151 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2023-08-26 15:24:41,465 INFO L153 SettingsManager]: * Size of a code block=SequenceOfStatements [2023-08-26 15:24:41,465 INFO L153 SettingsManager]: * To the following directory=./dump/ [2023-08-26 15:24:41,465 INFO L153 SettingsManager]: * SMT solver=External_DefaultMode [2023-08-26 15:24:41,466 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2023-08-26 15:24:41,466 INFO L151 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2023-08-26 15:24:41,466 INFO L153 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2023-08-26 15:24:41,467 INFO L153 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopsAndPotentialCycles [2023-08-26 15:24:41,467 INFO L153 SettingsManager]: * Trace refinement strategy=CAMEL [2023-08-26 15:24:41,468 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2023-08-26 15:24:41,468 INFO L153 SettingsManager]: * Automaton type used in concurrency analysis=PETRI_NET [2023-08-26 15:24:41,468 INFO L153 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2023-08-26 15:24:41,468 INFO L153 SettingsManager]: * Independence relation used for large block encoding in concurrent analysis=SYNTACTIC WARNING: An illegal reflective access operation has occurred WARNING: Illegal reflective access by com.sun.xml.bind.v2.runtime.reflect.opt.Injector$1 (file:/storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/plugins/com.sun.xml.bind_2.2.0.v201505121915.jar) to method java.lang.ClassLoader.defineClass(java.lang.String,byte[],int,int) WARNING: Please consider reporting this to the maintainers of com.sun.xml.bind.v2.runtime.reflect.opt.Injector$1 WARNING: Use --illegal-access=warn to enable warnings of further illegal reflective access operations WARNING: All illegal access operations will be denied in a future release Applying setting for plugin de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: Order of the error locations to be checked -> INSUFFICIENT_FIRST Applying setting for plugin de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator: Check unreachability of reach_error function -> false Applying setting for plugin de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator: Pointer base address is valid at dereference -> ASSERTandASSUME Applying setting for plugin de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator: Pointer to allocated memory at dereference -> ASSERTandASSUME Applying setting for plugin de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator: Check array bounds for arrays that are off heap -> ASSERTandASSUME Applying setting for plugin de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator: Check if freed pointer was valid -> true Applying setting for plugin de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator: Adapt memory model on pointer casts if necessary -> true [2023-08-26 15:24:41,795 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2023-08-26 15:24:41,819 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2023-08-26 15:24:41,821 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2023-08-26 15:24:41,822 INFO L270 PluginConnector]: Initializing CDTParser... [2023-08-26 15:24:41,823 INFO L274 PluginConnector]: CDTParser initialized [2023-08-26 15:24:41,824 INFO L431 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../../../trunk/examples/svcomp/pthread-wmm/safe030_power.oepc_pso.oepc_rmo.oepc.i [2023-08-26 15:24:42,971 INFO L533 CDTParser]: Created temporary CDT project at NULL [2023-08-26 15:24:43,262 INFO L384 CDTParser]: Found 1 translation units. [2023-08-26 15:24:43,264 INFO L180 CDTParser]: Scanning /storage/repos/ultimate/trunk/examples/svcomp/pthread-wmm/safe030_power.oepc_pso.oepc_rmo.oepc.i [2023-08-26 15:24:43,283 INFO L427 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/d1c7662b1/9da5df4fc593412fa359f7f49715053a/FLAG8c5dd0cb8 [2023-08-26 15:24:43,303 INFO L435 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/d1c7662b1/9da5df4fc593412fa359f7f49715053a [2023-08-26 15:24:43,307 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2023-08-26 15:24:43,308 INFO L133 ToolchainWalker]: Walking toolchain with 5 elements. [2023-08-26 15:24:43,309 INFO L112 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2023-08-26 15:24:43,309 INFO L270 PluginConnector]: Initializing CACSL2BoogieTranslator... [2023-08-26 15:24:43,311 INFO L274 PluginConnector]: CACSL2BoogieTranslator initialized [2023-08-26 15:24:43,312 INFO L184 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 26.08 03:24:43" (1/1) ... [2023-08-26 15:24:43,313 INFO L204 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@75660891 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 26.08 03:24:43, skipping insertion in model container [2023-08-26 15:24:43,313 INFO L184 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 26.08 03:24:43" (1/1) ... [2023-08-26 15:24:43,381 INFO L176 MainTranslator]: Built tables and reachable declarations [2023-08-26 15:24:43,758 INFO L209 PostProcessor]: Analyzing one entry point: main [2023-08-26 15:24:43,775 INFO L201 MainTranslator]: Completed pre-run [2023-08-26 15:24:43,800 WARN L75 lationResultReporter]: Unsoundness Warning: unspecified type, defaulting to int C: short [267] [2023-08-26 15:24:43,802 WARN L75 lationResultReporter]: Unsoundness Warning: unspecified type, defaulting to int C: short [267] [2023-08-26 15:24:43,839 INFO L209 PostProcessor]: Analyzing one entry point: main [2023-08-26 15:24:43,877 WARN L669 CHandler]: The function __VERIFIER_atomic_begin is called, but not defined or handled by StandardFunctionHandler. [2023-08-26 15:24:43,877 WARN L669 CHandler]: The function __VERIFIER_atomic_end is called, but not defined or handled by StandardFunctionHandler. [2023-08-26 15:24:43,883 INFO L206 MainTranslator]: Completed translation [2023-08-26 15:24:43,884 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 26.08 03:24:43 WrapperNode [2023-08-26 15:24:43,884 INFO L131 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2023-08-26 15:24:43,885 INFO L112 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2023-08-26 15:24:43,885 INFO L270 PluginConnector]: Initializing Boogie Procedure Inliner... [2023-08-26 15:24:43,885 INFO L274 PluginConnector]: Boogie Procedure Inliner initialized [2023-08-26 15:24:43,891 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 26.08 03:24:43" (1/1) ... [2023-08-26 15:24:43,920 INFO L184 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 26.08 03:24:43" (1/1) ... [2023-08-26 15:24:43,956 INFO L138 Inliner]: procedures = 176, calls = 55, calls flagged for inlining = 6, calls inlined = 7, statements flattened = 149 [2023-08-26 15:24:43,957 INFO L131 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2023-08-26 15:24:43,958 INFO L112 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2023-08-26 15:24:43,958 INFO L270 PluginConnector]: Initializing Boogie Preprocessor... [2023-08-26 15:24:43,958 INFO L274 PluginConnector]: Boogie Preprocessor initialized [2023-08-26 15:24:43,965 INFO L184 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 26.08 03:24:43" (1/1) ... [2023-08-26 15:24:43,965 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 26.08 03:24:43" (1/1) ... [2023-08-26 15:24:43,970 INFO L184 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 26.08 03:24:43" (1/1) ... [2023-08-26 15:24:43,970 INFO L184 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 26.08 03:24:43" (1/1) ... [2023-08-26 15:24:43,977 INFO L184 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 26.08 03:24:43" (1/1) ... [2023-08-26 15:24:43,979 INFO L184 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 26.08 03:24:43" (1/1) ... [2023-08-26 15:24:43,981 INFO L184 PluginConnector]: Executing the observer LTLStepAnnotator from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 26.08 03:24:43" (1/1) ... [2023-08-26 15:24:43,982 INFO L184 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 26.08 03:24:43" (1/1) ... [2023-08-26 15:24:43,991 INFO L131 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2023-08-26 15:24:43,997 INFO L112 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2023-08-26 15:24:43,997 INFO L270 PluginConnector]: Initializing RCFGBuilder... [2023-08-26 15:24:43,997 INFO L274 PluginConnector]: RCFGBuilder initialized [2023-08-26 15:24:43,998 INFO L184 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 26.08 03:24:43" (1/1) ... [2023-08-26 15:24:44,003 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2023-08-26 15:24:44,026 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2023-08-26 15:24:44,046 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 15:24:44,068 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 15:24:44,084 INFO L130 BoogieDeclarations]: Found specification of procedure write~int [2023-08-26 15:24:44,084 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_atomic_begin [2023-08-26 15:24:44,085 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2023-08-26 15:24:44,085 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnStack [2023-08-26 15:24:44,085 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.dealloc [2023-08-26 15:24:44,085 INFO L130 BoogieDeclarations]: Found specification of procedure P0 [2023-08-26 15:24:44,085 INFO L138 BoogieDeclarations]: Found implementation of procedure P0 [2023-08-26 15:24:44,086 INFO L130 BoogieDeclarations]: Found specification of procedure P1 [2023-08-26 15:24:44,086 INFO L138 BoogieDeclarations]: Found implementation of procedure P1 [2023-08-26 15:24:44,086 INFO L130 BoogieDeclarations]: Found specification of procedure P2 [2023-08-26 15:24:44,086 INFO L138 BoogieDeclarations]: Found implementation of procedure P2 [2023-08-26 15:24:44,086 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int [2023-08-26 15:24:44,086 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_atomic_end [2023-08-26 15:24:44,086 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2023-08-26 15:24:44,086 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2023-08-26 15:24:44,088 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 15:24:44,201 INFO L236 CfgBuilder]: Building ICFG [2023-08-26 15:24:44,202 INFO L262 CfgBuilder]: Building CFG for each procedure with an implementation [2023-08-26 15:24:44,521 INFO L277 CfgBuilder]: Performing block encoding [2023-08-26 15:24:44,663 INFO L297 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2023-08-26 15:24:44,663 INFO L302 CfgBuilder]: Removed 0 assume(true) statements. [2023-08-26 15:24:44,665 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 26.08 03:24:44 BoogieIcfgContainer [2023-08-26 15:24:44,665 INFO L131 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2023-08-26 15:24:44,668 INFO L112 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2023-08-26 15:24:44,668 INFO L270 PluginConnector]: Initializing TraceAbstraction... [2023-08-26 15:24:44,671 INFO L274 PluginConnector]: TraceAbstraction initialized [2023-08-26 15:24:44,671 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 26.08 03:24:43" (1/3) ... [2023-08-26 15:24:44,672 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@363d4ce6 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 26.08 03:24:44, skipping insertion in model container [2023-08-26 15:24:44,672 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 26.08 03:24:43" (2/3) ... [2023-08-26 15:24:44,672 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@363d4ce6 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 26.08 03:24:44, skipping insertion in model container [2023-08-26 15:24:44,673 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 26.08 03:24:44" (3/3) ... [2023-08-26 15:24:44,674 INFO L112 eAbstractionObserver]: Analyzing ICFG safe030_power.oepc_pso.oepc_rmo.oepc.i [2023-08-26 15:24:44,695 INFO L203 ceAbstractionStarter]: Automizer settings: Hoare:false NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2023-08-26 15:24:44,696 INFO L162 ceAbstractionStarter]: Applying trace abstraction to program that has 8 error locations. [2023-08-26 15:24:44,696 INFO L515 ceAbstractionStarter]: Constructing petrified ICFG for 1 thread instances. [2023-08-26 15:24:44,740 INFO L144 ThreadInstanceAdder]: Constructed 0 joinOtherThreadTransitions. [2023-08-26 15:24:44,781 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 123 places, 116 transitions, 247 flow [2023-08-26 15:24:44,838 INFO L124 PetriNetUnfolderBase]: 3/113 cut-off events. [2023-08-26 15:24:44,838 INFO L125 PetriNetUnfolderBase]: For 0/0 co-relation queries the response was YES. [2023-08-26 15:24:44,844 INFO L83 FinitePrefix]: Finished finitePrefix Result has 123 conditions, 113 events. 3/113 cut-off events. For 0/0 co-relation queries the response was YES. Maximal size of possible extension queue 4. Compared 85 event pairs, 0 based on Foata normal form. 0/102 useless extension candidates. Maximal degree in co-relation 77. Up to 2 conditions per place. [2023-08-26 15:24:44,844 INFO L82 GeneralOperation]: Start removeDead. Operand has 123 places, 116 transitions, 247 flow [2023-08-26 15:24:44,847 INFO L88 GeneralOperation]: Finished RemoveDead, result has has 120 places, 113 transitions, 235 flow [2023-08-26 15:24:44,851 INFO L124 etLargeBlockEncoding]: Petri net LBE is using variable-based independence relation. [2023-08-26 15:24:44,862 INFO L131 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 120 places, 113 transitions, 235 flow [2023-08-26 15:24:44,865 INFO L113 LiptonReduction]: Starting Lipton reduction on Petri net that has 120 places, 113 transitions, 235 flow [2023-08-26 15:24:44,866 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 120 places, 113 transitions, 235 flow [2023-08-26 15:24:44,905 INFO L124 PetriNetUnfolderBase]: 3/113 cut-off events. [2023-08-26 15:24:44,905 INFO L125 PetriNetUnfolderBase]: For 0/0 co-relation queries the response was YES. [2023-08-26 15:24:44,906 INFO L83 FinitePrefix]: Finished finitePrefix Result has 123 conditions, 113 events. 3/113 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/102 useless extension candidates. Maximal degree in co-relation 77. Up to 2 conditions per place. [2023-08-26 15:24:44,908 INFO L119 LiptonReduction]: Number of co-enabled transitions 2188 [2023-08-26 15:24:48,460 INFO L134 LiptonReduction]: Checked pairs total: 5990 [2023-08-26 15:24:48,461 INFO L136 LiptonReduction]: Total number of compositions: 116 [2023-08-26 15:24:48,472 INFO L356 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2023-08-26 15:24:48,477 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;@1d66a4d1, mLbeIndependenceSettings=[IndependenceType=SYNTACTIC, AbstractionType=NONE, UseConditional=, UseSemiCommutativity=, Solver=, SolverTimeout=] [2023-08-26 15:24:48,477 INFO L358 AbstractCegarLoop]: Starting to check reachability of 12 error locations. [2023-08-26 15:24:48,478 INFO L185 PetriNetUnfolderBase]: Found word, exiting Unfolder. [2023-08-26 15:24:48,479 INFO L124 PetriNetUnfolderBase]: 0/0 cut-off events. [2023-08-26 15:24:48,479 INFO L125 PetriNetUnfolderBase]: For 0/0 co-relation queries the response was YES. [2023-08-26 15:24:48,479 INFO L200 CegarLoopForPetriNet]: Found error trace [2023-08-26 15:24:48,479 INFO L208 CegarLoopForPetriNet]: trace histogram [1] [2023-08-26 15:24:48,480 INFO L420 AbstractCegarLoop]: === Iteration 1 === Targeting ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [P0Err0ASSERT_VIOLATIONASSERT, ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 9 more)] === [2023-08-26 15:24:48,484 INFO L145 PredicateUnifier]: Initialized classic predicate unifier [2023-08-26 15:24:48,484 INFO L85 PathProgramCache]: Analyzing trace with hash 530, now seen corresponding path program 1 times [2023-08-26 15:24:48,492 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-08-26 15:24:48,492 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1608315914] [2023-08-26 15:24:48,492 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-08-26 15:24:48,492 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-08-26 15:24:48,565 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-08-26 15:24:48,583 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 15:24:48,584 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-08-26 15:24:48,584 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1608315914] [2023-08-26 15:24:48,584 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1608315914] provided 1 perfect and 0 imperfect interpolant sequences [2023-08-26 15:24:48,584 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-08-26 15:24:48,585 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [0] imperfect sequences [] total 0 [2023-08-26 15:24:48,586 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [331299906] [2023-08-26 15:24:48,586 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-08-26 15:24:48,592 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 2 states [2023-08-26 15:24:48,597 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-08-26 15:24:48,612 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 2 interpolants. [2023-08-26 15:24:48,613 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=1, Invalid=1, Unknown=0, NotChecked=0, Total=2 [2023-08-26 15:24:48,614 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 102 out of 232 [2023-08-26 15:24:48,616 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 41 places, 32 transitions, 73 flow. Second operand has 2 states, 2 states have (on average 102.5) internal successors, (205), 2 states have internal predecessors, (205), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-26 15:24:48,616 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2023-08-26 15:24:48,616 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 102 of 232 [2023-08-26 15:24:48,617 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2023-08-26 15:24:48,927 INFO L124 PetriNetUnfolderBase]: 1279/1911 cut-off events. [2023-08-26 15:24:48,927 INFO L125 PetriNetUnfolderBase]: For 12/12 co-relation queries the response was YES. [2023-08-26 15:24:48,934 INFO L83 FinitePrefix]: Finished finitePrefix Result has 3858 conditions, 1911 events. 1279/1911 cut-off events. For 12/12 co-relation queries the response was YES. Maximal size of possible extension queue 120. Compared 9081 event pairs, 1279 based on Foata normal form. 80/1669 useless extension candidates. Maximal degree in co-relation 3847. Up to 1891 conditions per place. [2023-08-26 15:24:48,944 INFO L140 encePairwiseOnDemand]: 225/232 looper letters, 22 selfloop transitions, 0 changer transitions 0/25 dead transitions. [2023-08-26 15:24:48,944 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 36 places, 25 transitions, 103 flow [2023-08-26 15:24:48,946 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2023-08-26 15:24:48,947 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 2 states. [2023-08-26 15:24:48,953 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2 states to 2 states and 233 transitions. [2023-08-26 15:24:48,955 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.5021551724137931 [2023-08-26 15:24:48,956 INFO L72 ComplementDD]: Start complementDD. Operand 2 states and 233 transitions. [2023-08-26 15:24:48,956 INFO L73 IsDeterministic]: Start isDeterministic. Operand 2 states and 233 transitions. [2023-08-26 15:24:48,957 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2023-08-26 15:24:48,959 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 2 states and 233 transitions. [2023-08-26 15:24:48,961 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 3 states, 2 states have (on average 116.5) internal successors, (233), 2 states have internal predecessors, (233), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-26 15:24:48,965 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 3 states, 3 states have (on average 232.0) internal successors, (696), 3 states have internal predecessors, (696), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-26 15:24:48,966 INFO L81 ComplementDD]: Finished complementDD. Result has 3 states, 3 states have (on average 232.0) internal successors, (696), 3 states have internal predecessors, (696), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-26 15:24:48,968 INFO L175 Difference]: Start difference. First operand has 41 places, 32 transitions, 73 flow. Second operand 2 states and 233 transitions. [2023-08-26 15:24:48,968 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 36 places, 25 transitions, 103 flow [2023-08-26 15:24:48,972 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 33 places, 25 transitions, 100 flow, removed 0 selfloop flow, removed 3 redundant places. [2023-08-26 15:24:48,973 INFO L231 Difference]: Finished difference. Result has 33 places, 25 transitions, 56 flow [2023-08-26 15:24:48,975 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=232, PETRI_DIFFERENCE_MINUEND_FLOW=56, PETRI_DIFFERENCE_MINUEND_PLACES=32, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=25, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=0, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=25, PETRI_DIFFERENCE_SUBTRAHEND_STATES=2, PETRI_FLOW=56, PETRI_PLACES=33, PETRI_TRANSITIONS=25} [2023-08-26 15:24:48,978 INFO L281 CegarLoopForPetriNet]: 41 programPoint places, -8 predicate places. [2023-08-26 15:24:48,978 INFO L495 AbstractCegarLoop]: Abstraction has has 33 places, 25 transitions, 56 flow [2023-08-26 15:24:48,979 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 2 states, 2 states have (on average 102.5) internal successors, (205), 2 states have internal predecessors, (205), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-26 15:24:48,979 INFO L200 CegarLoopForPetriNet]: Found error trace [2023-08-26 15:24:48,979 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1] [2023-08-26 15:24:48,979 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable0 [2023-08-26 15:24:48,980 INFO L420 AbstractCegarLoop]: === Iteration 2 === Targeting P0Err0ASSERT_VIOLATIONASSERT === [P0Err0ASSERT_VIOLATIONASSERT, ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 9 more)] === [2023-08-26 15:24:48,988 INFO L145 PredicateUnifier]: Initialized classic predicate unifier [2023-08-26 15:24:48,988 INFO L85 PathProgramCache]: Analyzing trace with hash 522612, now seen corresponding path program 1 times [2023-08-26 15:24:48,988 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-08-26 15:24:48,988 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1998273668] [2023-08-26 15:24:48,988 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-08-26 15:24:48,989 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-08-26 15:24:49,060 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-08-26 15:24:49,271 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 15:24:49,271 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-08-26 15:24:49,272 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1998273668] [2023-08-26 15:24:49,272 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1998273668] provided 1 perfect and 0 imperfect interpolant sequences [2023-08-26 15:24:49,272 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-08-26 15:24:49,272 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [1] imperfect sequences [] total 1 [2023-08-26 15:24:49,272 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [719497786] [2023-08-26 15:24:49,272 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-08-26 15:24:49,273 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2023-08-26 15:24:49,273 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-08-26 15:24:49,274 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2023-08-26 15:24:49,274 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2023-08-26 15:24:49,275 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 101 out of 232 [2023-08-26 15:24:49,275 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 33 places, 25 transitions, 56 flow. Second operand has 3 states, 3 states have (on average 102.0) internal successors, (306), 3 states have internal predecessors, (306), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-26 15:24:49,275 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2023-08-26 15:24:49,276 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 101 of 232 [2023-08-26 15:24:49,276 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2023-08-26 15:24:49,528 INFO L124 PetriNetUnfolderBase]: 999/1614 cut-off events. [2023-08-26 15:24:49,529 INFO L125 PetriNetUnfolderBase]: For 0/0 co-relation queries the response was YES. [2023-08-26 15:24:49,531 INFO L83 FinitePrefix]: Finished finitePrefix Result has 3147 conditions, 1614 events. 999/1614 cut-off events. For 0/0 co-relation queries the response was YES. Maximal size of possible extension queue 103. Compared 8872 event pairs, 159 based on Foata normal form. 0/1478 useless extension candidates. Maximal degree in co-relation 3144. Up to 1207 conditions per place. [2023-08-26 15:24:49,536 INFO L140 encePairwiseOnDemand]: 229/232 looper letters, 31 selfloop transitions, 2 changer transitions 4/40 dead transitions. [2023-08-26 15:24:49,536 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 34 places, 40 transitions, 164 flow [2023-08-26 15:24:49,537 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2023-08-26 15:24:49,538 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2023-08-26 15:24:49,541 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 341 transitions. [2023-08-26 15:24:49,542 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.4899425287356322 [2023-08-26 15:24:49,542 INFO L72 ComplementDD]: Start complementDD. Operand 3 states and 341 transitions. [2023-08-26 15:24:49,542 INFO L73 IsDeterministic]: Start isDeterministic. Operand 3 states and 341 transitions. [2023-08-26 15:24:49,544 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2023-08-26 15:24:49,544 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 3 states and 341 transitions. [2023-08-26 15:24:49,546 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 4 states, 3 states have (on average 113.66666666666667) internal successors, (341), 3 states have internal predecessors, (341), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-26 15:24:49,549 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 4 states, 4 states have (on average 232.0) internal successors, (928), 4 states have internal predecessors, (928), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-26 15:24:49,550 INFO L81 ComplementDD]: Finished complementDD. Result has 4 states, 4 states have (on average 232.0) internal successors, (928), 4 states have internal predecessors, (928), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-26 15:24:49,550 INFO L175 Difference]: Start difference. First operand has 33 places, 25 transitions, 56 flow. Second operand 3 states and 341 transitions. [2023-08-26 15:24:49,551 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 34 places, 40 transitions, 164 flow [2023-08-26 15:24:49,551 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 34 places, 40 transitions, 164 flow, removed 0 selfloop flow, removed 0 redundant places. [2023-08-26 15:24:49,555 INFO L231 Difference]: Finished difference. Result has 34 places, 22 transitions, 54 flow [2023-08-26 15:24:49,558 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=232, PETRI_DIFFERENCE_MINUEND_FLOW=54, PETRI_DIFFERENCE_MINUEND_PLACES=32, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=24, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=2, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=22, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=54, PETRI_PLACES=34, PETRI_TRANSITIONS=22} [2023-08-26 15:24:49,559 INFO L281 CegarLoopForPetriNet]: 41 programPoint places, -7 predicate places. [2023-08-26 15:24:49,559 INFO L495 AbstractCegarLoop]: Abstraction has has 34 places, 22 transitions, 54 flow [2023-08-26 15:24:49,560 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 102.0) internal successors, (306), 3 states have internal predecessors, (306), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-26 15:24:49,560 INFO L200 CegarLoopForPetriNet]: Found error trace [2023-08-26 15:24:49,560 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-08-26 15:24:49,561 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1 [2023-08-26 15:24:49,566 INFO L420 AbstractCegarLoop]: === Iteration 3 === Targeting ULTIMATE.startErr6ASSERT_VIOLATIONASSERT === [P0Err0ASSERT_VIOLATIONASSERT, ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 9 more)] === [2023-08-26 15:24:49,566 INFO L145 PredicateUnifier]: Initialized classic predicate unifier [2023-08-26 15:24:49,566 INFO L85 PathProgramCache]: Analyzing trace with hash -1004148388, now seen corresponding path program 1 times [2023-08-26 15:24:49,566 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-08-26 15:24:49,567 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [637164494] [2023-08-26 15:24:49,567 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-08-26 15:24:49,567 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-08-26 15:24:49,621 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-08-26 15:24:50,378 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 15:24:50,378 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-08-26 15:24:50,379 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [637164494] [2023-08-26 15:24:50,379 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [637164494] provided 1 perfect and 0 imperfect interpolant sequences [2023-08-26 15:24:50,379 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-08-26 15:24:50,379 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2023-08-26 15:24:50,379 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [433238292] [2023-08-26 15:24:50,379 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-08-26 15:24:50,380 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2023-08-26 15:24:50,380 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-08-26 15:24:50,380 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2023-08-26 15:24:50,381 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=8, Invalid=12, Unknown=0, NotChecked=0, Total=20 [2023-08-26 15:24:50,382 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 86 out of 232 [2023-08-26 15:24:50,382 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 34 places, 22 transitions, 54 flow. Second operand has 5 states, 5 states have (on average 88.0) internal successors, (440), 5 states have internal predecessors, (440), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-26 15:24:50,382 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2023-08-26 15:24:50,382 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 86 of 232 [2023-08-26 15:24:50,383 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2023-08-26 15:24:50,966 INFO L124 PetriNetUnfolderBase]: 2149/3194 cut-off events. [2023-08-26 15:24:50,966 INFO L125 PetriNetUnfolderBase]: For 182/182 co-relation queries the response was YES. [2023-08-26 15:24:50,971 INFO L83 FinitePrefix]: Finished finitePrefix Result has 6648 conditions, 3194 events. 2149/3194 cut-off events. For 182/182 co-relation queries the response was YES. Maximal size of possible extension queue 154. Compared 14886 event pairs, 364 based on Foata normal form. 166/3360 useless extension candidates. Maximal degree in co-relation 6644. Up to 2084 conditions per place. [2023-08-26 15:24:50,984 INFO L140 encePairwiseOnDemand]: 220/232 looper letters, 38 selfloop transitions, 12 changer transitions 33/83 dead transitions. [2023-08-26 15:24:50,984 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 38 places, 83 transitions, 356 flow [2023-08-26 15:24:50,984 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2023-08-26 15:24:50,985 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 7 states. [2023-08-26 15:24:50,986 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 7 states to 7 states and 688 transitions. [2023-08-26 15:24:50,987 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.4236453201970443 [2023-08-26 15:24:50,987 INFO L72 ComplementDD]: Start complementDD. Operand 7 states and 688 transitions. [2023-08-26 15:24:50,987 INFO L73 IsDeterministic]: Start isDeterministic. Operand 7 states and 688 transitions. [2023-08-26 15:24:50,987 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2023-08-26 15:24:50,987 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 7 states and 688 transitions. [2023-08-26 15:24:50,989 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 8 states, 7 states have (on average 98.28571428571429) internal successors, (688), 7 states have internal predecessors, (688), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-26 15:24:50,996 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 8 states, 8 states have (on average 232.0) internal successors, (1856), 8 states have internal predecessors, (1856), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-26 15:24:50,997 INFO L81 ComplementDD]: Finished complementDD. Result has 8 states, 8 states have (on average 232.0) internal successors, (1856), 8 states have internal predecessors, (1856), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-26 15:24:50,997 INFO L175 Difference]: Start difference. First operand has 34 places, 22 transitions, 54 flow. Second operand 7 states and 688 transitions. [2023-08-26 15:24:50,997 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 38 places, 83 transitions, 356 flow [2023-08-26 15:24:50,998 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 36 places, 83 transitions, 342 flow, removed 0 selfloop flow, removed 2 redundant places. [2023-08-26 15:24:50,999 INFO L231 Difference]: Finished difference. Result has 42 places, 33 transitions, 160 flow [2023-08-26 15:24:50,999 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=232, PETRI_DIFFERENCE_MINUEND_FLOW=50, PETRI_DIFFERENCE_MINUEND_PLACES=30, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=22, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=3, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=12, PETRI_DIFFERENCE_SUBTRAHEND_STATES=7, PETRI_FLOW=160, PETRI_PLACES=42, PETRI_TRANSITIONS=33} [2023-08-26 15:24:51,000 INFO L281 CegarLoopForPetriNet]: 41 programPoint places, 1 predicate places. [2023-08-26 15:24:51,000 INFO L495 AbstractCegarLoop]: Abstraction has has 42 places, 33 transitions, 160 flow [2023-08-26 15:24:51,000 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 88.0) internal successors, (440), 5 states have internal predecessors, (440), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-26 15:24:51,000 INFO L200 CegarLoopForPetriNet]: Found error trace [2023-08-26 15:24:51,000 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-08-26 15:24:51,001 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2 [2023-08-26 15:24:51,001 INFO L420 AbstractCegarLoop]: === Iteration 4 === Targeting ULTIMATE.startErr6ASSERT_VIOLATIONASSERT === [P0Err0ASSERT_VIOLATIONASSERT, ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 9 more)] === [2023-08-26 15:24:51,001 INFO L145 PredicateUnifier]: Initialized classic predicate unifier [2023-08-26 15:24:51,001 INFO L85 PathProgramCache]: Analyzing trace with hash -1063791087, now seen corresponding path program 1 times [2023-08-26 15:24:51,001 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-08-26 15:24:51,002 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1176775819] [2023-08-26 15:24:51,002 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-08-26 15:24:51,002 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-08-26 15:24:51,029 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-08-26 15:24:51,189 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 15:24:51,190 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-08-26 15:24:51,190 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1176775819] [2023-08-26 15:24:51,190 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1176775819] provided 1 perfect and 0 imperfect interpolant sequences [2023-08-26 15:24:51,190 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-08-26 15:24:51,190 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2023-08-26 15:24:51,190 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1296267995] [2023-08-26 15:24:51,191 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-08-26 15:24:51,191 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2023-08-26 15:24:51,191 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-08-26 15:24:51,192 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2023-08-26 15:24:51,193 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2023-08-26 15:24:51,194 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 97 out of 232 [2023-08-26 15:24:51,194 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 42 places, 33 transitions, 160 flow. Second operand has 4 states, 4 states have (on average 99.75) internal successors, (399), 4 states have internal predecessors, (399), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-26 15:24:51,194 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2023-08-26 15:24:51,194 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 97 of 232 [2023-08-26 15:24:51,195 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2023-08-26 15:24:51,540 INFO L124 PetriNetUnfolderBase]: 1443/2269 cut-off events. [2023-08-26 15:24:51,541 INFO L125 PetriNetUnfolderBase]: For 3049/3125 co-relation queries the response was YES. [2023-08-26 15:24:51,546 INFO L83 FinitePrefix]: Finished finitePrefix Result has 7541 conditions, 2269 events. 1443/2269 cut-off events. For 3049/3125 co-relation queries the response was YES. Maximal size of possible extension queue 138. Compared 11485 event pairs, 529 based on Foata normal form. 125/2392 useless extension candidates. Maximal degree in co-relation 7532. Up to 1847 conditions per place. [2023-08-26 15:24:51,557 INFO L140 encePairwiseOnDemand]: 227/232 looper letters, 38 selfloop transitions, 4 changer transitions 21/67 dead transitions. [2023-08-26 15:24:51,557 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 43 places, 67 transitions, 452 flow [2023-08-26 15:24:51,558 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2023-08-26 15:24:51,558 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 5 states. [2023-08-26 15:24:51,559 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 534 transitions. [2023-08-26 15:24:51,560 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.4603448275862069 [2023-08-26 15:24:51,560 INFO L72 ComplementDD]: Start complementDD. Operand 5 states and 534 transitions. [2023-08-26 15:24:51,560 INFO L73 IsDeterministic]: Start isDeterministic. Operand 5 states and 534 transitions. [2023-08-26 15:24:51,560 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2023-08-26 15:24:51,560 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 5 states and 534 transitions. [2023-08-26 15:24:51,562 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 15:24:51,564 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 6 states, 6 states have (on average 232.0) internal successors, (1392), 6 states have internal predecessors, (1392), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-26 15:24:51,564 INFO L81 ComplementDD]: Finished complementDD. Result has 6 states, 6 states have (on average 232.0) internal successors, (1392), 6 states have internal predecessors, (1392), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-26 15:24:51,564 INFO L175 Difference]: Start difference. First operand has 42 places, 33 transitions, 160 flow. Second operand 5 states and 534 transitions. [2023-08-26 15:24:51,564 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 43 places, 67 transitions, 452 flow [2023-08-26 15:24:51,577 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 42 places, 67 transitions, 450 flow, removed 1 selfloop flow, removed 1 redundant places. [2023-08-26 15:24:51,578 INFO L231 Difference]: Finished difference. Result has 45 places, 36 transitions, 204 flow [2023-08-26 15:24:51,578 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=232, PETRI_DIFFERENCE_MINUEND_FLOW=158, PETRI_DIFFERENCE_MINUEND_PLACES=38, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=33, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=1, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=29, PETRI_DIFFERENCE_SUBTRAHEND_STATES=5, PETRI_FLOW=204, PETRI_PLACES=45, PETRI_TRANSITIONS=36} [2023-08-26 15:24:51,580 INFO L281 CegarLoopForPetriNet]: 41 programPoint places, 4 predicate places. [2023-08-26 15:24:51,580 INFO L495 AbstractCegarLoop]: Abstraction has has 45 places, 36 transitions, 204 flow [2023-08-26 15:24:51,580 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 99.75) internal successors, (399), 4 states have internal predecessors, (399), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-26 15:24:51,580 INFO L200 CegarLoopForPetriNet]: Found error trace [2023-08-26 15:24:51,580 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-08-26 15:24:51,581 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable3 [2023-08-26 15:24:51,581 INFO L420 AbstractCegarLoop]: === Iteration 5 === Targeting ULTIMATE.startErr6ASSERT_VIOLATIONASSERT === [P0Err0ASSERT_VIOLATIONASSERT, ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 9 more)] === [2023-08-26 15:24:51,581 INFO L145 PredicateUnifier]: Initialized classic predicate unifier [2023-08-26 15:24:51,581 INFO L85 PathProgramCache]: Analyzing trace with hash 1368466034, now seen corresponding path program 1 times [2023-08-26 15:24:51,581 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-08-26 15:24:51,581 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1144788611] [2023-08-26 15:24:51,581 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-08-26 15:24:51,582 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-08-26 15:24:51,626 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-08-26 15:24:52,122 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 15:24:52,123 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-08-26 15:24:52,123 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1144788611] [2023-08-26 15:24:52,123 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1144788611] provided 1 perfect and 0 imperfect interpolant sequences [2023-08-26 15:24:52,123 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-08-26 15:24:52,123 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2023-08-26 15:24:52,123 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1959967143] [2023-08-26 15:24:52,124 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-08-26 15:24:52,124 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2023-08-26 15:24:52,124 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-08-26 15:24:52,124 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2023-08-26 15:24:52,125 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=8, Invalid=12, Unknown=0, NotChecked=0, Total=20 [2023-08-26 15:24:52,125 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 86 out of 232 [2023-08-26 15:24:52,126 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 45 places, 36 transitions, 204 flow. Second operand has 5 states, 5 states have (on average 88.4) internal successors, (442), 5 states have internal predecessors, (442), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-26 15:24:52,126 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2023-08-26 15:24:52,126 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 86 of 232 [2023-08-26 15:24:52,126 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2023-08-26 15:24:52,827 INFO L124 PetriNetUnfolderBase]: 2627/3958 cut-off events. [2023-08-26 15:24:52,828 INFO L125 PetriNetUnfolderBase]: For 7024/7024 co-relation queries the response was YES. [2023-08-26 15:24:52,836 INFO L83 FinitePrefix]: Finished finitePrefix Result has 13980 conditions, 3958 events. 2627/3958 cut-off events. For 7024/7024 co-relation queries the response was YES. Maximal size of possible extension queue 194. Compared 20162 event pairs, 453 based on Foata normal form. 162/4120 useless extension candidates. Maximal degree in co-relation 13968. Up to 1852 conditions per place. [2023-08-26 15:24:52,850 INFO L140 encePairwiseOnDemand]: 220/232 looper letters, 49 selfloop transitions, 22 changer transitions 30/101 dead transitions. [2023-08-26 15:24:52,851 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 49 places, 101 transitions, 723 flow [2023-08-26 15:24:52,851 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2023-08-26 15:24:52,851 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 7 states. [2023-08-26 15:24:52,853 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 7 states to 7 states and 685 transitions. [2023-08-26 15:24:52,853 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.42179802955665024 [2023-08-26 15:24:52,853 INFO L72 ComplementDD]: Start complementDD. Operand 7 states and 685 transitions. [2023-08-26 15:24:52,853 INFO L73 IsDeterministic]: Start isDeterministic. Operand 7 states and 685 transitions. [2023-08-26 15:24:52,854 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2023-08-26 15:24:52,854 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 7 states and 685 transitions. [2023-08-26 15:24:52,856 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 8 states, 7 states have (on average 97.85714285714286) internal successors, (685), 7 states have internal predecessors, (685), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-26 15:24:52,858 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 8 states, 8 states have (on average 232.0) internal successors, (1856), 8 states have internal predecessors, (1856), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-26 15:24:52,859 INFO L81 ComplementDD]: Finished complementDD. Result has 8 states, 8 states have (on average 232.0) internal successors, (1856), 8 states have internal predecessors, (1856), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-26 15:24:52,859 INFO L175 Difference]: Start difference. First operand has 45 places, 36 transitions, 204 flow. Second operand 7 states and 685 transitions. [2023-08-26 15:24:52,859 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 49 places, 101 transitions, 723 flow [2023-08-26 15:24:52,870 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 47 places, 101 transitions, 710 flow, removed 4 selfloop flow, removed 2 redundant places. [2023-08-26 15:24:52,872 INFO L231 Difference]: Finished difference. Result has 53 places, 49 transitions, 412 flow [2023-08-26 15:24:52,872 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=232, PETRI_DIFFERENCE_MINUEND_FLOW=196, PETRI_DIFFERENCE_MINUEND_PLACES=41, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=36, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=9, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=15, PETRI_DIFFERENCE_SUBTRAHEND_STATES=7, PETRI_FLOW=412, PETRI_PLACES=53, PETRI_TRANSITIONS=49} [2023-08-26 15:24:52,873 INFO L281 CegarLoopForPetriNet]: 41 programPoint places, 12 predicate places. [2023-08-26 15:24:52,873 INFO L495 AbstractCegarLoop]: Abstraction has has 53 places, 49 transitions, 412 flow [2023-08-26 15:24:52,873 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 88.4) internal successors, (442), 5 states have internal predecessors, (442), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-26 15:24:52,873 INFO L200 CegarLoopForPetriNet]: Found error trace [2023-08-26 15:24:52,873 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-08-26 15:24:52,873 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable4 [2023-08-26 15:24:52,873 INFO L420 AbstractCegarLoop]: === Iteration 6 === Targeting ULTIMATE.startErr6ASSERT_VIOLATIONASSERT === [P0Err0ASSERT_VIOLATIONASSERT, ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 9 more)] === [2023-08-26 15:24:52,874 INFO L145 PredicateUnifier]: Initialized classic predicate unifier [2023-08-26 15:24:52,874 INFO L85 PathProgramCache]: Analyzing trace with hash 1370253494, now seen corresponding path program 1 times [2023-08-26 15:24:52,874 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-08-26 15:24:52,874 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [163267000] [2023-08-26 15:24:52,874 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-08-26 15:24:52,874 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-08-26 15:24:52,896 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-08-26 15:24:53,162 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 15:24:53,163 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-08-26 15:24:53,163 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [163267000] [2023-08-26 15:24:53,163 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [163267000] provided 1 perfect and 0 imperfect interpolant sequences [2023-08-26 15:24:53,163 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-08-26 15:24:53,163 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2023-08-26 15:24:53,163 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1633518090] [2023-08-26 15:24:53,163 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-08-26 15:24:53,164 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2023-08-26 15:24:53,164 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-08-26 15:24:53,164 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2023-08-26 15:24:53,164 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=8, Invalid=12, Unknown=0, NotChecked=0, Total=20 [2023-08-26 15:24:53,165 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 96 out of 232 [2023-08-26 15:24:53,166 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 53 places, 49 transitions, 412 flow. Second operand has 5 states, 5 states have (on average 98.4) internal successors, (492), 5 states have internal predecessors, (492), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-26 15:24:53,166 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2023-08-26 15:24:53,166 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 96 of 232 [2023-08-26 15:24:53,166 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2023-08-26 15:24:53,705 INFO L124 PetriNetUnfolderBase]: 2221/3423 cut-off events. [2023-08-26 15:24:53,705 INFO L125 PetriNetUnfolderBase]: For 15238/15557 co-relation queries the response was YES. [2023-08-26 15:24:53,717 INFO L83 FinitePrefix]: Finished finitePrefix Result has 14567 conditions, 3423 events. 2221/3423 cut-off events. For 15238/15557 co-relation queries the response was YES. Maximal size of possible extension queue 207. Compared 18098 event pairs, 895 based on Foata normal form. 359/3734 useless extension candidates. Maximal degree in co-relation 14551. Up to 2774 conditions per place. [2023-08-26 15:24:53,733 INFO L140 encePairwiseOnDemand]: 227/232 looper letters, 53 selfloop transitions, 5 changer transitions 22/90 dead transitions. [2023-08-26 15:24:53,733 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 54 places, 90 transitions, 834 flow [2023-08-26 15:24:53,734 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2023-08-26 15:24:53,734 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 5 states. [2023-08-26 15:24:53,735 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 527 transitions. [2023-08-26 15:24:53,735 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.4543103448275862 [2023-08-26 15:24:53,736 INFO L72 ComplementDD]: Start complementDD. Operand 5 states and 527 transitions. [2023-08-26 15:24:53,736 INFO L73 IsDeterministic]: Start isDeterministic. Operand 5 states and 527 transitions. [2023-08-26 15:24:53,736 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2023-08-26 15:24:53,736 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 5 states and 527 transitions. [2023-08-26 15:24:53,737 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 6 states, 5 states have (on average 105.4) internal successors, (527), 5 states have internal predecessors, (527), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-26 15:24:53,739 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 6 states, 6 states have (on average 232.0) internal successors, (1392), 6 states have internal predecessors, (1392), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-26 15:24:53,739 INFO L81 ComplementDD]: Finished complementDD. Result has 6 states, 6 states have (on average 232.0) internal successors, (1392), 6 states have internal predecessors, (1392), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-26 15:24:53,739 INFO L175 Difference]: Start difference. First operand has 53 places, 49 transitions, 412 flow. Second operand 5 states and 527 transitions. [2023-08-26 15:24:53,739 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 54 places, 90 transitions, 834 flow [2023-08-26 15:24:53,760 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 52 places, 90 transitions, 828 flow, removed 3 selfloop flow, removed 2 redundant places. [2023-08-26 15:24:53,761 INFO L231 Difference]: Finished difference. Result has 55 places, 52 transitions, 455 flow [2023-08-26 15:24:53,761 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=232, PETRI_DIFFERENCE_MINUEND_FLOW=406, PETRI_DIFFERENCE_MINUEND_PLACES=48, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=49, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=2, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=44, PETRI_DIFFERENCE_SUBTRAHEND_STATES=5, PETRI_FLOW=455, PETRI_PLACES=55, PETRI_TRANSITIONS=52} [2023-08-26 15:24:53,762 INFO L281 CegarLoopForPetriNet]: 41 programPoint places, 14 predicate places. [2023-08-26 15:24:53,762 INFO L495 AbstractCegarLoop]: Abstraction has has 55 places, 52 transitions, 455 flow [2023-08-26 15:24:53,763 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 98.4) internal successors, (492), 5 states have internal predecessors, (492), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-26 15:24:53,763 INFO L200 CegarLoopForPetriNet]: Found error trace [2023-08-26 15:24:53,763 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-08-26 15:24:53,763 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable5 [2023-08-26 15:24:53,763 INFO L420 AbstractCegarLoop]: === Iteration 7 === Targeting ULTIMATE.startErr6ASSERT_VIOLATIONASSERT === [P0Err0ASSERT_VIOLATIONASSERT, ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 9 more)] === [2023-08-26 15:24:53,763 INFO L145 PredicateUnifier]: Initialized classic predicate unifier [2023-08-26 15:24:53,764 INFO L85 PathProgramCache]: Analyzing trace with hash -676798439, now seen corresponding path program 1 times [2023-08-26 15:24:53,764 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-08-26 15:24:53,764 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [659217898] [2023-08-26 15:24:53,764 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-08-26 15:24:53,764 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-08-26 15:24:53,782 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-08-26 15:24:54,192 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-08-26 15:24:54,192 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-08-26 15:24:54,193 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [659217898] [2023-08-26 15:24:54,193 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [659217898] provided 1 perfect and 0 imperfect interpolant sequences [2023-08-26 15:24:54,193 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-08-26 15:24:54,193 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2023-08-26 15:24:54,193 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1479953519] [2023-08-26 15:24:54,193 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-08-26 15:24:54,193 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2023-08-26 15:24:54,194 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-08-26 15:24:54,194 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2023-08-26 15:24:54,194 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=8, Invalid=12, Unknown=0, NotChecked=0, Total=20 [2023-08-26 15:24:54,195 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 86 out of 232 [2023-08-26 15:24:54,195 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 55 places, 52 transitions, 455 flow. Second operand has 5 states, 5 states have (on average 88.6) internal successors, (443), 5 states have internal predecessors, (443), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-26 15:24:54,195 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2023-08-26 15:24:54,195 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 86 of 232 [2023-08-26 15:24:54,196 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2023-08-26 15:24:55,019 INFO L124 PetriNetUnfolderBase]: 3427/5251 cut-off events. [2023-08-26 15:24:55,020 INFO L125 PetriNetUnfolderBase]: For 20032/20032 co-relation queries the response was YES. [2023-08-26 15:24:55,037 INFO L83 FinitePrefix]: Finished finitePrefix Result has 22713 conditions, 5251 events. 3427/5251 cut-off events. For 20032/20032 co-relation queries the response was YES. Maximal size of possible extension queue 260. Compared 28913 event pairs, 851 based on Foata normal form. 164/5415 useless extension candidates. Maximal degree in co-relation 22695. Up to 2363 conditions per place. [2023-08-26 15:24:55,053 INFO L140 encePairwiseOnDemand]: 220/232 looper letters, 58 selfloop transitions, 22 changer transitions 34/114 dead transitions. [2023-08-26 15:24:55,053 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 59 places, 114 transitions, 1072 flow [2023-08-26 15:24:55,053 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2023-08-26 15:24:55,053 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 7 states. [2023-08-26 15:24:55,055 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 7 states to 7 states and 685 transitions. [2023-08-26 15:24:55,056 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.42179802955665024 [2023-08-26 15:24:55,056 INFO L72 ComplementDD]: Start complementDD. Operand 7 states and 685 transitions. [2023-08-26 15:24:55,056 INFO L73 IsDeterministic]: Start isDeterministic. Operand 7 states and 685 transitions. [2023-08-26 15:24:55,056 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2023-08-26 15:24:55,056 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 7 states and 685 transitions. [2023-08-26 15:24:55,058 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 8 states, 7 states have (on average 97.85714285714286) internal successors, (685), 7 states have internal predecessors, (685), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-26 15:24:55,060 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 8 states, 8 states have (on average 232.0) internal successors, (1856), 8 states have internal predecessors, (1856), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-26 15:24:55,061 INFO L81 ComplementDD]: Finished complementDD. Result has 8 states, 8 states have (on average 232.0) internal successors, (1856), 8 states have internal predecessors, (1856), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-26 15:24:55,061 INFO L175 Difference]: Start difference. First operand has 55 places, 52 transitions, 455 flow. Second operand 7 states and 685 transitions. [2023-08-26 15:24:55,061 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 59 places, 114 transitions, 1072 flow [2023-08-26 15:24:55,087 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 57 places, 114 transitions, 1054 flow, removed 6 selfloop flow, removed 2 redundant places. [2023-08-26 15:24:55,090 INFO L231 Difference]: Finished difference. Result has 63 places, 56 transitions, 596 flow [2023-08-26 15:24:55,090 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=232, PETRI_DIFFERENCE_MINUEND_FLOW=444, PETRI_DIFFERENCE_MINUEND_PLACES=51, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=52, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=16, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=30, PETRI_DIFFERENCE_SUBTRAHEND_STATES=7, PETRI_FLOW=596, PETRI_PLACES=63, PETRI_TRANSITIONS=56} [2023-08-26 15:24:55,091 INFO L281 CegarLoopForPetriNet]: 41 programPoint places, 22 predicate places. [2023-08-26 15:24:55,091 INFO L495 AbstractCegarLoop]: Abstraction has has 63 places, 56 transitions, 596 flow [2023-08-26 15:24:55,092 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 88.6) internal successors, (443), 5 states have internal predecessors, (443), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-26 15:24:55,092 INFO L200 CegarLoopForPetriNet]: Found error trace [2023-08-26 15:24:55,092 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-08-26 15:24:55,092 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable6 [2023-08-26 15:24:55,092 INFO L420 AbstractCegarLoop]: === Iteration 8 === Targeting ULTIMATE.startErr6ASSERT_VIOLATIONASSERT === [P0Err0ASSERT_VIOLATIONASSERT, ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 9 more)] === [2023-08-26 15:24:55,092 INFO L145 PredicateUnifier]: Initialized classic predicate unifier [2023-08-26 15:24:55,093 INFO L85 PathProgramCache]: Analyzing trace with hash -620665468, now seen corresponding path program 1 times [2023-08-26 15:24:55,093 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-08-26 15:24:55,093 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [684928010] [2023-08-26 15:24:55,093 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-08-26 15:24:55,093 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-08-26 15:24:55,157 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-08-26 15:24:56,033 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 15:24:56,033 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-08-26 15:24:56,033 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [684928010] [2023-08-26 15:24:56,033 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [684928010] provided 1 perfect and 0 imperfect interpolant sequences [2023-08-26 15:24:56,033 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-08-26 15:24:56,033 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2023-08-26 15:24:56,034 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1313543051] [2023-08-26 15:24:56,034 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-08-26 15:24:56,034 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2023-08-26 15:24:56,034 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-08-26 15:24:56,034 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2023-08-26 15:24:56,034 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2023-08-26 15:24:56,035 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 86 out of 232 [2023-08-26 15:24:56,035 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 63 places, 56 transitions, 596 flow. Second operand has 6 states, 6 states have (on average 88.16666666666667) internal successors, (529), 6 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 15:24:56,035 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2023-08-26 15:24:56,035 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 86 of 232 [2023-08-26 15:24:56,036 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2023-08-26 15:24:56,934 INFO L124 PetriNetUnfolderBase]: 3706/5743 cut-off events. [2023-08-26 15:24:56,934 INFO L125 PetriNetUnfolderBase]: For 38130/38130 co-relation queries the response was YES. [2023-08-26 15:24:56,955 INFO L83 FinitePrefix]: Finished finitePrefix Result has 27608 conditions, 5743 events. 3706/5743 cut-off events. For 38130/38130 co-relation queries the response was YES. Maximal size of possible extension queue 308. Compared 32646 event pairs, 897 based on Foata normal form. 272/6015 useless extension candidates. Maximal degree in co-relation 27586. Up to 3788 conditions per place. [2023-08-26 15:24:56,971 INFO L140 encePairwiseOnDemand]: 219/232 looper letters, 77 selfloop transitions, 58 changer transitions 57/192 dead transitions. [2023-08-26 15:24:56,972 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 68 places, 192 transitions, 2294 flow [2023-08-26 15:24:56,972 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2023-08-26 15:24:56,972 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 9 states. [2023-08-26 15:24:56,974 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 9 states to 9 states and 886 transitions. [2023-08-26 15:24:56,975 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.42432950191570884 [2023-08-26 15:24:56,975 INFO L72 ComplementDD]: Start complementDD. Operand 9 states and 886 transitions. [2023-08-26 15:24:56,975 INFO L73 IsDeterministic]: Start isDeterministic. Operand 9 states and 886 transitions. [2023-08-26 15:24:56,975 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2023-08-26 15:24:56,975 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 9 states and 886 transitions. [2023-08-26 15:24:56,977 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 10 states, 9 states have (on average 98.44444444444444) internal successors, (886), 9 states have internal predecessors, (886), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-26 15:24:56,980 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 10 states, 10 states have (on average 232.0) internal successors, (2320), 10 states have internal predecessors, (2320), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-26 15:24:56,980 INFO L81 ComplementDD]: Finished complementDD. Result has 10 states, 10 states have (on average 232.0) internal successors, (2320), 10 states have internal predecessors, (2320), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-26 15:24:56,980 INFO L175 Difference]: Start difference. First operand has 63 places, 56 transitions, 596 flow. Second operand 9 states and 886 transitions. [2023-08-26 15:24:56,980 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 68 places, 192 transitions, 2294 flow [2023-08-26 15:24:57,054 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 66 places, 192 transitions, 2232 flow, removed 31 selfloop flow, removed 2 redundant places. [2023-08-26 15:24:57,057 INFO L231 Difference]: Finished difference. Result has 73 places, 95 transitions, 1295 flow [2023-08-26 15:24:57,057 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=232, PETRI_DIFFERENCE_MINUEND_FLOW=578, PETRI_DIFFERENCE_MINUEND_PLACES=58, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=56, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=26, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=18, PETRI_DIFFERENCE_SUBTRAHEND_STATES=9, PETRI_FLOW=1295, PETRI_PLACES=73, PETRI_TRANSITIONS=95} [2023-08-26 15:24:57,057 INFO L281 CegarLoopForPetriNet]: 41 programPoint places, 32 predicate places. [2023-08-26 15:24:57,058 INFO L495 AbstractCegarLoop]: Abstraction has has 73 places, 95 transitions, 1295 flow [2023-08-26 15:24:57,058 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 88.16666666666667) internal successors, (529), 6 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 15:24:57,058 INFO L200 CegarLoopForPetriNet]: Found error trace [2023-08-26 15:24:57,058 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-08-26 15:24:57,058 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable7 [2023-08-26 15:24:57,058 INFO L420 AbstractCegarLoop]: === Iteration 9 === Targeting ULTIMATE.startErr6ASSERT_VIOLATIONASSERT === [P0Err0ASSERT_VIOLATIONASSERT, ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 9 more)] === [2023-08-26 15:24:57,059 INFO L145 PredicateUnifier]: Initialized classic predicate unifier [2023-08-26 15:24:57,059 INFO L85 PathProgramCache]: Analyzing trace with hash -620463658, now seen corresponding path program 2 times [2023-08-26 15:24:57,059 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-08-26 15:24:57,059 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1570702079] [2023-08-26 15:24:57,059 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-08-26 15:24:57,059 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-08-26 15:24:57,079 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-08-26 15:24:57,743 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 15:24:57,743 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-08-26 15:24:57,743 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1570702079] [2023-08-26 15:24:57,743 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1570702079] provided 1 perfect and 0 imperfect interpolant sequences [2023-08-26 15:24:57,743 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-08-26 15:24:57,743 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2023-08-26 15:24:57,743 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1930153782] [2023-08-26 15:24:57,744 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-08-26 15:24:57,744 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2023-08-26 15:24:57,744 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-08-26 15:24:57,744 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2023-08-26 15:24:57,744 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=14, Invalid=28, Unknown=0, NotChecked=0, Total=42 [2023-08-26 15:24:57,745 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 86 out of 232 [2023-08-26 15:24:57,746 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 73 places, 95 transitions, 1295 flow. Second operand has 7 states, 7 states have (on average 87.85714285714286) internal successors, (615), 7 states have internal predecessors, (615), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-26 15:24:57,746 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2023-08-26 15:24:57,746 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 86 of 232 [2023-08-26 15:24:57,746 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2023-08-26 15:24:58,522 INFO L124 PetriNetUnfolderBase]: 3332/5206 cut-off events. [2023-08-26 15:24:58,522 INFO L125 PetriNetUnfolderBase]: For 49289/49289 co-relation queries the response was YES. [2023-08-26 15:24:58,539 INFO L83 FinitePrefix]: Finished finitePrefix Result has 30182 conditions, 5206 events. 3332/5206 cut-off events. For 49289/49289 co-relation queries the response was YES. Maximal size of possible extension queue 269. Compared 29300 event pairs, 920 based on Foata normal form. 244/5450 useless extension candidates. Maximal degree in co-relation 30155. Up to 3576 conditions per place. [2023-08-26 15:24:58,554 INFO L140 encePairwiseOnDemand]: 219/232 looper letters, 77 selfloop transitions, 42 changer transitions 56/175 dead transitions. [2023-08-26 15:24:58,555 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 77 places, 175 transitions, 2475 flow [2023-08-26 15:24:58,555 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2023-08-26 15:24:58,555 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 8 states. [2023-08-26 15:24:58,557 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 8 states to 8 states and 782 transitions. [2023-08-26 15:24:58,557 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.4213362068965517 [2023-08-26 15:24:58,557 INFO L72 ComplementDD]: Start complementDD. Operand 8 states and 782 transitions. [2023-08-26 15:24:58,557 INFO L73 IsDeterministic]: Start isDeterministic. Operand 8 states and 782 transitions. [2023-08-26 15:24:58,558 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2023-08-26 15:24:58,558 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 8 states and 782 transitions. [2023-08-26 15:24:58,560 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 9 states, 8 states have (on average 97.75) internal successors, (782), 8 states have internal predecessors, (782), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-26 15:24:58,562 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 9 states, 9 states have (on average 232.0) internal successors, (2088), 9 states have internal predecessors, (2088), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-26 15:24:58,562 INFO L81 ComplementDD]: Finished complementDD. Result has 9 states, 9 states have (on average 232.0) internal successors, (2088), 9 states have internal predecessors, (2088), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-26 15:24:58,562 INFO L175 Difference]: Start difference. First operand has 73 places, 95 transitions, 1295 flow. Second operand 8 states and 782 transitions. [2023-08-26 15:24:58,562 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 77 places, 175 transitions, 2475 flow [2023-08-26 15:24:58,687 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 73 places, 175 transitions, 2398 flow, removed 36 selfloop flow, removed 4 redundant places. [2023-08-26 15:24:58,690 INFO L231 Difference]: Finished difference. Result has 77 places, 88 transitions, 1237 flow [2023-08-26 15:24:58,690 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=232, PETRI_DIFFERENCE_MINUEND_FLOW=1248, PETRI_DIFFERENCE_MINUEND_PLACES=66, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=95, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=42, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=53, PETRI_DIFFERENCE_SUBTRAHEND_STATES=8, PETRI_FLOW=1237, PETRI_PLACES=77, PETRI_TRANSITIONS=88} [2023-08-26 15:24:58,691 INFO L281 CegarLoopForPetriNet]: 41 programPoint places, 36 predicate places. [2023-08-26 15:24:58,691 INFO L495 AbstractCegarLoop]: Abstraction has has 77 places, 88 transitions, 1237 flow [2023-08-26 15:24:58,692 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 7 states, 7 states have (on average 87.85714285714286) internal successors, (615), 7 states have internal predecessors, (615), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-26 15:24:58,692 INFO L200 CegarLoopForPetriNet]: Found error trace [2023-08-26 15:24:58,692 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-08-26 15:24:58,692 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable8 [2023-08-26 15:24:58,692 INFO L420 AbstractCegarLoop]: === Iteration 10 === Targeting ULTIMATE.startErr6ASSERT_VIOLATIONASSERT === [P0Err0ASSERT_VIOLATIONASSERT, ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 9 more)] === [2023-08-26 15:24:58,693 INFO L145 PredicateUnifier]: Initialized classic predicate unifier [2023-08-26 15:24:58,693 INFO L85 PathProgramCache]: Analyzing trace with hash -1989766520, now seen corresponding path program 1 times [2023-08-26 15:24:58,693 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-08-26 15:24:58,695 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [211997175] [2023-08-26 15:24:58,695 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-08-26 15:24:58,697 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-08-26 15:24:58,719 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-08-26 15:24:59,318 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 15:24:59,319 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-08-26 15:24:59,319 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [211997175] [2023-08-26 15:24:59,319 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [211997175] provided 1 perfect and 0 imperfect interpolant sequences [2023-08-26 15:24:59,319 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-08-26 15:24:59,319 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2023-08-26 15:24:59,319 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1717608017] [2023-08-26 15:24:59,319 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-08-26 15:24:59,320 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2023-08-26 15:24:59,320 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-08-26 15:24:59,320 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2023-08-26 15:24:59,320 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=11, Invalid=19, Unknown=0, NotChecked=0, Total=30 [2023-08-26 15:24:59,321 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 86 out of 232 [2023-08-26 15:24:59,321 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 77 places, 88 transitions, 1237 flow. Second operand has 6 states, 6 states have (on average 88.16666666666667) internal successors, (529), 6 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 15:24:59,321 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2023-08-26 15:24:59,321 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 86 of 232 [2023-08-26 15:24:59,322 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2023-08-26 15:25:00,142 INFO L124 PetriNetUnfolderBase]: 2871/4504 cut-off events. [2023-08-26 15:25:00,143 INFO L125 PetriNetUnfolderBase]: For 41124/41124 co-relation queries the response was YES. [2023-08-26 15:25:00,158 INFO L83 FinitePrefix]: Finished finitePrefix Result has 26565 conditions, 4504 events. 2871/4504 cut-off events. For 41124/41124 co-relation queries the response was YES. Maximal size of possible extension queue 233. Compared 24895 event pairs, 959 based on Foata normal form. 136/4640 useless extension candidates. Maximal degree in co-relation 26536. Up to 3239 conditions per place. [2023-08-26 15:25:00,174 INFO L140 encePairwiseOnDemand]: 219/232 looper letters, 79 selfloop transitions, 60 changer transitions 49/188 dead transitions. [2023-08-26 15:25:00,175 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 84 places, 188 transitions, 2709 flow [2023-08-26 15:25:00,175 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 11 states. [2023-08-26 15:25:00,175 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 11 states. [2023-08-26 15:25:00,177 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 11 states to 11 states and 1056 transitions. [2023-08-26 15:25:00,178 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.41379310344827586 [2023-08-26 15:25:00,178 INFO L72 ComplementDD]: Start complementDD. Operand 11 states and 1056 transitions. [2023-08-26 15:25:00,178 INFO L73 IsDeterministic]: Start isDeterministic. Operand 11 states and 1056 transitions. [2023-08-26 15:25:00,179 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2023-08-26 15:25:00,179 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 11 states and 1056 transitions. [2023-08-26 15:25:00,181 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 12 states, 11 states have (on average 96.0) internal successors, (1056), 11 states have internal predecessors, (1056), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-26 15:25:00,184 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 12 states, 12 states have (on average 232.0) internal successors, (2784), 12 states have internal predecessors, (2784), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-26 15:25:00,185 INFO L81 ComplementDD]: Finished complementDD. Result has 12 states, 12 states have (on average 232.0) internal successors, (2784), 12 states have internal predecessors, (2784), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-26 15:25:00,185 INFO L175 Difference]: Start difference. First operand has 77 places, 88 transitions, 1237 flow. Second operand 11 states and 1056 transitions. [2023-08-26 15:25:00,185 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 84 places, 188 transitions, 2709 flow [2023-08-26 15:25:00,279 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 77 places, 188 transitions, 2533 flow, removed 13 selfloop flow, removed 7 redundant places. [2023-08-26 15:25:00,281 INFO L231 Difference]: Finished difference. Result has 85 places, 102 transitions, 1532 flow [2023-08-26 15:25:00,282 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=232, PETRI_DIFFERENCE_MINUEND_FLOW=1145, PETRI_DIFFERENCE_MINUEND_PLACES=67, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=88, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=46, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=33, PETRI_DIFFERENCE_SUBTRAHEND_STATES=11, PETRI_FLOW=1532, PETRI_PLACES=85, PETRI_TRANSITIONS=102} [2023-08-26 15:25:00,282 INFO L281 CegarLoopForPetriNet]: 41 programPoint places, 44 predicate places. [2023-08-26 15:25:00,282 INFO L495 AbstractCegarLoop]: Abstraction has has 85 places, 102 transitions, 1532 flow [2023-08-26 15:25:00,283 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 88.16666666666667) internal successors, (529), 6 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 15:25:00,283 INFO L200 CegarLoopForPetriNet]: Found error trace [2023-08-26 15:25:00,283 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-08-26 15:25:00,283 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable9 [2023-08-26 15:25:00,283 INFO L420 AbstractCegarLoop]: === Iteration 11 === Targeting ULTIMATE.startErr6ASSERT_VIOLATIONASSERT === [P0Err0ASSERT_VIOLATIONASSERT, ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 9 more)] === [2023-08-26 15:25:00,283 INFO L145 PredicateUnifier]: Initialized classic predicate unifier [2023-08-26 15:25:00,283 INFO L85 PathProgramCache]: Analyzing trace with hash -2062503188, now seen corresponding path program 1 times [2023-08-26 15:25:00,284 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-08-26 15:25:00,284 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1550413862] [2023-08-26 15:25:00,284 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-08-26 15:25:00,284 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-08-26 15:25:00,309 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-08-26 15:25:00,811 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 15:25:00,811 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-08-26 15:25:00,811 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1550413862] [2023-08-26 15:25:00,811 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1550413862] provided 1 perfect and 0 imperfect interpolant sequences [2023-08-26 15:25:00,811 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-08-26 15:25:00,812 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2023-08-26 15:25:00,812 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [67402908] [2023-08-26 15:25:00,812 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-08-26 15:25:00,812 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2023-08-26 15:25:00,812 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-08-26 15:25:00,812 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2023-08-26 15:25:00,813 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=13, Invalid=29, Unknown=0, NotChecked=0, Total=42 [2023-08-26 15:25:00,813 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 93 out of 232 [2023-08-26 15:25:00,814 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 85 places, 102 transitions, 1532 flow. Second operand has 7 states, 7 states have (on average 95.0) internal successors, (665), 7 states have internal predecessors, (665), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-26 15:25:00,814 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2023-08-26 15:25:00,814 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 93 of 232 [2023-08-26 15:25:00,814 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2023-08-26 15:25:01,645 INFO L124 PetriNetUnfolderBase]: 2805/4522 cut-off events. [2023-08-26 15:25:01,645 INFO L125 PetriNetUnfolderBase]: For 61199/61727 co-relation queries the response was YES. [2023-08-26 15:25:01,662 INFO L83 FinitePrefix]: Finished finitePrefix Result has 30141 conditions, 4522 events. 2805/4522 cut-off events. For 61199/61727 co-relation queries the response was YES. Maximal size of possible extension queue 275. Compared 26728 event pairs, 865 based on Foata normal form. 490/4962 useless extension candidates. Maximal degree in co-relation 30107. Up to 2935 conditions per place. [2023-08-26 15:25:01,678 INFO L140 encePairwiseOnDemand]: 224/232 looper letters, 116 selfloop transitions, 56 changer transitions 57/244 dead transitions. [2023-08-26 15:25:01,678 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 89 places, 244 transitions, 3957 flow [2023-08-26 15:25:01,678 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2023-08-26 15:25:01,679 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 10 states. [2023-08-26 15:25:01,681 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 10 states to 10 states and 1026 transitions. [2023-08-26 15:25:01,681 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.44224137931034485 [2023-08-26 15:25:01,681 INFO L72 ComplementDD]: Start complementDD. Operand 10 states and 1026 transitions. [2023-08-26 15:25:01,681 INFO L73 IsDeterministic]: Start isDeterministic. Operand 10 states and 1026 transitions. [2023-08-26 15:25:01,682 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2023-08-26 15:25:01,682 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 10 states and 1026 transitions. [2023-08-26 15:25:01,684 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 11 states, 10 states have (on average 102.6) internal successors, (1026), 10 states have internal predecessors, (1026), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-26 15:25:01,687 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 11 states, 11 states have (on average 232.0) internal successors, (2552), 11 states have internal predecessors, (2552), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-26 15:25:01,687 INFO L81 ComplementDD]: Finished complementDD. Result has 11 states, 11 states have (on average 232.0) internal successors, (2552), 11 states have internal predecessors, (2552), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-26 15:25:01,688 INFO L175 Difference]: Start difference. First operand has 85 places, 102 transitions, 1532 flow. Second operand 10 states and 1026 transitions. [2023-08-26 15:25:01,688 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 89 places, 244 transitions, 3957 flow [2023-08-26 15:25:01,926 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 84 places, 244 transitions, 3873 flow, removed 42 selfloop flow, removed 5 redundant places. [2023-08-26 15:25:01,933 INFO L231 Difference]: Finished difference. Result has 91 places, 132 transitions, 2183 flow [2023-08-26 15:25:01,933 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=232, PETRI_DIFFERENCE_MINUEND_FLOW=1504, PETRI_DIFFERENCE_MINUEND_PLACES=75, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=102, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=33, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=62, PETRI_DIFFERENCE_SUBTRAHEND_STATES=10, PETRI_FLOW=2183, PETRI_PLACES=91, PETRI_TRANSITIONS=132} [2023-08-26 15:25:01,934 INFO L281 CegarLoopForPetriNet]: 41 programPoint places, 50 predicate places. [2023-08-26 15:25:01,934 INFO L495 AbstractCegarLoop]: Abstraction has has 91 places, 132 transitions, 2183 flow [2023-08-26 15:25:01,934 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 7 states, 7 states have (on average 95.0) internal successors, (665), 7 states have internal predecessors, (665), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-26 15:25:01,935 INFO L200 CegarLoopForPetriNet]: Found error trace [2023-08-26 15:25:01,935 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-08-26 15:25:01,935 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable10 [2023-08-26 15:25:01,935 INFO L420 AbstractCegarLoop]: === Iteration 12 === Targeting ULTIMATE.startErr6ASSERT_VIOLATIONASSERT === [P0Err0ASSERT_VIOLATIONASSERT, ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 9 more)] === [2023-08-26 15:25:01,935 INFO L145 PredicateUnifier]: Initialized classic predicate unifier [2023-08-26 15:25:01,935 INFO L85 PathProgramCache]: Analyzing trace with hash -1483853623, now seen corresponding path program 1 times [2023-08-26 15:25:01,936 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-08-26 15:25:01,936 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1738585070] [2023-08-26 15:25:01,936 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-08-26 15:25:01,936 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-08-26 15:25:01,964 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-08-26 15:25:02,622 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 15:25:02,622 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-08-26 15:25:02,622 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1738585070] [2023-08-26 15:25:02,622 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1738585070] provided 1 perfect and 0 imperfect interpolant sequences [2023-08-26 15:25:02,623 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-08-26 15:25:02,623 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2023-08-26 15:25:02,623 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1430893156] [2023-08-26 15:25:02,623 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-08-26 15:25:02,623 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2023-08-26 15:25:02,623 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-08-26 15:25:02,624 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2023-08-26 15:25:02,624 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=11, Invalid=19, Unknown=0, NotChecked=0, Total=30 [2023-08-26 15:25:02,624 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 85 out of 232 [2023-08-26 15:25:02,625 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 91 places, 132 transitions, 2183 flow. Second operand has 6 states, 6 states have (on average 87.33333333333333) internal successors, (524), 6 states have internal predecessors, (524), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-26 15:25:02,625 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2023-08-26 15:25:02,625 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 85 of 232 [2023-08-26 15:25:02,625 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2023-08-26 15:25:03,383 INFO L124 PetriNetUnfolderBase]: 2968/4694 cut-off events. [2023-08-26 15:25:03,384 INFO L125 PetriNetUnfolderBase]: For 56377/56377 co-relation queries the response was YES. [2023-08-26 15:25:03,399 INFO L83 FinitePrefix]: Finished finitePrefix Result has 32686 conditions, 4694 events. 2968/4694 cut-off events. For 56377/56377 co-relation queries the response was YES. Maximal size of possible extension queue 241. Compared 26588 event pairs, 861 based on Foata normal form. 104/4798 useless extension candidates. Maximal degree in co-relation 32649. Up to 3308 conditions per place. [2023-08-26 15:25:03,413 INFO L140 encePairwiseOnDemand]: 219/232 looper letters, 97 selfloop transitions, 73 changer transitions 39/209 dead transitions. [2023-08-26 15:25:03,413 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 97 places, 209 transitions, 3490 flow [2023-08-26 15:25:03,414 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2023-08-26 15:25:03,414 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 10 states. [2023-08-26 15:25:03,416 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 10 states to 10 states and 952 transitions. [2023-08-26 15:25:03,417 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.4103448275862069 [2023-08-26 15:25:03,417 INFO L72 ComplementDD]: Start complementDD. Operand 10 states and 952 transitions. [2023-08-26 15:25:03,417 INFO L73 IsDeterministic]: Start isDeterministic. Operand 10 states and 952 transitions. [2023-08-26 15:25:03,417 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2023-08-26 15:25:03,417 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 10 states and 952 transitions. [2023-08-26 15:25:03,419 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 11 states, 10 states have (on average 95.2) internal successors, (952), 10 states have internal predecessors, (952), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-26 15:25:03,422 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 11 states, 11 states have (on average 232.0) internal successors, (2552), 11 states have internal predecessors, (2552), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-26 15:25:03,423 INFO L81 ComplementDD]: Finished complementDD. Result has 11 states, 11 states have (on average 232.0) internal successors, (2552), 11 states have internal predecessors, (2552), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-26 15:25:03,423 INFO L175 Difference]: Start difference. First operand has 91 places, 132 transitions, 2183 flow. Second operand 10 states and 952 transitions. [2023-08-26 15:25:03,423 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 97 places, 209 transitions, 3490 flow [2023-08-26 15:25:03,576 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 95 places, 209 transitions, 3444 flow, removed 23 selfloop flow, removed 2 redundant places. [2023-08-26 15:25:03,579 INFO L231 Difference]: Finished difference. Result has 100 places, 135 transitions, 2352 flow [2023-08-26 15:25:03,580 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=232, PETRI_DIFFERENCE_MINUEND_FLOW=2153, PETRI_DIFFERENCE_MINUEND_PLACES=86, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=132, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=68, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=61, PETRI_DIFFERENCE_SUBTRAHEND_STATES=10, PETRI_FLOW=2352, PETRI_PLACES=100, PETRI_TRANSITIONS=135} [2023-08-26 15:25:03,580 INFO L281 CegarLoopForPetriNet]: 41 programPoint places, 59 predicate places. [2023-08-26 15:25:03,580 INFO L495 AbstractCegarLoop]: Abstraction has has 100 places, 135 transitions, 2352 flow [2023-08-26 15:25:03,581 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 87.33333333333333) internal successors, (524), 6 states have internal predecessors, (524), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-26 15:25:03,581 INFO L200 CegarLoopForPetriNet]: Found error trace [2023-08-26 15:25:03,581 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-08-26 15:25:03,581 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable11 [2023-08-26 15:25:03,581 INFO L420 AbstractCegarLoop]: === Iteration 13 === Targeting ULTIMATE.startErr6ASSERT_VIOLATIONASSERT === [P0Err0ASSERT_VIOLATIONASSERT, ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 9 more)] === [2023-08-26 15:25:03,581 INFO L145 PredicateUnifier]: Initialized classic predicate unifier [2023-08-26 15:25:03,581 INFO L85 PathProgramCache]: Analyzing trace with hash -1797093995, now seen corresponding path program 2 times [2023-08-26 15:25:03,581 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-08-26 15:25:03,582 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [665773987] [2023-08-26 15:25:03,582 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-08-26 15:25:03,582 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-08-26 15:25:03,607 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-08-26 15:25:04,151 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 15:25:04,151 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-08-26 15:25:04,151 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [665773987] [2023-08-26 15:25:04,151 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [665773987] provided 1 perfect and 0 imperfect interpolant sequences [2023-08-26 15:25:04,151 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-08-26 15:25:04,151 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2023-08-26 15:25:04,152 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [310427565] [2023-08-26 15:25:04,152 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-08-26 15:25:04,152 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2023-08-26 15:25:04,152 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-08-26 15:25:04,153 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2023-08-26 15:25:04,153 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=15, Invalid=27, Unknown=0, NotChecked=0, Total=42 [2023-08-26 15:25:04,153 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 85 out of 232 [2023-08-26 15:25:04,154 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 100 places, 135 transitions, 2352 flow. Second operand has 7 states, 7 states have (on average 87.0) internal successors, (609), 7 states have internal predecessors, (609), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-26 15:25:04,154 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2023-08-26 15:25:04,154 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 85 of 232 [2023-08-26 15:25:04,154 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2023-08-26 15:25:04,942 INFO L124 PetriNetUnfolderBase]: 2844/4521 cut-off events. [2023-08-26 15:25:04,943 INFO L125 PetriNetUnfolderBase]: For 68164/68164 co-relation queries the response was YES. [2023-08-26 15:25:04,961 INFO L83 FinitePrefix]: Finished finitePrefix Result has 33148 conditions, 4521 events. 2844/4521 cut-off events. For 68164/68164 co-relation queries the response was YES. Maximal size of possible extension queue 230. Compared 25440 event pairs, 1059 based on Foata normal form. 110/4631 useless extension candidates. Maximal degree in co-relation 33107. Up to 4009 conditions per place. [2023-08-26 15:25:04,975 INFO L140 encePairwiseOnDemand]: 222/232 looper letters, 134 selfloop transitions, 32 changer transitions 33/199 dead transitions. [2023-08-26 15:25:04,975 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 102 places, 199 transitions, 3645 flow [2023-08-26 15:25:04,976 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2023-08-26 15:25:04,977 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 7 states. [2023-08-26 15:25:04,978 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 7 states to 7 states and 671 transitions. [2023-08-26 15:25:04,979 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.4131773399014778 [2023-08-26 15:25:04,979 INFO L72 ComplementDD]: Start complementDD. Operand 7 states and 671 transitions. [2023-08-26 15:25:04,979 INFO L73 IsDeterministic]: Start isDeterministic. Operand 7 states and 671 transitions. [2023-08-26 15:25:04,979 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2023-08-26 15:25:04,979 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 7 states and 671 transitions. [2023-08-26 15:25:04,980 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 8 states, 7 states have (on average 95.85714285714286) internal successors, (671), 7 states have internal predecessors, (671), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-26 15:25:04,982 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 8 states, 8 states have (on average 232.0) internal successors, (1856), 8 states have internal predecessors, (1856), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-26 15:25:04,983 INFO L81 ComplementDD]: Finished complementDD. Result has 8 states, 8 states have (on average 232.0) internal successors, (1856), 8 states have internal predecessors, (1856), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-26 15:25:04,983 INFO L175 Difference]: Start difference. First operand has 100 places, 135 transitions, 2352 flow. Second operand 7 states and 671 transitions. [2023-08-26 15:25:04,983 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 102 places, 199 transitions, 3645 flow [2023-08-26 15:25:05,165 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 97 places, 199 transitions, 3551 flow, removed 18 selfloop flow, removed 5 redundant places. [2023-08-26 15:25:05,168 INFO L231 Difference]: Finished difference. Result has 100 places, 140 transitions, 2474 flow [2023-08-26 15:25:05,168 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=232, PETRI_DIFFERENCE_MINUEND_FLOW=2289, PETRI_DIFFERENCE_MINUEND_PLACES=91, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=135, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=27, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=106, PETRI_DIFFERENCE_SUBTRAHEND_STATES=7, PETRI_FLOW=2474, PETRI_PLACES=100, PETRI_TRANSITIONS=140} [2023-08-26 15:25:05,169 INFO L281 CegarLoopForPetriNet]: 41 programPoint places, 59 predicate places. [2023-08-26 15:25:05,169 INFO L495 AbstractCegarLoop]: Abstraction has has 100 places, 140 transitions, 2474 flow [2023-08-26 15:25:05,169 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 7 states, 7 states have (on average 87.0) internal successors, (609), 7 states have internal predecessors, (609), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-26 15:25:05,170 INFO L200 CegarLoopForPetriNet]: Found error trace [2023-08-26 15:25:05,170 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-08-26 15:25:05,170 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable12 [2023-08-26 15:25:05,170 INFO L420 AbstractCegarLoop]: === Iteration 14 === Targeting ULTIMATE.startErr6ASSERT_VIOLATIONASSERT === [P0Err0ASSERT_VIOLATIONASSERT, ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 9 more)] === [2023-08-26 15:25:05,170 INFO L145 PredicateUnifier]: Initialized classic predicate unifier [2023-08-26 15:25:05,170 INFO L85 PathProgramCache]: Analyzing trace with hash 2013251785, now seen corresponding path program 3 times [2023-08-26 15:25:05,170 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-08-26 15:25:05,170 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [475302472] [2023-08-26 15:25:05,170 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-08-26 15:25:05,171 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-08-26 15:25:05,190 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-08-26 15:25:05,695 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 15:25:05,695 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-08-26 15:25:05,696 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [475302472] [2023-08-26 15:25:05,696 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [475302472] provided 1 perfect and 0 imperfect interpolant sequences [2023-08-26 15:25:05,696 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-08-26 15:25:05,696 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2023-08-26 15:25:05,696 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2109628073] [2023-08-26 15:25:05,696 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-08-26 15:25:05,697 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2023-08-26 15:25:05,697 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-08-26 15:25:05,698 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2023-08-26 15:25:05,698 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=15, Invalid=27, Unknown=0, NotChecked=0, Total=42 [2023-08-26 15:25:05,699 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 93 out of 232 [2023-08-26 15:25:05,699 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 100 places, 140 transitions, 2474 flow. Second operand has 7 states, 7 states have (on average 95.0) internal successors, (665), 7 states have internal predecessors, (665), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-26 15:25:05,699 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2023-08-26 15:25:05,699 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 93 of 232 [2023-08-26 15:25:05,699 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2023-08-26 15:25:06,349 INFO L124 PetriNetUnfolderBase]: 2448/4028 cut-off events. [2023-08-26 15:25:06,349 INFO L125 PetriNetUnfolderBase]: For 56715/56816 co-relation queries the response was YES. [2023-08-26 15:25:06,365 INFO L83 FinitePrefix]: Finished finitePrefix Result has 29235 conditions, 4028 events. 2448/4028 cut-off events. For 56715/56816 co-relation queries the response was YES. Maximal size of possible extension queue 232. Compared 23860 event pairs, 909 based on Foata normal form. 201/4141 useless extension candidates. Maximal degree in co-relation 29195. Up to 3059 conditions per place. [2023-08-26 15:25:06,376 INFO L140 encePairwiseOnDemand]: 224/232 looper letters, 110 selfloop transitions, 30 changer transitions 48/202 dead transitions. [2023-08-26 15:25:06,376 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 106 places, 202 transitions, 3715 flow [2023-08-26 15:25:06,376 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2023-08-26 15:25:06,377 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 9 states. [2023-08-26 15:25:06,378 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 9 states to 9 states and 909 transitions. [2023-08-26 15:25:06,379 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.4353448275862069 [2023-08-26 15:25:06,379 INFO L72 ComplementDD]: Start complementDD. Operand 9 states and 909 transitions. [2023-08-26 15:25:06,379 INFO L73 IsDeterministic]: Start isDeterministic. Operand 9 states and 909 transitions. [2023-08-26 15:25:06,380 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2023-08-26 15:25:06,380 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 9 states and 909 transitions. [2023-08-26 15:25:06,381 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 10 states, 9 states have (on average 101.0) internal successors, (909), 9 states have internal predecessors, (909), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-26 15:25:06,384 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 10 states, 10 states have (on average 232.0) internal successors, (2320), 10 states have internal predecessors, (2320), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-26 15:25:06,384 INFO L81 ComplementDD]: Finished complementDD. Result has 10 states, 10 states have (on average 232.0) internal successors, (2320), 10 states have internal predecessors, (2320), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-26 15:25:06,384 INFO L175 Difference]: Start difference. First operand has 100 places, 140 transitions, 2474 flow. Second operand 9 states and 909 transitions. [2023-08-26 15:25:06,384 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 106 places, 202 transitions, 3715 flow [2023-08-26 15:25:06,512 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 102 places, 202 transitions, 3649 flow, removed 18 selfloop flow, removed 4 redundant places. [2023-08-26 15:25:06,514 INFO L231 Difference]: Finished difference. Result has 108 places, 132 transitions, 2353 flow [2023-08-26 15:25:06,514 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=232, PETRI_DIFFERENCE_MINUEND_FLOW=2422, PETRI_DIFFERENCE_MINUEND_PLACES=94, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=140, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=27, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=111, PETRI_DIFFERENCE_SUBTRAHEND_STATES=9, PETRI_FLOW=2353, PETRI_PLACES=108, PETRI_TRANSITIONS=132} [2023-08-26 15:25:06,515 INFO L281 CegarLoopForPetriNet]: 41 programPoint places, 67 predicate places. [2023-08-26 15:25:06,515 INFO L495 AbstractCegarLoop]: Abstraction has has 108 places, 132 transitions, 2353 flow [2023-08-26 15:25:06,515 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 7 states, 7 states have (on average 95.0) internal successors, (665), 7 states have internal predecessors, (665), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-26 15:25:06,515 INFO L200 CegarLoopForPetriNet]: Found error trace [2023-08-26 15:25:06,515 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-08-26 15:25:06,516 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable13 [2023-08-26 15:25:06,516 INFO L420 AbstractCegarLoop]: === Iteration 15 === Targeting ULTIMATE.startErr6ASSERT_VIOLATIONASSERT === [P0Err0ASSERT_VIOLATIONASSERT, ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 9 more)] === [2023-08-26 15:25:06,516 INFO L145 PredicateUnifier]: Initialized classic predicate unifier [2023-08-26 15:25:06,516 INFO L85 PathProgramCache]: Analyzing trace with hash 337478499, now seen corresponding path program 1 times [2023-08-26 15:25:06,516 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-08-26 15:25:06,516 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1610049690] [2023-08-26 15:25:06,516 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-08-26 15:25:06,516 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-08-26 15:25:06,537 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-08-26 15:25:06,622 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 15:25:06,622 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-08-26 15:25:06,622 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1610049690] [2023-08-26 15:25:06,622 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1610049690] provided 1 perfect and 0 imperfect interpolant sequences [2023-08-26 15:25:06,622 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-08-26 15:25:06,622 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2023-08-26 15:25:06,623 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [300017828] [2023-08-26 15:25:06,623 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-08-26 15:25:06,623 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2023-08-26 15:25:06,623 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-08-26 15:25:06,623 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2023-08-26 15:25:06,623 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2023-08-26 15:25:06,624 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 93 out of 232 [2023-08-26 15:25:06,624 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 108 places, 132 transitions, 2353 flow. Second operand has 4 states, 4 states have (on average 96.5) internal successors, (386), 4 states have internal predecessors, (386), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-26 15:25:06,624 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2023-08-26 15:25:06,624 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 93 of 232 [2023-08-26 15:25:06,624 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2023-08-26 15:25:07,062 INFO L124 PetriNetUnfolderBase]: 1518/2661 cut-off events. [2023-08-26 15:25:07,062 INFO L125 PetriNetUnfolderBase]: For 53969/54587 co-relation queries the response was YES. [2023-08-26 15:25:07,072 INFO L83 FinitePrefix]: Finished finitePrefix Result has 19358 conditions, 2661 events. 1518/2661 cut-off events. For 53969/54587 co-relation queries the response was YES. Maximal size of possible extension queue 195. Compared 16521 event pairs, 264 based on Foata normal form. 668/3293 useless extension candidates. Maximal degree in co-relation 19314. Up to 1555 conditions per place. [2023-08-26 15:25:07,077 INFO L140 encePairwiseOnDemand]: 226/232 looper letters, 138 selfloop transitions, 6 changer transitions 110/274 dead transitions. [2023-08-26 15:25:07,077 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 108 places, 274 transitions, 5462 flow [2023-08-26 15:25:07,078 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2023-08-26 15:25:07,078 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 5 states. [2023-08-26 15:25:07,079 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 518 transitions. [2023-08-26 15:25:07,081 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.44655172413793104 [2023-08-26 15:25:07,081 INFO L72 ComplementDD]: Start complementDD. Operand 5 states and 518 transitions. [2023-08-26 15:25:07,081 INFO L73 IsDeterministic]: Start isDeterministic. Operand 5 states and 518 transitions. [2023-08-26 15:25:07,081 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2023-08-26 15:25:07,081 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 5 states and 518 transitions. [2023-08-26 15:25:07,082 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 6 states, 5 states have (on average 103.6) internal successors, (518), 5 states have internal predecessors, (518), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-26 15:25:07,084 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 6 states, 6 states have (on average 232.0) internal successors, (1392), 6 states have internal predecessors, (1392), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-26 15:25:07,084 INFO L81 ComplementDD]: Finished complementDD. Result has 6 states, 6 states have (on average 232.0) internal successors, (1392), 6 states have internal predecessors, (1392), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-26 15:25:07,084 INFO L175 Difference]: Start difference. First operand has 108 places, 132 transitions, 2353 flow. Second operand 5 states and 518 transitions. [2023-08-26 15:25:07,084 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 108 places, 274 transitions, 5462 flow [2023-08-26 15:25:07,146 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 102 places, 274 transitions, 5350 flow, removed 16 selfloop flow, removed 6 redundant places. [2023-08-26 15:25:07,150 INFO L231 Difference]: Finished difference. Result has 105 places, 119 transitions, 2077 flow [2023-08-26 15:25:07,150 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=232, PETRI_DIFFERENCE_MINUEND_FLOW=2037, PETRI_DIFFERENCE_MINUEND_PLACES=98, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=116, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=2, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=111, PETRI_DIFFERENCE_SUBTRAHEND_STATES=5, PETRI_FLOW=2077, PETRI_PLACES=105, PETRI_TRANSITIONS=119} [2023-08-26 15:25:07,151 INFO L281 CegarLoopForPetriNet]: 41 programPoint places, 64 predicate places. [2023-08-26 15:25:07,151 INFO L495 AbstractCegarLoop]: Abstraction has has 105 places, 119 transitions, 2077 flow [2023-08-26 15:25:07,151 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 96.5) internal successors, (386), 4 states have internal predecessors, (386), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-26 15:25:07,151 INFO L200 CegarLoopForPetriNet]: Found error trace [2023-08-26 15:25:07,151 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-08-26 15:25:07,151 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable14 [2023-08-26 15:25:07,151 INFO L420 AbstractCegarLoop]: === Iteration 16 === Targeting ULTIMATE.startErr6ASSERT_VIOLATIONASSERT === [P0Err0ASSERT_VIOLATIONASSERT, ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 9 more)] === [2023-08-26 15:25:07,152 INFO L145 PredicateUnifier]: Initialized classic predicate unifier [2023-08-26 15:25:07,152 INFO L85 PathProgramCache]: Analyzing trace with hash -1854919029, now seen corresponding path program 1 times [2023-08-26 15:25:07,152 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-08-26 15:25:07,152 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [77650711] [2023-08-26 15:25:07,152 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-08-26 15:25:07,152 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-08-26 15:25:07,174 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-08-26 15:25:07,273 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 15:25:07,274 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-08-26 15:25:07,274 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [77650711] [2023-08-26 15:25:07,274 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [77650711] provided 1 perfect and 0 imperfect interpolant sequences [2023-08-26 15:25:07,274 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-08-26 15:25:07,274 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2023-08-26 15:25:07,274 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [287989906] [2023-08-26 15:25:07,274 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-08-26 15:25:07,274 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2023-08-26 15:25:07,275 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-08-26 15:25:07,275 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2023-08-26 15:25:07,275 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=8, Invalid=12, Unknown=0, NotChecked=0, Total=20 [2023-08-26 15:25:07,276 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 93 out of 232 [2023-08-26 15:25:07,276 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 105 places, 119 transitions, 2077 flow. Second operand has 5 states, 5 states have (on average 96.0) internal successors, (480), 5 states have internal predecessors, (480), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-26 15:25:07,276 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2023-08-26 15:25:07,276 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 93 of 232 [2023-08-26 15:25:07,276 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2023-08-26 15:25:07,644 INFO L124 PetriNetUnfolderBase]: 911/1703 cut-off events. [2023-08-26 15:25:07,644 INFO L125 PetriNetUnfolderBase]: For 32594/32927 co-relation queries the response was YES. [2023-08-26 15:25:07,653 INFO L83 FinitePrefix]: Finished finitePrefix Result has 12703 conditions, 1703 events. 911/1703 cut-off events. For 32594/32927 co-relation queries the response was YES. Maximal size of possible extension queue 131. Compared 10446 event pairs, 59 based on Foata normal form. 356/2042 useless extension candidates. Maximal degree in co-relation 12660. Up to 813 conditions per place. [2023-08-26 15:25:07,658 INFO L140 encePairwiseOnDemand]: 226/232 looper letters, 125 selfloop transitions, 10 changer transitions 137/290 dead transitions. [2023-08-26 15:25:07,658 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 111 places, 290 transitions, 5704 flow [2023-08-26 15:25:07,658 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2023-08-26 15:25:07,659 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 7 states. [2023-08-26 15:25:07,660 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 7 states to 7 states and 723 transitions. [2023-08-26 15:25:07,660 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.44519704433497537 [2023-08-26 15:25:07,660 INFO L72 ComplementDD]: Start complementDD. Operand 7 states and 723 transitions. [2023-08-26 15:25:07,661 INFO L73 IsDeterministic]: Start isDeterministic. Operand 7 states and 723 transitions. [2023-08-26 15:25:07,662 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2023-08-26 15:25:07,662 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 7 states and 723 transitions. [2023-08-26 15:25:07,664 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 8 states, 7 states have (on average 103.28571428571429) internal successors, (723), 7 states have internal predecessors, (723), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-26 15:25:07,667 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 8 states, 8 states have (on average 232.0) internal successors, (1856), 8 states have internal predecessors, (1856), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-26 15:25:07,667 INFO L81 ComplementDD]: Finished complementDD. Result has 8 states, 8 states have (on average 232.0) internal successors, (1856), 8 states have internal predecessors, (1856), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-26 15:25:07,667 INFO L175 Difference]: Start difference. First operand has 105 places, 119 transitions, 2077 flow. Second operand 7 states and 723 transitions. [2023-08-26 15:25:07,667 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 111 places, 290 transitions, 5704 flow [2023-08-26 15:25:07,722 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 106 places, 290 transitions, 5573 flow, removed 9 selfloop flow, removed 5 redundant places. [2023-08-26 15:25:07,726 INFO L231 Difference]: Finished difference. Result has 109 places, 102 transitions, 1637 flow [2023-08-26 15:25:07,727 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=232, PETRI_DIFFERENCE_MINUEND_FLOW=1878, PETRI_DIFFERENCE_MINUEND_PLACES=100, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=112, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=6, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=102, PETRI_DIFFERENCE_SUBTRAHEND_STATES=7, PETRI_FLOW=1637, PETRI_PLACES=109, PETRI_TRANSITIONS=102} [2023-08-26 15:25:07,728 INFO L281 CegarLoopForPetriNet]: 41 programPoint places, 68 predicate places. [2023-08-26 15:25:07,728 INFO L495 AbstractCegarLoop]: Abstraction has has 109 places, 102 transitions, 1637 flow [2023-08-26 15:25:07,728 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 96.0) internal successors, (480), 5 states have internal predecessors, (480), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-26 15:25:07,728 INFO L200 CegarLoopForPetriNet]: Found error trace [2023-08-26 15:25:07,728 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-08-26 15:25:07,728 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable15 [2023-08-26 15:25:07,729 INFO L420 AbstractCegarLoop]: === Iteration 17 === Targeting ULTIMATE.startErr6ASSERT_VIOLATIONASSERT === [P0Err0ASSERT_VIOLATIONASSERT, ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 9 more)] === [2023-08-26 15:25:07,729 INFO L145 PredicateUnifier]: Initialized classic predicate unifier [2023-08-26 15:25:07,729 INFO L85 PathProgramCache]: Analyzing trace with hash -701653066, now seen corresponding path program 1 times [2023-08-26 15:25:07,729 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-08-26 15:25:07,729 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [876678624] [2023-08-26 15:25:07,729 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-08-26 15:25:07,729 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-08-26 15:25:07,778 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-08-26 15:25:08,637 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 15:25:08,637 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-08-26 15:25:08,638 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [876678624] [2023-08-26 15:25:08,638 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [876678624] provided 1 perfect and 0 imperfect interpolant sequences [2023-08-26 15:25:08,638 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-08-26 15:25:08,638 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2023-08-26 15:25:08,638 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2102829236] [2023-08-26 15:25:08,638 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-08-26 15:25:08,639 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 9 states [2023-08-26 15:25:08,639 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-08-26 15:25:08,639 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2023-08-26 15:25:08,639 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=20, Invalid=52, Unknown=0, NotChecked=0, Total=72 [2023-08-26 15:25:08,640 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 92 out of 232 [2023-08-26 15:25:08,641 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 109 places, 102 transitions, 1637 flow. Second operand has 9 states, 9 states have (on average 94.0) internal successors, (846), 9 states have internal predecessors, (846), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-26 15:25:08,641 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2023-08-26 15:25:08,641 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 92 of 232 [2023-08-26 15:25:08,641 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2023-08-26 15:25:09,189 INFO L124 PetriNetUnfolderBase]: 868/1781 cut-off events. [2023-08-26 15:25:09,189 INFO L125 PetriNetUnfolderBase]: For 22523/22593 co-relation queries the response was YES. [2023-08-26 15:25:09,196 INFO L83 FinitePrefix]: Finished finitePrefix Result has 13854 conditions, 1781 events. 868/1781 cut-off events. For 22523/22593 co-relation queries the response was YES. Maximal size of possible extension queue 141. Compared 11448 event pairs, 82 based on Foata normal form. 63/1829 useless extension candidates. Maximal degree in co-relation 13810. Up to 990 conditions per place. [2023-08-26 15:25:09,199 INFO L140 encePairwiseOnDemand]: 225/232 looper letters, 68 selfloop transitions, 23 changer transitions 51/153 dead transitions. [2023-08-26 15:25:09,199 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 115 places, 153 transitions, 2489 flow [2023-08-26 15:25:09,200 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2023-08-26 15:25:09,200 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 8 states. [2023-08-26 15:25:09,201 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 8 states to 8 states and 794 transitions. [2023-08-26 15:25:09,201 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.42780172413793105 [2023-08-26 15:25:09,202 INFO L72 ComplementDD]: Start complementDD. Operand 8 states and 794 transitions. [2023-08-26 15:25:09,202 INFO L73 IsDeterministic]: Start isDeterministic. Operand 8 states and 794 transitions. [2023-08-26 15:25:09,202 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2023-08-26 15:25:09,202 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 8 states and 794 transitions. [2023-08-26 15:25:09,203 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 9 states, 8 states have (on average 99.25) internal successors, (794), 8 states have internal predecessors, (794), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-26 15:25:09,205 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 9 states, 9 states have (on average 232.0) internal successors, (2088), 9 states have internal predecessors, (2088), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-26 15:25:09,205 INFO L81 ComplementDD]: Finished complementDD. Result has 9 states, 9 states have (on average 232.0) internal successors, (2088), 9 states have internal predecessors, (2088), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-26 15:25:09,205 INFO L175 Difference]: Start difference. First operand has 109 places, 102 transitions, 1637 flow. Second operand 8 states and 794 transitions. [2023-08-26 15:25:09,205 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 115 places, 153 transitions, 2489 flow [2023-08-26 15:25:09,281 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 107 places, 153 transitions, 2301 flow, removed 61 selfloop flow, removed 8 redundant places. [2023-08-26 15:25:09,283 INFO L231 Difference]: Finished difference. Result has 110 places, 85 transitions, 1356 flow [2023-08-26 15:25:09,283 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=232, PETRI_DIFFERENCE_MINUEND_FLOW=1513, PETRI_DIFFERENCE_MINUEND_PLACES=100, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=102, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=20, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=79, PETRI_DIFFERENCE_SUBTRAHEND_STATES=8, PETRI_FLOW=1356, PETRI_PLACES=110, PETRI_TRANSITIONS=85} [2023-08-26 15:25:09,284 INFO L281 CegarLoopForPetriNet]: 41 programPoint places, 69 predicate places. [2023-08-26 15:25:09,284 INFO L495 AbstractCegarLoop]: Abstraction has has 110 places, 85 transitions, 1356 flow [2023-08-26 15:25:09,284 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 9 states, 9 states have (on average 94.0) internal successors, (846), 9 states have internal predecessors, (846), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-26 15:25:09,284 INFO L200 CegarLoopForPetriNet]: Found error trace [2023-08-26 15:25:09,284 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 15:25:09,284 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable16 [2023-08-26 15:25:09,285 INFO L420 AbstractCegarLoop]: === Iteration 18 === Targeting ULTIMATE.startErr6ASSERT_VIOLATIONASSERT === [P0Err0ASSERT_VIOLATIONASSERT, ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 9 more)] === [2023-08-26 15:25:09,285 INFO L145 PredicateUnifier]: Initialized classic predicate unifier [2023-08-26 15:25:09,285 INFO L85 PathProgramCache]: Analyzing trace with hash -79734397, now seen corresponding path program 1 times [2023-08-26 15:25:09,285 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-08-26 15:25:09,285 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [614990847] [2023-08-26 15:25:09,285 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-08-26 15:25:09,285 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-08-26 15:25:09,314 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-08-26 15:25:09,455 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 15:25:09,456 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-08-26 15:25:09,456 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [614990847] [2023-08-26 15:25:09,456 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [614990847] provided 1 perfect and 0 imperfect interpolant sequences [2023-08-26 15:25:09,456 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-08-26 15:25:09,456 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2023-08-26 15:25:09,456 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1160611265] [2023-08-26 15:25:09,456 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-08-26 15:25:09,456 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2023-08-26 15:25:09,457 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-08-26 15:25:09,457 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2023-08-26 15:25:09,457 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=12, Invalid=18, Unknown=0, NotChecked=0, Total=30 [2023-08-26 15:25:09,458 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 93 out of 232 [2023-08-26 15:25:09,458 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 110 places, 85 transitions, 1356 flow. Second operand has 6 states, 6 states have (on average 95.83333333333333) internal successors, (575), 6 states have internal predecessors, (575), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-26 15:25:09,458 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2023-08-26 15:25:09,458 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 93 of 232 [2023-08-26 15:25:09,458 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2023-08-26 15:25:09,710 INFO L124 PetriNetUnfolderBase]: 477/981 cut-off events. [2023-08-26 15:25:09,710 INFO L125 PetriNetUnfolderBase]: For 12138/12175 co-relation queries the response was YES. [2023-08-26 15:25:09,715 INFO L83 FinitePrefix]: Finished finitePrefix Result has 7350 conditions, 981 events. 477/981 cut-off events. For 12138/12175 co-relation queries the response was YES. Maximal size of possible extension queue 85. Compared 5684 event pairs, 36 based on Foata normal form. 74/1048 useless extension candidates. Maximal degree in co-relation 7307. Up to 430 conditions per place. [2023-08-26 15:25:09,717 INFO L140 encePairwiseOnDemand]: 226/232 looper letters, 45 selfloop transitions, 10 changer transitions 122/182 dead transitions. [2023-08-26 15:25:09,717 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 113 places, 182 transitions, 3328 flow [2023-08-26 15:25:09,718 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2023-08-26 15:25:09,718 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 8 states. [2023-08-26 15:25:09,719 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 8 states to 8 states and 804 transitions. [2023-08-26 15:25:09,719 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.4331896551724138 [2023-08-26 15:25:09,720 INFO L72 ComplementDD]: Start complementDD. Operand 8 states and 804 transitions. [2023-08-26 15:25:09,720 INFO L73 IsDeterministic]: Start isDeterministic. Operand 8 states and 804 transitions. [2023-08-26 15:25:09,720 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2023-08-26 15:25:09,720 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 8 states and 804 transitions. [2023-08-26 15:25:09,730 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 9 states, 8 states have (on average 100.5) internal successors, (804), 8 states have internal predecessors, (804), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-26 15:25:09,732 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 9 states, 9 states have (on average 232.0) internal successors, (2088), 9 states have internal predecessors, (2088), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-26 15:25:09,732 INFO L81 ComplementDD]: Finished complementDD. Result has 9 states, 9 states have (on average 232.0) internal successors, (2088), 9 states have internal predecessors, (2088), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-26 15:25:09,732 INFO L175 Difference]: Start difference. First operand has 110 places, 85 transitions, 1356 flow. Second operand 8 states and 804 transitions. [2023-08-26 15:25:09,733 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 113 places, 182 transitions, 3328 flow [2023-08-26 15:25:09,765 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 94 places, 182 transitions, 2974 flow, removed 81 selfloop flow, removed 19 redundant places. [2023-08-26 15:25:09,767 INFO L231 Difference]: Finished difference. Result has 97 places, 43 transitions, 544 flow [2023-08-26 15:25:09,768 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=232, PETRI_DIFFERENCE_MINUEND_FLOW=1184, PETRI_DIFFERENCE_MINUEND_PLACES=87, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=85, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=10, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=75, PETRI_DIFFERENCE_SUBTRAHEND_STATES=8, PETRI_FLOW=544, PETRI_PLACES=97, PETRI_TRANSITIONS=43} [2023-08-26 15:25:09,768 INFO L281 CegarLoopForPetriNet]: 41 programPoint places, 56 predicate places. [2023-08-26 15:25:09,768 INFO L495 AbstractCegarLoop]: Abstraction has has 97 places, 43 transitions, 544 flow [2023-08-26 15:25:09,768 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 95.83333333333333) internal successors, (575), 6 states have internal predecessors, (575), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-26 15:25:09,768 INFO L200 CegarLoopForPetriNet]: Found error trace [2023-08-26 15:25:09,769 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-08-26 15:25:09,769 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable17 [2023-08-26 15:25:09,769 INFO L420 AbstractCegarLoop]: === Iteration 19 === Targeting ULTIMATE.startErr6ASSERT_VIOLATIONASSERT === [P0Err0ASSERT_VIOLATIONASSERT, ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 9 more)] === [2023-08-26 15:25:09,769 INFO L145 PredicateUnifier]: Initialized classic predicate unifier [2023-08-26 15:25:09,769 INFO L85 PathProgramCache]: Analyzing trace with hash 853050304, now seen corresponding path program 1 times [2023-08-26 15:25:09,769 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-08-26 15:25:09,769 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [58967586] [2023-08-26 15:25:09,769 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-08-26 15:25:09,770 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-08-26 15:25:09,800 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-08-26 15:25:11,140 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 15:25:11,140 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-08-26 15:25:11,140 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [58967586] [2023-08-26 15:25:11,140 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [58967586] provided 1 perfect and 0 imperfect interpolant sequences [2023-08-26 15:25:11,140 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-08-26 15:25:11,140 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2023-08-26 15:25:11,141 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [392838619] [2023-08-26 15:25:11,141 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-08-26 15:25:11,141 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 10 states [2023-08-26 15:25:11,141 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-08-26 15:25:11,142 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2023-08-26 15:25:11,142 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=24, Invalid=66, Unknown=0, NotChecked=0, Total=90 [2023-08-26 15:25:11,142 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 83 out of 232 [2023-08-26 15:25:11,143 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 97 places, 43 transitions, 544 flow. Second operand has 10 states, 10 states have (on average 85.2) internal successors, (852), 10 states have internal predecessors, (852), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-26 15:25:11,143 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2023-08-26 15:25:11,143 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 83 of 232 [2023-08-26 15:25:11,143 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2023-08-26 15:25:11,564 INFO L124 PetriNetUnfolderBase]: 153/318 cut-off events. [2023-08-26 15:25:11,564 INFO L125 PetriNetUnfolderBase]: For 2153/2153 co-relation queries the response was YES. [2023-08-26 15:25:11,566 INFO L83 FinitePrefix]: Finished finitePrefix Result has 2107 conditions, 318 events. 153/318 cut-off events. For 2153/2153 co-relation queries the response was YES. Maximal size of possible extension queue 24. Compared 1125 event pairs, 22 based on Foata normal form. 1/319 useless extension candidates. Maximal degree in co-relation 2070. Up to 136 conditions per place. [2023-08-26 15:25:11,566 INFO L140 encePairwiseOnDemand]: 222/232 looper letters, 49 selfloop transitions, 13 changer transitions 30/92 dead transitions. [2023-08-26 15:25:11,566 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 96 places, 92 transitions, 1145 flow [2023-08-26 15:25:11,566 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2023-08-26 15:25:11,567 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 9 states. [2023-08-26 15:25:11,567 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 9 states to 9 states and 811 transitions. [2023-08-26 15:25:11,568 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.38840996168582376 [2023-08-26 15:25:11,568 INFO L72 ComplementDD]: Start complementDD. Operand 9 states and 811 transitions. [2023-08-26 15:25:11,568 INFO L73 IsDeterministic]: Start isDeterministic. Operand 9 states and 811 transitions. [2023-08-26 15:25:11,568 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2023-08-26 15:25:11,568 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 9 states and 811 transitions. [2023-08-26 15:25:11,570 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 10 states, 9 states have (on average 90.11111111111111) internal successors, (811), 9 states have internal predecessors, (811), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-26 15:25:11,572 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 10 states, 10 states have (on average 232.0) internal successors, (2320), 10 states have internal predecessors, (2320), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-26 15:25:11,572 INFO L81 ComplementDD]: Finished complementDD. Result has 10 states, 10 states have (on average 232.0) internal successors, (2320), 10 states have internal predecessors, (2320), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-26 15:25:11,572 INFO L175 Difference]: Start difference. First operand has 97 places, 43 transitions, 544 flow. Second operand 9 states and 811 transitions. [2023-08-26 15:25:11,572 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 96 places, 92 transitions, 1145 flow [2023-08-26 15:25:11,578 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 65 places, 92 transitions, 759 flow, removed 99 selfloop flow, removed 31 redundant places. [2023-08-26 15:25:11,580 INFO L231 Difference]: Finished difference. Result has 69 places, 40 transitions, 341 flow [2023-08-26 15:25:11,580 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=232, PETRI_DIFFERENCE_MINUEND_FLOW=306, PETRI_DIFFERENCE_MINUEND_PLACES=57, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=43, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=10, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=30, PETRI_DIFFERENCE_SUBTRAHEND_STATES=9, PETRI_FLOW=341, PETRI_PLACES=69, PETRI_TRANSITIONS=40} [2023-08-26 15:25:11,580 INFO L281 CegarLoopForPetriNet]: 41 programPoint places, 28 predicate places. [2023-08-26 15:25:11,580 INFO L495 AbstractCegarLoop]: Abstraction has has 69 places, 40 transitions, 341 flow [2023-08-26 15:25:11,581 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 10 states, 10 states have (on average 85.2) internal successors, (852), 10 states have internal predecessors, (852), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-26 15:25:11,581 INFO L200 CegarLoopForPetriNet]: Found error trace [2023-08-26 15:25:11,581 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-08-26 15:25:11,581 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable18 [2023-08-26 15:25:11,581 INFO L420 AbstractCegarLoop]: === Iteration 20 === Targeting ULTIMATE.startErr6ASSERT_VIOLATIONASSERT === [P0Err0ASSERT_VIOLATIONASSERT, ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 9 more)] === [2023-08-26 15:25:11,581 INFO L145 PredicateUnifier]: Initialized classic predicate unifier [2023-08-26 15:25:11,581 INFO L85 PathProgramCache]: Analyzing trace with hash -1679226016, now seen corresponding path program 2 times [2023-08-26 15:25:11,581 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-08-26 15:25:11,581 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [548812356] [2023-08-26 15:25:11,582 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-08-26 15:25:11,582 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-08-26 15:25:11,613 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2023-08-26 15:25:11,613 INFO L356 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2023-08-26 15:25:11,639 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2023-08-26 15:25:11,665 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2023-08-26 15:25:11,665 INFO L360 BasicCegarLoop]: Counterexample is feasible [2023-08-26 15:25:11,666 INFO L805 garLoopResultBuilder]: Registering result UNSAFE for location ULTIMATE.startErr6ASSERT_VIOLATIONASSERT (11 of 12 remaining) [2023-08-26 15:25:11,667 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location P0Err0ASSERT_VIOLATIONASSERT (10 of 12 remaining) [2023-08-26 15:25:11,668 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE (9 of 12 remaining) [2023-08-26 15:25:11,668 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE (8 of 12 remaining) [2023-08-26 15:25:11,668 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (7 of 12 remaining) [2023-08-26 15:25:11,669 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr3REQUIRES_VIOLATIONMEMORY_DEREFERENCE (6 of 12 remaining) [2023-08-26 15:25:11,669 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr4REQUIRES_VIOLATIONMEMORY_DEREFERENCE (5 of 12 remaining) [2023-08-26 15:25:11,669 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr5REQUIRES_VIOLATIONMEMORY_DEREFERENCE (4 of 12 remaining) [2023-08-26 15:25:11,669 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (3 of 12 remaining) [2023-08-26 15:25:11,669 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (2 of 12 remaining) [2023-08-26 15:25:11,669 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr2INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (1 of 12 remaining) [2023-08-26 15:25:11,670 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location P0Err0ASSERT_VIOLATIONASSERT (0 of 12 remaining) [2023-08-26 15:25:11,670 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable19 [2023-08-26 15:25:11,670 INFO L445 BasicCegarLoop]: Path program histogram: [3, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-08-26 15:25:11,675 INFO L228 ceAbstractionStarter]: Analysis of concurrent program completed with 1 thread instances [2023-08-26 15:25:11,676 INFO L178 ceAbstractionStarter]: Computing trace abstraction results [2023-08-26 15:25:11,732 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 26.08 03:25:11 BasicIcfg [2023-08-26 15:25:11,732 INFO L131 PluginConnector]: ------------------------ END TraceAbstraction---------------------------- [2023-08-26 15:25:11,732 INFO L158 Benchmark]: Toolchain (without parser) took 28424.57ms. Allocated memory was 343.9MB in the beginning and 1.1GB in the end (delta: 721.4MB). Free memory was 319.1MB in the beginning and 1.0GB in the end (delta: -712.2MB). Peak memory consumption was 637.8MB. Max. memory is 16.0GB. [2023-08-26 15:25:11,733 INFO L158 Benchmark]: CDTParser took 0.14ms. Allocated memory is still 343.9MB. Free memory is still 320.2MB. There was no memory consumed. Max. memory is 16.0GB. [2023-08-26 15:25:11,733 INFO L158 Benchmark]: CACSL2BoogieTranslator took 575.38ms. Allocated memory is still 343.9MB. Free memory was 318.6MB in the beginning and 295.4MB in the end (delta: 23.2MB). Peak memory consumption was 23.1MB. Max. memory is 16.0GB. [2023-08-26 15:25:11,733 INFO L158 Benchmark]: Boogie Procedure Inliner took 72.30ms. Allocated memory is still 343.9MB. Free memory was 295.4MB in the beginning and 292.9MB in the end (delta: 2.5MB). Peak memory consumption was 2.1MB. Max. memory is 16.0GB. [2023-08-26 15:25:11,733 INFO L158 Benchmark]: Boogie Preprocessor took 38.86ms. Allocated memory is still 343.9MB. Free memory was 292.9MB in the beginning and 290.9MB in the end (delta: 2.1MB). Peak memory consumption was 2.1MB. Max. memory is 16.0GB. [2023-08-26 15:25:11,734 INFO L158 Benchmark]: RCFGBuilder took 667.98ms. Allocated memory is still 343.9MB. Free memory was 290.9MB in the beginning and 306.9MB in the end (delta: -16.1MB). Peak memory consumption was 29.6MB. Max. memory is 16.0GB. [2023-08-26 15:25:11,734 INFO L158 Benchmark]: TraceAbstraction took 27063.81ms. Allocated memory was 343.9MB in the beginning and 1.1GB in the end (delta: 721.4MB). Free memory was 306.8MB in the beginning and 1.0GB in the end (delta: -724.5MB). Peak memory consumption was 625.0MB. Max. memory is 16.0GB. [2023-08-26 15:25:11,735 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 343.9MB. Free memory is still 320.2MB. There was no memory consumed. Max. memory is 16.0GB. * CACSL2BoogieTranslator took 575.38ms. Allocated memory is still 343.9MB. Free memory was 318.6MB in the beginning and 295.4MB in the end (delta: 23.2MB). Peak memory consumption was 23.1MB. Max. memory is 16.0GB. * Boogie Procedure Inliner took 72.30ms. Allocated memory is still 343.9MB. Free memory was 295.4MB in the beginning and 292.9MB in the end (delta: 2.5MB). Peak memory consumption was 2.1MB. Max. memory is 16.0GB. * Boogie Preprocessor took 38.86ms. Allocated memory is still 343.9MB. Free memory was 292.9MB in the beginning and 290.9MB in the end (delta: 2.1MB). Peak memory consumption was 2.1MB. Max. memory is 16.0GB. * RCFGBuilder took 667.98ms. Allocated memory is still 343.9MB. Free memory was 290.9MB in the beginning and 306.9MB in the end (delta: -16.1MB). Peak memory consumption was 29.6MB. Max. memory is 16.0GB. * TraceAbstraction took 27063.81ms. Allocated memory was 343.9MB in the beginning and 1.1GB in the end (delta: 721.4MB). Free memory was 306.8MB in the beginning and 1.0GB in the end (delta: -724.5MB). Peak memory consumption was 625.0MB. Max. memory is 16.0GB. * Results from de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator: - GenericResultAtLocation [Line: 267]: Unsoundness Warning unspecified type, defaulting to int C: short [267] - GenericResultAtLocation [Line: 267]: Unsoundness Warning unspecified type, defaulting to int C: short [267] * Results from de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: - StatisticsResult: PetriNetLargeBlockEncoding benchmarks Lipton Reduction Statistics: ReductionTime: 3.6s, 120 PlacesBefore, 41 PlacesAfterwards, 113 TransitionsBefore, 32 TransitionsAfterwards, 2188 CoEnabledTransitionPairs, 6 FixpointIterations, 42 TrivialSequentialCompositions, 59 ConcurrentSequentialCompositions, 0 TrivialYvCompositions, 13 ConcurrentYvCompositions, 2 ChoiceCompositions, 116 TotalNumberOfCompositions, 5990 MoverChecksTotal, Independence Relation Statistics: CachedIndependenceRelation.Independence Queries: [ total: 2359, independent: 2194, independent conditional: 0, independent unconditional: 2194, dependent: 165, dependent conditional: 0, dependent unconditional: 165, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , CachedIndependenceRelation.Statistics on underlying relation: SyntacticIndependenceRelation.Independence Queries: [ total: 1154, independent: 1122, independent conditional: 0, independent unconditional: 1122, dependent: 32, dependent conditional: 0, dependent unconditional: 32, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , Cache Queries: [ total: 2359, independent: 1072, independent conditional: 0, independent unconditional: 1072, dependent: 133, dependent conditional: 0, dependent unconditional: 133, unknown: 1154, unknown conditional: 0, unknown unconditional: 1154] , Statistics on independence cache: Total cache size (in pairs): 85, Positive cache size: 69, Positive conditional cache size: 0, Positive unconditional cache size: 69, Negative cache size: 16, Negative conditional cache size: 0, Negative unconditional cache size: 16, Unknown cache size: 0, Unknown conditional cache size: 0, Unknown unconditional cache size: 0 - CounterExampleResult [Line: 17]: assertion can be violated assertion can be violated We found a FailurePath: [L709] 0 int __unbuffered_cnt = 0; [L710] 0 _Bool main$tmp_guard0; [L711] 0 _Bool main$tmp_guard1; [L713] 0 int x = 0; [L715] 0 int y = 0; [L717] 0 int z = 0; [L718] 0 _Bool z$flush_delayed; [L719] 0 int z$mem_tmp; [L720] 0 _Bool z$r_buff0_thd0; [L721] 0 _Bool z$r_buff0_thd1; [L722] 0 _Bool z$r_buff0_thd2; [L723] 0 _Bool z$r_buff0_thd3; [L724] 0 _Bool z$r_buff1_thd0; [L725] 0 _Bool z$r_buff1_thd1; [L726] 0 _Bool z$r_buff1_thd2; [L727] 0 _Bool z$r_buff1_thd3; [L728] 0 _Bool z$read_delayed; [L729] 0 int *z$read_delayed_var; [L730] 0 int z$w_buff0; [L731] 0 _Bool z$w_buff0_used; [L732] 0 int z$w_buff1; [L733] 0 _Bool z$w_buff1_used; [L734] 0 _Bool weak$$choice0; [L735] 0 _Bool weak$$choice2; [L816] 0 pthread_t t2489; [L817] FCALL, FORK 0 pthread_create(&t2489, ((void *)0), P0, ((void *)0)) VAL [__unbuffered_cnt=0, main$tmp_guard0=0, main$tmp_guard1=0, pthread_create(&t2489, ((void *)0), P0, ((void *)0))=-1, t2489={5:0}, weak$$choice0=0, weak$$choice2=0, x=0, y=0, z$flush_delayed=0, z$mem_tmp=0, z$r_buff0_thd0=0, z$r_buff0_thd1=0, z$r_buff0_thd2=0, z$r_buff0_thd3=0, z$r_buff1_thd0=0, z$r_buff1_thd1=0, z$r_buff1_thd2=0, z$r_buff1_thd3=0, z$read_delayed=0, z$read_delayed_var={0:0}, z$w_buff0=0, z$w_buff0_used=0, z$w_buff1=0, z$w_buff1_used=0, z=0] [L818] 0 pthread_t t2490; [L819] FCALL, FORK 0 pthread_create(&t2490, ((void *)0), P1, ((void *)0)) VAL [__unbuffered_cnt=0, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, pthread_create(&t2490, ((void *)0), P1, ((void *)0))=0, t2489={5:0}, t2490={6:0}, weak$$choice0=0, weak$$choice2=0, x=0, y=0, z$flush_delayed=0, z$mem_tmp=0, z$r_buff0_thd0=0, z$r_buff0_thd1=0, z$r_buff0_thd2=0, z$r_buff0_thd3=0, z$r_buff1_thd0=0, z$r_buff1_thd1=0, z$r_buff1_thd2=0, z$r_buff1_thd3=0, z$read_delayed=0, z$read_delayed_var={0:0}, z$w_buff0=0, z$w_buff0_used=0, z$w_buff1=0, z$w_buff1_used=0, z=0] [L820] 0 pthread_t t2491; [L821] FCALL, FORK 0 pthread_create(&t2491, ((void *)0), P2, ((void *)0)) VAL [__unbuffered_cnt=0, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, pthread_create(&t2491, ((void *)0), P2, ((void *)0))=1, t2489={5:0}, t2490={6:0}, t2491={3:0}, weak$$choice0=0, weak$$choice2=0, x=0, y=0, z$flush_delayed=0, z$mem_tmp=0, z$r_buff0_thd0=0, z$r_buff0_thd1=0, z$r_buff0_thd2=0, z$r_buff0_thd3=0, z$r_buff1_thd0=0, z$r_buff1_thd1=0, z$r_buff1_thd2=0, z$r_buff1_thd3=0, z$read_delayed=0, z$read_delayed_var={0:0}, z$w_buff0=0, z$w_buff0_used=0, z$w_buff1=0, z$w_buff1_used=0, z=0] [L739] 1 z$w_buff1 = z$w_buff0 [L740] 1 z$w_buff0 = 2 [L741] 1 z$w_buff1_used = z$w_buff0_used [L742] 1 z$w_buff0_used = (_Bool)1 [L743] CALL 1 __VERIFIER_assert(!(z$w_buff1_used && z$w_buff0_used)) [L18] COND FALSE 1 !(!expression) [L743] RET 1 __VERIFIER_assert(!(z$w_buff1_used && z$w_buff0_used)) [L744] 1 z$r_buff1_thd0 = z$r_buff0_thd0 [L745] 1 z$r_buff1_thd1 = z$r_buff0_thd1 [L746] 1 z$r_buff1_thd2 = z$r_buff0_thd2 [L747] 1 z$r_buff1_thd3 = z$r_buff0_thd3 [L748] 1 z$r_buff0_thd1 = (_Bool)1 VAL [__unbuffered_cnt=0, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=0, x=0, y=0, z$flush_delayed=0, z$mem_tmp=0, z$r_buff0_thd0=0, z$r_buff0_thd1=1, z$r_buff0_thd2=0, z$r_buff0_thd3=0, z$r_buff1_thd0=0, z$r_buff1_thd1=0, z$r_buff1_thd2=0, z$r_buff1_thd3=0, z$read_delayed=0, z$read_delayed_var={0:0}, z$w_buff0=2, z$w_buff0_used=1, z$w_buff1=0, z$w_buff1_used=0, z=0] [L751] 1 x = 1 VAL [__unbuffered_cnt=0, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=0, x=1, y=0, z$flush_delayed=0, z$mem_tmp=0, z$r_buff0_thd0=0, z$r_buff0_thd1=1, z$r_buff0_thd2=0, z$r_buff0_thd3=0, z$r_buff1_thd0=0, z$r_buff1_thd1=0, z$r_buff1_thd2=0, z$r_buff1_thd3=0, z$read_delayed=0, z$read_delayed_var={0:0}, z$w_buff0=2, z$w_buff0_used=1, z$w_buff1=0, z$w_buff1_used=0, z=0] [L768] 2 x = 2 VAL [__unbuffered_cnt=0, arg={0:0}, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=0, x=2, y=0, z$flush_delayed=0, z$mem_tmp=0, z$r_buff0_thd0=0, z$r_buff0_thd1=1, z$r_buff0_thd2=0, z$r_buff0_thd3=0, z$r_buff1_thd0=0, z$r_buff1_thd1=0, z$r_buff1_thd2=0, z$r_buff1_thd3=0, z$read_delayed=0, z$read_delayed_var={0:0}, z$w_buff0=2, z$w_buff0_used=1, z$w_buff1=0, z$w_buff1_used=0, z=0] [L771] 2 y = 1 VAL [__unbuffered_cnt=0, arg={0:0}, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=0, x=2, y=1, z$flush_delayed=0, z$mem_tmp=0, z$r_buff0_thd0=0, z$r_buff0_thd1=1, z$r_buff0_thd2=0, z$r_buff0_thd3=0, z$r_buff1_thd0=0, z$r_buff1_thd1=0, z$r_buff1_thd2=0, z$r_buff1_thd3=0, z$read_delayed=0, z$read_delayed_var={0:0}, z$w_buff0=2, z$w_buff0_used=1, z$w_buff1=0, z$w_buff1_used=0, z=0] [L774] 2 z = z$w_buff0_used && z$r_buff0_thd2 ? z$w_buff0 : (z$w_buff1_used && z$r_buff1_thd2 ? z$w_buff1 : z) [L775] 2 z$w_buff0_used = z$w_buff0_used && z$r_buff0_thd2 ? (_Bool)0 : z$w_buff0_used [L776] 2 z$w_buff1_used = z$w_buff0_used && z$r_buff0_thd2 || z$w_buff1_used && z$r_buff1_thd2 ? (_Bool)0 : z$w_buff1_used [L777] 2 z$r_buff0_thd2 = z$w_buff0_used && z$r_buff0_thd2 ? (_Bool)0 : z$r_buff0_thd2 [L778] 2 z$r_buff1_thd2 = z$w_buff0_used && z$r_buff0_thd2 || z$w_buff1_used && z$r_buff1_thd2 ? (_Bool)0 : z$r_buff1_thd2 VAL [__unbuffered_cnt=0, arg={0:0}, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=0, x=2, y=1, z$flush_delayed=0, z$mem_tmp=0, z$r_buff0_thd0=0, z$r_buff0_thd1=1, z$r_buff0_thd2=0, z$r_buff0_thd3=0, z$r_buff1_thd0=0, z$r_buff1_thd1=0, z$r_buff1_thd2=0, z$r_buff1_thd3=0, z$read_delayed=0, z$read_delayed_var={0:0}, z$w_buff0=2, z$w_buff0_used=1, z$w_buff1=0, z$w_buff1_used=0, z=0] [L788] 3 y = 2 VAL [__unbuffered_cnt=0, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=0, x=2, y=2, z$flush_delayed=0, z$mem_tmp=0, z$r_buff0_thd0=0, z$r_buff0_thd1=1, z$r_buff0_thd2=0, z$r_buff0_thd3=0, z$r_buff1_thd0=0, z$r_buff1_thd1=0, z$r_buff1_thd2=0, z$r_buff1_thd3=0, z$read_delayed=0, z$read_delayed_var={0:0}, z$w_buff0=2, z$w_buff0_used=1, z$w_buff1=0, z$w_buff1_used=0, z=0] [L791] 3 z = 1 VAL [__unbuffered_cnt=0, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=0, x=2, y=2, z$flush_delayed=0, z$mem_tmp=0, z$r_buff0_thd0=0, z$r_buff0_thd1=1, z$r_buff0_thd2=0, z$r_buff0_thd3=0, z$r_buff1_thd0=0, z$r_buff1_thd1=0, z$r_buff1_thd2=0, z$r_buff1_thd3=0, z$read_delayed=0, z$read_delayed_var={0:0}, z$w_buff0=2, z$w_buff0_used=1, z$w_buff1=0, z$w_buff1_used=0, z=1] [L754] 1 z = z$w_buff0_used && z$r_buff0_thd1 ? z$w_buff0 : (z$w_buff1_used && z$r_buff1_thd1 ? z$w_buff1 : z) [L755] 1 z$w_buff0_used = z$w_buff0_used && z$r_buff0_thd1 ? (_Bool)0 : z$w_buff0_used [L756] 1 z$w_buff1_used = z$w_buff0_used && z$r_buff0_thd1 || z$w_buff1_used && z$r_buff1_thd1 ? (_Bool)0 : z$w_buff1_used [L757] 1 z$r_buff0_thd1 = z$w_buff0_used && z$r_buff0_thd1 ? (_Bool)0 : z$r_buff0_thd1 [L758] 1 z$r_buff1_thd1 = z$w_buff0_used && z$r_buff0_thd1 || z$w_buff1_used && z$r_buff1_thd1 ? (_Bool)0 : z$r_buff1_thd1 VAL [__unbuffered_cnt=0, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=0, x=2, y=2, z$flush_delayed=0, z$mem_tmp=0, z$r_buff0_thd0=0, z$r_buff0_thd1=1, z$r_buff0_thd2=0, z$r_buff0_thd3=0, z$r_buff1_thd0=0, z$r_buff1_thd1=0, z$r_buff1_thd2=0, z$r_buff1_thd3=0, z$read_delayed=0, z$read_delayed_var={0:0}, z$w_buff0=2, z$w_buff0_used=0, z$w_buff1=0, z$w_buff1_used=0, z=2] [L761] 1 __unbuffered_cnt = __unbuffered_cnt + 1 [L763] 1 return 0; [L781] 2 __unbuffered_cnt = __unbuffered_cnt + 1 [L783] 2 return 0; [L794] 3 z = z$w_buff0_used && z$r_buff0_thd3 ? z$w_buff0 : (z$w_buff1_used && z$r_buff1_thd3 ? z$w_buff1 : z) [L795] 3 z$w_buff0_used = z$w_buff0_used && z$r_buff0_thd3 ? (_Bool)0 : z$w_buff0_used [L796] 3 z$w_buff1_used = z$w_buff0_used && z$r_buff0_thd3 || z$w_buff1_used && z$r_buff1_thd3 ? (_Bool)0 : z$w_buff1_used [L797] 3 z$r_buff0_thd3 = z$w_buff0_used && z$r_buff0_thd3 ? (_Bool)0 : z$r_buff0_thd3 [L798] 3 z$r_buff1_thd3 = z$w_buff0_used && z$r_buff0_thd3 || z$w_buff1_used && z$r_buff1_thd3 ? (_Bool)0 : z$r_buff1_thd3 VAL [\result={0:0}, __unbuffered_cnt=2, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=0, x=2, y=2, z$flush_delayed=0, z$mem_tmp=0, z$r_buff0_thd0=0, z$r_buff0_thd1=1, z$r_buff0_thd2=0, z$r_buff0_thd3=0, z$r_buff1_thd0=0, z$r_buff1_thd1=0, z$r_buff1_thd2=0, z$r_buff1_thd3=0, z$read_delayed=0, z$read_delayed_var={0:0}, z$w_buff0=2, z$w_buff0_used=0, z$w_buff1=0, z$w_buff1_used=0, z=2] [L801] 3 __unbuffered_cnt = __unbuffered_cnt + 1 [L803] 3 return 0; [L823] 0 main$tmp_guard0 = __unbuffered_cnt == 3 [L825] CALL 0 assume_abort_if_not(main$tmp_guard0) [L3] COND FALSE 0 !(!cond) [L825] RET 0 assume_abort_if_not(main$tmp_guard0) [L827] 0 z = z$w_buff0_used && z$r_buff0_thd0 ? z$w_buff0 : (z$w_buff1_used && z$r_buff1_thd0 ? z$w_buff1 : z) [L828] 0 z$w_buff0_used = z$w_buff0_used && z$r_buff0_thd0 ? (_Bool)0 : z$w_buff0_used [L829] 0 z$w_buff1_used = z$w_buff0_used && z$r_buff0_thd0 || z$w_buff1_used && z$r_buff1_thd0 ? (_Bool)0 : z$w_buff1_used [L830] 0 z$r_buff0_thd0 = z$w_buff0_used && z$r_buff0_thd0 ? (_Bool)0 : z$r_buff0_thd0 [L831] 0 z$r_buff1_thd0 = z$w_buff0_used && z$r_buff0_thd0 || z$w_buff1_used && z$r_buff1_thd0 ? (_Bool)0 : z$r_buff1_thd0 VAL [\result={0:0}, \result={0:0}, __unbuffered_cnt=3, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, main$tmp_guard0=1, main$tmp_guard1=0, t2489={5:0}, t2490={6:0}, t2491={3:0}, weak$$choice0=0, weak$$choice2=0, x=2, y=2, z$flush_delayed=0, z$mem_tmp=0, z$r_buff0_thd0=0, z$r_buff0_thd1=1, z$r_buff0_thd2=0, z$r_buff0_thd3=0, z$r_buff1_thd0=0, z$r_buff1_thd1=0, z$r_buff1_thd2=0, z$r_buff1_thd3=0, z$read_delayed=0, z$read_delayed_var={0:0}, z$w_buff0=2, z$w_buff0_used=0, z$w_buff1=0, z$w_buff1_used=0, z=2] [L834] 0 weak$$choice0 = __VERIFIER_nondet_bool() [L835] 0 weak$$choice2 = __VERIFIER_nondet_bool() [L836] 0 z$flush_delayed = weak$$choice2 [L837] 0 z$mem_tmp = z [L838] 0 z = !z$w_buff0_used || !z$r_buff0_thd0 && !z$w_buff1_used || !z$r_buff0_thd0 && !z$r_buff1_thd0 ? z : (z$w_buff0_used && z$r_buff0_thd0 ? z$w_buff0 : z$w_buff1) [L839] 0 z$w_buff0 = weak$$choice2 ? z$w_buff0 : (!z$w_buff0_used || !z$r_buff0_thd0 && !z$w_buff1_used || !z$r_buff0_thd0 && !z$r_buff1_thd0 ? z$w_buff0 : (z$w_buff0_used && z$r_buff0_thd0 ? z$w_buff0 : z$w_buff0)) [L840] 0 z$w_buff1 = weak$$choice2 ? z$w_buff1 : (!z$w_buff0_used || !z$r_buff0_thd0 && !z$w_buff1_used || !z$r_buff0_thd0 && !z$r_buff1_thd0 ? z$w_buff1 : (z$w_buff0_used && z$r_buff0_thd0 ? z$w_buff1 : z$w_buff1)) [L841] 0 z$w_buff0_used = weak$$choice2 ? z$w_buff0_used : (!z$w_buff0_used || !z$r_buff0_thd0 && !z$w_buff1_used || !z$r_buff0_thd0 && !z$r_buff1_thd0 ? z$w_buff0_used : (z$w_buff0_used && z$r_buff0_thd0 ? (_Bool)0 : z$w_buff0_used)) [L842] 0 z$w_buff1_used = weak$$choice2 ? z$w_buff1_used : (!z$w_buff0_used || !z$r_buff0_thd0 && !z$w_buff1_used || !z$r_buff0_thd0 && !z$r_buff1_thd0 ? z$w_buff1_used : (z$w_buff0_used && z$r_buff0_thd0 ? (_Bool)0 : (_Bool)0)) [L843] 0 z$r_buff0_thd0 = weak$$choice2 ? z$r_buff0_thd0 : (!z$w_buff0_used || !z$r_buff0_thd0 && !z$w_buff1_used || !z$r_buff0_thd0 && !z$r_buff1_thd0 ? z$r_buff0_thd0 : (z$w_buff0_used && z$r_buff0_thd0 ? (_Bool)0 : z$r_buff0_thd0)) [L844] 0 z$r_buff1_thd0 = weak$$choice2 ? z$r_buff1_thd0 : (!z$w_buff0_used || !z$r_buff0_thd0 && !z$w_buff1_used || !z$r_buff0_thd0 && !z$r_buff1_thd0 ? z$r_buff1_thd0 : (z$w_buff0_used && z$r_buff0_thd0 ? (_Bool)0 : (_Bool)0)) [L845] 0 main$tmp_guard1 = !(x == 2 && y == 2 && z == 2) [L846] 0 z = z$flush_delayed ? z$mem_tmp : z [L847] 0 z$flush_delayed = (_Bool)0 [L849] CALL 0 __VERIFIER_assert(main$tmp_guard1) [L18] COND TRUE 0 !expression [L18] CALL 0 reach_error() [L17] COND FALSE 0 !(0) [L17] 0 __assert_fail ("0", "safe030_power.oepc_pso.oepc_rmo.oepc.c", 8, __extension__ __PRETTY_FUNCTION__) VAL [\read(__PRETTY_FUNCTION__)={49:50}, \result={0:0}, \result={0:0}, __unbuffered_cnt=3, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, main$tmp_guard0=1, main$tmp_guard1=0, weak$$choice2=1, x=2, y=2, z$flush_delayed=0, z$mem_tmp=2, z$r_buff0_thd0=0, z$r_buff0_thd1=1, z$r_buff0_thd2=0, z$r_buff0_thd3=0, z$r_buff1_thd0=0, z$r_buff1_thd1=0, z$r_buff1_thd2=0, z$r_buff1_thd3=0, z$read_delayed=0, z$read_delayed_var={0:0}, z$w_buff0=2, z$w_buff0_used=0, z$w_buff1=0, z$w_buff1_used=0, z=2] - UnprovableResult [Line: 17]: Unable to prove that assertion always holds Unable to prove that assertion always holds Reason: Not analyzed. - UnprovableResult [Line: -1]: Unable to prove that pointer dereference always succeeds Unable to prove that pointer dereference always succeeds Reason: Not analyzed. - UnprovableResult [Line: -1]: Unable to prove that pointer dereference always succeeds Unable to prove that pointer dereference always succeeds Reason: Not analyzed. - UnprovableResult [Line: -1]: Unable to prove that pointer dereference always succeeds Unable to prove that pointer dereference always succeeds Reason: Not analyzed. - UnprovableResult [Line: -1]: Unable to prove that pointer dereference always succeeds Unable to prove that pointer dereference always succeeds Reason: Not analyzed. - UnprovableResult [Line: -1]: Unable to prove that pointer dereference always succeeds Unable to prove that pointer dereference always succeeds Reason: Not analyzed. - UnprovableResult [Line: -1]: Unable to prove that pointer dereference always succeeds Unable to prove that pointer dereference always succeeds Reason: Not analyzed. - UnprovableResult [Line: 817]: 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: 819]: 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: 821]: 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: 26.9s, OverallIterations: 20, TraceHistogramMax: 1, PathProgramHistogramMax: 3, EmptinessCheckTime: 0.0s, AutomataDifference: 13.1s, DeadEndRemovalTime: 0.0s, HoareAnnotationTime: 0.0s, InitialAbstractionConstructionTime: 3.7s, HoareTripleCheckerStatistics: 0 mSolverCounterUnknown, 697 SdHoareTripleChecker+Valid, 2.7s IncrementalHoareTripleChecker+Time, 0 mSdLazyCounter, 697 mSDsluCounter, 224 SdHoareTripleChecker+Invalid, 2.3s Time, 0 mProtectedAction, 0 SdHoareTripleChecker+Unchecked, 0 IncrementalHoareTripleChecker+Unchecked, 147 mSDsCounter, 178 IncrementalHoareTripleChecker+Valid, 0 mProtectedPredicate, 2555 IncrementalHoareTripleChecker+Invalid, 2733 SdHoareTripleChecker+Unknown, 0 mSolverCounterNotChecked, 178 mSolverCounterUnsat, 77 mSDtfsCounter, 2555 mSolverCounterSat, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Unknown, PredicateUnifierStatistics: 0 DeclaredPredicates, 124 GetRequests, 6 SyntacticMatches, 0 SemanticMatches, 118 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 94 ImplicationChecksByTransitivity, 2.5s Time, 0.0s BasicInterpolantAutomatonTime, BiggestAbstraction: size=2474occurred in iteration=13, InterpolantAutomatonStates: 137, 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.5s SatisfiabilityAnalysisTime, 9.2s InterpolantComputationTime, 270 NumberOfCodeBlocks, 270 NumberOfCodeBlocksAsserted, 20 NumberOfCheckSat, 229 ConstructedInterpolants, 0 QuantifiedInterpolants, 4200 SizeOfPredicates, 0 NumberOfNonLiveVariables, 0 ConjunctsInSsa, 0 ConjunctsInUnsatCore, 19 InterpolantComputations, 19 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 15:25:11,753 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 (1)] Forceful destruction successful, exit code 0 Received shutdown request...