/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/safe004_power.opt_pso.opt_rmo.opt.i -------------------------------------------------------------------------------- This is Ultimate 0.2.3-dev-ac9dbd0-m [2023-08-26 15:16:44,400 INFO L188 SettingsManager]: Resetting all preferences to default values... [2023-08-26 15:16:44,484 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:16:44,489 WARN L101 SettingsManager]: Preference file contains the following unknown settings: [2023-08-26 15:16:44,489 WARN L103 SettingsManager]: * de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.Checked method. Library mode if empty. [2023-08-26 15:16:44,519 INFO L130 SettingsManager]: Preferences different from defaults after loading the file: [2023-08-26 15:16:44,520 INFO L151 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2023-08-26 15:16:44,520 INFO L153 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2023-08-26 15:16:44,521 INFO L151 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2023-08-26 15:16:44,524 INFO L153 SettingsManager]: * Create parallel compositions if possible=false [2023-08-26 15:16:44,524 INFO L153 SettingsManager]: * Use SBE=true [2023-08-26 15:16:44,525 INFO L151 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2023-08-26 15:16:44,525 INFO L153 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2023-08-26 15:16:44,526 INFO L153 SettingsManager]: * sizeof long=4 [2023-08-26 15:16:44,526 INFO L153 SettingsManager]: * Overapproximate operations on floating types=true [2023-08-26 15:16:44,526 INFO L153 SettingsManager]: * sizeof POINTER=4 [2023-08-26 15:16:44,527 INFO L153 SettingsManager]: * Check division by zero=IGNORE [2023-08-26 15:16:44,527 INFO L153 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2023-08-26 15:16:44,527 INFO L153 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2023-08-26 15:16:44,527 INFO L153 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2023-08-26 15:16:44,527 INFO L153 SettingsManager]: * sizeof long double=12 [2023-08-26 15:16:44,528 INFO L153 SettingsManager]: * Check if freed pointer was valid=false [2023-08-26 15:16:44,528 INFO L153 SettingsManager]: * Use constant arrays=true [2023-08-26 15:16:44,529 INFO L151 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2023-08-26 15:16:44,529 INFO L153 SettingsManager]: * Size of a code block=SequenceOfStatements [2023-08-26 15:16:44,529 INFO L153 SettingsManager]: * To the following directory=./dump/ [2023-08-26 15:16:44,530 INFO L153 SettingsManager]: * SMT solver=External_DefaultMode [2023-08-26 15:16:44,530 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2023-08-26 15:16:44,530 INFO L151 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2023-08-26 15:16:44,530 INFO L153 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2023-08-26 15:16:44,531 INFO L153 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopsAndPotentialCycles [2023-08-26 15:16:44,531 INFO L153 SettingsManager]: * Trace refinement strategy=CAMEL [2023-08-26 15:16:44,531 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2023-08-26 15:16:44,532 INFO L153 SettingsManager]: * Automaton type used in concurrency analysis=PETRI_NET [2023-08-26 15:16:44,532 INFO L153 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2023-08-26 15:16:44,532 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:16:44,876 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2023-08-26 15:16:44,900 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2023-08-26 15:16:44,902 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2023-08-26 15:16:44,903 INFO L270 PluginConnector]: Initializing CDTParser... [2023-08-26 15:16:44,903 INFO L274 PluginConnector]: CDTParser initialized [2023-08-26 15:16:44,905 INFO L431 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../../../trunk/examples/svcomp/pthread-wmm/safe004_power.opt_pso.opt_rmo.opt.i [2023-08-26 15:16:46,082 INFO L533 CDTParser]: Created temporary CDT project at NULL [2023-08-26 15:16:46,407 INFO L384 CDTParser]: Found 1 translation units. [2023-08-26 15:16:46,407 INFO L180 CDTParser]: Scanning /storage/repos/ultimate/trunk/examples/svcomp/pthread-wmm/safe004_power.opt_pso.opt_rmo.opt.i [2023-08-26 15:16:46,423 INFO L427 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/070adbf3d/e124235a57e64ebaa1c17e950b09c9a1/FLAGb0e08d8cc [2023-08-26 15:16:46,437 INFO L435 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/070adbf3d/e124235a57e64ebaa1c17e950b09c9a1 [2023-08-26 15:16:46,439 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2023-08-26 15:16:46,441 INFO L133 ToolchainWalker]: Walking toolchain with 5 elements. [2023-08-26 15:16:46,442 INFO L112 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2023-08-26 15:16:46,442 INFO L270 PluginConnector]: Initializing CACSL2BoogieTranslator... [2023-08-26 15:16:46,444 INFO L274 PluginConnector]: CACSL2BoogieTranslator initialized [2023-08-26 15:16:46,445 INFO L184 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 26.08 03:16:46" (1/1) ... [2023-08-26 15:16:46,446 INFO L204 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@763d1c0 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 26.08 03:16:46, skipping insertion in model container [2023-08-26 15:16:46,446 INFO L184 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 26.08 03:16:46" (1/1) ... [2023-08-26 15:16:46,489 INFO L176 MainTranslator]: Built tables and reachable declarations [2023-08-26 15:16:46,768 INFO L209 PostProcessor]: Analyzing one entry point: main [2023-08-26 15:16:46,777 INFO L201 MainTranslator]: Completed pre-run [2023-08-26 15:16:46,795 WARN L75 lationResultReporter]: Unsoundness Warning: unspecified type, defaulting to int C: short [267] [2023-08-26 15:16:46,802 WARN L75 lationResultReporter]: Unsoundness Warning: unspecified type, defaulting to int C: short [267] [2023-08-26 15:16:46,856 INFO L209 PostProcessor]: Analyzing one entry point: main [2023-08-26 15:16:46,892 WARN L669 CHandler]: The function __VERIFIER_atomic_begin is called, but not defined or handled by StandardFunctionHandler. [2023-08-26 15:16:46,892 WARN L669 CHandler]: The function __VERIFIER_atomic_end is called, but not defined or handled by StandardFunctionHandler. [2023-08-26 15:16:46,898 INFO L206 MainTranslator]: Completed translation [2023-08-26 15:16:46,899 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 26.08 03:16:46 WrapperNode [2023-08-26 15:16:46,899 INFO L131 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2023-08-26 15:16:46,900 INFO L112 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2023-08-26 15:16:46,900 INFO L270 PluginConnector]: Initializing Boogie Procedure Inliner... [2023-08-26 15:16:46,900 INFO L274 PluginConnector]: Boogie Procedure Inliner initialized [2023-08-26 15:16:46,907 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:16:46" (1/1) ... [2023-08-26 15:16:46,938 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:16:46" (1/1) ... [2023-08-26 15:16:46,962 INFO L138 Inliner]: procedures = 176, calls = 55, calls flagged for inlining = 6, calls inlined = 7, statements flattened = 150 [2023-08-26 15:16:46,962 INFO L131 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2023-08-26 15:16:46,963 INFO L112 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2023-08-26 15:16:46,963 INFO L270 PluginConnector]: Initializing Boogie Preprocessor... [2023-08-26 15:16:46,963 INFO L274 PluginConnector]: Boogie Preprocessor initialized [2023-08-26 15:16:46,971 INFO L184 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 26.08 03:16:46" (1/1) ... [2023-08-26 15:16:46,971 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 26.08 03:16:46" (1/1) ... [2023-08-26 15:16:46,974 INFO L184 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 26.08 03:16:46" (1/1) ... [2023-08-26 15:16:46,974 INFO L184 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 26.08 03:16:46" (1/1) ... [2023-08-26 15:16:46,981 INFO L184 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 26.08 03:16:46" (1/1) ... [2023-08-26 15:16:46,983 INFO L184 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 26.08 03:16:46" (1/1) ... [2023-08-26 15:16:46,985 INFO L184 PluginConnector]: Executing the observer LTLStepAnnotator from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 26.08 03:16:46" (1/1) ... [2023-08-26 15:16:46,987 INFO L184 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 26.08 03:16:46" (1/1) ... [2023-08-26 15:16:46,990 INFO L131 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2023-08-26 15:16:46,991 INFO L112 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2023-08-26 15:16:46,991 INFO L270 PluginConnector]: Initializing RCFGBuilder... [2023-08-26 15:16:46,991 INFO L274 PluginConnector]: RCFGBuilder initialized [2023-08-26 15:16:46,992 INFO L184 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 26.08 03:16:46" (1/1) ... [2023-08-26 15:16:47,000 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2023-08-26 15:16:47,010 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2023-08-26 15:16:47,025 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:16:47,031 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:16:47,058 INFO L130 BoogieDeclarations]: Found specification of procedure write~int [2023-08-26 15:16:47,058 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_atomic_begin [2023-08-26 15:16:47,058 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2023-08-26 15:16:47,058 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnStack [2023-08-26 15:16:47,058 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.dealloc [2023-08-26 15:16:47,058 INFO L130 BoogieDeclarations]: Found specification of procedure P0 [2023-08-26 15:16:47,059 INFO L138 BoogieDeclarations]: Found implementation of procedure P0 [2023-08-26 15:16:47,059 INFO L130 BoogieDeclarations]: Found specification of procedure P1 [2023-08-26 15:16:47,059 INFO L138 BoogieDeclarations]: Found implementation of procedure P1 [2023-08-26 15:16:47,060 INFO L130 BoogieDeclarations]: Found specification of procedure P2 [2023-08-26 15:16:47,060 INFO L138 BoogieDeclarations]: Found implementation of procedure P2 [2023-08-26 15:16:47,060 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int [2023-08-26 15:16:47,060 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_atomic_end [2023-08-26 15:16:47,060 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2023-08-26 15:16:47,060 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2023-08-26 15:16:47,062 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:16:47,176 INFO L236 CfgBuilder]: Building ICFG [2023-08-26 15:16:47,178 INFO L262 CfgBuilder]: Building CFG for each procedure with an implementation [2023-08-26 15:16:47,449 INFO L277 CfgBuilder]: Performing block encoding [2023-08-26 15:16:47,616 INFO L297 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2023-08-26 15:16:47,616 INFO L302 CfgBuilder]: Removed 0 assume(true) statements. [2023-08-26 15:16:47,618 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 26.08 03:16:47 BoogieIcfgContainer [2023-08-26 15:16:47,618 INFO L131 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2023-08-26 15:16:47,621 INFO L112 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2023-08-26 15:16:47,621 INFO L270 PluginConnector]: Initializing TraceAbstraction... [2023-08-26 15:16:47,623 INFO L274 PluginConnector]: TraceAbstraction initialized [2023-08-26 15:16:47,624 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 26.08 03:16:46" (1/3) ... [2023-08-26 15:16:47,624 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@4e3485dd and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 26.08 03:16:47, skipping insertion in model container [2023-08-26 15:16:47,625 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 26.08 03:16:46" (2/3) ... [2023-08-26 15:16:47,625 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@4e3485dd and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 26.08 03:16:47, skipping insertion in model container [2023-08-26 15:16:47,625 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 26.08 03:16:47" (3/3) ... [2023-08-26 15:16:47,626 INFO L112 eAbstractionObserver]: Analyzing ICFG safe004_power.opt_pso.opt_rmo.opt.i [2023-08-26 15:16:47,642 INFO L203 ceAbstractionStarter]: Automizer settings: Hoare:false NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2023-08-26 15:16:47,642 INFO L162 ceAbstractionStarter]: Applying trace abstraction to program that has 8 error locations. [2023-08-26 15:16:47,642 INFO L515 ceAbstractionStarter]: Constructing petrified ICFG for 1 thread instances. [2023-08-26 15:16:47,693 INFO L144 ThreadInstanceAdder]: Constructed 0 joinOtherThreadTransitions. [2023-08-26 15:16:47,731 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 124 places, 117 transitions, 249 flow [2023-08-26 15:16:47,785 INFO L124 PetriNetUnfolderBase]: 3/114 cut-off events. [2023-08-26 15:16:47,785 INFO L125 PetriNetUnfolderBase]: For 0/0 co-relation queries the response was YES. [2023-08-26 15:16:47,790 INFO L83 FinitePrefix]: Finished finitePrefix Result has 124 conditions, 114 events. 3/114 cut-off events. For 0/0 co-relation queries the response was YES. Maximal size of possible extension queue 4. Compared 89 event pairs, 0 based on Foata normal form. 0/103 useless extension candidates. Maximal degree in co-relation 77. Up to 2 conditions per place. [2023-08-26 15:16:47,790 INFO L82 GeneralOperation]: Start removeDead. Operand has 124 places, 117 transitions, 249 flow [2023-08-26 15:16:47,794 INFO L88 GeneralOperation]: Finished RemoveDead, result has has 121 places, 114 transitions, 237 flow [2023-08-26 15:16:47,797 INFO L124 etLargeBlockEncoding]: Petri net LBE is using variable-based independence relation. [2023-08-26 15:16:47,813 INFO L131 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 121 places, 114 transitions, 237 flow [2023-08-26 15:16:47,816 INFO L113 LiptonReduction]: Starting Lipton reduction on Petri net that has 121 places, 114 transitions, 237 flow [2023-08-26 15:16:47,816 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 121 places, 114 transitions, 237 flow [2023-08-26 15:16:47,847 INFO L124 PetriNetUnfolderBase]: 3/114 cut-off events. [2023-08-26 15:16:47,847 INFO L125 PetriNetUnfolderBase]: For 0/0 co-relation queries the response was YES. [2023-08-26 15:16:47,848 INFO L83 FinitePrefix]: Finished finitePrefix Result has 124 conditions, 114 events. 3/114 cut-off events. For 0/0 co-relation queries the response was YES. Maximal size of possible extension queue 4. Compared 90 event pairs, 0 based on Foata normal form. 0/103 useless extension candidates. Maximal degree in co-relation 77. Up to 2 conditions per place. [2023-08-26 15:16:47,850 INFO L119 LiptonReduction]: Number of co-enabled transitions 2170 [2023-08-26 15:16:52,421 INFO L134 LiptonReduction]: Checked pairs total: 6191 [2023-08-26 15:16:52,422 INFO L136 LiptonReduction]: Total number of compositions: 120 [2023-08-26 15:16:52,433 INFO L356 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2023-08-26 15:16:52,439 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;@35d7a371, mLbeIndependenceSettings=[IndependenceType=SYNTACTIC, AbstractionType=NONE, UseConditional=, UseSemiCommutativity=, Solver=, SolverTimeout=] [2023-08-26 15:16:52,439 INFO L358 AbstractCegarLoop]: Starting to check reachability of 12 error locations. [2023-08-26 15:16:52,441 INFO L185 PetriNetUnfolderBase]: Found word, exiting Unfolder. [2023-08-26 15:16:52,441 INFO L124 PetriNetUnfolderBase]: 0/1 cut-off events. [2023-08-26 15:16:52,442 INFO L125 PetriNetUnfolderBase]: For 0/0 co-relation queries the response was YES. [2023-08-26 15:16:52,442 INFO L200 CegarLoopForPetriNet]: Found error trace [2023-08-26 15:16:52,442 INFO L208 CegarLoopForPetriNet]: trace histogram [1] [2023-08-26 15:16:52,443 INFO L420 AbstractCegarLoop]: === Iteration 1 === Targeting ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [P1Err0ASSERT_VIOLATIONASSERT, ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 9 more)] === [2023-08-26 15:16:52,447 INFO L145 PredicateUnifier]: Initialized classic predicate unifier [2023-08-26 15:16:52,447 INFO L85 PathProgramCache]: Analyzing trace with hash 537, now seen corresponding path program 1 times [2023-08-26 15:16:52,455 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-08-26 15:16:52,455 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [327181595] [2023-08-26 15:16:52,455 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-08-26 15:16:52,456 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-08-26 15:16:52,519 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-08-26 15:16:52,538 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:16:52,539 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-08-26 15:16:52,539 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [327181595] [2023-08-26 15:16:52,540 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [327181595] provided 1 perfect and 0 imperfect interpolant sequences [2023-08-26 15:16:52,540 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-08-26 15:16:52,540 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [0] imperfect sequences [] total 0 [2023-08-26 15:16:52,541 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1909246673] [2023-08-26 15:16:52,542 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-08-26 15:16:52,549 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 2 states [2023-08-26 15:16:52,553 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-08-26 15:16:52,572 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 2 interpolants. [2023-08-26 15:16:52,573 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=1, Invalid=1, Unknown=0, NotChecked=0, Total=2 [2023-08-26 15:16:52,574 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 103 out of 237 [2023-08-26 15:16:52,577 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 39 places, 29 transitions, 67 flow. Second operand has 2 states, 2 states have (on average 103.5) internal successors, (207), 2 states have internal predecessors, (207), 0 states have call successors, (0), 0 states have 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:16:52,577 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2023-08-26 15:16:52,577 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 103 of 237 [2023-08-26 15:16:52,578 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2023-08-26 15:16:52,852 INFO L124 PetriNetUnfolderBase]: 909/1382 cut-off events. [2023-08-26 15:16:52,853 INFO L125 PetriNetUnfolderBase]: For 20/20 co-relation queries the response was YES. [2023-08-26 15:16:52,859 INFO L83 FinitePrefix]: Finished finitePrefix Result has 2795 conditions, 1382 events. 909/1382 cut-off events. For 20/20 co-relation queries the response was YES. Maximal size of possible extension queue 88. Compared 6326 event pairs, 909 based on Foata normal form. 0/1194 useless extension candidates. Maximal degree in co-relation 2784. Up to 1359 conditions per place. [2023-08-26 15:16:52,867 INFO L140 encePairwiseOnDemand]: 231/237 looper letters, 20 selfloop transitions, 0 changer transitions 0/23 dead transitions. [2023-08-26 15:16:52,868 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 34 places, 23 transitions, 95 flow [2023-08-26 15:16:52,869 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2023-08-26 15:16:52,871 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 2 states. [2023-08-26 15:16:52,880 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2 states to 2 states and 232 transitions. [2023-08-26 15:16:52,883 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.48945147679324896 [2023-08-26 15:16:52,883 INFO L72 ComplementDD]: Start complementDD. Operand 2 states and 232 transitions. [2023-08-26 15:16:52,884 INFO L73 IsDeterministic]: Start isDeterministic. Operand 2 states and 232 transitions. [2023-08-26 15:16:52,885 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2023-08-26 15:16:52,887 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 2 states and 232 transitions. [2023-08-26 15:16:52,890 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 3 states, 2 states have (on average 116.0) internal successors, (232), 2 states have internal predecessors, (232), 0 states have call successors, (0), 0 states have 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:16:52,894 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 3 states, 3 states have (on average 237.0) internal successors, (711), 3 states have internal predecessors, (711), 0 states have call successors, (0), 0 states have 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:16:52,894 INFO L81 ComplementDD]: Finished complementDD. Result has 3 states, 3 states have (on average 237.0) internal successors, (711), 3 states have internal predecessors, (711), 0 states have call successors, (0), 0 states have 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:16:52,896 INFO L175 Difference]: Start difference. First operand has 39 places, 29 transitions, 67 flow. Second operand 2 states and 232 transitions. [2023-08-26 15:16:52,896 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 34 places, 23 transitions, 95 flow [2023-08-26 15:16:52,901 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 31 places, 23 transitions, 92 flow, removed 0 selfloop flow, removed 3 redundant places. [2023-08-26 15:16:52,902 INFO L231 Difference]: Finished difference. Result has 31 places, 23 transitions, 52 flow [2023-08-26 15:16:52,904 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=237, PETRI_DIFFERENCE_MINUEND_FLOW=52, PETRI_DIFFERENCE_MINUEND_PLACES=30, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=23, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=0, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=23, PETRI_DIFFERENCE_SUBTRAHEND_STATES=2, PETRI_FLOW=52, PETRI_PLACES=31, PETRI_TRANSITIONS=23} [2023-08-26 15:16:52,907 INFO L281 CegarLoopForPetriNet]: 39 programPoint places, -8 predicate places. [2023-08-26 15:16:52,907 INFO L495 AbstractCegarLoop]: Abstraction has has 31 places, 23 transitions, 52 flow [2023-08-26 15:16:52,908 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 2 states, 2 states have (on average 103.5) internal successors, (207), 2 states have internal predecessors, (207), 0 states have call successors, (0), 0 states have 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:16:52,908 INFO L200 CegarLoopForPetriNet]: Found error trace [2023-08-26 15:16:52,908 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1] [2023-08-26 15:16:52,908 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable0 [2023-08-26 15:16:52,908 INFO L420 AbstractCegarLoop]: === Iteration 2 === Targeting P1Err0ASSERT_VIOLATIONASSERT === [P1Err0ASSERT_VIOLATIONASSERT, ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 9 more)] === [2023-08-26 15:16:52,909 INFO L145 PredicateUnifier]: Initialized classic predicate unifier [2023-08-26 15:16:52,909 INFO L85 PathProgramCache]: Analyzing trace with hash 507011937, now seen corresponding path program 1 times [2023-08-26 15:16:52,909 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-08-26 15:16:52,909 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1474358328] [2023-08-26 15:16:52,909 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-08-26 15:16:52,910 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-08-26 15:16:52,957 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-08-26 15:16:53,214 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:16:53,215 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-08-26 15:16:53,215 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1474358328] [2023-08-26 15:16:53,215 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1474358328] provided 1 perfect and 0 imperfect interpolant sequences [2023-08-26 15:16:53,215 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-08-26 15:16:53,215 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [1] imperfect sequences [] total 1 [2023-08-26 15:16:53,215 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [602342765] [2023-08-26 15:16:53,216 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-08-26 15:16:53,216 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2023-08-26 15:16:53,217 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-08-26 15:16:53,217 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2023-08-26 15:16:53,218 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2023-08-26 15:16:53,220 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 102 out of 237 [2023-08-26 15:16:53,220 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 31 places, 23 transitions, 52 flow. Second operand has 3 states, 3 states have (on average 103.66666666666667) internal successors, (311), 3 states have internal predecessors, (311), 0 states have call successors, (0), 0 states have 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:16:53,220 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2023-08-26 15:16:53,220 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 102 of 237 [2023-08-26 15:16:53,221 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2023-08-26 15:16:53,422 INFO L124 PetriNetUnfolderBase]: 711/1126 cut-off events. [2023-08-26 15:16:53,423 INFO L125 PetriNetUnfolderBase]: For 0/0 co-relation queries the response was YES. [2023-08-26 15:16:53,425 INFO L83 FinitePrefix]: Finished finitePrefix Result has 2243 conditions, 1126 events. 711/1126 cut-off events. For 0/0 co-relation queries the response was YES. Maximal size of possible extension queue 74. Compared 5167 event pairs, 197 based on Foata normal form. 0/1057 useless extension candidates. Maximal degree in co-relation 2240. Up to 859 conditions per place. [2023-08-26 15:16:53,429 INFO L140 encePairwiseOnDemand]: 234/237 looper letters, 27 selfloop transitions, 2 changer transitions 2/34 dead transitions. [2023-08-26 15:16:53,430 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 32 places, 34 transitions, 138 flow [2023-08-26 15:16:53,430 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2023-08-26 15:16:53,431 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2023-08-26 15:16:53,434 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 338 transitions. [2023-08-26 15:16:53,436 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.47538677918424754 [2023-08-26 15:16:53,436 INFO L72 ComplementDD]: Start complementDD. Operand 3 states and 338 transitions. [2023-08-26 15:16:53,436 INFO L73 IsDeterministic]: Start isDeterministic. Operand 3 states and 338 transitions. [2023-08-26 15:16:53,437 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2023-08-26 15:16:53,437 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 3 states and 338 transitions. [2023-08-26 15:16:53,439 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 4 states, 3 states have (on average 112.66666666666667) internal successors, (338), 3 states have internal predecessors, (338), 0 states have call successors, (0), 0 states have 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:16:53,442 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 4 states, 4 states have (on average 237.0) internal successors, (948), 4 states have internal predecessors, (948), 0 states have call successors, (0), 0 states have 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:16:53,442 INFO L81 ComplementDD]: Finished complementDD. Result has 4 states, 4 states have (on average 237.0) internal successors, (948), 4 states have internal predecessors, (948), 0 states have call successors, (0), 0 states have 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:16:53,442 INFO L175 Difference]: Start difference. First operand has 31 places, 23 transitions, 52 flow. Second operand 3 states and 338 transitions. [2023-08-26 15:16:53,443 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 32 places, 34 transitions, 138 flow [2023-08-26 15:16:53,444 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 32 places, 34 transitions, 138 flow, removed 0 selfloop flow, removed 0 redundant places. [2023-08-26 15:16:53,446 INFO L231 Difference]: Finished difference. Result has 32 places, 21 transitions, 52 flow [2023-08-26 15:16:53,447 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=237, PETRI_DIFFERENCE_MINUEND_FLOW=50, PETRI_DIFFERENCE_MINUEND_PLACES=30, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=22, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=2, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=20, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=52, PETRI_PLACES=32, PETRI_TRANSITIONS=21} [2023-08-26 15:16:53,447 INFO L281 CegarLoopForPetriNet]: 39 programPoint places, -7 predicate places. [2023-08-26 15:16:53,448 INFO L495 AbstractCegarLoop]: Abstraction has has 32 places, 21 transitions, 52 flow [2023-08-26 15:16:53,448 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 103.66666666666667) internal successors, (311), 3 states have internal predecessors, (311), 0 states have call successors, (0), 0 states have 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:16:53,449 INFO L200 CegarLoopForPetriNet]: Found error trace [2023-08-26 15:16:53,449 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-08-26 15:16:53,449 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1 [2023-08-26 15:16:53,454 INFO L420 AbstractCegarLoop]: === Iteration 3 === Targeting ULTIMATE.startErr6ASSERT_VIOLATIONASSERT === [P1Err0ASSERT_VIOLATIONASSERT, ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 9 more)] === [2023-08-26 15:16:53,456 INFO L145 PredicateUnifier]: Initialized classic predicate unifier [2023-08-26 15:16:53,457 INFO L85 PathProgramCache]: Analyzing trace with hash -1106233306, now seen corresponding path program 1 times [2023-08-26 15:16:53,457 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-08-26 15:16:53,457 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1956589693] [2023-08-26 15:16:53,457 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-08-26 15:16:53,458 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-08-26 15:16:53,511 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-08-26 15:16:53,700 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:16:53,700 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-08-26 15:16:53,700 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1956589693] [2023-08-26 15:16:53,700 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1956589693] provided 1 perfect and 0 imperfect interpolant sequences [2023-08-26 15:16:53,700 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-08-26 15:16:53,700 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [1] imperfect sequences [] total 1 [2023-08-26 15:16:53,701 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [900772629] [2023-08-26 15:16:53,701 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-08-26 15:16:53,701 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2023-08-26 15:16:53,701 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-08-26 15:16:53,702 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2023-08-26 15:16:53,702 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2023-08-26 15:16:53,702 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 101 out of 237 [2023-08-26 15:16:53,703 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 32 places, 21 transitions, 52 flow. Second operand has 3 states, 3 states have (on average 104.0) internal successors, (312), 3 states have internal predecessors, (312), 0 states have call successors, (0), 0 states have 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:16:53,703 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2023-08-26 15:16:53,703 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 101 of 237 [2023-08-26 15:16:53,703 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2023-08-26 15:16:53,837 INFO L124 PetriNetUnfolderBase]: 631/968 cut-off events. [2023-08-26 15:16:53,837 INFO L125 PetriNetUnfolderBase]: For 77/77 co-relation queries the response was YES. [2023-08-26 15:16:53,839 INFO L83 FinitePrefix]: Finished finitePrefix Result has 2055 conditions, 968 events. 631/968 cut-off events. For 77/77 co-relation queries the response was YES. Maximal size of possible extension queue 58. Compared 4086 event pairs, 247 based on Foata normal form. 32/996 useless extension candidates. Maximal degree in co-relation 2051. Up to 609 conditions per place. [2023-08-26 15:16:53,843 INFO L140 encePairwiseOnDemand]: 234/237 looper letters, 25 selfloop transitions, 2 changer transitions 0/29 dead transitions. [2023-08-26 15:16:53,843 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 33 places, 29 transitions, 124 flow [2023-08-26 15:16:53,844 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2023-08-26 15:16:53,844 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2023-08-26 15:16:53,845 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 331 transitions. [2023-08-26 15:16:53,845 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.46554149085794655 [2023-08-26 15:16:53,845 INFO L72 ComplementDD]: Start complementDD. Operand 3 states and 331 transitions. [2023-08-26 15:16:53,845 INFO L73 IsDeterministic]: Start isDeterministic. Operand 3 states and 331 transitions. [2023-08-26 15:16:53,845 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2023-08-26 15:16:53,846 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 3 states and 331 transitions. [2023-08-26 15:16:53,846 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 4 states, 3 states have (on average 110.33333333333333) internal successors, (331), 3 states have internal predecessors, (331), 0 states have call successors, (0), 0 states have 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:16:53,848 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 4 states, 4 states have (on average 237.0) internal successors, (948), 4 states have internal predecessors, (948), 0 states have call successors, (0), 0 states have 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:16:53,848 INFO L81 ComplementDD]: Finished complementDD. Result has 4 states, 4 states have (on average 237.0) internal successors, (948), 4 states have internal predecessors, (948), 0 states have call successors, (0), 0 states have 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:16:53,848 INFO L175 Difference]: Start difference. First operand has 32 places, 21 transitions, 52 flow. Second operand 3 states and 331 transitions. [2023-08-26 15:16:53,849 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 33 places, 29 transitions, 124 flow [2023-08-26 15:16:53,849 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 31 places, 29 transitions, 118 flow, removed 0 selfloop flow, removed 2 redundant places. [2023-08-26 15:16:53,850 INFO L231 Difference]: Finished difference. Result has 32 places, 21 transitions, 56 flow [2023-08-26 15:16:53,850 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=237, PETRI_DIFFERENCE_MINUEND_FLOW=48, PETRI_DIFFERENCE_MINUEND_PLACES=29, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=21, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=2, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=19, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=56, PETRI_PLACES=32, PETRI_TRANSITIONS=21} [2023-08-26 15:16:53,851 INFO L281 CegarLoopForPetriNet]: 39 programPoint places, -7 predicate places. [2023-08-26 15:16:53,851 INFO L495 AbstractCegarLoop]: Abstraction has has 32 places, 21 transitions, 56 flow [2023-08-26 15:16:53,851 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 104.0) internal successors, (312), 3 states have internal predecessors, (312), 0 states have call successors, (0), 0 states have 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:16:53,851 INFO L200 CegarLoopForPetriNet]: Found error trace [2023-08-26 15:16:53,851 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-08-26 15:16:53,852 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2 [2023-08-26 15:16:53,852 INFO L420 AbstractCegarLoop]: === Iteration 4 === Targeting ULTIMATE.startErr6ASSERT_VIOLATIONASSERT === [P1Err0ASSERT_VIOLATIONASSERT, ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 9 more)] === [2023-08-26 15:16:53,852 INFO L145 PredicateUnifier]: Initialized classic predicate unifier [2023-08-26 15:16:53,852 INFO L85 PathProgramCache]: Analyzing trace with hash 2030766716, now seen corresponding path program 1 times [2023-08-26 15:16:53,852 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-08-26 15:16:53,853 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [392235952] [2023-08-26 15:16:53,853 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-08-26 15:16:53,853 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-08-26 15:16:53,881 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-08-26 15:16:54,432 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:16:54,433 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-08-26 15:16:54,433 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [392235952] [2023-08-26 15:16:54,433 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [392235952] provided 1 perfect and 0 imperfect interpolant sequences [2023-08-26 15:16:54,433 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-08-26 15:16:54,433 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2023-08-26 15:16:54,433 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [273788627] [2023-08-26 15:16:54,433 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-08-26 15:16:54,434 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2023-08-26 15:16:54,434 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-08-26 15:16:54,434 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2023-08-26 15:16:54,435 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2023-08-26 15:16:54,435 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 88 out of 237 [2023-08-26 15:16:54,436 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 32 places, 21 transitions, 56 flow. Second operand has 5 states, 5 states have (on average 90.2) internal successors, (451), 5 states have internal predecessors, (451), 0 states have call successors, (0), 0 states have 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:16:54,436 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2023-08-26 15:16:54,436 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 88 of 237 [2023-08-26 15:16:54,436 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2023-08-26 15:16:54,817 INFO L124 PetriNetUnfolderBase]: 1900/2843 cut-off events. [2023-08-26 15:16:54,818 INFO L125 PetriNetUnfolderBase]: For 263/263 co-relation queries the response was YES. [2023-08-26 15:16:54,822 INFO L83 FinitePrefix]: Finished finitePrefix Result has 6237 conditions, 2843 events. 1900/2843 cut-off events. For 263/263 co-relation queries the response was YES. Maximal size of possible extension queue 156. Compared 13743 event pairs, 208 based on Foata normal form. 106/2949 useless extension candidates. Maximal degree in co-relation 6232. Up to 1162 conditions per place. [2023-08-26 15:16:54,830 INFO L140 encePairwiseOnDemand]: 226/237 looper letters, 41 selfloop transitions, 12 changer transitions 7/60 dead transitions. [2023-08-26 15:16:54,830 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 36 places, 60 transitions, 267 flow [2023-08-26 15:16:54,830 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2023-08-26 15:16:54,831 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 5 states. [2023-08-26 15:16:54,832 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 503 transitions. [2023-08-26 15:16:54,832 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.42447257383966247 [2023-08-26 15:16:54,832 INFO L72 ComplementDD]: Start complementDD. Operand 5 states and 503 transitions. [2023-08-26 15:16:54,832 INFO L73 IsDeterministic]: Start isDeterministic. Operand 5 states and 503 transitions. [2023-08-26 15:16:54,833 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2023-08-26 15:16:54,833 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 5 states and 503 transitions. [2023-08-26 15:16:54,834 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 6 states, 5 states have (on average 100.6) internal successors, (503), 5 states have internal predecessors, (503), 0 states have call successors, (0), 0 states have 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:16:54,836 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 6 states, 6 states have (on average 237.0) internal successors, (1422), 6 states have internal predecessors, (1422), 0 states have call successors, (0), 0 states have 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:16:54,836 INFO L81 ComplementDD]: Finished complementDD. Result has 6 states, 6 states have (on average 237.0) internal successors, (1422), 6 states have internal predecessors, (1422), 0 states have call successors, (0), 0 states have 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:16:54,836 INFO L175 Difference]: Start difference. First operand has 32 places, 21 transitions, 56 flow. Second operand 5 states and 503 transitions. [2023-08-26 15:16:54,836 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 36 places, 60 transitions, 267 flow [2023-08-26 15:16:54,842 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 34 places, 60 transitions, 257 flow, removed 0 selfloop flow, removed 2 redundant places. [2023-08-26 15:16:54,843 INFO L231 Difference]: Finished difference. Result has 38 places, 31 transitions, 147 flow [2023-08-26 15:16:54,844 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=237, PETRI_DIFFERENCE_MINUEND_FLOW=52, PETRI_DIFFERENCE_MINUEND_PLACES=30, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=21, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=2, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=11, PETRI_DIFFERENCE_SUBTRAHEND_STATES=5, PETRI_FLOW=147, PETRI_PLACES=38, PETRI_TRANSITIONS=31} [2023-08-26 15:16:54,844 INFO L281 CegarLoopForPetriNet]: 39 programPoint places, -1 predicate places. [2023-08-26 15:16:54,844 INFO L495 AbstractCegarLoop]: Abstraction has has 38 places, 31 transitions, 147 flow [2023-08-26 15:16:54,845 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 90.2) internal successors, (451), 5 states have internal predecessors, (451), 0 states have call successors, (0), 0 states have 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:16:54,845 INFO L200 CegarLoopForPetriNet]: Found error trace [2023-08-26 15:16:54,845 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-08-26 15:16:54,845 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable3 [2023-08-26 15:16:54,845 INFO L420 AbstractCegarLoop]: === Iteration 5 === Targeting ULTIMATE.startErr6ASSERT_VIOLATIONASSERT === [P1Err0ASSERT_VIOLATIONASSERT, ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 9 more)] === [2023-08-26 15:16:54,846 INFO L145 PredicateUnifier]: Initialized classic predicate unifier [2023-08-26 15:16:54,846 INFO L85 PathProgramCache]: Analyzing trace with hash -570814383, now seen corresponding path program 1 times [2023-08-26 15:16:54,846 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-08-26 15:16:54,846 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1688964456] [2023-08-26 15:16:54,846 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-08-26 15:16:54,846 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-08-26 15:16:54,862 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-08-26 15:16:55,251 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:16:55,251 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-08-26 15:16:55,252 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1688964456] [2023-08-26 15:16:55,252 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1688964456] provided 1 perfect and 0 imperfect interpolant sequences [2023-08-26 15:16:55,252 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-08-26 15:16:55,252 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2023-08-26 15:16:55,252 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [349575490] [2023-08-26 15:16:55,252 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-08-26 15:16:55,253 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2023-08-26 15:16:55,253 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-08-26 15:16:55,253 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2023-08-26 15:16:55,253 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=8, Invalid=12, Unknown=0, NotChecked=0, Total=20 [2023-08-26 15:16:55,254 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 88 out of 237 [2023-08-26 15:16:55,255 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 38 places, 31 transitions, 147 flow. Second operand has 5 states, 5 states have (on average 90.4) internal successors, (452), 5 states have internal predecessors, (452), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-26 15:16:55,255 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2023-08-26 15:16:55,255 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 88 of 237 [2023-08-26 15:16:55,255 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2023-08-26 15:16:55,930 INFO L124 PetriNetUnfolderBase]: 2157/3265 cut-off events. [2023-08-26 15:16:55,931 INFO L125 PetriNetUnfolderBase]: For 2266/2266 co-relation queries the response was YES. [2023-08-26 15:16:55,938 INFO L83 FinitePrefix]: Finished finitePrefix Result has 9684 conditions, 3265 events. 2157/3265 cut-off events. For 2266/2266 co-relation queries the response was YES. Maximal size of possible extension queue 179. Compared 16127 event pairs, 238 based on Foata normal form. 96/3361 useless extension candidates. Maximal degree in co-relation 9676. Up to 1426 conditions per place. [2023-08-26 15:16:55,949 INFO L140 encePairwiseOnDemand]: 226/237 looper letters, 42 selfloop transitions, 24 changer transitions 35/101 dead transitions. [2023-08-26 15:16:55,949 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 44 places, 101 transitions, 627 flow [2023-08-26 15:16:55,950 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2023-08-26 15:16:55,950 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 7 states. [2023-08-26 15:16:55,952 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 7 states to 7 states and 702 transitions. [2023-08-26 15:16:55,952 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.4231464737793852 [2023-08-26 15:16:55,952 INFO L72 ComplementDD]: Start complementDD. Operand 7 states and 702 transitions. [2023-08-26 15:16:55,952 INFO L73 IsDeterministic]: Start isDeterministic. Operand 7 states and 702 transitions. [2023-08-26 15:16:55,953 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2023-08-26 15:16:55,953 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 7 states and 702 transitions. [2023-08-26 15:16:55,954 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 8 states, 7 states have (on average 100.28571428571429) internal successors, (702), 7 states have internal predecessors, (702), 0 states have call successors, (0), 0 states have 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:16:55,957 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 8 states, 8 states have (on average 237.0) internal successors, (1896), 8 states have internal predecessors, (1896), 0 states have call successors, (0), 0 states have 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:16:55,958 INFO L81 ComplementDD]: Finished complementDD. Result has 8 states, 8 states have (on average 237.0) internal successors, (1896), 8 states have internal predecessors, (1896), 0 states have call successors, (0), 0 states have 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:16:55,958 INFO L175 Difference]: Start difference. First operand has 38 places, 31 transitions, 147 flow. Second operand 7 states and 702 transitions. [2023-08-26 15:16:55,958 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 44 places, 101 transitions, 627 flow [2023-08-26 15:16:55,962 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 43 places, 101 transitions, 617 flow, removed 2 selfloop flow, removed 1 redundant places. [2023-08-26 15:16:55,963 INFO L231 Difference]: Finished difference. Result has 48 places, 43 transitions, 312 flow [2023-08-26 15:16:55,963 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=237, PETRI_DIFFERENCE_MINUEND_FLOW=142, PETRI_DIFFERENCE_MINUEND_PLACES=37, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=31, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=13, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=12, PETRI_DIFFERENCE_SUBTRAHEND_STATES=7, PETRI_FLOW=312, PETRI_PLACES=48, PETRI_TRANSITIONS=43} [2023-08-26 15:16:55,964 INFO L281 CegarLoopForPetriNet]: 39 programPoint places, 9 predicate places. [2023-08-26 15:16:55,964 INFO L495 AbstractCegarLoop]: Abstraction has has 48 places, 43 transitions, 312 flow [2023-08-26 15:16:55,964 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 90.4) internal successors, (452), 5 states have internal predecessors, (452), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-26 15:16:55,965 INFO L200 CegarLoopForPetriNet]: Found error trace [2023-08-26 15:16:55,965 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-08-26 15:16:55,965 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable4 [2023-08-26 15:16:55,965 INFO L420 AbstractCegarLoop]: === Iteration 6 === Targeting ULTIMATE.startErr6ASSERT_VIOLATIONASSERT === [P1Err0ASSERT_VIOLATIONASSERT, ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 9 more)] === [2023-08-26 15:16:55,965 INFO L145 PredicateUnifier]: Initialized classic predicate unifier [2023-08-26 15:16:55,965 INFO L85 PathProgramCache]: Analyzing trace with hash -1965150139, now seen corresponding path program 1 times [2023-08-26 15:16:55,966 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-08-26 15:16:55,966 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2013119138] [2023-08-26 15:16:55,966 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-08-26 15:16:55,966 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-08-26 15:16:55,986 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-08-26 15:16:56,371 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-08-26 15:16:56,372 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-08-26 15:16:56,372 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2013119138] [2023-08-26 15:16:56,372 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2013119138] provided 1 perfect and 0 imperfect interpolant sequences [2023-08-26 15:16:56,372 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-08-26 15:16:56,372 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2023-08-26 15:16:56,372 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [767019783] [2023-08-26 15:16:56,373 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-08-26 15:16:56,373 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2023-08-26 15:16:56,373 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-08-26 15:16:56,374 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2023-08-26 15:16:56,375 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=8, Invalid=12, Unknown=0, NotChecked=0, Total=20 [2023-08-26 15:16:56,376 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 98 out of 237 [2023-08-26 15:16:56,376 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 48 places, 43 transitions, 312 flow. Second operand has 5 states, 5 states have (on average 100.4) internal successors, (502), 5 states have internal predecessors, (502), 0 states have call successors, (0), 0 states have 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:16:56,376 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2023-08-26 15:16:56,376 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 98 of 237 [2023-08-26 15:16:56,377 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2023-08-26 15:16:56,694 INFO L124 PetriNetUnfolderBase]: 1262/2004 cut-off events. [2023-08-26 15:16:56,695 INFO L125 PetriNetUnfolderBase]: For 3862/3870 co-relation queries the response was YES. [2023-08-26 15:16:56,701 INFO L83 FinitePrefix]: Finished finitePrefix Result has 7350 conditions, 2004 events. 1262/2004 cut-off events. For 3862/3870 co-relation queries the response was YES. Maximal size of possible extension queue 112. Compared 9691 event pairs, 291 based on Foata normal form. 13/2017 useless extension candidates. Maximal degree in co-relation 7338. Up to 1717 conditions per place. [2023-08-26 15:16:56,710 INFO L140 encePairwiseOnDemand]: 229/237 looper letters, 68 selfloop transitions, 25 changer transitions 0/99 dead transitions. [2023-08-26 15:16:56,710 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 50 places, 99 transitions, 858 flow [2023-08-26 15:16:56,711 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2023-08-26 15:16:56,711 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 5 states. [2023-08-26 15:16:56,712 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 543 transitions. [2023-08-26 15:16:56,712 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.4582278481012658 [2023-08-26 15:16:56,712 INFO L72 ComplementDD]: Start complementDD. Operand 5 states and 543 transitions. [2023-08-26 15:16:56,712 INFO L73 IsDeterministic]: Start isDeterministic. Operand 5 states and 543 transitions. [2023-08-26 15:16:56,713 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2023-08-26 15:16:56,713 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 5 states and 543 transitions. [2023-08-26 15:16:56,714 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 6 states, 5 states have (on average 108.6) internal successors, (543), 5 states have internal predecessors, (543), 0 states have call successors, (0), 0 states have 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:16:56,716 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 6 states, 6 states have (on average 237.0) internal successors, (1422), 6 states have internal predecessors, (1422), 0 states have call successors, (0), 0 states have 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:16:56,716 INFO L81 ComplementDD]: Finished complementDD. Result has 6 states, 6 states have (on average 237.0) internal successors, (1422), 6 states have internal predecessors, (1422), 0 states have call successors, (0), 0 states have 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:16:56,716 INFO L175 Difference]: Start difference. First operand has 48 places, 43 transitions, 312 flow. Second operand 5 states and 543 transitions. [2023-08-26 15:16:56,716 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 50 places, 99 transitions, 858 flow [2023-08-26 15:16:56,738 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 48 places, 99 transitions, 850 flow, removed 4 selfloop flow, removed 2 redundant places. [2023-08-26 15:16:56,740 INFO L231 Difference]: Finished difference. Result has 51 places, 66 transitions, 593 flow [2023-08-26 15:16:56,740 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=237, PETRI_DIFFERENCE_MINUEND_FLOW=304, PETRI_DIFFERENCE_MINUEND_PLACES=44, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=43, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=9, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=26, PETRI_DIFFERENCE_SUBTRAHEND_STATES=5, PETRI_FLOW=593, PETRI_PLACES=51, PETRI_TRANSITIONS=66} [2023-08-26 15:16:56,740 INFO L281 CegarLoopForPetriNet]: 39 programPoint places, 12 predicate places. [2023-08-26 15:16:56,741 INFO L495 AbstractCegarLoop]: Abstraction has has 51 places, 66 transitions, 593 flow [2023-08-26 15:16:56,741 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 100.4) internal successors, (502), 5 states have internal predecessors, (502), 0 states have call successors, (0), 0 states have 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:16:56,741 INFO L200 CegarLoopForPetriNet]: Found error trace [2023-08-26 15:16:56,741 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-08-26 15:16:56,741 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable5 [2023-08-26 15:16:56,742 INFO L420 AbstractCegarLoop]: === Iteration 7 === Targeting ULTIMATE.startErr6ASSERT_VIOLATIONASSERT === [P1Err0ASSERT_VIOLATIONASSERT, ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 9 more)] === [2023-08-26 15:16:56,742 INFO L145 PredicateUnifier]: Initialized classic predicate unifier [2023-08-26 15:16:56,742 INFO L85 PathProgramCache]: Analyzing trace with hash 1956948178, now seen corresponding path program 1 times [2023-08-26 15:16:56,742 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-08-26 15:16:56,742 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1993955655] [2023-08-26 15:16:56,742 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-08-26 15:16:56,743 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-08-26 15:16:56,774 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-08-26 15:16:56,896 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:16:56,896 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-08-26 15:16:56,896 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1993955655] [2023-08-26 15:16:56,897 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1993955655] provided 1 perfect and 0 imperfect interpolant sequences [2023-08-26 15:16:56,897 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-08-26 15:16:56,897 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2023-08-26 15:16:56,897 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [36647884] [2023-08-26 15:16:56,897 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-08-26 15:16:56,897 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2023-08-26 15:16:56,897 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-08-26 15:16:56,898 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2023-08-26 15:16:56,898 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2023-08-26 15:16:56,898 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 96 out of 237 [2023-08-26 15:16:56,899 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 51 places, 66 transitions, 593 flow. Second operand has 4 states, 4 states have (on average 99.25) internal successors, (397), 4 states have internal predecessors, (397), 0 states have call successors, (0), 0 states have 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:16:56,899 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2023-08-26 15:16:56,899 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 96 of 237 [2023-08-26 15:16:56,899 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2023-08-26 15:16:57,196 INFO L124 PetriNetUnfolderBase]: 845/1481 cut-off events. [2023-08-26 15:16:57,196 INFO L125 PetriNetUnfolderBase]: For 6280/6367 co-relation queries the response was YES. [2023-08-26 15:16:57,203 INFO L83 FinitePrefix]: Finished finitePrefix Result has 6084 conditions, 1481 events. 845/1481 cut-off events. For 6280/6367 co-relation queries the response was YES. Maximal size of possible extension queue 106. Compared 8239 event pairs, 98 based on Foata normal form. 253/1716 useless extension candidates. Maximal degree in co-relation 6070. Up to 828 conditions per place. [2023-08-26 15:16:57,209 INFO L140 encePairwiseOnDemand]: 231/237 looper letters, 117 selfloop transitions, 8 changer transitions 10/144 dead transitions. [2023-08-26 15:16:57,210 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 55 places, 144 transitions, 1513 flow [2023-08-26 15:16:57,210 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2023-08-26 15:16:57,210 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 5 states. [2023-08-26 15:16:57,212 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 532 transitions. [2023-08-26 15:16:57,212 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.4489451476793249 [2023-08-26 15:16:57,212 INFO L72 ComplementDD]: Start complementDD. Operand 5 states and 532 transitions. [2023-08-26 15:16:57,212 INFO L73 IsDeterministic]: Start isDeterministic. Operand 5 states and 532 transitions. [2023-08-26 15:16:57,212 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2023-08-26 15:16:57,212 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 5 states and 532 transitions. [2023-08-26 15:16:57,214 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 6 states, 5 states have (on average 106.4) internal successors, (532), 5 states have internal predecessors, (532), 0 states have call successors, (0), 0 states have 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:16:57,215 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 6 states, 6 states have (on average 237.0) internal successors, (1422), 6 states have internal predecessors, (1422), 0 states have call successors, (0), 0 states have 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:16:57,216 INFO L81 ComplementDD]: Finished complementDD. Result has 6 states, 6 states have (on average 237.0) internal successors, (1422), 6 states have internal predecessors, (1422), 0 states have call successors, (0), 0 states have 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:16:57,216 INFO L175 Difference]: Start difference. First operand has 51 places, 66 transitions, 593 flow. Second operand 5 states and 532 transitions. [2023-08-26 15:16:57,216 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 55 places, 144 transitions, 1513 flow [2023-08-26 15:16:57,222 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 55 places, 144 transitions, 1513 flow, removed 0 selfloop flow, removed 0 redundant places. [2023-08-26 15:16:57,224 INFO L231 Difference]: Finished difference. Result has 58 places, 70 transitions, 630 flow [2023-08-26 15:16:57,224 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=237, PETRI_DIFFERENCE_MINUEND_FLOW=558, PETRI_DIFFERENCE_MINUEND_PLACES=51, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=63, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=1, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=58, PETRI_DIFFERENCE_SUBTRAHEND_STATES=5, PETRI_FLOW=630, PETRI_PLACES=58, PETRI_TRANSITIONS=70} [2023-08-26 15:16:57,225 INFO L281 CegarLoopForPetriNet]: 39 programPoint places, 19 predicate places. [2023-08-26 15:16:57,225 INFO L495 AbstractCegarLoop]: Abstraction has has 58 places, 70 transitions, 630 flow [2023-08-26 15:16:57,225 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 99.25) internal successors, (397), 4 states have internal predecessors, (397), 0 states have call successors, (0), 0 states have 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:16:57,225 INFO L200 CegarLoopForPetriNet]: Found error trace [2023-08-26 15:16:57,225 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-08-26 15:16:57,225 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable6 [2023-08-26 15:16:57,226 INFO L420 AbstractCegarLoop]: === Iteration 8 === Targeting ULTIMATE.startErr6ASSERT_VIOLATIONASSERT === [P1Err0ASSERT_VIOLATIONASSERT, ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 9 more)] === [2023-08-26 15:16:57,226 INFO L145 PredicateUnifier]: Initialized classic predicate unifier [2023-08-26 15:16:57,226 INFO L85 PathProgramCache]: Analyzing trace with hash 1005310781, now seen corresponding path program 1 times [2023-08-26 15:16:57,226 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-08-26 15:16:57,226 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1909037905] [2023-08-26 15:16:57,226 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-08-26 15:16:57,226 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-08-26 15:16:57,260 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-08-26 15:16:57,463 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:16:57,464 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-08-26 15:16:57,464 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1909037905] [2023-08-26 15:16:57,464 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1909037905] provided 1 perfect and 0 imperfect interpolant sequences [2023-08-26 15:16:57,464 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-08-26 15:16:57,464 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2023-08-26 15:16:57,464 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1967166130] [2023-08-26 15:16:57,464 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-08-26 15:16:57,465 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2023-08-26 15:16:57,465 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-08-26 15:16:57,465 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2023-08-26 15:16:57,465 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=8, Invalid=12, Unknown=0, NotChecked=0, Total=20 [2023-08-26 15:16:57,466 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 96 out of 237 [2023-08-26 15:16:57,466 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 58 places, 70 transitions, 630 flow. Second operand has 5 states, 5 states have (on average 98.8) internal successors, (494), 5 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:16:57,467 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2023-08-26 15:16:57,467 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 96 of 237 [2023-08-26 15:16:57,467 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2023-08-26 15:16:57,737 INFO L124 PetriNetUnfolderBase]: 646/1207 cut-off events. [2023-08-26 15:16:57,737 INFO L125 PetriNetUnfolderBase]: For 6027/6118 co-relation queries the response was YES. [2023-08-26 15:16:57,741 INFO L83 FinitePrefix]: Finished finitePrefix Result has 5676 conditions, 1207 events. 646/1207 cut-off events. For 6027/6118 co-relation queries the response was YES. Maximal size of possible extension queue 91. Compared 6901 event pairs, 36 based on Foata normal form. 175/1369 useless extension candidates. Maximal degree in co-relation 5658. Up to 510 conditions per place. [2023-08-26 15:16:57,746 INFO L140 encePairwiseOnDemand]: 231/237 looper letters, 122 selfloop transitions, 15 changer transitions 20/166 dead transitions. [2023-08-26 15:16:57,746 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 64 places, 166 transitions, 1779 flow [2023-08-26 15:16:57,747 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2023-08-26 15:16:57,747 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 7 states. [2023-08-26 15:16:57,749 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 7 states to 7 states and 743 transitions. [2023-08-26 15:16:57,749 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.4478601567209162 [2023-08-26 15:16:57,749 INFO L72 ComplementDD]: Start complementDD. Operand 7 states and 743 transitions. [2023-08-26 15:16:57,749 INFO L73 IsDeterministic]: Start isDeterministic. Operand 7 states and 743 transitions. [2023-08-26 15:16:57,750 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2023-08-26 15:16:57,750 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 7 states and 743 transitions. [2023-08-26 15:16:57,751 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 8 states, 7 states have (on average 106.14285714285714) internal successors, (743), 7 states have internal predecessors, (743), 0 states have call successors, (0), 0 states have 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:16:57,753 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 8 states, 8 states have (on average 237.0) internal successors, (1896), 8 states have internal predecessors, (1896), 0 states have call successors, (0), 0 states have 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:16:57,754 INFO L81 ComplementDD]: Finished complementDD. Result has 8 states, 8 states have (on average 237.0) internal successors, (1896), 8 states have internal predecessors, (1896), 0 states have call successors, (0), 0 states have 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:16:57,754 INFO L175 Difference]: Start difference. First operand has 58 places, 70 transitions, 630 flow. Second operand 7 states and 743 transitions. [2023-08-26 15:16:57,754 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 64 places, 166 transitions, 1779 flow [2023-08-26 15:16:57,762 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 63 places, 166 transitions, 1775 flow, removed 0 selfloop flow, removed 1 redundant places. [2023-08-26 15:16:57,764 INFO L231 Difference]: Finished difference. Result has 66 places, 75 transitions, 700 flow [2023-08-26 15:16:57,765 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=237, PETRI_DIFFERENCE_MINUEND_FLOW=612, PETRI_DIFFERENCE_MINUEND_PLACES=57, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=69, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=11, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=57, PETRI_DIFFERENCE_SUBTRAHEND_STATES=7, PETRI_FLOW=700, PETRI_PLACES=66, PETRI_TRANSITIONS=75} [2023-08-26 15:16:57,765 INFO L281 CegarLoopForPetriNet]: 39 programPoint places, 27 predicate places. [2023-08-26 15:16:57,765 INFO L495 AbstractCegarLoop]: Abstraction has has 66 places, 75 transitions, 700 flow [2023-08-26 15:16:57,766 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 98.8) internal successors, (494), 5 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:16:57,766 INFO L200 CegarLoopForPetriNet]: Found error trace [2023-08-26 15:16:57,766 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-08-26 15:16:57,766 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable7 [2023-08-26 15:16:57,766 INFO L420 AbstractCegarLoop]: === Iteration 9 === Targeting ULTIMATE.startErr6ASSERT_VIOLATIONASSERT === [P1Err0ASSERT_VIOLATIONASSERT, ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 9 more)] === [2023-08-26 15:16:57,766 INFO L145 PredicateUnifier]: Initialized classic predicate unifier [2023-08-26 15:16:57,766 INFO L85 PathProgramCache]: Analyzing trace with hash -1859349059, now seen corresponding path program 1 times [2023-08-26 15:16:57,767 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-08-26 15:16:57,767 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [485805827] [2023-08-26 15:16:57,767 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-08-26 15:16:57,767 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-08-26 15:16:57,803 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-08-26 15:16:57,948 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:16:57,948 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-08-26 15:16:57,948 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [485805827] [2023-08-26 15:16:57,948 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [485805827] provided 1 perfect and 0 imperfect interpolant sequences [2023-08-26 15:16:57,948 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-08-26 15:16:57,948 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2023-08-26 15:16:57,948 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1277593230] [2023-08-26 15:16:57,949 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-08-26 15:16:57,949 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2023-08-26 15:16:57,949 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-08-26 15:16:57,949 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2023-08-26 15:16:57,950 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=12, Invalid=18, Unknown=0, NotChecked=0, Total=30 [2023-08-26 15:16:57,950 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 96 out of 237 [2023-08-26 15:16:57,951 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 66 places, 75 transitions, 700 flow. Second operand has 6 states, 6 states have (on average 98.66666666666667) internal successors, (592), 6 states have internal predecessors, (592), 0 states have call successors, (0), 0 states have 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:16:57,951 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2023-08-26 15:16:57,951 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 96 of 237 [2023-08-26 15:16:57,951 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2023-08-26 15:16:58,245 INFO L124 PetriNetUnfolderBase]: 601/1130 cut-off events. [2023-08-26 15:16:58,245 INFO L125 PetriNetUnfolderBase]: For 6147/6229 co-relation queries the response was YES. [2023-08-26 15:16:58,249 INFO L83 FinitePrefix]: Finished finitePrefix Result has 5808 conditions, 1130 events. 601/1130 cut-off events. For 6147/6229 co-relation queries the response was YES. Maximal size of possible extension queue 91. Compared 6533 event pairs, 31 based on Foata normal form. 91/1208 useless extension candidates. Maximal degree in co-relation 5787. Up to 461 conditions per place. [2023-08-26 15:16:58,253 INFO L140 encePairwiseOnDemand]: 231/237 looper letters, 117 selfloop transitions, 19 changer transitions 19/164 dead transitions. [2023-08-26 15:16:58,253 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 74 places, 164 transitions, 1803 flow [2023-08-26 15:16:58,253 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2023-08-26 15:16:58,253 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 9 states. [2023-08-26 15:16:58,255 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 9 states to 9 states and 936 transitions. [2023-08-26 15:16:58,256 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.4388185654008439 [2023-08-26 15:16:58,256 INFO L72 ComplementDD]: Start complementDD. Operand 9 states and 936 transitions. [2023-08-26 15:16:58,256 INFO L73 IsDeterministic]: Start isDeterministic. Operand 9 states and 936 transitions. [2023-08-26 15:16:58,257 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2023-08-26 15:16:58,257 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 9 states and 936 transitions. [2023-08-26 15:16:58,259 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 10 states, 9 states have (on average 104.0) internal successors, (936), 9 states have internal predecessors, (936), 0 states have call successors, (0), 0 states have 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:16:58,261 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 10 states, 10 states have (on average 237.0) internal successors, (2370), 10 states have internal predecessors, (2370), 0 states have call successors, (0), 0 states have 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:16:58,262 INFO L81 ComplementDD]: Finished complementDD. Result has 10 states, 10 states have (on average 237.0) internal successors, (2370), 10 states have internal predecessors, (2370), 0 states have call successors, (0), 0 states have 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:16:58,262 INFO L175 Difference]: Start difference. First operand has 66 places, 75 transitions, 700 flow. Second operand 9 states and 936 transitions. [2023-08-26 15:16:58,262 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 74 places, 164 transitions, 1803 flow [2023-08-26 15:16:58,284 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 71 places, 164 transitions, 1745 flow, removed 23 selfloop flow, removed 3 redundant places. [2023-08-26 15:16:58,286 INFO L231 Difference]: Finished difference. Result has 74 places, 74 transitions, 675 flow [2023-08-26 15:16:58,286 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=237, PETRI_DIFFERENCE_MINUEND_FLOW=614, PETRI_DIFFERENCE_MINUEND_PLACES=63, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=73, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=18, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=54, PETRI_DIFFERENCE_SUBTRAHEND_STATES=9, PETRI_FLOW=675, PETRI_PLACES=74, PETRI_TRANSITIONS=74} [2023-08-26 15:16:58,287 INFO L281 CegarLoopForPetriNet]: 39 programPoint places, 35 predicate places. [2023-08-26 15:16:58,287 INFO L495 AbstractCegarLoop]: Abstraction has has 74 places, 74 transitions, 675 flow [2023-08-26 15:16:58,287 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 98.66666666666667) internal successors, (592), 6 states have internal predecessors, (592), 0 states have call successors, (0), 0 states have 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:16:58,287 INFO L200 CegarLoopForPetriNet]: Found error trace [2023-08-26 15:16:58,288 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-08-26 15:16:58,288 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable8 [2023-08-26 15:16:58,288 INFO L420 AbstractCegarLoop]: === Iteration 10 === Targeting ULTIMATE.startErr6ASSERT_VIOLATIONASSERT === [P1Err0ASSERT_VIOLATIONASSERT, ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 9 more)] === [2023-08-26 15:16:58,288 INFO L145 PredicateUnifier]: Initialized classic predicate unifier [2023-08-26 15:16:58,288 INFO L85 PathProgramCache]: Analyzing trace with hash -1631959356, now seen corresponding path program 1 times [2023-08-26 15:16:58,288 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-08-26 15:16:58,288 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1504583420] [2023-08-26 15:16:58,289 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-08-26 15:16:58,289 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-08-26 15:16:58,328 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2023-08-26 15:16:58,328 INFO L356 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2023-08-26 15:16:58,360 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2023-08-26 15:16:58,382 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2023-08-26 15:16:58,382 INFO L360 BasicCegarLoop]: Counterexample is feasible [2023-08-26 15:16:58,383 INFO L805 garLoopResultBuilder]: Registering result UNSAFE for location ULTIMATE.startErr6ASSERT_VIOLATIONASSERT (11 of 12 remaining) [2023-08-26 15:16:58,385 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location P1Err0ASSERT_VIOLATIONASSERT (10 of 12 remaining) [2023-08-26 15:16:58,385 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE (9 of 12 remaining) [2023-08-26 15:16:58,385 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE (8 of 12 remaining) [2023-08-26 15:16:58,385 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (7 of 12 remaining) [2023-08-26 15:16:58,385 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr3REQUIRES_VIOLATIONMEMORY_DEREFERENCE (6 of 12 remaining) [2023-08-26 15:16:58,385 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr4REQUIRES_VIOLATIONMEMORY_DEREFERENCE (5 of 12 remaining) [2023-08-26 15:16:58,385 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr5REQUIRES_VIOLATIONMEMORY_DEREFERENCE (4 of 12 remaining) [2023-08-26 15:16:58,385 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (3 of 12 remaining) [2023-08-26 15:16:58,385 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (2 of 12 remaining) [2023-08-26 15:16:58,386 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr2INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (1 of 12 remaining) [2023-08-26 15:16:58,386 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location P1Err0ASSERT_VIOLATIONASSERT (0 of 12 remaining) [2023-08-26 15:16:58,386 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable9 [2023-08-26 15:16:58,386 INFO L445 BasicCegarLoop]: Path program histogram: [1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-08-26 15:16:58,390 INFO L228 ceAbstractionStarter]: Analysis of concurrent program completed with 1 thread instances [2023-08-26 15:16:58,390 INFO L178 ceAbstractionStarter]: Computing trace abstraction results [2023-08-26 15:16:58,434 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 26.08 03:16:58 BasicIcfg [2023-08-26 15:16:58,434 INFO L131 PluginConnector]: ------------------------ END TraceAbstraction---------------------------- [2023-08-26 15:16:58,435 INFO L158 Benchmark]: Toolchain (without parser) took 11994.23ms. Allocated memory was 352.3MB in the beginning and 595.6MB in the end (delta: 243.3MB). Free memory was 327.1MB in the beginning and 498.2MB in the end (delta: -171.1MB). Peak memory consumption was 70.5MB. Max. memory is 16.0GB. [2023-08-26 15:16:58,435 INFO L158 Benchmark]: CDTParser took 0.13ms. Allocated memory is still 352.3MB. Free memory is still 328.7MB. There was no memory consumed. Max. memory is 16.0GB. [2023-08-26 15:16:58,435 INFO L158 Benchmark]: CACSL2BoogieTranslator took 457.84ms. Allocated memory is still 352.3MB. Free memory was 326.7MB in the beginning and 303.5MB in the end (delta: 23.2MB). Peak memory consumption was 23.1MB. Max. memory is 16.0GB. [2023-08-26 15:16:58,435 INFO L158 Benchmark]: Boogie Procedure Inliner took 62.20ms. Allocated memory is still 352.3MB. Free memory was 303.5MB in the beginning and 300.8MB in the end (delta: 2.7MB). Peak memory consumption was 2.1MB. Max. memory is 16.0GB. [2023-08-26 15:16:58,436 INFO L158 Benchmark]: Boogie Preprocessor took 27.13ms. Allocated memory is still 352.3MB. Free memory was 300.8MB in the beginning and 298.7MB in the end (delta: 2.1MB). Peak memory consumption was 2.1MB. Max. memory is 16.0GB. [2023-08-26 15:16:58,436 INFO L158 Benchmark]: RCFGBuilder took 627.77ms. Allocated memory is still 352.3MB. Free memory was 298.7MB in the beginning and 324.3MB in the end (delta: -25.6MB). Peak memory consumption was 40.0MB. Max. memory is 16.0GB. [2023-08-26 15:16:58,436 INFO L158 Benchmark]: TraceAbstraction took 10813.69ms. Allocated memory was 352.3MB in the beginning and 595.6MB in the end (delta: 243.3MB). Free memory was 323.2MB in the beginning and 498.2MB in the end (delta: -175.0MB). Peak memory consumption was 68.3MB. Max. memory is 16.0GB. [2023-08-26 15:16:58,437 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.13ms. Allocated memory is still 352.3MB. Free memory is still 328.7MB. There was no memory consumed. Max. memory is 16.0GB. * CACSL2BoogieTranslator took 457.84ms. Allocated memory is still 352.3MB. Free memory was 326.7MB in the beginning and 303.5MB in the end (delta: 23.2MB). Peak memory consumption was 23.1MB. Max. memory is 16.0GB. * Boogie Procedure Inliner took 62.20ms. Allocated memory is still 352.3MB. Free memory was 303.5MB in the beginning and 300.8MB in the end (delta: 2.7MB). Peak memory consumption was 2.1MB. Max. memory is 16.0GB. * Boogie Preprocessor took 27.13ms. Allocated memory is still 352.3MB. Free memory was 300.8MB in the beginning and 298.7MB in the end (delta: 2.1MB). Peak memory consumption was 2.1MB. Max. memory is 16.0GB. * RCFGBuilder took 627.77ms. Allocated memory is still 352.3MB. Free memory was 298.7MB in the beginning and 324.3MB in the end (delta: -25.6MB). Peak memory consumption was 40.0MB. Max. memory is 16.0GB. * TraceAbstraction took 10813.69ms. Allocated memory was 352.3MB in the beginning and 595.6MB in the end (delta: 243.3MB). Free memory was 323.2MB in the beginning and 498.2MB in the end (delta: -175.0MB). Peak memory consumption was 68.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: 4.6s, 121 PlacesBefore, 39 PlacesAfterwards, 114 TransitionsBefore, 29 TransitionsAfterwards, 2170 CoEnabledTransitionPairs, 7 FixpointIterations, 45 TrivialSequentialCompositions, 57 ConcurrentSequentialCompositions, 0 TrivialYvCompositions, 15 ConcurrentYvCompositions, 3 ChoiceCompositions, 120 TotalNumberOfCompositions, 6191 MoverChecksTotal, Independence Relation Statistics: CachedIndependenceRelation.Independence Queries: [ total: 3117, independent: 2931, independent conditional: 0, independent unconditional: 2931, dependent: 186, dependent conditional: 0, dependent unconditional: 186, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , CachedIndependenceRelation.Statistics on underlying relation: SyntacticIndependenceRelation.Independence Queries: [ total: 1211, independent: 1165, independent conditional: 0, independent unconditional: 1165, dependent: 46, dependent conditional: 0, dependent unconditional: 46, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , Cache Queries: [ total: 3117, independent: 1766, independent conditional: 0, independent unconditional: 1766, dependent: 140, dependent conditional: 0, dependent unconditional: 140, unknown: 1211, unknown conditional: 0, unknown unconditional: 1211] , Statistics on independence cache: Total cache size (in pairs): 83, Positive cache size: 69, Positive conditional cache size: 0, Positive unconditional cache size: 69, Negative cache size: 14, Negative conditional cache size: 0, Negative unconditional cache size: 14, Unknown cache size: 0, Unknown conditional cache size: 0, Unknown unconditional cache size: 0 - CounterExampleResult [Line: 17]: assertion can be violated assertion can be violated We found a FailurePath: [L709] 0 int __unbuffered_cnt = 0; [L711] 0 int __unbuffered_p2_EAX = 0; [L713] 0 int __unbuffered_p2_EBX = 0; [L714] 0 _Bool main$tmp_guard0; [L715] 0 _Bool main$tmp_guard1; [L717] 0 int x = 0; [L718] 0 _Bool x$flush_delayed; [L719] 0 int x$mem_tmp; [L720] 0 _Bool x$r_buff0_thd0; [L721] 0 _Bool x$r_buff0_thd1; [L722] 0 _Bool x$r_buff0_thd2; [L723] 0 _Bool x$r_buff0_thd3; [L724] 0 _Bool x$r_buff1_thd0; [L725] 0 _Bool x$r_buff1_thd1; [L726] 0 _Bool x$r_buff1_thd2; [L727] 0 _Bool x$r_buff1_thd3; [L728] 0 _Bool x$read_delayed; [L729] 0 int *x$read_delayed_var; [L730] 0 int x$w_buff0; [L731] 0 _Bool x$w_buff0_used; [L732] 0 int x$w_buff1; [L733] 0 _Bool x$w_buff1_used; [L735] 0 int y = 0; [L736] 0 _Bool weak$$choice0; [L737] 0 _Bool weak$$choice2; [L818] 0 pthread_t t1876; [L819] FCALL, FORK 0 pthread_create(&t1876, ((void *)0), P0, ((void *)0)) VAL [__unbuffered_cnt=0, __unbuffered_p2_EAX=0, __unbuffered_p2_EBX=0, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, pthread_create(&t1876, ((void *)0), P0, ((void *)0))=-1, t1876={5:0}, weak$$choice0=0, weak$$choice2=0, x$flush_delayed=0, x$mem_tmp=0, x$r_buff0_thd0=0, x$r_buff0_thd1=0, x$r_buff0_thd2=0, x$r_buff0_thd3=0, x$r_buff1_thd0=0, x$r_buff1_thd1=0, x$r_buff1_thd2=0, x$r_buff1_thd3=0, x$read_delayed=0, x$read_delayed_var={0:0}, x$w_buff0=0, x$w_buff0_used=0, x$w_buff1=0, x$w_buff1_used=0, x=0, y=0] [L820] 0 pthread_t t1877; [L821] FCALL, FORK 0 pthread_create(&t1877, ((void *)0), P1, ((void *)0)) VAL [__unbuffered_cnt=0, __unbuffered_p2_EAX=0, __unbuffered_p2_EBX=0, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, pthread_create(&t1877, ((void *)0), P1, ((void *)0))=0, t1876={5:0}, t1877={6:0}, weak$$choice0=0, weak$$choice2=0, x$flush_delayed=0, x$mem_tmp=0, x$r_buff0_thd0=0, x$r_buff0_thd1=0, x$r_buff0_thd2=0, x$r_buff0_thd3=0, x$r_buff1_thd0=0, x$r_buff1_thd1=0, x$r_buff1_thd2=0, x$r_buff1_thd3=0, x$read_delayed=0, x$read_delayed_var={0:0}, x$w_buff0=0, x$w_buff0_used=0, x$w_buff1=0, x$w_buff1_used=0, x=0, y=0] [L822] 0 pthread_t t1878; [L761] 2 x$w_buff1 = x$w_buff0 [L762] 2 x$w_buff0 = 2 [L763] 2 x$w_buff1_used = x$w_buff0_used [L764] 2 x$w_buff0_used = (_Bool)1 [L765] CALL 2 __VERIFIER_assert(!(x$w_buff1_used && x$w_buff0_used)) [L18] COND FALSE 2 !(!expression) [L765] RET 2 __VERIFIER_assert(!(x$w_buff1_used && x$w_buff0_used)) [L766] 2 x$r_buff1_thd0 = x$r_buff0_thd0 [L767] 2 x$r_buff1_thd1 = x$r_buff0_thd1 [L768] 2 x$r_buff1_thd2 = x$r_buff0_thd2 [L769] 2 x$r_buff1_thd3 = x$r_buff0_thd3 [L770] 2 x$r_buff0_thd2 = (_Bool)1 VAL [__unbuffered_cnt=0, __unbuffered_p2_EAX=0, __unbuffered_p2_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_buff0_thd3=0, x$r_buff1_thd0=0, x$r_buff1_thd1=0, x$r_buff1_thd2=0, x$r_buff1_thd3=0, x$read_delayed=0, x$read_delayed_var={0:0}, x$w_buff0=2, x$w_buff0_used=1, x$w_buff1=0, x$w_buff1_used=0, x=0, y=0] [L773] 2 y = 1 VAL [__unbuffered_cnt=0, __unbuffered_p2_EAX=0, __unbuffered_p2_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_buff0_thd3=0, x$r_buff1_thd0=0, x$r_buff1_thd1=0, x$r_buff1_thd2=0, x$r_buff1_thd3=0, x$read_delayed=0, x$read_delayed_var={0:0}, x$w_buff0=2, x$w_buff0_used=1, x$w_buff1=0, x$w_buff1_used=0, x=0, y=1] [L823] FCALL, FORK 0 pthread_create(&t1878, ((void *)0), P2, ((void *)0)) VAL [__unbuffered_cnt=0, __unbuffered_p2_EAX=0, __unbuffered_p2_EBX=0, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, pthread_create(&t1878, ((void *)0), P2, ((void *)0))=1, t1876={5:0}, t1877={6:0}, t1878={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_buff0_thd3=0, x$r_buff1_thd0=0, x$r_buff1_thd1=0, x$r_buff1_thd2=0, x$r_buff1_thd3=0, x$read_delayed=0, x$read_delayed_var={0:0}, x$w_buff0=2, x$w_buff0_used=1, x$w_buff1=0, x$w_buff1_used=0, x=0, y=1] [L790] 3 __unbuffered_p2_EAX = y VAL [__unbuffered_cnt=0, __unbuffered_p2_EAX=1, __unbuffered_p2_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_buff0_thd3=0, x$r_buff1_thd0=0, x$r_buff1_thd1=0, x$r_buff1_thd2=0, x$r_buff1_thd3=0, x$read_delayed=0, x$read_delayed_var={0:0}, x$w_buff0=2, x$w_buff0_used=1, x$w_buff1=0, x$w_buff1_used=0, x=0, y=1] [L793] 3 __unbuffered_p2_EBX = y VAL [__unbuffered_cnt=0, __unbuffered_p2_EAX=1, __unbuffered_p2_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_buff0_thd3=0, x$r_buff1_thd0=0, x$r_buff1_thd1=0, x$r_buff1_thd2=0, x$r_buff1_thd3=0, x$read_delayed=0, x$read_delayed_var={0:0}, x$w_buff0=2, x$w_buff0_used=1, x$w_buff1=0, x$w_buff1_used=0, x=0, y=1] [L741] 1 y = 2 VAL [__unbuffered_cnt=0, __unbuffered_p2_EAX=1, __unbuffered_p2_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_buff0_thd3=0, x$r_buff1_thd0=0, x$r_buff1_thd1=0, x$r_buff1_thd2=0, x$r_buff1_thd3=0, x$read_delayed=0, x$read_delayed_var={0:0}, x$w_buff0=2, x$w_buff0_used=1, x$w_buff1=0, x$w_buff1_used=0, x=0, y=2] [L744] 1 x = 1 VAL [__unbuffered_cnt=0, __unbuffered_p2_EAX=1, __unbuffered_p2_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_buff0_thd3=0, x$r_buff1_thd0=0, x$r_buff1_thd1=0, x$r_buff1_thd2=0, x$r_buff1_thd3=0, x$read_delayed=0, x$read_delayed_var={0:0}, x$w_buff0=2, x$w_buff0_used=1, x$w_buff1=0, x$w_buff1_used=0, x=1, y=2] [L747] 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) [L748] 1 x$w_buff0_used = x$w_buff0_used && x$r_buff0_thd1 ? (_Bool)0 : x$w_buff0_used [L749] 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 [L750] 1 x$r_buff0_thd1 = x$w_buff0_used && x$r_buff0_thd1 ? (_Bool)0 : x$r_buff0_thd1 [L751] 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=0, __unbuffered_p2_EAX=1, __unbuffered_p2_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_buff0_thd3=0, x$r_buff1_thd0=0, x$r_buff1_thd1=0, x$r_buff1_thd2=0, x$r_buff1_thd3=0, x$read_delayed=0, x$read_delayed_var={0:0}, x$w_buff0=2, x$w_buff0_used=1, x$w_buff1=0, x$w_buff1_used=0, x=1, y=2] [L776] 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) [L777] 2 x$w_buff0_used = x$w_buff0_used && x$r_buff0_thd2 ? (_Bool)0 : x$w_buff0_used [L778] 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 [L779] 2 x$r_buff0_thd2 = x$w_buff0_used && x$r_buff0_thd2 ? (_Bool)0 : x$r_buff0_thd2 [L780] 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_p2_EAX=1, __unbuffered_p2_EBX=1, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=0, x$flush_delayed=0, x$mem_tmp=0, x$r_buff0_thd0=0, x$r_buff0_thd1=0, x$r_buff0_thd2=1, x$r_buff0_thd3=0, x$r_buff1_thd0=0, x$r_buff1_thd1=0, x$r_buff1_thd2=0, x$r_buff1_thd3=0, x$read_delayed=0, x$read_delayed_var={0:0}, x$w_buff0=2, x$w_buff0_used=0, x$w_buff1=0, x$w_buff1_used=0, x=2, y=2] [L796] 3 x = x$w_buff0_used && x$r_buff0_thd3 ? x$w_buff0 : (x$w_buff1_used && x$r_buff1_thd3 ? x$w_buff1 : x) [L797] 3 x$w_buff0_used = x$w_buff0_used && x$r_buff0_thd3 ? (_Bool)0 : x$w_buff0_used [L798] 3 x$w_buff1_used = x$w_buff0_used && x$r_buff0_thd3 || x$w_buff1_used && x$r_buff1_thd3 ? (_Bool)0 : x$w_buff1_used [L799] 3 x$r_buff0_thd3 = x$w_buff0_used && x$r_buff0_thd3 ? (_Bool)0 : x$r_buff0_thd3 [L800] 3 x$r_buff1_thd3 = x$w_buff0_used && x$r_buff0_thd3 || x$w_buff1_used && x$r_buff1_thd3 ? (_Bool)0 : x$r_buff1_thd3 VAL [__unbuffered_cnt=0, __unbuffered_p2_EAX=1, __unbuffered_p2_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_buff0_thd3=0, x$r_buff1_thd0=0, x$r_buff1_thd1=0, x$r_buff1_thd2=0, x$r_buff1_thd3=0, x$read_delayed=0, x$read_delayed_var={0:0}, x$w_buff0=2, x$w_buff0_used=0, x$w_buff1=0, x$w_buff1_used=0, x=2, y=2] [L754] 1 __unbuffered_cnt = __unbuffered_cnt + 1 [L756] 1 return 0; [L783] 2 __unbuffered_cnt = __unbuffered_cnt + 1 [L785] 2 return 0; [L803] 3 __unbuffered_cnt = __unbuffered_cnt + 1 [L805] 3 return 0; [L825] 0 main$tmp_guard0 = __unbuffered_cnt == 3 [L827] CALL 0 assume_abort_if_not(main$tmp_guard0) [L3] COND FALSE 0 !(!cond) [L827] RET 0 assume_abort_if_not(main$tmp_guard0) [L829] 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) [L830] 0 x$w_buff0_used = x$w_buff0_used && x$r_buff0_thd0 ? (_Bool)0 : x$w_buff0_used [L831] 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 [L832] 0 x$r_buff0_thd0 = x$w_buff0_used && x$r_buff0_thd0 ? (_Bool)0 : x$r_buff0_thd0 [L833] 0 x$r_buff1_thd0 = x$w_buff0_used && x$r_buff0_thd0 || x$w_buff1_used && x$r_buff1_thd0 ? (_Bool)0 : x$r_buff1_thd0 VAL [\result={0:0}, \result={0:0}, __unbuffered_cnt=3, __unbuffered_p2_EAX=1, __unbuffered_p2_EBX=1, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, main$tmp_guard0=1, main$tmp_guard1=0, t1876={5:0}, t1877={6:0}, t1878={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_buff0_thd3=0, x$r_buff1_thd0=0, x$r_buff1_thd1=0, x$r_buff1_thd2=0, x$r_buff1_thd3=0, x$read_delayed=0, x$read_delayed_var={0:0}, x$w_buff0=2, x$w_buff0_used=0, x$w_buff1=0, x$w_buff1_used=0, x=2, y=2] [L836] 0 weak$$choice0 = __VERIFIER_nondet_bool() [L837] 0 weak$$choice2 = __VERIFIER_nondet_bool() [L838] 0 x$flush_delayed = weak$$choice2 [L839] 0 x$mem_tmp = x [L840] 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) [L841] 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)) [L842] 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)) [L843] 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)) [L844] 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)) [L845] 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)) [L846] 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)) [L847] 0 main$tmp_guard1 = !(x == 2 && y == 2 && __unbuffered_p2_EAX == 1 && __unbuffered_p2_EBX == 1) [L848] 0 x = x$flush_delayed ? x$mem_tmp : x [L849] 0 x$flush_delayed = (_Bool)0 [L851] 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", "safe004_power.opt_pso.opt_rmo.opt.c", 8, __extension__ __PRETTY_FUNCTION__) VAL [\read(__PRETTY_FUNCTION__)={49:50}, \result={0:0}, \result={0:0}, __unbuffered_cnt=3, __unbuffered_p2_EAX=1, __unbuffered_p2_EBX=1, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, main$tmp_guard0=1, main$tmp_guard1=0, weak$$choice2=0, 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_buff0_thd3=0, x$r_buff1_thd0=0, x$r_buff1_thd1=0, x$r_buff1_thd2=0, x$r_buff1_thd3=0, x$read_delayed=0, x$read_delayed_var={0:0}, x$w_buff0=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: -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: 823]: Unable to prove that petrification did provide enough thread instances (tool internal message, not intended for end users) Unable to prove that petrification did provide enough thread instances (tool internal message, not intended for end users) Reason: Not analyzed. - UnprovableResult [Line: 819]: Unable to prove that petrification did provide enough thread instances (tool internal message, not intended for end users) Unable to prove that petrification did provide enough thread instances (tool internal message, not intended for end users) Reason: Not analyzed. - UnprovableResult [Line: 821]: Unable to prove that petrification did provide enough thread instances (tool internal message, not intended for end users) Unable to prove that petrification did provide enough thread instances (tool internal message, not intended for end users) Reason: Not analyzed. - StatisticsResult: Ultimate Automizer benchmark data with 1 thread instances CFG has 7 procedures, 143 locations, 12 error locations. Started 1 CEGAR loops. EmptinessCheckTime: 0.0s, RemoveRedundantFlowTime: 0.0s, RemoveRedundantFlowUnfoldingTime: 0.0s, BackfoldingTime: 0.0s, BackfoldingUnfoldingTime: 0.0s, FlowIncreaseByBackfolding: 0, BasicCegarLoop: OverallTime: 10.7s, OverallIterations: 10, TraceHistogramMax: 1, PathProgramHistogramMax: 1, EmptinessCheckTime: 0.0s, AutomataDifference: 3.2s, DeadEndRemovalTime: 0.0s, HoareAnnotationTime: 0.0s, InitialAbstractionConstructionTime: 4.7s, HoareTripleCheckerStatistics: 0 mSolverCounterUnknown, 242 SdHoareTripleChecker+Valid, 0.8s IncrementalHoareTripleChecker+Time, 0 mSdLazyCounter, 242 mSDsluCounter, 24 SdHoareTripleChecker+Invalid, 0.7s Time, 0 mProtectedAction, 0 SdHoareTripleChecker+Unchecked, 0 IncrementalHoareTripleChecker+Unchecked, 11 mSDsCounter, 36 IncrementalHoareTripleChecker+Valid, 0 mProtectedPredicate, 628 IncrementalHoareTripleChecker+Invalid, 664 SdHoareTripleChecker+Unknown, 0 mSolverCounterNotChecked, 36 mSolverCounterUnsat, 13 mSDtfsCounter, 628 mSolverCounterSat, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Unknown, PredicateUnifierStatistics: 0 DeclaredPredicates, 36 GetRequests, 6 SyntacticMatches, 0 SemanticMatches, 30 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 7 ImplicationChecksByTransitivity, 0.4s Time, 0.0s BasicInterpolantAutomatonTime, BiggestAbstraction: size=700occurred in iteration=8, InterpolantAutomatonStates: 46, 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, 2.3s InterpolantComputationTime, 122 NumberOfCodeBlocks, 122 NumberOfCodeBlocksAsserted, 10 NumberOfCheckSat, 92 ConstructedInterpolants, 0 QuantifiedInterpolants, 623 SizeOfPredicates, 0 NumberOfNonLiveVariables, 0 ConjunctsInSsa, 0 ConjunctsInUnsatCore, 9 InterpolantComputations, 9 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:16:58,457 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...