/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/rfi000_power.opt_pso.opt_rmo.opt.i -------------------------------------------------------------------------------- This is Ultimate 0.2.3-dev-ac9dbd0-m [2023-08-26 15:14:13,936 INFO L188 SettingsManager]: Resetting all preferences to default values... [2023-08-26 15:14:14,001 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:14:14,005 WARN L101 SettingsManager]: Preference file contains the following unknown settings: [2023-08-26 15:14:14,005 WARN L103 SettingsManager]: * de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.Checked method. Library mode if empty. [2023-08-26 15:14:14,029 INFO L130 SettingsManager]: Preferences different from defaults after loading the file: [2023-08-26 15:14:14,029 INFO L151 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2023-08-26 15:14:14,033 INFO L153 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2023-08-26 15:14:14,033 INFO L151 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2023-08-26 15:14:14,036 INFO L153 SettingsManager]: * Create parallel compositions if possible=false [2023-08-26 15:14:14,036 INFO L153 SettingsManager]: * Use SBE=true [2023-08-26 15:14:14,036 INFO L151 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2023-08-26 15:14:14,036 INFO L153 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2023-08-26 15:14:14,037 INFO L153 SettingsManager]: * sizeof long=4 [2023-08-26 15:14:14,037 INFO L153 SettingsManager]: * Overapproximate operations on floating types=true [2023-08-26 15:14:14,037 INFO L153 SettingsManager]: * sizeof POINTER=4 [2023-08-26 15:14:14,037 INFO L153 SettingsManager]: * Check division by zero=IGNORE [2023-08-26 15:14:14,038 INFO L153 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2023-08-26 15:14:14,038 INFO L153 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2023-08-26 15:14:14,038 INFO L153 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2023-08-26 15:14:14,038 INFO L153 SettingsManager]: * sizeof long double=12 [2023-08-26 15:14:14,038 INFO L153 SettingsManager]: * Check if freed pointer was valid=false [2023-08-26 15:14:14,038 INFO L153 SettingsManager]: * Use constant arrays=true [2023-08-26 15:14:14,039 INFO L151 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2023-08-26 15:14:14,039 INFO L153 SettingsManager]: * Size of a code block=SequenceOfStatements [2023-08-26 15:14:14,039 INFO L153 SettingsManager]: * To the following directory=./dump/ [2023-08-26 15:14:14,039 INFO L153 SettingsManager]: * SMT solver=External_DefaultMode [2023-08-26 15:14:14,039 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2023-08-26 15:14:14,039 INFO L151 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2023-08-26 15:14:14,040 INFO L153 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2023-08-26 15:14:14,040 INFO L153 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopsAndPotentialCycles [2023-08-26 15:14:14,040 INFO L153 SettingsManager]: * Trace refinement strategy=CAMEL [2023-08-26 15:14:14,040 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2023-08-26 15:14:14,041 INFO L153 SettingsManager]: * Automaton type used in concurrency analysis=PETRI_NET [2023-08-26 15:14:14,041 INFO L153 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2023-08-26 15:14:14,041 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:14:14,290 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2023-08-26 15:14:14,307 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2023-08-26 15:14:14,309 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2023-08-26 15:14:14,310 INFO L270 PluginConnector]: Initializing CDTParser... [2023-08-26 15:14:14,310 INFO L274 PluginConnector]: CDTParser initialized [2023-08-26 15:14:14,311 INFO L431 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../../../trunk/examples/svcomp/pthread-wmm/rfi000_power.opt_pso.opt_rmo.opt.i [2023-08-26 15:14:15,254 INFO L533 CDTParser]: Created temporary CDT project at NULL [2023-08-26 15:14:15,445 INFO L384 CDTParser]: Found 1 translation units. [2023-08-26 15:14:15,445 INFO L180 CDTParser]: Scanning /storage/repos/ultimate/trunk/examples/svcomp/pthread-wmm/rfi000_power.opt_pso.opt_rmo.opt.i [2023-08-26 15:14:15,457 INFO L427 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/f0fcb612d/e69a22645bd041deaa6a8fa26ab1b37a/FLAGe235b4657 [2023-08-26 15:14:15,466 INFO L435 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/f0fcb612d/e69a22645bd041deaa6a8fa26ab1b37a [2023-08-26 15:14:15,467 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2023-08-26 15:14:15,468 INFO L133 ToolchainWalker]: Walking toolchain with 5 elements. [2023-08-26 15:14:15,469 INFO L112 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2023-08-26 15:14:15,469 INFO L270 PluginConnector]: Initializing CACSL2BoogieTranslator... [2023-08-26 15:14:15,470 INFO L274 PluginConnector]: CACSL2BoogieTranslator initialized [2023-08-26 15:14:15,471 INFO L184 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 26.08 03:14:15" (1/1) ... [2023-08-26 15:14:15,471 INFO L204 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@76b2d59e and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 26.08 03:14:15, skipping insertion in model container [2023-08-26 15:14:15,471 INFO L184 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 26.08 03:14:15" (1/1) ... [2023-08-26 15:14:15,516 INFO L176 MainTranslator]: Built tables and reachable declarations [2023-08-26 15:14:15,752 INFO L209 PostProcessor]: Analyzing one entry point: main [2023-08-26 15:14:15,762 INFO L201 MainTranslator]: Completed pre-run [2023-08-26 15:14:15,783 WARN L75 lationResultReporter]: Unsoundness Warning: unspecified type, defaulting to int C: short [267] [2023-08-26 15:14:15,784 WARN L75 lationResultReporter]: Unsoundness Warning: unspecified type, defaulting to int C: short [267] [2023-08-26 15:14:15,800 INFO L209 PostProcessor]: Analyzing one entry point: main [2023-08-26 15:14:15,825 WARN L669 CHandler]: The function __VERIFIER_atomic_begin is called, but not defined or handled by StandardFunctionHandler. [2023-08-26 15:14:15,825 WARN L669 CHandler]: The function __VERIFIER_atomic_end is called, but not defined or handled by StandardFunctionHandler. [2023-08-26 15:14:15,829 INFO L206 MainTranslator]: Completed translation [2023-08-26 15:14:15,830 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 26.08 03:14:15 WrapperNode [2023-08-26 15:14:15,830 INFO L131 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2023-08-26 15:14:15,830 INFO L112 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2023-08-26 15:14:15,830 INFO L270 PluginConnector]: Initializing Boogie Procedure Inliner... [2023-08-26 15:14:15,831 INFO L274 PluginConnector]: Boogie Procedure Inliner initialized [2023-08-26 15:14:15,835 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:14:15" (1/1) ... [2023-08-26 15:14:15,855 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:14:15" (1/1) ... [2023-08-26 15:14:15,872 INFO L138 Inliner]: procedures = 175, calls = 46, calls flagged for inlining = 6, calls inlined = 7, statements flattened = 142 [2023-08-26 15:14:15,872 INFO L131 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2023-08-26 15:14:15,873 INFO L112 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2023-08-26 15:14:15,873 INFO L270 PluginConnector]: Initializing Boogie Preprocessor... [2023-08-26 15:14:15,873 INFO L274 PluginConnector]: Boogie Preprocessor initialized [2023-08-26 15:14:15,878 INFO L184 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 26.08 03:14:15" (1/1) ... [2023-08-26 15:14:15,878 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 26.08 03:14:15" (1/1) ... [2023-08-26 15:14:15,881 INFO L184 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 26.08 03:14:15" (1/1) ... [2023-08-26 15:14:15,881 INFO L184 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 26.08 03:14:15" (1/1) ... [2023-08-26 15:14:15,893 INFO L184 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 26.08 03:14:15" (1/1) ... [2023-08-26 15:14:15,894 INFO L184 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 26.08 03:14:15" (1/1) ... [2023-08-26 15:14:15,895 INFO L184 PluginConnector]: Executing the observer LTLStepAnnotator from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 26.08 03:14:15" (1/1) ... [2023-08-26 15:14:15,896 INFO L184 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 26.08 03:14:15" (1/1) ... [2023-08-26 15:14:15,898 INFO L131 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2023-08-26 15:14:15,899 INFO L112 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2023-08-26 15:14:15,899 INFO L270 PluginConnector]: Initializing RCFGBuilder... [2023-08-26 15:14:15,899 INFO L274 PluginConnector]: RCFGBuilder initialized [2023-08-26 15:14:15,899 INFO L184 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 26.08 03:14:15" (1/1) ... [2023-08-26 15:14:15,903 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2023-08-26 15:14:15,911 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2023-08-26 15:14:15,921 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:14:15,924 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:14:15,942 INFO L130 BoogieDeclarations]: Found specification of procedure write~int [2023-08-26 15:14:15,942 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_atomic_begin [2023-08-26 15:14:15,943 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2023-08-26 15:14:15,943 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnStack [2023-08-26 15:14:15,943 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.dealloc [2023-08-26 15:14:15,943 INFO L130 BoogieDeclarations]: Found specification of procedure P0 [2023-08-26 15:14:15,943 INFO L138 BoogieDeclarations]: Found implementation of procedure P0 [2023-08-26 15:14:15,943 INFO L130 BoogieDeclarations]: Found specification of procedure P1 [2023-08-26 15:14:15,943 INFO L138 BoogieDeclarations]: Found implementation of procedure P1 [2023-08-26 15:14:15,943 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int [2023-08-26 15:14:15,943 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_atomic_end [2023-08-26 15:14:15,943 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2023-08-26 15:14:15,943 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2023-08-26 15:14:15,944 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:14:16,039 INFO L236 CfgBuilder]: Building ICFG [2023-08-26 15:14:16,042 INFO L262 CfgBuilder]: Building CFG for each procedure with an implementation [2023-08-26 15:14:16,276 INFO L277 CfgBuilder]: Performing block encoding [2023-08-26 15:14:16,367 INFO L297 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2023-08-26 15:14:16,367 INFO L302 CfgBuilder]: Removed 0 assume(true) statements. [2023-08-26 15:14:16,369 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 26.08 03:14:16 BoogieIcfgContainer [2023-08-26 15:14:16,369 INFO L131 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2023-08-26 15:14:16,370 INFO L112 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2023-08-26 15:14:16,370 INFO L270 PluginConnector]: Initializing TraceAbstraction... [2023-08-26 15:14:16,372 INFO L274 PluginConnector]: TraceAbstraction initialized [2023-08-26 15:14:16,372 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 26.08 03:14:15" (1/3) ... [2023-08-26 15:14:16,373 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@5a2cf6a6 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 26.08 03:14:16, skipping insertion in model container [2023-08-26 15:14:16,373 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 26.08 03:14:15" (2/3) ... [2023-08-26 15:14:16,373 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@5a2cf6a6 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 26.08 03:14:16, skipping insertion in model container [2023-08-26 15:14:16,373 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 26.08 03:14:16" (3/3) ... [2023-08-26 15:14:16,374 INFO L112 eAbstractionObserver]: Analyzing ICFG rfi000_power.opt_pso.opt_rmo.opt.i [2023-08-26 15:14:16,384 INFO L203 ceAbstractionStarter]: Automizer settings: Hoare:false NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2023-08-26 15:14:16,384 INFO L162 ceAbstractionStarter]: Applying trace abstraction to program that has 6 error locations. [2023-08-26 15:14:16,384 INFO L515 ceAbstractionStarter]: Constructing petrified ICFG for 1 thread instances. [2023-08-26 15:14:16,417 INFO L144 ThreadInstanceAdder]: Constructed 0 joinOtherThreadTransitions. [2023-08-26 15:14:16,438 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 102 places, 98 transitions, 206 flow [2023-08-26 15:14:16,461 INFO L124 PetriNetUnfolderBase]: 3/96 cut-off events. [2023-08-26 15:14:16,462 INFO L125 PetriNetUnfolderBase]: For 0/0 co-relation queries the response was YES. [2023-08-26 15:14:16,464 INFO L83 FinitePrefix]: Finished finitePrefix Result has 103 conditions, 96 events. 3/96 cut-off events. For 0/0 co-relation queries the response was YES. Maximal size of possible extension queue 4. Compared 69 event pairs, 0 based on Foata normal form. 0/87 useless extension candidates. Maximal degree in co-relation 59. Up to 2 conditions per place. [2023-08-26 15:14:16,465 INFO L82 GeneralOperation]: Start removeDead. Operand has 102 places, 98 transitions, 206 flow [2023-08-26 15:14:16,467 INFO L88 GeneralOperation]: Finished RemoveDead, result has has 100 places, 96 transitions, 198 flow [2023-08-26 15:14:16,469 INFO L124 etLargeBlockEncoding]: Petri net LBE is using variable-based independence relation. [2023-08-26 15:14:16,474 INFO L131 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 100 places, 96 transitions, 198 flow [2023-08-26 15:14:16,476 INFO L113 LiptonReduction]: Starting Lipton reduction on Petri net that has 100 places, 96 transitions, 198 flow [2023-08-26 15:14:16,476 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 100 places, 96 transitions, 198 flow [2023-08-26 15:14:16,497 INFO L124 PetriNetUnfolderBase]: 3/96 cut-off events. [2023-08-26 15:14:16,497 INFO L125 PetriNetUnfolderBase]: For 0/0 co-relation queries the response was YES. [2023-08-26 15:14:16,498 INFO L83 FinitePrefix]: Finished finitePrefix Result has 103 conditions, 96 events. 3/96 cut-off events. For 0/0 co-relation queries the response was YES. Maximal size of possible extension queue 4. Compared 69 event pairs, 0 based on Foata normal form. 0/87 useless extension candidates. Maximal degree in co-relation 59. Up to 2 conditions per place. [2023-08-26 15:14:16,499 INFO L119 LiptonReduction]: Number of co-enabled transitions 1320 [2023-08-26 15:14:19,878 INFO L134 LiptonReduction]: Checked pairs total: 3751 [2023-08-26 15:14:19,879 INFO L136 LiptonReduction]: Total number of compositions: 103 [2023-08-26 15:14:19,887 INFO L356 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2023-08-26 15:14:19,891 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;@74bacda5, mLbeIndependenceSettings=[IndependenceType=SYNTACTIC, AbstractionType=NONE, UseConditional=, UseSemiCommutativity=, Solver=, SolverTimeout=] [2023-08-26 15:14:19,891 INFO L358 AbstractCegarLoop]: Starting to check reachability of 9 error locations. [2023-08-26 15:14:19,892 INFO L185 PetriNetUnfolderBase]: Found word, exiting Unfolder. [2023-08-26 15:14:19,892 INFO L124 PetriNetUnfolderBase]: 0/0 cut-off events. [2023-08-26 15:14:19,892 INFO L125 PetriNetUnfolderBase]: For 0/0 co-relation queries the response was YES. [2023-08-26 15:14:19,892 INFO L200 CegarLoopForPetriNet]: Found error trace [2023-08-26 15:14:19,893 INFO L208 CegarLoopForPetriNet]: trace histogram [1] [2023-08-26 15:14:19,893 INFO L420 AbstractCegarLoop]: === Iteration 1 === Targeting ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [P1Err0ASSERT_VIOLATIONASSERT, ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 6 more)] === [2023-08-26 15:14:19,896 INFO L145 PredicateUnifier]: Initialized classic predicate unifier [2023-08-26 15:14:19,896 INFO L85 PathProgramCache]: Analyzing trace with hash 468, now seen corresponding path program 1 times [2023-08-26 15:14:19,901 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-08-26 15:14:19,902 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [157060479] [2023-08-26 15:14:19,902 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-08-26 15:14:19,902 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-08-26 15:14:19,952 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-08-26 15:14:19,965 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:14:19,966 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-08-26 15:14:19,966 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [157060479] [2023-08-26 15:14:19,966 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [157060479] provided 1 perfect and 0 imperfect interpolant sequences [2023-08-26 15:14:19,966 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-08-26 15:14:19,966 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [0] imperfect sequences [] total 0 [2023-08-26 15:14:19,967 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [398785147] [2023-08-26 15:14:19,968 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-08-26 15:14:19,972 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 2 states [2023-08-26 15:14:19,975 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-08-26 15:14:19,987 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 2 interpolants. [2023-08-26 15:14:19,987 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=1, Invalid=1, Unknown=0, NotChecked=0, Total=2 [2023-08-26 15:14:19,988 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 86 out of 201 [2023-08-26 15:14:19,989 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 30 places, 23 transitions, 52 flow. Second operand has 2 states, 2 states have (on average 86.5) internal successors, (173), 2 states have internal predecessors, (173), 0 states have call successors, (0), 0 states have 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:14:19,989 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2023-08-26 15:14:19,989 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 86 of 201 [2023-08-26 15:14:19,990 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2023-08-26 15:14:20,091 INFO L124 PetriNetUnfolderBase]: 142/271 cut-off events. [2023-08-26 15:14:20,091 INFO L125 PetriNetUnfolderBase]: For 3/3 co-relation queries the response was YES. [2023-08-26 15:14:20,092 INFO L83 FinitePrefix]: Finished finitePrefix Result has 536 conditions, 271 events. 142/271 cut-off events. For 3/3 co-relation queries the response was YES. Maximal size of possible extension queue 23. Compared 1076 event pairs, 142 based on Foata normal form. 0/216 useless extension candidates. Maximal degree in co-relation 526. Up to 252 conditions per place. [2023-08-26 15:14:20,095 INFO L140 encePairwiseOnDemand]: 197/201 looper letters, 15 selfloop transitions, 0 changer transitions 0/19 dead transitions. [2023-08-26 15:14:20,095 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 27 places, 19 transitions, 74 flow [2023-08-26 15:14:20,096 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2023-08-26 15:14:20,097 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 2 states. [2023-08-26 15:14:20,104 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2 states to 2 states and 191 transitions. [2023-08-26 15:14:20,106 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.47512437810945274 [2023-08-26 15:14:20,106 INFO L72 ComplementDD]: Start complementDD. Operand 2 states and 191 transitions. [2023-08-26 15:14:20,107 INFO L73 IsDeterministic]: Start isDeterministic. Operand 2 states and 191 transitions. [2023-08-26 15:14:20,108 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2023-08-26 15:14:20,109 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 2 states and 191 transitions. [2023-08-26 15:14:20,113 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 3 states, 2 states have (on average 95.5) internal successors, (191), 2 states have internal predecessors, (191), 0 states have call successors, (0), 0 states have 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:14:20,117 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 3 states, 3 states have (on average 201.0) internal successors, (603), 3 states have internal predecessors, (603), 0 states have call successors, (0), 0 states have 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:14:20,118 INFO L81 ComplementDD]: Finished complementDD. Result has 3 states, 3 states have (on average 201.0) internal successors, (603), 3 states have internal predecessors, (603), 0 states have call successors, (0), 0 states have 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:14:20,119 INFO L175 Difference]: Start difference. First operand has 30 places, 23 transitions, 52 flow. Second operand 2 states and 191 transitions. [2023-08-26 15:14:20,120 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 27 places, 19 transitions, 74 flow [2023-08-26 15:14:20,121 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 25 places, 19 transitions, 72 flow, removed 0 selfloop flow, removed 2 redundant places. [2023-08-26 15:14:20,122 INFO L231 Difference]: Finished difference. Result has 25 places, 19 transitions, 42 flow [2023-08-26 15:14:20,123 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=201, PETRI_DIFFERENCE_MINUEND_FLOW=42, PETRI_DIFFERENCE_MINUEND_PLACES=24, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=19, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=0, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=19, PETRI_DIFFERENCE_SUBTRAHEND_STATES=2, PETRI_FLOW=42, PETRI_PLACES=25, PETRI_TRANSITIONS=19} [2023-08-26 15:14:20,125 INFO L281 CegarLoopForPetriNet]: 30 programPoint places, -5 predicate places. [2023-08-26 15:14:20,125 INFO L495 AbstractCegarLoop]: Abstraction has has 25 places, 19 transitions, 42 flow [2023-08-26 15:14:20,125 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 2 states, 2 states have (on average 86.5) internal successors, (173), 2 states have internal predecessors, (173), 0 states have call successors, (0), 0 states have 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:14:20,126 INFO L200 CegarLoopForPetriNet]: Found error trace [2023-08-26 15:14:20,126 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1] [2023-08-26 15:14:20,126 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable0 [2023-08-26 15:14:20,126 INFO L420 AbstractCegarLoop]: === Iteration 2 === Targeting P1Err0ASSERT_VIOLATIONASSERT === [P1Err0ASSERT_VIOLATIONASSERT, ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 6 more)] === [2023-08-26 15:14:20,127 INFO L145 PredicateUnifier]: Initialized classic predicate unifier [2023-08-26 15:14:20,127 INFO L85 PathProgramCache]: Analyzing trace with hash 443542973, now seen corresponding path program 1 times [2023-08-26 15:14:20,127 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-08-26 15:14:20,127 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2142002325] [2023-08-26 15:14:20,128 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-08-26 15:14:20,128 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-08-26 15:14:20,170 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-08-26 15:14:20,335 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:14:20,335 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-08-26 15:14:20,336 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2142002325] [2023-08-26 15:14:20,336 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2142002325] provided 1 perfect and 0 imperfect interpolant sequences [2023-08-26 15:14:20,336 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-08-26 15:14:20,336 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [1] imperfect sequences [] total 1 [2023-08-26 15:14:20,336 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1953756401] [2023-08-26 15:14:20,336 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-08-26 15:14:20,337 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2023-08-26 15:14:20,337 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-08-26 15:14:20,337 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2023-08-26 15:14:20,337 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2023-08-26 15:14:20,338 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 85 out of 201 [2023-08-26 15:14:20,338 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 25 places, 19 transitions, 42 flow. Second operand has 3 states, 3 states have (on average 86.66666666666667) internal successors, (260), 3 states have internal predecessors, (260), 0 states have call successors, (0), 0 states have 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:14:20,338 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2023-08-26 15:14:20,338 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 85 of 201 [2023-08-26 15:14:20,338 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2023-08-26 15:14:20,396 INFO L124 PetriNetUnfolderBase]: 111/262 cut-off events. [2023-08-26 15:14:20,396 INFO L125 PetriNetUnfolderBase]: For 0/0 co-relation queries the response was YES. [2023-08-26 15:14:20,397 INFO L83 FinitePrefix]: Finished finitePrefix Result has 475 conditions, 262 events. 111/262 cut-off events. For 0/0 co-relation queries the response was YES. Maximal size of possible extension queue 22. Compared 1186 event pairs, 18 based on Foata normal form. 0/245 useless extension candidates. Maximal degree in co-relation 472. Up to 154 conditions per place. [2023-08-26 15:14:20,398 INFO L140 encePairwiseOnDemand]: 198/201 looper letters, 17 selfloop transitions, 2 changer transitions 2/25 dead transitions. [2023-08-26 15:14:20,398 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 26 places, 25 transitions, 96 flow [2023-08-26 15:14:20,398 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2023-08-26 15:14:20,398 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2023-08-26 15:14:20,399 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 277 transitions. [2023-08-26 15:14:20,400 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.4593698175787728 [2023-08-26 15:14:20,400 INFO L72 ComplementDD]: Start complementDD. Operand 3 states and 277 transitions. [2023-08-26 15:14:20,400 INFO L73 IsDeterministic]: Start isDeterministic. Operand 3 states and 277 transitions. [2023-08-26 15:14:20,400 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2023-08-26 15:14:20,400 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 3 states and 277 transitions. [2023-08-26 15:14:20,401 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 4 states, 3 states have (on average 92.33333333333333) internal successors, (277), 3 states have internal predecessors, (277), 0 states have call successors, (0), 0 states have 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:14:20,402 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 4 states, 4 states have (on average 201.0) internal successors, (804), 4 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:14:20,402 INFO L81 ComplementDD]: Finished complementDD. Result has 4 states, 4 states have (on average 201.0) internal successors, (804), 4 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:14:20,402 INFO L175 Difference]: Start difference. First operand has 25 places, 19 transitions, 42 flow. Second operand 3 states and 277 transitions. [2023-08-26 15:14:20,403 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 26 places, 25 transitions, 96 flow [2023-08-26 15:14:20,403 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 26 places, 25 transitions, 96 flow, removed 0 selfloop flow, removed 0 redundant places. [2023-08-26 15:14:20,403 INFO L231 Difference]: Finished difference. Result has 26 places, 17 transitions, 42 flow [2023-08-26 15:14:20,403 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=201, PETRI_DIFFERENCE_MINUEND_FLOW=40, PETRI_DIFFERENCE_MINUEND_PLACES=24, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=18, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=2, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=16, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=42, PETRI_PLACES=26, PETRI_TRANSITIONS=17} [2023-08-26 15:14:20,404 INFO L281 CegarLoopForPetriNet]: 30 programPoint places, -4 predicate places. [2023-08-26 15:14:20,404 INFO L495 AbstractCegarLoop]: Abstraction has has 26 places, 17 transitions, 42 flow [2023-08-26 15:14:20,404 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 86.66666666666667) internal successors, (260), 3 states have internal predecessors, (260), 0 states have call successors, (0), 0 states have 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:14:20,404 INFO L200 CegarLoopForPetriNet]: Found error trace [2023-08-26 15:14:20,404 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1] [2023-08-26 15:14:20,405 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1 [2023-08-26 15:14:20,405 INFO L420 AbstractCegarLoop]: === Iteration 3 === Targeting ULTIMATE.startErr4ASSERT_VIOLATIONASSERT === [P1Err0ASSERT_VIOLATIONASSERT, ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 6 more)] === [2023-08-26 15:14:20,405 INFO L145 PredicateUnifier]: Initialized classic predicate unifier [2023-08-26 15:14:20,405 INFO L85 PathProgramCache]: Analyzing trace with hash 1043089387, now seen corresponding path program 1 times [2023-08-26 15:14:20,405 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-08-26 15:14:20,405 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [957898902] [2023-08-26 15:14:20,405 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-08-26 15:14:20,405 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-08-26 15:14:20,422 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-08-26 15:14:20,719 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:14:20,720 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-08-26 15:14:20,720 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [957898902] [2023-08-26 15:14:20,720 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [957898902] provided 1 perfect and 0 imperfect interpolant sequences [2023-08-26 15:14:20,720 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-08-26 15:14:20,720 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2023-08-26 15:14:20,720 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1372241251] [2023-08-26 15:14:20,720 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-08-26 15:14:20,721 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2023-08-26 15:14:20,721 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-08-26 15:14:20,721 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2023-08-26 15:14:20,721 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2023-08-26 15:14:20,722 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 71 out of 201 [2023-08-26 15:14:20,722 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 26 places, 17 transitions, 42 flow. Second operand has 4 states, 4 states have (on average 72.75) internal successors, (291), 4 states have internal predecessors, (291), 0 states have call successors, (0), 0 states have 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:14:20,722 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2023-08-26 15:14:20,722 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 71 of 201 [2023-08-26 15:14:20,722 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2023-08-26 15:14:20,815 INFO L124 PetriNetUnfolderBase]: 267/469 cut-off events. [2023-08-26 15:14:20,815 INFO L125 PetriNetUnfolderBase]: For 18/18 co-relation queries the response was YES. [2023-08-26 15:14:20,816 INFO L83 FinitePrefix]: Finished finitePrefix Result has 974 conditions, 469 events. 267/469 cut-off events. For 18/18 co-relation queries the response was YES. Maximal size of possible extension queue 35. Compared 1839 event pairs, 59 based on Foata normal form. 17/486 useless extension candidates. Maximal degree in co-relation 970. Up to 326 conditions per place. [2023-08-26 15:14:20,817 INFO L140 encePairwiseOnDemand]: 192/201 looper letters, 23 selfloop transitions, 10 changer transitions 0/33 dead transitions. [2023-08-26 15:14:20,817 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 28 places, 33 transitions, 144 flow [2023-08-26 15:14:20,818 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2023-08-26 15:14:20,818 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 4 states. [2023-08-26 15:14:20,819 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 319 transitions. [2023-08-26 15:14:20,819 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.39676616915422885 [2023-08-26 15:14:20,819 INFO L72 ComplementDD]: Start complementDD. Operand 4 states and 319 transitions. [2023-08-26 15:14:20,819 INFO L73 IsDeterministic]: Start isDeterministic. Operand 4 states and 319 transitions. [2023-08-26 15:14:20,819 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2023-08-26 15:14:20,820 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 4 states and 319 transitions. [2023-08-26 15:14:20,820 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 5 states, 4 states have (on average 79.75) internal successors, (319), 4 states have internal predecessors, (319), 0 states have call successors, (0), 0 states have 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:14:20,821 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 5 states, 5 states have (on average 201.0) internal successors, (1005), 5 states have internal predecessors, (1005), 0 states have call successors, (0), 0 states have 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:14:20,822 INFO L81 ComplementDD]: Finished complementDD. Result has 5 states, 5 states have (on average 201.0) internal successors, (1005), 5 states have internal predecessors, (1005), 0 states have call successors, (0), 0 states have 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:14:20,822 INFO L175 Difference]: Start difference. First operand has 26 places, 17 transitions, 42 flow. Second operand 4 states and 319 transitions. [2023-08-26 15:14:20,822 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 28 places, 33 transitions, 144 flow [2023-08-26 15:14:20,822 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 26 places, 33 transitions, 138 flow, removed 0 selfloop flow, removed 2 redundant places. [2023-08-26 15:14:20,823 INFO L231 Difference]: Finished difference. Result has 29 places, 25 transitions, 110 flow [2023-08-26 15:14:20,823 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=201, PETRI_DIFFERENCE_MINUEND_FLOW=38, PETRI_DIFFERENCE_MINUEND_PLACES=23, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=17, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=3, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=9, PETRI_DIFFERENCE_SUBTRAHEND_STATES=4, PETRI_FLOW=110, PETRI_PLACES=29, PETRI_TRANSITIONS=25} [2023-08-26 15:14:20,823 INFO L281 CegarLoopForPetriNet]: 30 programPoint places, -1 predicate places. [2023-08-26 15:14:20,824 INFO L495 AbstractCegarLoop]: Abstraction has has 29 places, 25 transitions, 110 flow [2023-08-26 15:14:20,824 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 72.75) internal successors, (291), 4 states have internal predecessors, (291), 0 states have call successors, (0), 0 states have 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:14:20,824 INFO L200 CegarLoopForPetriNet]: Found error trace [2023-08-26 15:14:20,824 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1] [2023-08-26 15:14:20,824 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2 [2023-08-26 15:14:20,824 INFO L420 AbstractCegarLoop]: === Iteration 4 === Targeting ULTIMATE.startErr4ASSERT_VIOLATIONASSERT === [P1Err0ASSERT_VIOLATIONASSERT, ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 6 more)] === [2023-08-26 15:14:20,824 INFO L145 PredicateUnifier]: Initialized classic predicate unifier [2023-08-26 15:14:20,824 INFO L85 PathProgramCache]: Analyzing trace with hash -2023968626, now seen corresponding path program 1 times [2023-08-26 15:14:20,825 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-08-26 15:14:20,825 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [224905496] [2023-08-26 15:14:20,825 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-08-26 15:14:20,825 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-08-26 15:14:20,839 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-08-26 15:14:21,084 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:14:21,084 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-08-26 15:14:21,085 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [224905496] [2023-08-26 15:14:21,085 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [224905496] provided 1 perfect and 0 imperfect interpolant sequences [2023-08-26 15:14:21,085 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-08-26 15:14:21,085 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2023-08-26 15:14:21,085 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1804208286] [2023-08-26 15:14:21,085 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-08-26 15:14:21,085 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2023-08-26 15:14:21,085 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-08-26 15:14:21,086 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2023-08-26 15:14:21,086 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2023-08-26 15:14:21,086 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 71 out of 201 [2023-08-26 15:14:21,087 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 29 places, 25 transitions, 110 flow. Second operand has 4 states, 4 states have (on average 73.0) internal successors, (292), 4 states have internal predecessors, (292), 0 states have call successors, (0), 0 states have 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:14:21,087 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2023-08-26 15:14:21,087 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 71 of 201 [2023-08-26 15:14:21,087 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2023-08-26 15:14:21,172 INFO L124 PetriNetUnfolderBase]: 224/394 cut-off events. [2023-08-26 15:14:21,172 INFO L125 PetriNetUnfolderBase]: For 151/151 co-relation queries the response was YES. [2023-08-26 15:14:21,172 INFO L83 FinitePrefix]: Finished finitePrefix Result has 1150 conditions, 394 events. 224/394 cut-off events. For 151/151 co-relation queries the response was YES. Maximal size of possible extension queue 28. Compared 1406 event pairs, 79 based on Foata normal form. 18/412 useless extension candidates. Maximal degree in co-relation 1144. Up to 202 conditions per place. [2023-08-26 15:14:21,174 INFO L140 encePairwiseOnDemand]: 194/201 looper letters, 30 selfloop transitions, 7 changer transitions 0/37 dead transitions. [2023-08-26 15:14:21,174 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 32 places, 37 transitions, 226 flow [2023-08-26 15:14:21,174 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2023-08-26 15:14:21,174 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 4 states. [2023-08-26 15:14:21,175 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 315 transitions. [2023-08-26 15:14:21,175 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.3917910447761194 [2023-08-26 15:14:21,175 INFO L72 ComplementDD]: Start complementDD. Operand 4 states and 315 transitions. [2023-08-26 15:14:21,175 INFO L73 IsDeterministic]: Start isDeterministic. Operand 4 states and 315 transitions. [2023-08-26 15:14:21,175 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2023-08-26 15:14:21,175 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 4 states and 315 transitions. [2023-08-26 15:14:21,176 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 5 states, 4 states have (on average 78.75) internal successors, (315), 4 states have internal predecessors, (315), 0 states have call successors, (0), 0 states have 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:14:21,177 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 5 states, 5 states have (on average 201.0) internal successors, (1005), 5 states have internal predecessors, (1005), 0 states have call successors, (0), 0 states have 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:14:21,177 INFO L81 ComplementDD]: Finished complementDD. Result has 5 states, 5 states have (on average 201.0) internal successors, (1005), 5 states have internal predecessors, (1005), 0 states have call successors, (0), 0 states have 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:14:21,177 INFO L175 Difference]: Start difference. First operand has 29 places, 25 transitions, 110 flow. Second operand 4 states and 315 transitions. [2023-08-26 15:14:21,177 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 32 places, 37 transitions, 226 flow [2023-08-26 15:14:21,178 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 32 places, 37 transitions, 226 flow, removed 0 selfloop flow, removed 0 redundant places. [2023-08-26 15:14:21,179 INFO L231 Difference]: Finished difference. Result has 34 places, 28 transitions, 159 flow [2023-08-26 15:14:21,179 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=201, PETRI_DIFFERENCE_MINUEND_FLOW=110, PETRI_DIFFERENCE_MINUEND_PLACES=29, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=25, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=4, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=18, PETRI_DIFFERENCE_SUBTRAHEND_STATES=4, PETRI_FLOW=159, PETRI_PLACES=34, PETRI_TRANSITIONS=28} [2023-08-26 15:14:21,179 INFO L281 CegarLoopForPetriNet]: 30 programPoint places, 4 predicate places. [2023-08-26 15:14:21,180 INFO L495 AbstractCegarLoop]: Abstraction has has 34 places, 28 transitions, 159 flow [2023-08-26 15:14:21,180 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 73.0) internal successors, (292), 4 states have internal predecessors, (292), 0 states have call successors, (0), 0 states have 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:14:21,180 INFO L200 CegarLoopForPetriNet]: Found error trace [2023-08-26 15:14:21,180 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-08-26 15:14:21,180 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable3 [2023-08-26 15:14:21,180 INFO L420 AbstractCegarLoop]: === Iteration 5 === Targeting ULTIMATE.startErr4ASSERT_VIOLATIONASSERT === [P1Err0ASSERT_VIOLATIONASSERT, ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 6 more)] === [2023-08-26 15:14:21,180 INFO L145 PredicateUnifier]: Initialized classic predicate unifier [2023-08-26 15:14:21,181 INFO L85 PathProgramCache]: Analyzing trace with hash -416097438, now seen corresponding path program 1 times [2023-08-26 15:14:21,181 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-08-26 15:14:21,181 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1165929110] [2023-08-26 15:14:21,181 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-08-26 15:14:21,181 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-08-26 15:14:21,191 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-08-26 15:14:21,256 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:14:21,256 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-08-26 15:14:21,256 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1165929110] [2023-08-26 15:14:21,256 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1165929110] provided 1 perfect and 0 imperfect interpolant sequences [2023-08-26 15:14:21,257 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-08-26 15:14:21,257 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2023-08-26 15:14:21,257 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [627773921] [2023-08-26 15:14:21,257 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-08-26 15:14:21,257 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2023-08-26 15:14:21,257 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-08-26 15:14:21,257 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2023-08-26 15:14:21,258 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2023-08-26 15:14:21,258 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 81 out of 201 [2023-08-26 15:14:21,258 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 34 places, 28 transitions, 159 flow. Second operand has 3 states, 3 states have (on average 84.66666666666667) internal successors, (254), 3 states have internal predecessors, (254), 0 states have call successors, (0), 0 states have 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:14:21,258 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2023-08-26 15:14:21,258 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 81 of 201 [2023-08-26 15:14:21,258 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2023-08-26 15:14:21,323 INFO L124 PetriNetUnfolderBase]: 228/428 cut-off events. [2023-08-26 15:14:21,327 INFO L125 PetriNetUnfolderBase]: For 346/346 co-relation queries the response was YES. [2023-08-26 15:14:21,327 INFO L83 FinitePrefix]: Finished finitePrefix Result has 1438 conditions, 428 events. 228/428 cut-off events. For 346/346 co-relation queries the response was YES. Maximal size of possible extension queue 38. Compared 1845 event pairs, 92 based on Foata normal form. 12/439 useless extension candidates. Maximal degree in co-relation 1429. Up to 240 conditions per place. [2023-08-26 15:14:21,328 INFO L140 encePairwiseOnDemand]: 198/201 looper letters, 31 selfloop transitions, 4 changer transitions 6/42 dead transitions. [2023-08-26 15:14:21,328 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 36 places, 42 transitions, 326 flow [2023-08-26 15:14:21,329 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2023-08-26 15:14:21,329 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2023-08-26 15:14:21,329 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 269 transitions. [2023-08-26 15:14:21,330 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.4461028192371476 [2023-08-26 15:14:21,330 INFO L72 ComplementDD]: Start complementDD. Operand 3 states and 269 transitions. [2023-08-26 15:14:21,330 INFO L73 IsDeterministic]: Start isDeterministic. Operand 3 states and 269 transitions. [2023-08-26 15:14:21,330 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2023-08-26 15:14:21,330 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 3 states and 269 transitions. [2023-08-26 15:14:21,330 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 4 states, 3 states have (on average 89.66666666666667) internal successors, (269), 3 states have internal predecessors, (269), 0 states have call successors, (0), 0 states have 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:14:21,331 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 4 states, 4 states have (on average 201.0) internal successors, (804), 4 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:14:21,331 INFO L81 ComplementDD]: Finished complementDD. Result has 4 states, 4 states have (on average 201.0) internal successors, (804), 4 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:14:21,332 INFO L175 Difference]: Start difference. First operand has 34 places, 28 transitions, 159 flow. Second operand 3 states and 269 transitions. [2023-08-26 15:14:21,332 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 36 places, 42 transitions, 326 flow [2023-08-26 15:14:21,336 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 33 places, 42 transitions, 308 flow, removed 1 selfloop flow, removed 3 redundant places. [2023-08-26 15:14:21,337 INFO L231 Difference]: Finished difference. Result has 34 places, 26 transitions, 149 flow [2023-08-26 15:14:21,337 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=201, PETRI_DIFFERENCE_MINUEND_FLOW=146, PETRI_DIFFERENCE_MINUEND_PLACES=31, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=28, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=4, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=24, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=149, PETRI_PLACES=34, PETRI_TRANSITIONS=26} [2023-08-26 15:14:21,339 INFO L281 CegarLoopForPetriNet]: 30 programPoint places, 4 predicate places. [2023-08-26 15:14:21,339 INFO L495 AbstractCegarLoop]: Abstraction has has 34 places, 26 transitions, 149 flow [2023-08-26 15:14:21,339 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 84.66666666666667) internal successors, (254), 3 states have internal predecessors, (254), 0 states have call successors, (0), 0 states have 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:14:21,339 INFO L200 CegarLoopForPetriNet]: Found error trace [2023-08-26 15:14:21,339 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-08-26 15:14:21,339 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable4 [2023-08-26 15:14:21,339 INFO L420 AbstractCegarLoop]: === Iteration 6 === Targeting ULTIMATE.startErr4ASSERT_VIOLATIONASSERT === [P1Err0ASSERT_VIOLATIONASSERT, ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 6 more)] === [2023-08-26 15:14:21,339 INFO L145 PredicateUnifier]: Initialized classic predicate unifier [2023-08-26 15:14:21,340 INFO L85 PathProgramCache]: Analyzing trace with hash -1733501531, now seen corresponding path program 1 times [2023-08-26 15:14:21,340 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-08-26 15:14:21,340 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2051406312] [2023-08-26 15:14:21,340 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-08-26 15:14:21,340 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-08-26 15:14:21,367 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-08-26 15:14:21,654 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:14:21,654 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-08-26 15:14:21,654 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2051406312] [2023-08-26 15:14:21,654 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2051406312] provided 1 perfect and 0 imperfect interpolant sequences [2023-08-26 15:14:21,654 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-08-26 15:14:21,654 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2023-08-26 15:14:21,655 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [743110420] [2023-08-26 15:14:21,655 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-08-26 15:14:21,655 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2023-08-26 15:14:21,655 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-08-26 15:14:21,655 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2023-08-26 15:14:21,655 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=8, Invalid=12, Unknown=0, NotChecked=0, Total=20 [2023-08-26 15:14:21,656 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 80 out of 201 [2023-08-26 15:14:21,656 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 34 places, 26 transitions, 149 flow. Second operand has 5 states, 5 states have (on average 81.8) internal successors, (409), 5 states have internal predecessors, (409), 0 states have call successors, (0), 0 states have 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:14:21,656 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2023-08-26 15:14:21,656 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 80 of 201 [2023-08-26 15:14:21,656 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2023-08-26 15:14:21,726 INFO L124 PetriNetUnfolderBase]: 121/230 cut-off events. [2023-08-26 15:14:21,726 INFO L125 PetriNetUnfolderBase]: For 265/276 co-relation queries the response was YES. [2023-08-26 15:14:21,727 INFO L83 FinitePrefix]: Finished finitePrefix Result has 778 conditions, 230 events. 121/230 cut-off events. For 265/276 co-relation queries the response was YES. Maximal size of possible extension queue 24. Compared 801 event pairs, 13 based on Foata normal form. 7/232 useless extension candidates. Maximal degree in co-relation 769. Up to 151 conditions per place. [2023-08-26 15:14:21,728 INFO L140 encePairwiseOnDemand]: 196/201 looper letters, 25 selfloop transitions, 7 changer transitions 0/37 dead transitions. [2023-08-26 15:14:21,728 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 37 places, 37 transitions, 266 flow [2023-08-26 15:14:21,728 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2023-08-26 15:14:21,728 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 4 states. [2023-08-26 15:14:21,729 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 343 transitions. [2023-08-26 15:14:21,729 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.42661691542288555 [2023-08-26 15:14:21,729 INFO L72 ComplementDD]: Start complementDD. Operand 4 states and 343 transitions. [2023-08-26 15:14:21,729 INFO L73 IsDeterministic]: Start isDeterministic. Operand 4 states and 343 transitions. [2023-08-26 15:14:21,729 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2023-08-26 15:14:21,730 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 4 states and 343 transitions. [2023-08-26 15:14:21,730 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 5 states, 4 states have (on average 85.75) internal successors, (343), 4 states have internal predecessors, (343), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-26 15:14:21,732 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 5 states, 5 states have (on average 201.0) internal successors, (1005), 5 states have internal predecessors, (1005), 0 states have call successors, (0), 0 states have 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:14:21,732 INFO L81 ComplementDD]: Finished complementDD. Result has 5 states, 5 states have (on average 201.0) internal successors, (1005), 5 states have internal predecessors, (1005), 0 states have call successors, (0), 0 states have 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:14:21,732 INFO L175 Difference]: Start difference. First operand has 34 places, 26 transitions, 149 flow. Second operand 4 states and 343 transitions. [2023-08-26 15:14:21,732 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 37 places, 37 transitions, 266 flow [2023-08-26 15:14:21,733 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 34 places, 37 transitions, 254 flow, removed 0 selfloop flow, removed 3 redundant places. [2023-08-26 15:14:21,734 INFO L231 Difference]: Finished difference. Result has 35 places, 29 transitions, 183 flow [2023-08-26 15:14:21,734 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=201, PETRI_DIFFERENCE_MINUEND_FLOW=139, PETRI_DIFFERENCE_MINUEND_PLACES=31, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=26, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=4, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=19, PETRI_DIFFERENCE_SUBTRAHEND_STATES=4, PETRI_FLOW=183, PETRI_PLACES=35, PETRI_TRANSITIONS=29} [2023-08-26 15:14:21,736 INFO L281 CegarLoopForPetriNet]: 30 programPoint places, 5 predicate places. [2023-08-26 15:14:21,738 INFO L495 AbstractCegarLoop]: Abstraction has has 35 places, 29 transitions, 183 flow [2023-08-26 15:14:21,738 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 81.8) internal successors, (409), 5 states have internal predecessors, (409), 0 states have call successors, (0), 0 states have 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:14:21,738 INFO L200 CegarLoopForPetriNet]: Found error trace [2023-08-26 15:14:21,739 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-08-26 15:14:21,739 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable5 [2023-08-26 15:14:21,739 INFO L420 AbstractCegarLoop]: === Iteration 7 === Targeting ULTIMATE.startErr4ASSERT_VIOLATIONASSERT === [P1Err0ASSERT_VIOLATIONASSERT, ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 6 more)] === [2023-08-26 15:14:21,739 INFO L145 PredicateUnifier]: Initialized classic predicate unifier [2023-08-26 15:14:21,739 INFO L85 PathProgramCache]: Analyzing trace with hash 202138158, now seen corresponding path program 1 times [2023-08-26 15:14:21,739 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-08-26 15:14:21,739 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [87834355] [2023-08-26 15:14:21,741 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-08-26 15:14:21,741 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-08-26 15:14:21,764 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-08-26 15:14:21,906 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:14:21,907 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-08-26 15:14:21,907 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [87834355] [2023-08-26 15:14:21,907 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [87834355] provided 1 perfect and 0 imperfect interpolant sequences [2023-08-26 15:14:21,907 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-08-26 15:14:21,907 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2023-08-26 15:14:21,908 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [607719992] [2023-08-26 15:14:21,908 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-08-26 15:14:21,908 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2023-08-26 15:14:21,908 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-08-26 15:14:21,908 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2023-08-26 15:14:21,908 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2023-08-26 15:14:21,909 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 80 out of 201 [2023-08-26 15:14:21,909 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 35 places, 29 transitions, 183 flow. Second operand has 4 states, 4 states have (on average 83.25) internal successors, (333), 4 states have internal predecessors, (333), 0 states have call successors, (0), 0 states have 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:14:21,909 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2023-08-26 15:14:21,909 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 80 of 201 [2023-08-26 15:14:21,909 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2023-08-26 15:14:21,982 INFO L124 PetriNetUnfolderBase]: 138/276 cut-off events. [2023-08-26 15:14:21,982 INFO L125 PetriNetUnfolderBase]: For 302/302 co-relation queries the response was YES. [2023-08-26 15:14:21,983 INFO L83 FinitePrefix]: Finished finitePrefix Result has 985 conditions, 276 events. 138/276 cut-off events. For 302/302 co-relation queries the response was YES. Maximal size of possible extension queue 28. Compared 1106 event pairs, 17 based on Foata normal form. 8/284 useless extension candidates. Maximal degree in co-relation 975. Up to 135 conditions per place. [2023-08-26 15:14:21,983 INFO L140 encePairwiseOnDemand]: 198/201 looper letters, 26 selfloop transitions, 2 changer transitions 18/47 dead transitions. [2023-08-26 15:14:21,984 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 38 places, 47 transitions, 375 flow [2023-08-26 15:14:21,984 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2023-08-26 15:14:21,984 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 4 states. [2023-08-26 15:14:21,985 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 349 transitions. [2023-08-26 15:14:21,985 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.43407960199004975 [2023-08-26 15:14:21,985 INFO L72 ComplementDD]: Start complementDD. Operand 4 states and 349 transitions. [2023-08-26 15:14:21,985 INFO L73 IsDeterministic]: Start isDeterministic. Operand 4 states and 349 transitions. [2023-08-26 15:14:21,985 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2023-08-26 15:14:21,985 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 4 states and 349 transitions. [2023-08-26 15:14:21,986 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 5 states, 4 states have (on average 87.25) internal successors, (349), 4 states have internal predecessors, (349), 0 states have call successors, (0), 0 states have 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:14:21,988 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 5 states, 5 states have (on average 201.0) internal successors, (1005), 5 states have internal predecessors, (1005), 0 states have call successors, (0), 0 states have 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:14:21,988 INFO L81 ComplementDD]: Finished complementDD. Result has 5 states, 5 states have (on average 201.0) internal successors, (1005), 5 states have internal predecessors, (1005), 0 states have call successors, (0), 0 states have 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:14:21,988 INFO L175 Difference]: Start difference. First operand has 35 places, 29 transitions, 183 flow. Second operand 4 states and 349 transitions. [2023-08-26 15:14:21,989 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 38 places, 47 transitions, 375 flow [2023-08-26 15:14:21,990 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 36 places, 47 transitions, 363 flow, removed 0 selfloop flow, removed 2 redundant places. [2023-08-26 15:14:21,991 INFO L231 Difference]: Finished difference. Result has 38 places, 25 transitions, 148 flow [2023-08-26 15:14:21,991 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=201, PETRI_DIFFERENCE_MINUEND_FLOW=175, PETRI_DIFFERENCE_MINUEND_PLACES=33, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=29, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=2, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=27, PETRI_DIFFERENCE_SUBTRAHEND_STATES=4, PETRI_FLOW=148, PETRI_PLACES=38, PETRI_TRANSITIONS=25} [2023-08-26 15:14:21,992 INFO L281 CegarLoopForPetriNet]: 30 programPoint places, 8 predicate places. [2023-08-26 15:14:21,992 INFO L495 AbstractCegarLoop]: Abstraction has has 38 places, 25 transitions, 148 flow [2023-08-26 15:14:21,992 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 83.25) internal successors, (333), 4 states have internal predecessors, (333), 0 states have call successors, (0), 0 states have 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:14:21,993 INFO L200 CegarLoopForPetriNet]: Found error trace [2023-08-26 15:14:21,993 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-08-26 15:14:21,993 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable6 [2023-08-26 15:14:21,993 INFO L420 AbstractCegarLoop]: === Iteration 8 === Targeting ULTIMATE.startErr4ASSERT_VIOLATIONASSERT === [P1Err0ASSERT_VIOLATIONASSERT, ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 6 more)] === [2023-08-26 15:14:21,993 INFO L145 PredicateUnifier]: Initialized classic predicate unifier [2023-08-26 15:14:21,994 INFO L85 PathProgramCache]: Analyzing trace with hash -1652996200, now seen corresponding path program 2 times [2023-08-26 15:14:21,994 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-08-26 15:14:21,994 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1194548651] [2023-08-26 15:14:21,994 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-08-26 15:14:21,994 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-08-26 15:14:22,040 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-08-26 15:14:22,126 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:14:22,126 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-08-26 15:14:22,126 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1194548651] [2023-08-26 15:14:22,126 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1194548651] provided 1 perfect and 0 imperfect interpolant sequences [2023-08-26 15:14:22,126 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-08-26 15:14:22,127 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2023-08-26 15:14:22,127 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1985937459] [2023-08-26 15:14:22,127 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-08-26 15:14:22,127 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2023-08-26 15:14:22,127 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-08-26 15:14:22,127 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2023-08-26 15:14:22,127 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2023-08-26 15:14:22,128 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 78 out of 201 [2023-08-26 15:14:22,128 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 38 places, 25 transitions, 148 flow. Second operand has 4 states, 4 states have (on average 80.5) internal successors, (322), 4 states have internal predecessors, (322), 0 states have call successors, (0), 0 states have 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:14:22,128 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2023-08-26 15:14:22,128 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 78 of 201 [2023-08-26 15:14:22,128 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2023-08-26 15:14:22,182 INFO L124 PetriNetUnfolderBase]: 32/85 cut-off events. [2023-08-26 15:14:22,182 INFO L125 PetriNetUnfolderBase]: For 149/152 co-relation queries the response was YES. [2023-08-26 15:14:22,182 INFO L83 FinitePrefix]: Finished finitePrefix Result has 291 conditions, 85 events. 32/85 cut-off events. For 149/152 co-relation queries the response was YES. Maximal size of possible extension queue 9. Compared 230 event pairs, 6 based on Foata normal form. 19/104 useless extension candidates. Maximal degree in co-relation 279. Up to 42 conditions per place. [2023-08-26 15:14:22,183 INFO L140 encePairwiseOnDemand]: 196/201 looper letters, 19 selfloop transitions, 3 changer transitions 16/42 dead transitions. [2023-08-26 15:14:22,183 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 41 places, 42 transitions, 303 flow [2023-08-26 15:14:22,183 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2023-08-26 15:14:22,183 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 5 states. [2023-08-26 15:14:22,184 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 422 transitions. [2023-08-26 15:14:22,185 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.4199004975124378 [2023-08-26 15:14:22,185 INFO L72 ComplementDD]: Start complementDD. Operand 5 states and 422 transitions. [2023-08-26 15:14:22,185 INFO L73 IsDeterministic]: Start isDeterministic. Operand 5 states and 422 transitions. [2023-08-26 15:14:22,185 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2023-08-26 15:14:22,185 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 5 states and 422 transitions. [2023-08-26 15:14:22,186 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 6 states, 5 states have (on average 84.4) internal successors, (422), 5 states have internal predecessors, (422), 0 states have call successors, (0), 0 states have 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:14:22,187 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 6 states, 6 states have (on average 201.0) internal successors, (1206), 6 states have internal predecessors, (1206), 0 states have call successors, (0), 0 states have 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:14:22,187 INFO L81 ComplementDD]: Finished complementDD. Result has 6 states, 6 states have (on average 201.0) internal successors, (1206), 6 states have internal predecessors, (1206), 0 states have call successors, (0), 0 states have 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:14:22,187 INFO L175 Difference]: Start difference. First operand has 38 places, 25 transitions, 148 flow. Second operand 5 states and 422 transitions. [2023-08-26 15:14:22,187 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 41 places, 42 transitions, 303 flow [2023-08-26 15:14:22,188 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 35 places, 42 transitions, 270 flow, removed 5 selfloop flow, removed 6 redundant places. [2023-08-26 15:14:22,188 INFO L231 Difference]: Finished difference. Result has 38 places, 23 transitions, 119 flow [2023-08-26 15:14:22,189 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=201, PETRI_DIFFERENCE_MINUEND_FLOW=92, PETRI_DIFFERENCE_MINUEND_PLACES=31, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=21, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=1, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=18, PETRI_DIFFERENCE_SUBTRAHEND_STATES=5, PETRI_FLOW=119, PETRI_PLACES=38, PETRI_TRANSITIONS=23} [2023-08-26 15:14:22,189 INFO L281 CegarLoopForPetriNet]: 30 programPoint places, 8 predicate places. [2023-08-26 15:14:22,189 INFO L495 AbstractCegarLoop]: Abstraction has has 38 places, 23 transitions, 119 flow [2023-08-26 15:14:22,189 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 80.5) internal successors, (322), 4 states have internal predecessors, (322), 0 states have call successors, (0), 0 states have 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:14:22,189 INFO L200 CegarLoopForPetriNet]: Found error trace [2023-08-26 15:14:22,189 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-08-26 15:14:22,189 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable7 [2023-08-26 15:14:22,190 INFO L420 AbstractCegarLoop]: === Iteration 9 === Targeting ULTIMATE.startErr4ASSERT_VIOLATIONASSERT === [P1Err0ASSERT_VIOLATIONASSERT, ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 6 more)] === [2023-08-26 15:14:22,190 INFO L145 PredicateUnifier]: Initialized classic predicate unifier [2023-08-26 15:14:22,190 INFO L85 PathProgramCache]: Analyzing trace with hash 195476934, now seen corresponding path program 1 times [2023-08-26 15:14:22,190 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-08-26 15:14:22,190 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [399457441] [2023-08-26 15:14:22,190 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-08-26 15:14:22,190 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-08-26 15:14:22,214 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-08-26 15:14:22,300 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-08-26 15:14:22,300 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-08-26 15:14:22,300 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [399457441] [2023-08-26 15:14:22,300 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [399457441] provided 1 perfect and 0 imperfect interpolant sequences [2023-08-26 15:14:22,300 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-08-26 15:14:22,300 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2023-08-26 15:14:22,300 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1794561363] [2023-08-26 15:14:22,300 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-08-26 15:14:22,301 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2023-08-26 15:14:22,301 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-08-26 15:14:22,301 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2023-08-26 15:14:22,301 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=8, Invalid=12, Unknown=0, NotChecked=0, Total=20 [2023-08-26 15:14:22,301 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 78 out of 201 [2023-08-26 15:14:22,302 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 38 places, 23 transitions, 119 flow. Second operand has 5 states, 5 states have (on average 80.2) internal successors, (401), 5 states have internal predecessors, (401), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-26 15:14:22,302 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2023-08-26 15:14:22,302 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 78 of 201 [2023-08-26 15:14:22,302 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2023-08-26 15:14:22,346 INFO L124 PetriNetUnfolderBase]: 10/40 cut-off events. [2023-08-26 15:14:22,346 INFO L125 PetriNetUnfolderBase]: For 60/60 co-relation queries the response was YES. [2023-08-26 15:14:22,346 INFO L83 FinitePrefix]: Finished finitePrefix Result has 156 conditions, 40 events. 10/40 cut-off events. For 60/60 co-relation queries the response was YES. Maximal size of possible extension queue 5. Compared 61 event pairs, 0 based on Foata normal form. 6/46 useless extension candidates. Maximal degree in co-relation 144. Up to 16 conditions per place. [2023-08-26 15:14:22,346 INFO L140 encePairwiseOnDemand]: 196/201 looper letters, 17 selfloop transitions, 5 changer transitions 6/32 dead transitions. [2023-08-26 15:14:22,347 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 41 places, 32 transitions, 229 flow [2023-08-26 15:14:22,347 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2023-08-26 15:14:22,347 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 6 states. [2023-08-26 15:14:22,348 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6 states to 6 states and 494 transitions. [2023-08-26 15:14:22,348 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.4096185737976783 [2023-08-26 15:14:22,348 INFO L72 ComplementDD]: Start complementDD. Operand 6 states and 494 transitions. [2023-08-26 15:14:22,348 INFO L73 IsDeterministic]: Start isDeterministic. Operand 6 states and 494 transitions. [2023-08-26 15:14:22,348 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2023-08-26 15:14:22,348 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 6 states and 494 transitions. [2023-08-26 15:14:22,349 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 7 states, 6 states have (on average 82.33333333333333) internal successors, (494), 6 states have internal predecessors, (494), 0 states have call successors, (0), 0 states have 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:14:22,350 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 7 states, 7 states have (on average 201.0) internal successors, (1407), 7 states have internal predecessors, (1407), 0 states have call successors, (0), 0 states have 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:14:22,351 INFO L81 ComplementDD]: Finished complementDD. Result has 7 states, 7 states have (on average 201.0) internal successors, (1407), 7 states have internal predecessors, (1407), 0 states have call successors, (0), 0 states have 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:14:22,351 INFO L175 Difference]: Start difference. First operand has 38 places, 23 transitions, 119 flow. Second operand 6 states and 494 transitions. [2023-08-26 15:14:22,351 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 41 places, 32 transitions, 229 flow [2023-08-26 15:14:22,351 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 37 places, 32 transitions, 201 flow, removed 8 selfloop flow, removed 4 redundant places. [2023-08-26 15:14:22,352 INFO L231 Difference]: Finished difference. Result has 40 places, 23 transitions, 119 flow [2023-08-26 15:14:22,352 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=201, PETRI_DIFFERENCE_MINUEND_FLOW=99, PETRI_DIFFERENCE_MINUEND_PLACES=32, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=23, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=5, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=18, PETRI_DIFFERENCE_SUBTRAHEND_STATES=6, PETRI_FLOW=119, PETRI_PLACES=40, PETRI_TRANSITIONS=23} [2023-08-26 15:14:22,352 INFO L281 CegarLoopForPetriNet]: 30 programPoint places, 10 predicate places. [2023-08-26 15:14:22,352 INFO L495 AbstractCegarLoop]: Abstraction has has 40 places, 23 transitions, 119 flow [2023-08-26 15:14:22,353 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 80.2) internal successors, (401), 5 states have internal predecessors, (401), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-26 15:14:22,353 INFO L200 CegarLoopForPetriNet]: Found error trace [2023-08-26 15:14:22,353 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-08-26 15:14:22,353 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable8 [2023-08-26 15:14:22,353 INFO L420 AbstractCegarLoop]: === Iteration 10 === Targeting ULTIMATE.startErr4ASSERT_VIOLATIONASSERT === [P1Err0ASSERT_VIOLATIONASSERT, ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 6 more)] === [2023-08-26 15:14:22,353 INFO L145 PredicateUnifier]: Initialized classic predicate unifier [2023-08-26 15:14:22,353 INFO L85 PathProgramCache]: Analyzing trace with hash 1048972999, now seen corresponding path program 1 times [2023-08-26 15:14:22,353 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-08-26 15:14:22,353 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [48332786] [2023-08-26 15:14:22,353 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-08-26 15:14:22,353 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-08-26 15:14:22,370 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-08-26 15:14:22,847 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:14:22,847 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-08-26 15:14:22,849 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [48332786] [2023-08-26 15:14:22,849 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [48332786] provided 1 perfect and 0 imperfect interpolant sequences [2023-08-26 15:14:22,849 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-08-26 15:14:22,849 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2023-08-26 15:14:22,849 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [499613738] [2023-08-26 15:14:22,849 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-08-26 15:14:22,850 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2023-08-26 15:14:22,850 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-08-26 15:14:22,851 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2023-08-26 15:14:22,851 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=11, Invalid=19, Unknown=0, NotChecked=0, Total=30 [2023-08-26 15:14:22,851 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 79 out of 201 [2023-08-26 15:14:22,852 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 40 places, 23 transitions, 119 flow. Second operand has 6 states, 6 states have (on average 81.33333333333333) internal successors, (488), 6 states have internal predecessors, (488), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-26 15:14:22,852 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2023-08-26 15:14:22,852 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 79 of 201 [2023-08-26 15:14:22,852 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2023-08-26 15:14:22,937 INFO L124 PetriNetUnfolderBase]: 9/42 cut-off events. [2023-08-26 15:14:22,937 INFO L125 PetriNetUnfolderBase]: For 66/66 co-relation queries the response was YES. [2023-08-26 15:14:22,937 INFO L83 FinitePrefix]: Finished finitePrefix Result has 171 conditions, 42 events. 9/42 cut-off events. For 66/66 co-relation queries the response was YES. Maximal size of possible extension queue 5. Compared 69 event pairs, 1 based on Foata normal form. 1/43 useless extension candidates. Maximal degree in co-relation 159. Up to 21 conditions per place. [2023-08-26 15:14:22,937 INFO L140 encePairwiseOnDemand]: 195/201 looper letters, 13 selfloop transitions, 6 changer transitions 10/32 dead transitions. [2023-08-26 15:14:22,937 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 43 places, 32 transitions, 240 flow [2023-08-26 15:14:22,938 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2023-08-26 15:14:22,938 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 6 states. [2023-08-26 15:14:22,938 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6 states to 6 states and 497 transitions. [2023-08-26 15:14:22,939 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.412106135986733 [2023-08-26 15:14:22,939 INFO L72 ComplementDD]: Start complementDD. Operand 6 states and 497 transitions. [2023-08-26 15:14:22,939 INFO L73 IsDeterministic]: Start isDeterministic. Operand 6 states and 497 transitions. [2023-08-26 15:14:22,939 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2023-08-26 15:14:22,939 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 6 states and 497 transitions. [2023-08-26 15:14:22,940 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 7 states, 6 states have (on average 82.83333333333333) internal successors, (497), 6 states have internal predecessors, (497), 0 states have call successors, (0), 0 states have 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:14:22,941 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 7 states, 7 states have (on average 201.0) internal successors, (1407), 7 states have internal predecessors, (1407), 0 states have call successors, (0), 0 states have 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:14:22,941 INFO L81 ComplementDD]: Finished complementDD. Result has 7 states, 7 states have (on average 201.0) internal successors, (1407), 7 states have internal predecessors, (1407), 0 states have call successors, (0), 0 states have 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:14:22,941 INFO L175 Difference]: Start difference. First operand has 40 places, 23 transitions, 119 flow. Second operand 6 states and 497 transitions. [2023-08-26 15:14:22,941 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 43 places, 32 transitions, 240 flow [2023-08-26 15:14:22,942 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 38 places, 32 transitions, 205 flow, removed 12 selfloop flow, removed 5 redundant places. [2023-08-26 15:14:22,942 INFO L231 Difference]: Finished difference. Result has 40 places, 21 transitions, 110 flow [2023-08-26 15:14:22,942 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=201, PETRI_DIFFERENCE_MINUEND_FLOW=101, PETRI_DIFFERENCE_MINUEND_PLACES=33, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=23, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=6, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=17, PETRI_DIFFERENCE_SUBTRAHEND_STATES=6, PETRI_FLOW=110, PETRI_PLACES=40, PETRI_TRANSITIONS=21} [2023-08-26 15:14:22,943 INFO L281 CegarLoopForPetriNet]: 30 programPoint places, 10 predicate places. [2023-08-26 15:14:22,943 INFO L495 AbstractCegarLoop]: Abstraction has has 40 places, 21 transitions, 110 flow [2023-08-26 15:14:22,943 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 81.33333333333333) internal successors, (488), 6 states have internal predecessors, (488), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-26 15:14:22,943 INFO L200 CegarLoopForPetriNet]: Found error trace [2023-08-26 15:14:22,943 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-08-26 15:14:22,943 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable9 [2023-08-26 15:14:22,943 INFO L420 AbstractCegarLoop]: === Iteration 11 === Targeting ULTIMATE.startErr4ASSERT_VIOLATIONASSERT === [P1Err0ASSERT_VIOLATIONASSERT, ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 6 more)] === [2023-08-26 15:14:22,943 INFO L145 PredicateUnifier]: Initialized classic predicate unifier [2023-08-26 15:14:22,943 INFO L85 PathProgramCache]: Analyzing trace with hash 1278345593, now seen corresponding path program 2 times [2023-08-26 15:14:22,944 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-08-26 15:14:22,944 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [24036277] [2023-08-26 15:14:22,944 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-08-26 15:14:22,944 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-08-26 15:14:22,963 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2023-08-26 15:14:22,963 INFO L356 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2023-08-26 15:14:22,980 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2023-08-26 15:14:22,998 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2023-08-26 15:14:22,998 INFO L360 BasicCegarLoop]: Counterexample is feasible [2023-08-26 15:14:22,999 INFO L805 garLoopResultBuilder]: Registering result UNSAFE for location ULTIMATE.startErr4ASSERT_VIOLATIONASSERT (8 of 9 remaining) [2023-08-26 15:14:23,000 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location P1Err0ASSERT_VIOLATIONASSERT (7 of 9 remaining) [2023-08-26 15:14:23,000 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE (6 of 9 remaining) [2023-08-26 15:14:23,001 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE (5 of 9 remaining) [2023-08-26 15:14:23,001 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (4 of 9 remaining) [2023-08-26 15:14:23,001 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr3REQUIRES_VIOLATIONMEMORY_DEREFERENCE (3 of 9 remaining) [2023-08-26 15:14:23,001 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (2 of 9 remaining) [2023-08-26 15:14:23,001 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (1 of 9 remaining) [2023-08-26 15:14:23,001 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location P1Err0ASSERT_VIOLATIONASSERT (0 of 9 remaining) [2023-08-26 15:14:23,001 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable10 [2023-08-26 15:14:23,001 INFO L445 BasicCegarLoop]: Path program histogram: [2, 2, 1, 1, 1, 1, 1, 1, 1] [2023-08-26 15:14:23,005 INFO L228 ceAbstractionStarter]: Analysis of concurrent program completed with 1 thread instances [2023-08-26 15:14:23,005 INFO L178 ceAbstractionStarter]: Computing trace abstraction results [2023-08-26 15:14:23,041 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 26.08 03:14:23 BasicIcfg [2023-08-26 15:14:23,041 INFO L131 PluginConnector]: ------------------------ END TraceAbstraction---------------------------- [2023-08-26 15:14:23,041 INFO L158 Benchmark]: Toolchain (without parser) took 7573.61ms. Allocated memory was 379.6MB in the beginning and 635.4MB in the end (delta: 255.9MB). Free memory was 354.0MB in the beginning and 542.2MB in the end (delta: -188.2MB). Peak memory consumption was 69.7MB. Max. memory is 16.0GB. [2023-08-26 15:14:23,042 INFO L158 Benchmark]: CDTParser took 0.10ms. Allocated memory is still 379.6MB. Free memory is still 355.8MB. There was no memory consumed. Max. memory is 16.0GB. [2023-08-26 15:14:23,042 INFO L158 Benchmark]: CACSL2BoogieTranslator took 361.29ms. Allocated memory is still 379.6MB. Free memory was 354.0MB in the beginning and 331.0MB in the end (delta: 22.9MB). Peak memory consumption was 23.1MB. Max. memory is 16.0GB. [2023-08-26 15:14:23,042 INFO L158 Benchmark]: Boogie Procedure Inliner took 42.05ms. Allocated memory is still 379.6MB. Free memory was 331.0MB in the beginning and 328.4MB in the end (delta: 2.7MB). Peak memory consumption was 2.1MB. Max. memory is 16.0GB. [2023-08-26 15:14:23,042 INFO L158 Benchmark]: Boogie Preprocessor took 25.41ms. Allocated memory is still 379.6MB. Free memory was 328.4MB in the beginning and 326.9MB in the end (delta: 1.5MB). Peak memory consumption was 2.1MB. Max. memory is 16.0GB. [2023-08-26 15:14:23,042 INFO L158 Benchmark]: RCFGBuilder took 470.46ms. Allocated memory is still 379.6MB. Free memory was 326.4MB in the beginning and 347.8MB in the end (delta: -21.4MB). Peak memory consumption was 31.5MB. Max. memory is 16.0GB. [2023-08-26 15:14:23,042 INFO L158 Benchmark]: TraceAbstraction took 6671.04ms. Allocated memory was 379.6MB in the beginning and 635.4MB in the end (delta: 255.9MB). Free memory was 346.8MB in the beginning and 542.2MB in the end (delta: -195.4MB). Peak memory consumption was 61.3MB. Max. memory is 16.0GB. [2023-08-26 15:14:23,043 INFO L338 ainManager$Toolchain]: ####################### End [Toolchain 1] ####################### --- Results --- * Results from de.uni_freiburg.informatik.ultimate.core: - StatisticsResult: Toolchain Benchmarks Benchmark results are: * CDTParser took 0.10ms. Allocated memory is still 379.6MB. Free memory is still 355.8MB. There was no memory consumed. Max. memory is 16.0GB. * CACSL2BoogieTranslator took 361.29ms. Allocated memory is still 379.6MB. Free memory was 354.0MB in the beginning and 331.0MB in the end (delta: 22.9MB). Peak memory consumption was 23.1MB. Max. memory is 16.0GB. * Boogie Procedure Inliner took 42.05ms. Allocated memory is still 379.6MB. Free memory was 331.0MB in the beginning and 328.4MB in the end (delta: 2.7MB). Peak memory consumption was 2.1MB. Max. memory is 16.0GB. * Boogie Preprocessor took 25.41ms. Allocated memory is still 379.6MB. Free memory was 328.4MB in the beginning and 326.9MB in the end (delta: 1.5MB). Peak memory consumption was 2.1MB. Max. memory is 16.0GB. * RCFGBuilder took 470.46ms. Allocated memory is still 379.6MB. Free memory was 326.4MB in the beginning and 347.8MB in the end (delta: -21.4MB). Peak memory consumption was 31.5MB. Max. memory is 16.0GB. * TraceAbstraction took 6671.04ms. Allocated memory was 379.6MB in the beginning and 635.4MB in the end (delta: 255.9MB). Free memory was 346.8MB in the beginning and 542.2MB in the end (delta: -195.4MB). Peak memory consumption was 61.3MB. 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.4s, 100 PlacesBefore, 30 PlacesAfterwards, 96 TransitionsBefore, 23 TransitionsAfterwards, 1320 CoEnabledTransitionPairs, 6 FixpointIterations, 43 TrivialSequentialCompositions, 45 ConcurrentSequentialCompositions, 0 TrivialYvCompositions, 12 ConcurrentYvCompositions, 3 ChoiceCompositions, 103 TotalNumberOfCompositions, 3751 MoverChecksTotal, Independence Relation Statistics: CachedIndependenceRelation.Independence Queries: [ total: 1772, independent: 1621, independent conditional: 0, independent unconditional: 1621, dependent: 151, dependent conditional: 0, dependent unconditional: 151, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , CachedIndependenceRelation.Statistics on underlying relation: SyntacticIndependenceRelation.Independence Queries: [ total: 766, independent: 712, independent conditional: 0, independent unconditional: 712, dependent: 54, dependent conditional: 0, dependent unconditional: 54, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , Cache Queries: [ total: 1772, independent: 909, independent conditional: 0, independent unconditional: 909, dependent: 97, dependent conditional: 0, dependent unconditional: 97, unknown: 766, unknown conditional: 0, unknown unconditional: 766] , Statistics on independence cache: Total cache size (in pairs): 58, Positive cache size: 43, Positive conditional cache size: 0, Positive unconditional cache size: 43, Negative cache size: 15, Negative conditional cache size: 0, Negative unconditional cache size: 15, 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: [L708] 0 int __unbuffered_cnt = 0; [L710] 0 int __unbuffered_p1_EAX = 0; [L712] 0 int __unbuffered_p1_EBX = 0; [L713] 0 _Bool main$tmp_guard0; [L714] 0 _Bool main$tmp_guard1; [L716] 0 int x = 0; [L717] 0 _Bool x$flush_delayed; [L718] 0 int x$mem_tmp; [L719] 0 _Bool x$r_buff0_thd0; [L720] 0 _Bool x$r_buff0_thd1; [L721] 0 _Bool x$r_buff0_thd2; [L722] 0 _Bool x$r_buff1_thd0; [L723] 0 _Bool x$r_buff1_thd1; [L724] 0 _Bool x$r_buff1_thd2; [L725] 0 _Bool x$read_delayed; [L726] 0 int *x$read_delayed_var; [L727] 0 int x$w_buff0; [L728] 0 _Bool x$w_buff0_used; [L729] 0 int x$w_buff1; [L730] 0 _Bool x$w_buff1_used; [L732] 0 int y = 0; [L733] 0 _Bool weak$$choice0; [L734] 0 _Bool weak$$choice2; [L800] 0 pthread_t t1587; [L801] FCALL, FORK 0 pthread_create(&t1587, ((void *)0), P0, ((void *)0)) VAL [__unbuffered_cnt=0, __unbuffered_p1_EAX=0, __unbuffered_p1_EBX=0, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, pthread_create(&t1587, ((void *)0), P0, ((void *)0))=-1, t1587={5:0}, weak$$choice0=0, weak$$choice2=0, x$flush_delayed=0, x$mem_tmp=0, x$r_buff0_thd0=0, x$r_buff0_thd1=0, x$r_buff0_thd2=0, x$r_buff1_thd0=0, x$r_buff1_thd1=0, x$r_buff1_thd2=0, x$read_delayed=0, x$read_delayed_var={0:0}, x$w_buff0=0, x$w_buff0_used=0, x$w_buff1=0, x$w_buff1_used=0, x=0, y=0] [L802] 0 pthread_t t1588; [L803] FCALL, FORK 0 pthread_create(&t1588, ((void *)0), P1, ((void *)0)) VAL [__unbuffered_cnt=0, __unbuffered_p1_EAX=0, __unbuffered_p1_EBX=0, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, pthread_create(&t1588, ((void *)0), P1, ((void *)0))=0, t1587={5:0}, t1588={3:0}, weak$$choice0=0, weak$$choice2=0, x$flush_delayed=0, x$mem_tmp=0, x$r_buff0_thd0=0, x$r_buff0_thd1=0, x$r_buff0_thd2=0, x$r_buff1_thd0=0, x$r_buff1_thd1=0, x$r_buff1_thd2=0, x$read_delayed=0, x$read_delayed_var={0:0}, x$w_buff0=0, x$w_buff0_used=0, x$w_buff1=0, x$w_buff1_used=0, x=0, y=0] [L758] 2 x$w_buff1 = x$w_buff0 [L759] 2 x$w_buff0 = 2 [L760] 2 x$w_buff1_used = x$w_buff0_used [L761] 2 x$w_buff0_used = (_Bool)1 [L762] CALL 2 __VERIFIER_assert(!(x$w_buff1_used && x$w_buff0_used)) [L18] COND FALSE 2 !(!expression) [L762] RET 2 __VERIFIER_assert(!(x$w_buff1_used && x$w_buff0_used)) [L763] 2 x$r_buff1_thd0 = x$r_buff0_thd0 [L764] 2 x$r_buff1_thd1 = x$r_buff0_thd1 [L765] 2 x$r_buff1_thd2 = x$r_buff0_thd2 [L766] 2 x$r_buff0_thd2 = (_Bool)1 VAL [__unbuffered_cnt=0, __unbuffered_p1_EAX=0, __unbuffered_p1_EBX=0, arg={0:0}, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=0, x$flush_delayed=0, x$mem_tmp=0, x$r_buff0_thd0=0, x$r_buff0_thd1=0, x$r_buff0_thd2=1, x$r_buff1_thd0=0, x$r_buff1_thd1=0, x$r_buff1_thd2=0, x$read_delayed=0, x$read_delayed_var={0:0}, x$w_buff0=2, x$w_buff0_used=1, x$w_buff1=0, x$w_buff1_used=0, x=0, y=0] [L769] 2 y = 1 VAL [__unbuffered_cnt=0, __unbuffered_p1_EAX=0, __unbuffered_p1_EBX=0, arg={0:0}, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=0, x$flush_delayed=0, x$mem_tmp=0, x$r_buff0_thd0=0, x$r_buff0_thd1=0, x$r_buff0_thd2=1, x$r_buff1_thd0=0, x$r_buff1_thd1=0, x$r_buff1_thd2=0, x$read_delayed=0, x$read_delayed_var={0:0}, x$w_buff0=2, x$w_buff0_used=1, x$w_buff1=0, x$w_buff1_used=0, x=0, y=1] [L772] 2 __unbuffered_p1_EAX = y VAL [__unbuffered_cnt=0, __unbuffered_p1_EAX=1, __unbuffered_p1_EBX=0, arg={0:0}, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=0, x$flush_delayed=0, x$mem_tmp=0, x$r_buff0_thd0=0, x$r_buff0_thd1=0, x$r_buff0_thd2=1, x$r_buff1_thd0=0, x$r_buff1_thd1=0, x$r_buff1_thd2=0, x$read_delayed=0, x$read_delayed_var={0:0}, x$w_buff0=2, x$w_buff0_used=1, x$w_buff1=0, x$w_buff1_used=0, x=0, y=1] [L775] 2 __unbuffered_p1_EBX = y VAL [__unbuffered_cnt=0, __unbuffered_p1_EAX=1, __unbuffered_p1_EBX=1, arg={0:0}, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=0, x$flush_delayed=0, x$mem_tmp=0, x$r_buff0_thd0=0, x$r_buff0_thd1=0, x$r_buff0_thd2=1, x$r_buff1_thd0=0, x$r_buff1_thd1=0, x$r_buff1_thd2=0, x$read_delayed=0, x$read_delayed_var={0:0}, x$w_buff0=2, x$w_buff0_used=1, x$w_buff1=0, x$w_buff1_used=0, x=0, y=1] [L738] 1 y = 2 VAL [__unbuffered_cnt=0, __unbuffered_p1_EAX=1, __unbuffered_p1_EBX=1, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=0, x$flush_delayed=0, x$mem_tmp=0, x$r_buff0_thd0=0, x$r_buff0_thd1=0, x$r_buff0_thd2=1, x$r_buff1_thd0=0, x$r_buff1_thd1=0, x$r_buff1_thd2=0, x$read_delayed=0, x$read_delayed_var={0:0}, x$w_buff0=2, x$w_buff0_used=1, x$w_buff1=0, x$w_buff1_used=0, x=0, y=2] [L741] 1 x = 1 VAL [__unbuffered_cnt=0, __unbuffered_p1_EAX=1, __unbuffered_p1_EBX=1, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=0, x$flush_delayed=0, x$mem_tmp=0, x$r_buff0_thd0=0, x$r_buff0_thd1=0, x$r_buff0_thd2=1, x$r_buff1_thd0=0, x$r_buff1_thd1=0, x$r_buff1_thd2=0, x$read_delayed=0, x$read_delayed_var={0:0}, x$w_buff0=2, x$w_buff0_used=1, x$w_buff1=0, x$w_buff1_used=0, x=1, y=2] [L778] 2 x = x$w_buff0_used && x$r_buff0_thd2 ? x$w_buff0 : (x$w_buff1_used && x$r_buff1_thd2 ? x$w_buff1 : x) [L779] 2 x$w_buff0_used = x$w_buff0_used && x$r_buff0_thd2 ? (_Bool)0 : x$w_buff0_used [L780] 2 x$w_buff1_used = x$w_buff0_used && x$r_buff0_thd2 || x$w_buff1_used && x$r_buff1_thd2 ? (_Bool)0 : x$w_buff1_used [L781] 2 x$r_buff0_thd2 = x$w_buff0_used && x$r_buff0_thd2 ? (_Bool)0 : x$r_buff0_thd2 [L782] 2 x$r_buff1_thd2 = x$w_buff0_used && x$r_buff0_thd2 || x$w_buff1_used && x$r_buff1_thd2 ? (_Bool)0 : x$r_buff1_thd2 VAL [__unbuffered_cnt=0, __unbuffered_p1_EAX=1, __unbuffered_p1_EBX=1, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=0, x$flush_delayed=0, x$mem_tmp=0, x$r_buff0_thd0=0, x$r_buff0_thd1=0, x$r_buff0_thd2=1, x$r_buff1_thd0=0, x$r_buff1_thd1=0, x$r_buff1_thd2=0, x$read_delayed=0, x$read_delayed_var={0:0}, x$w_buff0=2, x$w_buff0_used=0, x$w_buff1=0, x$w_buff1_used=0, x=2, y=2] [L785] 2 __unbuffered_cnt = __unbuffered_cnt + 1 [L787] 2 return 0; [L744] 1 x = x$w_buff0_used && x$r_buff0_thd1 ? x$w_buff0 : (x$w_buff1_used && x$r_buff1_thd1 ? x$w_buff1 : x) [L745] 1 x$w_buff0_used = x$w_buff0_used && x$r_buff0_thd1 ? (_Bool)0 : x$w_buff0_used [L746] 1 x$w_buff1_used = x$w_buff0_used && x$r_buff0_thd1 || x$w_buff1_used && x$r_buff1_thd1 ? (_Bool)0 : x$w_buff1_used [L747] 1 x$r_buff0_thd1 = x$w_buff0_used && x$r_buff0_thd1 ? (_Bool)0 : x$r_buff0_thd1 [L748] 1 x$r_buff1_thd1 = x$w_buff0_used && x$r_buff0_thd1 || x$w_buff1_used && x$r_buff1_thd1 ? (_Bool)0 : x$r_buff1_thd1 VAL [__unbuffered_cnt=1, __unbuffered_p1_EAX=1, __unbuffered_p1_EBX=1, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=0, x$flush_delayed=0, x$mem_tmp=0, x$r_buff0_thd0=0, x$r_buff0_thd1=0, x$r_buff0_thd2=1, x$r_buff1_thd0=0, x$r_buff1_thd1=0, x$r_buff1_thd2=0, x$read_delayed=0, x$read_delayed_var={0:0}, x$w_buff0=2, x$w_buff0_used=0, x$w_buff1=0, x$w_buff1_used=0, x=2, y=2] [L751] 1 __unbuffered_cnt = __unbuffered_cnt + 1 [L753] 1 return 0; [L805] 0 main$tmp_guard0 = __unbuffered_cnt == 2 [L807] CALL 0 assume_abort_if_not(main$tmp_guard0) [L3] COND FALSE 0 !(!cond) [L807] RET 0 assume_abort_if_not(main$tmp_guard0) [L809] 0 x = x$w_buff0_used && x$r_buff0_thd0 ? x$w_buff0 : (x$w_buff1_used && x$r_buff1_thd0 ? x$w_buff1 : x) [L810] 0 x$w_buff0_used = x$w_buff0_used && x$r_buff0_thd0 ? (_Bool)0 : x$w_buff0_used [L811] 0 x$w_buff1_used = x$w_buff0_used && x$r_buff0_thd0 || x$w_buff1_used && x$r_buff1_thd0 ? (_Bool)0 : x$w_buff1_used [L812] 0 x$r_buff0_thd0 = x$w_buff0_used && x$r_buff0_thd0 ? (_Bool)0 : x$r_buff0_thd0 [L813] 0 x$r_buff1_thd0 = x$w_buff0_used && x$r_buff0_thd0 || x$w_buff1_used && x$r_buff1_thd0 ? (_Bool)0 : x$r_buff1_thd0 VAL [\result={0:0}, __unbuffered_cnt=2, __unbuffered_p1_EAX=1, __unbuffered_p1_EBX=1, arg={0:0}, arg={0:0}, main$tmp_guard0=1, main$tmp_guard1=0, t1587={5:0}, t1588={3:0}, weak$$choice0=0, weak$$choice2=0, x$flush_delayed=0, x$mem_tmp=0, x$r_buff0_thd0=0, x$r_buff0_thd1=0, x$r_buff0_thd2=1, x$r_buff1_thd0=0, x$r_buff1_thd1=0, x$r_buff1_thd2=0, x$read_delayed=0, x$read_delayed_var={0:0}, x$w_buff0=2, x$w_buff0_used=0, x$w_buff1=0, x$w_buff1_used=0, x=2, y=2] [L816] 0 weak$$choice0 = __VERIFIER_nondet_bool() [L817] 0 weak$$choice2 = __VERIFIER_nondet_bool() [L818] 0 x$flush_delayed = weak$$choice2 [L819] 0 x$mem_tmp = x [L820] 0 x = !x$w_buff0_used || !x$r_buff0_thd0 && !x$w_buff1_used || !x$r_buff0_thd0 && !x$r_buff1_thd0 ? x : (x$w_buff0_used && x$r_buff0_thd0 ? x$w_buff0 : x$w_buff1) [L821] 0 x$w_buff0 = weak$$choice2 ? x$w_buff0 : (!x$w_buff0_used || !x$r_buff0_thd0 && !x$w_buff1_used || !x$r_buff0_thd0 && !x$r_buff1_thd0 ? x$w_buff0 : (x$w_buff0_used && x$r_buff0_thd0 ? x$w_buff0 : x$w_buff0)) [L822] 0 x$w_buff1 = weak$$choice2 ? x$w_buff1 : (!x$w_buff0_used || !x$r_buff0_thd0 && !x$w_buff1_used || !x$r_buff0_thd0 && !x$r_buff1_thd0 ? x$w_buff1 : (x$w_buff0_used && x$r_buff0_thd0 ? x$w_buff1 : x$w_buff1)) [L823] 0 x$w_buff0_used = weak$$choice2 ? x$w_buff0_used : (!x$w_buff0_used || !x$r_buff0_thd0 && !x$w_buff1_used || !x$r_buff0_thd0 && !x$r_buff1_thd0 ? x$w_buff0_used : (x$w_buff0_used && x$r_buff0_thd0 ? (_Bool)0 : x$w_buff0_used)) [L824] 0 x$w_buff1_used = weak$$choice2 ? x$w_buff1_used : (!x$w_buff0_used || !x$r_buff0_thd0 && !x$w_buff1_used || !x$r_buff0_thd0 && !x$r_buff1_thd0 ? x$w_buff1_used : (x$w_buff0_used && x$r_buff0_thd0 ? (_Bool)0 : (_Bool)0)) [L825] 0 x$r_buff0_thd0 = weak$$choice2 ? x$r_buff0_thd0 : (!x$w_buff0_used || !x$r_buff0_thd0 && !x$w_buff1_used || !x$r_buff0_thd0 && !x$r_buff1_thd0 ? x$r_buff0_thd0 : (x$w_buff0_used && x$r_buff0_thd0 ? (_Bool)0 : x$r_buff0_thd0)) [L826] 0 x$r_buff1_thd0 = weak$$choice2 ? x$r_buff1_thd0 : (!x$w_buff0_used || !x$r_buff0_thd0 && !x$w_buff1_used || !x$r_buff0_thd0 && !x$r_buff1_thd0 ? x$r_buff1_thd0 : (x$w_buff0_used && x$r_buff0_thd0 ? (_Bool)0 : (_Bool)0)) [L827] 0 main$tmp_guard1 = !(x == 2 && y == 2 && __unbuffered_p1_EAX == 1 && __unbuffered_p1_EBX == 1) [L828] 0 x = x$flush_delayed ? x$mem_tmp : x [L829] 0 x$flush_delayed = (_Bool)0 [L831] 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", "rfi000_power.opt_pso.opt_rmo.opt.c", 8, __extension__ __PRETTY_FUNCTION__) VAL [\read(__PRETTY_FUNCTION__)={49:50}, \result={0:0}, __unbuffered_cnt=2, __unbuffered_p1_EAX=1, __unbuffered_p1_EBX=1, arg={0:0}, arg={0:0}, main$tmp_guard0=1, main$tmp_guard1=0, weak$$choice2=1, x$flush_delayed=0, x$mem_tmp=2, x$r_buff0_thd0=0, x$r_buff0_thd1=0, x$r_buff0_thd2=1, x$r_buff1_thd0=0, x$r_buff1_thd1=0, x$r_buff1_thd2=0, x$read_delayed=0, x$read_delayed_var={0:0}, x$w_buff0=2, x$w_buff0_used=0, x$w_buff1=0, x$w_buff1_used=0, x=2, y=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: 801]: 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: 803]: 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 5 procedures, 117 locations, 9 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: 6.6s, OverallIterations: 11, TraceHistogramMax: 1, PathProgramHistogramMax: 2, EmptinessCheckTime: 0.0s, AutomataDifference: 0.9s, DeadEndRemovalTime: 0.0s, HoareAnnotationTime: 0.0s, InitialAbstractionConstructionTime: 3.5s, HoareTripleCheckerStatistics: 0 mSolverCounterUnknown, 88 SdHoareTripleChecker+Valid, 0.4s IncrementalHoareTripleChecker+Time, 0 mSdLazyCounter, 88 mSDsluCounter, 18 SdHoareTripleChecker+Invalid, 0.3s Time, 0 mProtectedAction, 0 SdHoareTripleChecker+Unchecked, 0 IncrementalHoareTripleChecker+Unchecked, 5 mSDsCounter, 28 IncrementalHoareTripleChecker+Valid, 0 mProtectedPredicate, 363 IncrementalHoareTripleChecker+Invalid, 391 SdHoareTripleChecker+Unknown, 0 mSolverCounterNotChecked, 28 mSolverCounterUnsat, 13 mSDtfsCounter, 363 mSolverCounterSat, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Unknown, PredicateUnifierStatistics: 0 DeclaredPredicates, 32 GetRequests, 6 SyntacticMatches, 0 SemanticMatches, 26 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 3 ImplicationChecksByTransitivity, 0.2s Time, 0.0s BasicInterpolantAutomatonTime, BiggestAbstraction: size=183occurred in iteration=6, InterpolantAutomatonStates: 41, 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.2s SatisfiabilityAnalysisTime, 1.9s InterpolantComputationTime, 118 NumberOfCodeBlocks, 118 NumberOfCodeBlocksAsserted, 11 NumberOfCheckSat, 91 ConstructedInterpolants, 0 QuantifiedInterpolants, 809 SizeOfPredicates, 0 NumberOfNonLiveVariables, 0 ConjunctsInSsa, 0 ConjunctsInUnsatCore, 10 InterpolantComputations, 10 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:14:23,072 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...