./Ultimate.py --spec ../../sv-benchmarks/c/properties/valid-memsafety.prp --file ../../sv-benchmarks/c/pthread-wmm/mix045_power.oepc_pso.oepc_rmo.oepc.i --full-output --architecture 32bit -------------------------------------------------------------------------------- Checking for memory safety (deref-memtrack) Using default analysis Version 0e0057cc Calling Ultimate with: /usr/lib/jvm/java-11-openjdk-amd64/bin/java -Dosgi.configuration.area=/tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_f1fda7e5-70f6-451b-9e85-d6f04acde80c/bin/uautomizer-verify-VRDe98Ueme/data/config -Xmx15G -Xms4m -jar /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_f1fda7e5-70f6-451b-9e85-d6f04acde80c/bin/uautomizer-verify-VRDe98Ueme/plugins/org.eclipse.equinox.launcher_1.5.800.v20200727-1323.jar -data @noDefault -ultimatedata /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_f1fda7e5-70f6-451b-9e85-d6f04acde80c/bin/uautomizer-verify-VRDe98Ueme/data -tc /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_f1fda7e5-70f6-451b-9e85-d6f04acde80c/bin/uautomizer-verify-VRDe98Ueme/config/AutomizerMemDerefMemtrack.xml -i ../../sv-benchmarks/c/pthread-wmm/mix045_power.oepc_pso.oepc_rmo.oepc.i -s /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_f1fda7e5-70f6-451b-9e85-d6f04acde80c/bin/uautomizer-verify-VRDe98Ueme/config/svcomp-DerefFreeMemtrack-32bit-Automizer_Default.epf --cacsl2boogietranslator.entry.function main --witnessprinter.witness.directory /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_f1fda7e5-70f6-451b-9e85-d6f04acde80c/bin/uautomizer-verify-VRDe98Ueme --witnessprinter.witness.filename witness --witnessprinter.write.witness.besides.input.file false --witnessprinter.graph.data.specification CHECK( init(main()), LTL(G valid-free) ) CHECK( init(main()), LTL(G valid-deref) ) CHECK( init(main()), LTL(G valid-memtrack) ) --witnessprinter.graph.data.producer Automizer --witnessprinter.graph.data.architecture 32bit --witnessprinter.graph.data.programhash ac99c7435b3707a16823c102e546d1d8821c1d75e1c740ce64249f2f34cab350 --- Real Ultimate output --- This is Ultimate 0.2.4-dev-0e0057c [2023-11-26 11:51:24,020 INFO L188 SettingsManager]: Resetting all preferences to default values... [2023-11-26 11:51:24,173 INFO L114 SettingsManager]: Loading settings from /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_f1fda7e5-70f6-451b-9e85-d6f04acde80c/bin/uautomizer-verify-VRDe98Ueme/config/svcomp-DerefFreeMemtrack-32bit-Automizer_Default.epf [2023-11-26 11:51:24,182 WARN L101 SettingsManager]: Preference file contains the following unknown settings: [2023-11-26 11:51:24,184 WARN L103 SettingsManager]: * de.uni_freiburg.informatik.ultimate.core.Log level for class [2023-11-26 11:51:24,233 INFO L130 SettingsManager]: Preferences different from defaults after loading the file: [2023-11-26 11:51:24,235 INFO L151 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2023-11-26 11:51:24,236 INFO L153 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2023-11-26 11:51:24,237 INFO L151 SettingsManager]: Preferences of Boogie Preprocessor differ from their defaults: [2023-11-26 11:51:24,244 INFO L153 SettingsManager]: * Use memory slicer=true [2023-11-26 11:51:24,244 INFO L151 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2023-11-26 11:51:24,245 INFO L153 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2023-11-26 11:51:24,246 INFO L151 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2023-11-26 11:51:24,248 INFO L153 SettingsManager]: * Create parallel compositions if possible=false [2023-11-26 11:51:24,249 INFO L153 SettingsManager]: * Use SBE=true [2023-11-26 11:51:24,250 INFO L151 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2023-11-26 11:51:24,250 INFO L153 SettingsManager]: * sizeof long=4 [2023-11-26 11:51:24,251 INFO L153 SettingsManager]: * Overapproximate operations on floating types=true [2023-11-26 11:51:24,252 INFO L153 SettingsManager]: * sizeof POINTER=4 [2023-11-26 11:51:24,253 INFO L153 SettingsManager]: * Check division by zero=IGNORE [2023-11-26 11:51:24,253 INFO L153 SettingsManager]: * Check for the main procedure if all allocated memory was freed=true [2023-11-26 11:51:24,254 INFO L153 SettingsManager]: * Bitprecise bitfields=true [2023-11-26 11:51:24,255 INFO L153 SettingsManager]: * SV-COMP memtrack compatibility mode=true [2023-11-26 11:51:24,255 INFO L153 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2023-11-26 11:51:24,256 INFO L153 SettingsManager]: * Adapt memory model on pointer casts if necessary=true [2023-11-26 11:51:24,256 INFO L153 SettingsManager]: * Check unreachability of reach_error function=false [2023-11-26 11:51:24,257 INFO L153 SettingsManager]: * sizeof long double=12 [2023-11-26 11:51:24,258 INFO L153 SettingsManager]: * Use constant arrays=true [2023-11-26 11:51:24,259 INFO L151 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2023-11-26 11:51:24,260 INFO L153 SettingsManager]: * Size of a code block=SequenceOfStatements [2023-11-26 11:51:24,261 INFO L153 SettingsManager]: * Only consider context switches at boundaries of atomic blocks=true [2023-11-26 11:51:24,262 INFO L153 SettingsManager]: * SMT solver=External_DefaultMode [2023-11-26 11:51:24,262 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2023-11-26 11:51:24,263 INFO L151 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2023-11-26 11:51:24,263 INFO L153 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2023-11-26 11:51:24,264 INFO L153 SettingsManager]: * Trace refinement strategy=CAMEL [2023-11-26 11:51:24,264 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2023-11-26 11:51:24,264 INFO L153 SettingsManager]: * Apply one-shot large block encoding in concurrent analysis=false [2023-11-26 11:51:24,265 INFO L153 SettingsManager]: * Automaton type used in concurrency analysis=PETRI_NET [2023-11-26 11:51:24,265 INFO L153 SettingsManager]: * Order on configurations for Petri net unfoldings=DBO [2023-11-26 11:51:24,265 INFO L153 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2023-11-26 11:51:24,266 INFO L153 SettingsManager]: * Looper check in Petri net analysis=SEMANTIC WARNING: An illegal reflective access operation has occurred WARNING: Illegal reflective access by com.sun.xml.bind.v2.runtime.reflect.opt.Injector$1 (file:/tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_f1fda7e5-70f6-451b-9e85-d6f04acde80c/bin/uautomizer-verify-VRDe98Ueme/plugins/com.sun.xml.bind_2.2.0.v201505121915.jar) to method java.lang.ClassLoader.defineClass(java.lang.String,byte[],int,int) WARNING: Please consider reporting this to the maintainers of com.sun.xml.bind.v2.runtime.reflect.opt.Injector$1 WARNING: Use --illegal-access=warn to enable warnings of further illegal reflective access operations WARNING: All illegal access operations will be denied in a future release Applying setting for plugin de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator: Entry function -> main Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Witness directory -> /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_f1fda7e5-70f6-451b-9e85-d6f04acde80c/bin/uautomizer-verify-VRDe98Ueme Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Witness filename -> witness Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Write witness besides input file -> false Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Graph data specification -> CHECK( init(main()), LTL(G valid-free) ) CHECK( init(main()), LTL(G valid-deref) ) CHECK( init(main()), LTL(G valid-memtrack) ) Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Graph data producer -> Automizer Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Graph data architecture -> 32bit Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Graph data programhash -> ac99c7435b3707a16823c102e546d1d8821c1d75e1c740ce64249f2f34cab350 [2023-11-26 11:51:24,671 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2023-11-26 11:51:24,724 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2023-11-26 11:51:24,728 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2023-11-26 11:51:24,729 INFO L270 PluginConnector]: Initializing CDTParser... [2023-11-26 11:51:24,730 INFO L274 PluginConnector]: CDTParser initialized [2023-11-26 11:51:24,732 INFO L431 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_f1fda7e5-70f6-451b-9e85-d6f04acde80c/bin/uautomizer-verify-VRDe98Ueme/../../sv-benchmarks/c/pthread-wmm/mix045_power.oepc_pso.oepc_rmo.oepc.i [2023-11-26 11:51:28,486 INFO L533 CDTParser]: Created temporary CDT project at NULL [2023-11-26 11:51:28,820 INFO L384 CDTParser]: Found 1 translation units. [2023-11-26 11:51:28,821 INFO L180 CDTParser]: Scanning /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_f1fda7e5-70f6-451b-9e85-d6f04acde80c/sv-benchmarks/c/pthread-wmm/mix045_power.oepc_pso.oepc_rmo.oepc.i [2023-11-26 11:51:28,845 INFO L427 CDTParser]: About to delete temporary CDT project at /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_f1fda7e5-70f6-451b-9e85-d6f04acde80c/bin/uautomizer-verify-VRDe98Ueme/data/175fcc25a/657d200e2aae4ff4be0fe4b793baea8d/FLAG870139b3b [2023-11-26 11:51:28,873 INFO L435 CDTParser]: Successfully deleted /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_f1fda7e5-70f6-451b-9e85-d6f04acde80c/bin/uautomizer-verify-VRDe98Ueme/data/175fcc25a/657d200e2aae4ff4be0fe4b793baea8d [2023-11-26 11:51:28,880 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2023-11-26 11:51:28,884 INFO L133 ToolchainWalker]: Walking toolchain with 6 elements. [2023-11-26 11:51:28,886 INFO L112 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2023-11-26 11:51:28,886 INFO L270 PluginConnector]: Initializing CACSL2BoogieTranslator... [2023-11-26 11:51:28,893 INFO L274 PluginConnector]: CACSL2BoogieTranslator initialized [2023-11-26 11:51:28,894 INFO L184 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 26.11 11:51:28" (1/1) ... [2023-11-26 11:51:28,895 INFO L204 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@6e5f8b7e and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 26.11 11:51:28, skipping insertion in model container [2023-11-26 11:51:28,896 INFO L184 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 26.11 11:51:28" (1/1) ... [2023-11-26 11:51:28,964 INFO L177 MainTranslator]: Built tables and reachable declarations [2023-11-26 11:51:29,596 INFO L209 PostProcessor]: Analyzing one entry point: main [2023-11-26 11:51:29,613 INFO L202 MainTranslator]: Completed pre-run [2023-11-26 11:51:29,690 INFO L209 PostProcessor]: Analyzing one entry point: main [2023-11-26 11:51:29,767 WARN L675 CHandler]: The function __VERIFIER_atomic_begin is called, but not defined or handled by StandardFunctionHandler. [2023-11-26 11:51:29,767 WARN L675 CHandler]: The function __VERIFIER_atomic_end is called, but not defined or handled by StandardFunctionHandler. [2023-11-26 11:51:29,777 INFO L206 MainTranslator]: Completed translation [2023-11-26 11:51:29,778 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 26.11 11:51:29 WrapperNode [2023-11-26 11:51:29,779 INFO L131 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2023-11-26 11:51:29,780 INFO L112 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2023-11-26 11:51:29,782 INFO L270 PluginConnector]: Initializing Boogie Procedure Inliner... [2023-11-26 11:51:29,782 INFO L274 PluginConnector]: Boogie Procedure Inliner initialized [2023-11-26 11:51:29,792 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 26.11 11:51:29" (1/1) ... [2023-11-26 11:51:29,847 INFO L184 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 26.11 11:51:29" (1/1) ... [2023-11-26 11:51:29,911 INFO L138 Inliner]: procedures = 176, calls = 59, calls flagged for inlining = 6, calls inlined = 7, statements flattened = 134 [2023-11-26 11:51:29,914 INFO L131 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2023-11-26 11:51:29,915 INFO L112 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2023-11-26 11:51:29,916 INFO L270 PluginConnector]: Initializing Boogie Preprocessor... [2023-11-26 11:51:29,916 INFO L274 PluginConnector]: Boogie Preprocessor initialized [2023-11-26 11:51:29,931 INFO L184 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 26.11 11:51:29" (1/1) ... [2023-11-26 11:51:29,932 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 26.11 11:51:29" (1/1) ... [2023-11-26 11:51:29,950 INFO L184 PluginConnector]: Executing the observer MemorySlicer from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 26.11 11:51:29" (1/1) ... [2023-11-26 11:51:29,987 INFO L175 MemorySlicer]: Split 5 memory accesses to 4 slices as follows [2, 1, 1, 1]. 40 percent of accesses are in the largest equivalence class. The 2 initializations are split as follows [2, 0, 0, 0]. The 3 writes are split as follows [0, 1, 1, 1]. [2023-11-26 11:51:29,996 INFO L184 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 26.11 11:51:29" (1/1) ... [2023-11-26 11:51:29,997 INFO L184 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 26.11 11:51:29" (1/1) ... [2023-11-26 11:51:30,014 INFO L184 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 26.11 11:51:29" (1/1) ... [2023-11-26 11:51:30,030 INFO L184 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 26.11 11:51:29" (1/1) ... [2023-11-26 11:51:30,034 INFO L184 PluginConnector]: Executing the observer LTLStepAnnotator from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 26.11 11:51:29" (1/1) ... [2023-11-26 11:51:30,047 INFO L184 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 26.11 11:51:29" (1/1) ... [2023-11-26 11:51:30,053 INFO L131 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2023-11-26 11:51:30,059 INFO L112 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2023-11-26 11:51:30,059 INFO L270 PluginConnector]: Initializing RCFGBuilder... [2023-11-26 11:51:30,060 INFO L274 PluginConnector]: RCFGBuilder initialized [2023-11-26 11:51:30,061 INFO L184 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 26.11 11:51:29" (1/1) ... [2023-11-26 11:51:30,069 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2023-11-26 11:51:30,086 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_f1fda7e5-70f6-451b-9e85-d6f04acde80c/bin/uautomizer-verify-VRDe98Ueme/z3 [2023-11-26 11:51:30,105 INFO L229 MonitoredProcess]: Starting monitored process 1 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_f1fda7e5-70f6-451b-9e85-d6f04acde80c/bin/uautomizer-verify-VRDe98Ueme/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 (exit command is (exit), workingDir is null) [2023-11-26 11:51:30,130 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_f1fda7e5-70f6-451b-9e85-d6f04acde80c/bin/uautomizer-verify-VRDe98Ueme/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 (1)] Waiting until timeout for monitored process [2023-11-26 11:51:30,161 INFO L130 BoogieDeclarations]: Found specification of procedure write~int#0 [2023-11-26 11:51:30,162 INFO L130 BoogieDeclarations]: Found specification of procedure write~int#1 [2023-11-26 11:51:30,162 INFO L130 BoogieDeclarations]: Found specification of procedure write~int#2 [2023-11-26 11:51:30,162 INFO L130 BoogieDeclarations]: Found specification of procedure write~int#3 [2023-11-26 11:51:30,163 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_atomic_begin [2023-11-26 11:51:30,163 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2023-11-26 11:51:30,163 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnStack [2023-11-26 11:51:30,164 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.dealloc [2023-11-26 11:51:30,164 INFO L130 BoogieDeclarations]: Found specification of procedure P0 [2023-11-26 11:51:30,164 INFO L138 BoogieDeclarations]: Found implementation of procedure P0 [2023-11-26 11:51:30,167 INFO L130 BoogieDeclarations]: Found specification of procedure P1 [2023-11-26 11:51:30,167 INFO L138 BoogieDeclarations]: Found implementation of procedure P1 [2023-11-26 11:51:30,168 INFO L130 BoogieDeclarations]: Found specification of procedure P2 [2023-11-26 11:51:30,168 INFO L138 BoogieDeclarations]: Found implementation of procedure P2 [2023-11-26 11:51:30,168 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#0 [2023-11-26 11:51:30,169 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#1 [2023-11-26 11:51:30,169 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#2 [2023-11-26 11:51:30,169 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#3 [2023-11-26 11:51:30,170 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_atomic_end [2023-11-26 11:51:30,171 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2023-11-26 11:51:30,171 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2023-11-26 11:51:30,174 WARN L213 CfgBuilder]: User set CodeBlockSize to SequenceOfStatements but program contains fork statements. Overwriting the user preferences and setting CodeBlockSize to OneNontrivialStatement [2023-11-26 11:51:30,416 INFO L241 CfgBuilder]: Building ICFG [2023-11-26 11:51:30,419 INFO L267 CfgBuilder]: Building CFG for each procedure with an implementation [2023-11-26 11:51:31,051 INFO L282 CfgBuilder]: Performing block encoding [2023-11-26 11:51:31,350 INFO L304 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2023-11-26 11:51:31,350 INFO L309 CfgBuilder]: Removed 0 assume(true) statements. [2023-11-26 11:51:31,351 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 26.11 11:51:31 BoogieIcfgContainer [2023-11-26 11:51:31,351 INFO L131 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2023-11-26 11:51:31,355 INFO L112 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2023-11-26 11:51:31,355 INFO L270 PluginConnector]: Initializing TraceAbstraction... [2023-11-26 11:51:31,359 INFO L274 PluginConnector]: TraceAbstraction initialized [2023-11-26 11:51:31,360 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 26.11 11:51:28" (1/3) ... [2023-11-26 11:51:31,361 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@48ea4afa and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 26.11 11:51:31, skipping insertion in model container [2023-11-26 11:51:31,361 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 26.11 11:51:29" (2/3) ... [2023-11-26 11:51:31,362 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@48ea4afa and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 26.11 11:51:31, skipping insertion in model container [2023-11-26 11:51:31,362 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 26.11 11:51:31" (3/3) ... [2023-11-26 11:51:31,364 INFO L112 eAbstractionObserver]: Analyzing ICFG mix045_power.oepc_pso.oepc_rmo.oepc.i [2023-11-26 11:51:31,390 INFO L203 ceAbstractionStarter]: Automizer settings: Hoare:false NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2023-11-26 11:51:31,390 INFO L162 ceAbstractionStarter]: Applying trace abstraction to program that has 9 error locations. [2023-11-26 11:51:31,391 INFO L514 ceAbstractionStarter]: Constructing petrified ICFG for 1 thread instances. [2023-11-26 11:51:31,489 INFO L144 ThreadInstanceAdder]: Constructed 0 joinOtherThreadTransitions. [2023-11-26 11:51:31,550 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 63 places, 55 transitions, 122 flow [2023-11-26 11:51:31,598 INFO L124 PetriNetUnfolderBase]: 2/52 cut-off events. [2023-11-26 11:51:31,598 INFO L125 PetriNetUnfolderBase]: For 0/0 co-relation queries the response was YES. [2023-11-26 11:51:31,604 INFO L83 FinitePrefix]: Finished finitePrefix Result has 62 conditions, 52 events. 2/52 cut-off events. For 0/0 co-relation queries the response was YES. Maximal size of possible extension queue 5. Compared 103 event pairs, 0 based on Foata normal form. 0/41 useless extension candidates. Maximal degree in co-relation 51. Up to 2 conditions per place. [2023-11-26 11:51:31,604 INFO L82 GeneralOperation]: Start removeDead. Operand has 63 places, 55 transitions, 122 flow [2023-11-26 11:51:31,610 INFO L88 GeneralOperation]: Finished RemoveDead, result has has 60 places, 52 transitions, 113 flow [2023-11-26 11:51:31,623 INFO L356 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2023-11-26 11:51:31,633 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=All, 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;@16bf2217, mLbeIndependenceSettings=[IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=false, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2023-11-26 11:51:31,633 INFO L358 AbstractCegarLoop]: Starting to check reachability of 13 error locations. [2023-11-26 11:51:31,637 INFO L185 PetriNetUnfolderBase]: Found word, exiting Unfolder. [2023-11-26 11:51:31,638 INFO L124 PetriNetUnfolderBase]: 0/2 cut-off events. [2023-11-26 11:51:31,638 INFO L125 PetriNetUnfolderBase]: For 0/0 co-relation queries the response was YES. [2023-11-26 11:51:31,638 INFO L200 CegarLoopForPetriNet]: Found error trace [2023-11-26 11:51:31,639 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1] [2023-11-26 11:51:31,640 INFO L420 AbstractCegarLoop]: === Iteration 1 === Targeting ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [P0Err0ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 10 more)] === [2023-11-26 11:51:31,647 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-11-26 11:51:31,647 INFO L85 PathProgramCache]: Analyzing trace with hash 12632, now seen corresponding path program 1 times [2023-11-26 11:51:31,660 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-11-26 11:51:31,661 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [649359811] [2023-11-26 11:51:31,661 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-11-26 11:51:31,662 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-11-26 11:51:31,814 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-26 11:51:32,081 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-11-26 11:51:32,082 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-11-26 11:51:32,083 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [649359811] [2023-11-26 11:51:32,083 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [649359811] provided 1 perfect and 0 imperfect interpolant sequences [2023-11-26 11:51:32,084 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-11-26 11:51:32,084 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [1] imperfect sequences [] total 1 [2023-11-26 11:51:32,086 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1993946771] [2023-11-26 11:51:32,087 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-11-26 11:51:32,099 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2023-11-26 11:51:32,106 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-11-26 11:51:32,151 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2023-11-26 11:51:32,156 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2023-11-26 11:51:32,192 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 28 out of 55 [2023-11-26 11:51:32,195 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 60 places, 52 transitions, 113 flow. Second operand has 3 states, 3 states have (on average 28.666666666666668) internal successors, (86), 3 states have internal predecessors, (86), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-26 11:51:32,195 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2023-11-26 11:51:32,196 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 28 of 55 [2023-11-26 11:51:32,197 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2023-11-26 11:51:33,054 INFO L124 PetriNetUnfolderBase]: 1057/2068 cut-off events. [2023-11-26 11:51:33,054 INFO L125 PetriNetUnfolderBase]: For 20/20 co-relation queries the response was YES. [2023-11-26 11:51:33,069 INFO L83 FinitePrefix]: Finished finitePrefix Result has 3694 conditions, 2068 events. 1057/2068 cut-off events. For 20/20 co-relation queries the response was YES. Maximal size of possible extension queue 142. Compared 14095 event pairs, 791 based on Foata normal form. 120/1951 useless extension candidates. Maximal degree in co-relation 3680. Up to 1193 conditions per place. [2023-11-26 11:51:33,094 INFO L140 encePairwiseOnDemand]: 50/55 looper letters, 30 selfloop transitions, 2 changer transitions 0/57 dead transitions. [2023-11-26 11:51:33,094 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 60 places, 57 transitions, 187 flow [2023-11-26 11:51:33,096 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2023-11-26 11:51:33,100 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2023-11-26 11:51:33,112 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 119 transitions. [2023-11-26 11:51:33,116 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.7212121212121212 [2023-11-26 11:51:33,118 INFO L72 ComplementDD]: Start complementDD. Operand 3 states and 119 transitions. [2023-11-26 11:51:33,118 INFO L73 IsDeterministic]: Start isDeterministic. Operand 3 states and 119 transitions. [2023-11-26 11:51:33,120 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2023-11-26 11:51:33,123 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 3 states and 119 transitions. [2023-11-26 11:51:33,129 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 4 states, 3 states have (on average 39.666666666666664) internal successors, (119), 3 states have internal predecessors, (119), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-26 11:51:33,136 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 4 states, 4 states have (on average 55.0) internal successors, (220), 4 states have internal predecessors, (220), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-26 11:51:33,137 INFO L81 ComplementDD]: Finished complementDD. Result has 4 states, 4 states have (on average 55.0) internal successors, (220), 4 states have internal predecessors, (220), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-26 11:51:33,139 INFO L175 Difference]: Start difference. First operand has 60 places, 52 transitions, 113 flow. Second operand 3 states and 119 transitions. [2023-11-26 11:51:33,141 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 60 places, 57 transitions, 187 flow [2023-11-26 11:51:33,148 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 57 places, 57 transitions, 184 flow, removed 0 selfloop flow, removed 3 redundant places. [2023-11-26 11:51:33,158 INFO L231 Difference]: Finished difference. Result has 57 places, 48 transitions, 106 flow [2023-11-26 11:51:33,160 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=55, PETRI_DIFFERENCE_MINUEND_FLOW=102, PETRI_DIFFERENCE_MINUEND_PLACES=55, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=48, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=2, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=46, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=106, PETRI_PLACES=57, PETRI_TRANSITIONS=48} [2023-11-26 11:51:33,170 INFO L281 CegarLoopForPetriNet]: 60 programPoint places, -3 predicate places. [2023-11-26 11:51:33,170 INFO L495 AbstractCegarLoop]: Abstraction has has 57 places, 48 transitions, 106 flow [2023-11-26 11:51:33,171 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 28.666666666666668) internal successors, (86), 3 states have internal predecessors, (86), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-26 11:51:33,171 INFO L200 CegarLoopForPetriNet]: Found error trace [2023-11-26 11:51:33,171 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1] [2023-11-26 11:51:33,171 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable0 [2023-11-26 11:51:33,172 INFO L420 AbstractCegarLoop]: === Iteration 2 === Targeting ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [P0Err0ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 10 more)] === [2023-11-26 11:51:33,174 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-11-26 11:51:33,174 INFO L85 PathProgramCache]: Analyzing trace with hash 12633, now seen corresponding path program 1 times [2023-11-26 11:51:33,175 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-11-26 11:51:33,175 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [801169317] [2023-11-26 11:51:33,176 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-11-26 11:51:33,176 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-11-26 11:51:33,241 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-26 11:51:33,391 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-11-26 11:51:33,391 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-11-26 11:51:33,393 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [801169317] [2023-11-26 11:51:33,393 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [801169317] provided 1 perfect and 0 imperfect interpolant sequences [2023-11-26 11:51:33,393 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-11-26 11:51:33,394 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [1] imperfect sequences [] total 1 [2023-11-26 11:51:33,394 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2033737824] [2023-11-26 11:51:33,394 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-11-26 11:51:33,395 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2023-11-26 11:51:33,396 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-11-26 11:51:33,397 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2023-11-26 11:51:33,398 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2023-11-26 11:51:33,420 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 29 out of 55 [2023-11-26 11:51:33,421 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 57 places, 48 transitions, 106 flow. Second operand has 3 states, 3 states have (on average 29.666666666666668) internal successors, (89), 3 states have internal predecessors, (89), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-26 11:51:33,422 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2023-11-26 11:51:33,422 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 29 of 55 [2023-11-26 11:51:33,422 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2023-11-26 11:51:33,997 INFO L124 PetriNetUnfolderBase]: 1057/2067 cut-off events. [2023-11-26 11:51:33,997 INFO L125 PetriNetUnfolderBase]: For 60/60 co-relation queries the response was YES. [2023-11-26 11:51:34,005 INFO L83 FinitePrefix]: Finished finitePrefix Result has 3751 conditions, 2067 events. 1057/2067 cut-off events. For 60/60 co-relation queries the response was YES. Maximal size of possible extension queue 142. Compared 14121 event pairs, 791 based on Foata normal form. 1/1831 useless extension candidates. Maximal degree in co-relation 3740. Up to 1192 conditions per place. [2023-11-26 11:51:34,025 INFO L140 encePairwiseOnDemand]: 52/55 looper letters, 29 selfloop transitions, 2 changer transitions 0/56 dead transitions. [2023-11-26 11:51:34,025 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 58 places, 56 transitions, 184 flow [2023-11-26 11:51:34,026 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2023-11-26 11:51:34,026 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2023-11-26 11:51:34,030 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 119 transitions. [2023-11-26 11:51:34,033 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.7212121212121212 [2023-11-26 11:51:34,033 INFO L72 ComplementDD]: Start complementDD. Operand 3 states and 119 transitions. [2023-11-26 11:51:34,033 INFO L73 IsDeterministic]: Start isDeterministic. Operand 3 states and 119 transitions. [2023-11-26 11:51:34,036 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2023-11-26 11:51:34,036 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 3 states and 119 transitions. [2023-11-26 11:51:34,038 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 4 states, 3 states have (on average 39.666666666666664) internal successors, (119), 3 states have internal predecessors, (119), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-26 11:51:34,040 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 4 states, 4 states have (on average 55.0) internal successors, (220), 4 states have internal predecessors, (220), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-26 11:51:34,042 INFO L81 ComplementDD]: Finished complementDD. Result has 4 states, 4 states have (on average 55.0) internal successors, (220), 4 states have internal predecessors, (220), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-26 11:51:34,045 INFO L175 Difference]: Start difference. First operand has 57 places, 48 transitions, 106 flow. Second operand 3 states and 119 transitions. [2023-11-26 11:51:34,046 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 58 places, 56 transitions, 184 flow [2023-11-26 11:51:34,050 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 56 places, 56 transitions, 180 flow, removed 0 selfloop flow, removed 2 redundant places. [2023-11-26 11:51:34,053 INFO L231 Difference]: Finished difference. Result has 56 places, 47 transitions, 104 flow [2023-11-26 11:51:34,054 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=55, PETRI_DIFFERENCE_MINUEND_FLOW=100, PETRI_DIFFERENCE_MINUEND_PLACES=54, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=47, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=2, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=45, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=104, PETRI_PLACES=56, PETRI_TRANSITIONS=47} [2023-11-26 11:51:34,055 INFO L281 CegarLoopForPetriNet]: 60 programPoint places, -4 predicate places. [2023-11-26 11:51:34,056 INFO L495 AbstractCegarLoop]: Abstraction has has 56 places, 47 transitions, 104 flow [2023-11-26 11:51:34,057 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 29.666666666666668) internal successors, (89), 3 states have internal predecessors, (89), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-26 11:51:34,057 INFO L200 CegarLoopForPetriNet]: Found error trace [2023-11-26 11:51:34,063 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1] [2023-11-26 11:51:34,063 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1 [2023-11-26 11:51:34,064 INFO L420 AbstractCegarLoop]: === Iteration 3 === Targeting ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [P0Err0ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 10 more)] === [2023-11-26 11:51:34,067 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-11-26 11:51:34,068 INFO L85 PathProgramCache]: Analyzing trace with hash 376699020, now seen corresponding path program 1 times [2023-11-26 11:51:34,068 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-11-26 11:51:34,069 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1354027138] [2023-11-26 11:51:34,069 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-11-26 11:51:34,070 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-11-26 11:51:34,106 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-26 11:51:34,205 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-11-26 11:51:34,205 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-11-26 11:51:34,205 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1354027138] [2023-11-26 11:51:34,206 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1354027138] provided 1 perfect and 0 imperfect interpolant sequences [2023-11-26 11:51:34,207 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-11-26 11:51:34,207 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2023-11-26 11:51:34,207 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1309069089] [2023-11-26 11:51:34,208 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-11-26 11:51:34,208 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2023-11-26 11:51:34,210 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-11-26 11:51:34,211 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2023-11-26 11:51:34,212 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2023-11-26 11:51:34,247 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 28 out of 55 [2023-11-26 11:51:34,247 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 56 places, 47 transitions, 104 flow. Second operand has 3 states, 3 states have (on average 29.333333333333332) internal successors, (88), 3 states have internal predecessors, (88), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-26 11:51:34,248 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2023-11-26 11:51:34,248 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 28 of 55 [2023-11-26 11:51:34,248 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2023-11-26 11:51:34,734 INFO L124 PetriNetUnfolderBase]: 1061/2066 cut-off events. [2023-11-26 11:51:34,734 INFO L125 PetriNetUnfolderBase]: For 60/60 co-relation queries the response was YES. [2023-11-26 11:51:34,742 INFO L83 FinitePrefix]: Finished finitePrefix Result has 3759 conditions, 2066 events. 1061/2066 cut-off events. For 60/60 co-relation queries the response was YES. Maximal size of possible extension queue 142. Compared 14232 event pairs, 571 based on Foata normal form. 0/1841 useless extension candidates. Maximal degree in co-relation 3748. Up to 1195 conditions per place. [2023-11-26 11:51:34,762 INFO L140 encePairwiseOnDemand]: 52/55 looper letters, 30 selfloop transitions, 2 changer transitions 0/55 dead transitions. [2023-11-26 11:51:34,762 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 57 places, 55 transitions, 184 flow [2023-11-26 11:51:34,763 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2023-11-26 11:51:34,763 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2023-11-26 11:51:34,823 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 117 transitions. [2023-11-26 11:51:34,824 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.7090909090909091 [2023-11-26 11:51:34,824 INFO L72 ComplementDD]: Start complementDD. Operand 3 states and 117 transitions. [2023-11-26 11:51:34,824 INFO L73 IsDeterministic]: Start isDeterministic. Operand 3 states and 117 transitions. [2023-11-26 11:51:34,824 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2023-11-26 11:51:34,825 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 3 states and 117 transitions. [2023-11-26 11:51:34,826 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 4 states, 3 states have (on average 39.0) internal successors, (117), 3 states have internal predecessors, (117), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-26 11:51:34,827 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 4 states, 4 states have (on average 55.0) internal successors, (220), 4 states have internal predecessors, (220), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-26 11:51:34,827 INFO L81 ComplementDD]: Finished complementDD. Result has 4 states, 4 states have (on average 55.0) internal successors, (220), 4 states have internal predecessors, (220), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-26 11:51:34,827 INFO L175 Difference]: Start difference. First operand has 56 places, 47 transitions, 104 flow. Second operand 3 states and 117 transitions. [2023-11-26 11:51:34,827 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 57 places, 55 transitions, 184 flow [2023-11-26 11:51:34,830 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 55 places, 55 transitions, 180 flow, removed 0 selfloop flow, removed 2 redundant places. [2023-11-26 11:51:34,831 INFO L231 Difference]: Finished difference. Result has 55 places, 46 transitions, 102 flow [2023-11-26 11:51:34,834 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=55, PETRI_DIFFERENCE_MINUEND_FLOW=98, PETRI_DIFFERENCE_MINUEND_PLACES=53, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=46, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=2, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=44, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=102, PETRI_PLACES=55, PETRI_TRANSITIONS=46} [2023-11-26 11:51:34,836 INFO L281 CegarLoopForPetriNet]: 60 programPoint places, -5 predicate places. [2023-11-26 11:51:34,837 INFO L495 AbstractCegarLoop]: Abstraction has has 55 places, 46 transitions, 102 flow [2023-11-26 11:51:34,837 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 29.333333333333332) internal successors, (88), 3 states have internal predecessors, (88), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-26 11:51:34,837 INFO L200 CegarLoopForPetriNet]: Found error trace [2023-11-26 11:51:34,838 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1] [2023-11-26 11:51:34,838 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2 [2023-11-26 11:51:34,838 INFO L420 AbstractCegarLoop]: === Iteration 4 === Targeting ULTIMATE.startErr3REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [P0Err0ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 10 more)] === [2023-11-26 11:51:34,839 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-11-26 11:51:34,844 INFO L85 PathProgramCache]: Analyzing trace with hash 376699021, now seen corresponding path program 1 times [2023-11-26 11:51:34,844 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-11-26 11:51:34,844 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1668808489] [2023-11-26 11:51:34,845 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-11-26 11:51:34,846 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-11-26 11:51:34,888 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-26 11:51:35,024 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-11-26 11:51:35,025 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-11-26 11:51:35,027 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1668808489] [2023-11-26 11:51:35,028 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1668808489] provided 1 perfect and 0 imperfect interpolant sequences [2023-11-26 11:51:35,028 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-11-26 11:51:35,028 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2023-11-26 11:51:35,034 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [578391262] [2023-11-26 11:51:35,035 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-11-26 11:51:35,035 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2023-11-26 11:51:35,035 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-11-26 11:51:35,039 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2023-11-26 11:51:35,039 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2023-11-26 11:51:35,058 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 29 out of 55 [2023-11-26 11:51:35,059 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 55 places, 46 transitions, 102 flow. Second operand has 3 states, 3 states have (on average 30.333333333333332) internal successors, (91), 3 states have internal predecessors, (91), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-26 11:51:35,059 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2023-11-26 11:51:35,059 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 29 of 55 [2023-11-26 11:51:35,059 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2023-11-26 11:51:35,585 INFO L124 PetriNetUnfolderBase]: 1057/2057 cut-off events. [2023-11-26 11:51:35,585 INFO L125 PetriNetUnfolderBase]: For 64/64 co-relation queries the response was YES. [2023-11-26 11:51:35,593 INFO L83 FinitePrefix]: Finished finitePrefix Result has 3745 conditions, 2057 events. 1057/2057 cut-off events. For 64/64 co-relation queries the response was YES. Maximal size of possible extension queue 142. Compared 14183 event pairs, 571 based on Foata normal form. 5/1838 useless extension candidates. Maximal degree in co-relation 3735. Up to 1186 conditions per place. [2023-11-26 11:51:35,611 INFO L140 encePairwiseOnDemand]: 52/55 looper letters, 29 selfloop transitions, 2 changer transitions 0/54 dead transitions. [2023-11-26 11:51:35,612 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 56 places, 54 transitions, 180 flow [2023-11-26 11:51:35,612 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2023-11-26 11:51:35,612 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2023-11-26 11:51:35,614 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 119 transitions. [2023-11-26 11:51:35,615 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.7212121212121212 [2023-11-26 11:51:35,615 INFO L72 ComplementDD]: Start complementDD. Operand 3 states and 119 transitions. [2023-11-26 11:51:35,615 INFO L73 IsDeterministic]: Start isDeterministic. Operand 3 states and 119 transitions. [2023-11-26 11:51:35,616 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2023-11-26 11:51:35,616 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 3 states and 119 transitions. [2023-11-26 11:51:35,619 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 4 states, 3 states have (on average 39.666666666666664) internal successors, (119), 3 states have internal predecessors, (119), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-26 11:51:35,620 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 4 states, 4 states have (on average 55.0) internal successors, (220), 4 states have internal predecessors, (220), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-26 11:51:35,621 INFO L81 ComplementDD]: Finished complementDD. Result has 4 states, 4 states have (on average 55.0) internal successors, (220), 4 states have internal predecessors, (220), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-26 11:51:35,621 INFO L175 Difference]: Start difference. First operand has 55 places, 46 transitions, 102 flow. Second operand 3 states and 119 transitions. [2023-11-26 11:51:35,621 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 56 places, 54 transitions, 180 flow [2023-11-26 11:51:35,624 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 54 places, 54 transitions, 176 flow, removed 0 selfloop flow, removed 2 redundant places. [2023-11-26 11:51:35,626 INFO L231 Difference]: Finished difference. Result has 54 places, 45 transitions, 100 flow [2023-11-26 11:51:35,626 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=55, PETRI_DIFFERENCE_MINUEND_FLOW=96, PETRI_DIFFERENCE_MINUEND_PLACES=52, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=45, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=2, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=43, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=100, PETRI_PLACES=54, PETRI_TRANSITIONS=45} [2023-11-26 11:51:35,628 INFO L281 CegarLoopForPetriNet]: 60 programPoint places, -6 predicate places. [2023-11-26 11:51:35,629 INFO L495 AbstractCegarLoop]: Abstraction has has 54 places, 45 transitions, 100 flow [2023-11-26 11:51:35,629 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 30.333333333333332) internal successors, (91), 3 states have internal predecessors, (91), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-26 11:51:35,629 INFO L200 CegarLoopForPetriNet]: Found error trace [2023-11-26 11:51:35,629 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1] [2023-11-26 11:51:35,630 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable3 [2023-11-26 11:51:35,631 INFO L420 AbstractCegarLoop]: === Iteration 5 === Targeting P0Err0ASSERT_VIOLATIONMEMORY_LEAK === [P0Err0ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 10 more)] === [2023-11-26 11:51:35,632 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-11-26 11:51:35,632 INFO L85 PathProgramCache]: Analyzing trace with hash 376699527, now seen corresponding path program 1 times [2023-11-26 11:51:35,632 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-11-26 11:51:35,633 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1870779998] [2023-11-26 11:51:35,633 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-11-26 11:51:35,633 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-11-26 11:51:35,664 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-26 11:51:35,814 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-11-26 11:51:35,814 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-11-26 11:51:35,815 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1870779998] [2023-11-26 11:51:35,815 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1870779998] provided 1 perfect and 0 imperfect interpolant sequences [2023-11-26 11:51:35,815 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-11-26 11:51:35,816 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [1] imperfect sequences [] total 1 [2023-11-26 11:51:35,816 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [36998344] [2023-11-26 11:51:35,816 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-11-26 11:51:35,817 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2023-11-26 11:51:35,817 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-11-26 11:51:35,818 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2023-11-26 11:51:35,818 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2023-11-26 11:51:35,819 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 30 out of 55 [2023-11-26 11:51:35,819 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 54 places, 45 transitions, 100 flow. Second operand has 3 states, 3 states have (on average 31.0) internal successors, (93), 3 states have internal predecessors, (93), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-26 11:51:35,820 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2023-11-26 11:51:35,820 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 30 of 55 [2023-11-26 11:51:35,820 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2023-11-26 11:51:36,212 INFO L124 PetriNetUnfolderBase]: 825/1544 cut-off events. [2023-11-26 11:51:36,213 INFO L125 PetriNetUnfolderBase]: For 51/51 co-relation queries the response was YES. [2023-11-26 11:51:36,218 INFO L83 FinitePrefix]: Finished finitePrefix Result has 2875 conditions, 1544 events. 825/1544 cut-off events. For 51/51 co-relation queries the response was YES. Maximal size of possible extension queue 111. Compared 10043 event pairs, 129 based on Foata normal form. 0/1512 useless extension candidates. Maximal degree in co-relation 2865. Up to 1009 conditions per place. [2023-11-26 11:51:36,231 INFO L140 encePairwiseOnDemand]: 52/55 looper letters, 33 selfloop transitions, 2 changer transitions 2/60 dead transitions. [2023-11-26 11:51:36,231 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 55 places, 60 transitions, 212 flow [2023-11-26 11:51:36,232 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2023-11-26 11:51:36,232 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2023-11-26 11:51:36,233 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 128 transitions. [2023-11-26 11:51:36,233 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.7757575757575758 [2023-11-26 11:51:36,234 INFO L72 ComplementDD]: Start complementDD. Operand 3 states and 128 transitions. [2023-11-26 11:51:36,234 INFO L73 IsDeterministic]: Start isDeterministic. Operand 3 states and 128 transitions. [2023-11-26 11:51:36,234 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2023-11-26 11:51:36,234 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 3 states and 128 transitions. [2023-11-26 11:51:36,235 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 4 states, 3 states have (on average 42.666666666666664) internal successors, (128), 3 states have internal predecessors, (128), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-26 11:51:36,236 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 4 states, 4 states have (on average 55.0) internal successors, (220), 4 states have internal predecessors, (220), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-26 11:51:36,237 INFO L81 ComplementDD]: Finished complementDD. Result has 4 states, 4 states have (on average 55.0) internal successors, (220), 4 states have internal predecessors, (220), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-26 11:51:36,237 INFO L175 Difference]: Start difference. First operand has 54 places, 45 transitions, 100 flow. Second operand 3 states and 128 transitions. [2023-11-26 11:51:36,237 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 55 places, 60 transitions, 212 flow [2023-11-26 11:51:36,241 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 53 places, 60 transitions, 204 flow, removed 0 selfloop flow, removed 2 redundant places. [2023-11-26 11:51:36,244 INFO L231 Difference]: Finished difference. Result has 53 places, 43 transitions, 96 flow [2023-11-26 11:51:36,244 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=55, PETRI_DIFFERENCE_MINUEND_FLOW=94, PETRI_DIFFERENCE_MINUEND_PLACES=51, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=44, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=2, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=42, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=96, PETRI_PLACES=53, PETRI_TRANSITIONS=43} [2023-11-26 11:51:36,248 INFO L281 CegarLoopForPetriNet]: 60 programPoint places, -7 predicate places. [2023-11-26 11:51:36,248 INFO L495 AbstractCegarLoop]: Abstraction has has 53 places, 43 transitions, 96 flow [2023-11-26 11:51:36,248 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 31.0) internal successors, (93), 3 states have internal predecessors, (93), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-26 11:51:36,248 INFO L200 CegarLoopForPetriNet]: Found error trace [2023-11-26 11:51:36,249 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1] [2023-11-26 11:51:36,249 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable4 [2023-11-26 11:51:36,249 INFO L420 AbstractCegarLoop]: === Iteration 6 === Targeting ULTIMATE.startErr4REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [P0Err0ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 10 more)] === [2023-11-26 11:51:36,250 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-11-26 11:51:36,250 INFO L85 PathProgramCache]: Analyzing trace with hash -508657026, now seen corresponding path program 1 times [2023-11-26 11:51:36,251 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-11-26 11:51:36,252 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2030817140] [2023-11-26 11:51:36,252 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-11-26 11:51:36,252 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-11-26 11:51:36,270 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-26 11:51:36,362 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-11-26 11:51:36,362 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-11-26 11:51:36,363 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2030817140] [2023-11-26 11:51:36,363 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2030817140] provided 1 perfect and 0 imperfect interpolant sequences [2023-11-26 11:51:36,363 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-11-26 11:51:36,364 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2023-11-26 11:51:36,364 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1026066877] [2023-11-26 11:51:36,364 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-11-26 11:51:36,365 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2023-11-26 11:51:36,365 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-11-26 11:51:36,366 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2023-11-26 11:51:36,366 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2023-11-26 11:51:36,384 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 28 out of 55 [2023-11-26 11:51:36,385 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 53 places, 43 transitions, 96 flow. Second operand has 3 states, 3 states have (on average 30.0) internal successors, (90), 3 states have internal predecessors, (90), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-26 11:51:36,385 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2023-11-26 11:51:36,385 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 28 of 55 [2023-11-26 11:51:36,386 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2023-11-26 11:51:36,739 INFO L124 PetriNetUnfolderBase]: 738/1459 cut-off events. [2023-11-26 11:51:36,740 INFO L125 PetriNetUnfolderBase]: For 95/95 co-relation queries the response was YES. [2023-11-26 11:51:36,745 INFO L83 FinitePrefix]: Finished finitePrefix Result has 2711 conditions, 1459 events. 738/1459 cut-off events. For 95/95 co-relation queries the response was YES. Maximal size of possible extension queue 104. Compared 9451 event pairs, 428 based on Foata normal form. 0/1384 useless extension candidates. Maximal degree in co-relation 2700. Up to 934 conditions per place. [2023-11-26 11:51:36,758 INFO L140 encePairwiseOnDemand]: 52/55 looper letters, 27 selfloop transitions, 2 changer transitions 0/50 dead transitions. [2023-11-26 11:51:36,758 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 53 places, 50 transitions, 170 flow [2023-11-26 11:51:36,759 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2023-11-26 11:51:36,759 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2023-11-26 11:51:36,760 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 114 transitions. [2023-11-26 11:51:36,760 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.6909090909090909 [2023-11-26 11:51:36,760 INFO L72 ComplementDD]: Start complementDD. Operand 3 states and 114 transitions. [2023-11-26 11:51:36,761 INFO L73 IsDeterministic]: Start isDeterministic. Operand 3 states and 114 transitions. [2023-11-26 11:51:36,761 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2023-11-26 11:51:36,761 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 3 states and 114 transitions. [2023-11-26 11:51:36,762 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 4 states, 3 states have (on average 38.0) internal successors, (114), 3 states have internal predecessors, (114), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-26 11:51:36,764 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 4 states, 4 states have (on average 55.0) internal successors, (220), 4 states have internal predecessors, (220), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-26 11:51:36,765 INFO L81 ComplementDD]: Finished complementDD. Result has 4 states, 4 states have (on average 55.0) internal successors, (220), 4 states have internal predecessors, (220), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-26 11:51:36,765 INFO L175 Difference]: Start difference. First operand has 53 places, 43 transitions, 96 flow. Second operand 3 states and 114 transitions. [2023-11-26 11:51:36,765 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 53 places, 50 transitions, 170 flow [2023-11-26 11:51:36,766 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 51 places, 50 transitions, 164 flow, removed 0 selfloop flow, removed 2 redundant places. [2023-11-26 11:51:36,769 INFO L231 Difference]: Finished difference. Result has 51 places, 42 transitions, 94 flow [2023-11-26 11:51:36,770 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=55, PETRI_DIFFERENCE_MINUEND_FLOW=90, PETRI_DIFFERENCE_MINUEND_PLACES=49, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=42, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=2, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=40, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=94, PETRI_PLACES=51, PETRI_TRANSITIONS=42} [2023-11-26 11:51:36,774 INFO L281 CegarLoopForPetriNet]: 60 programPoint places, -9 predicate places. [2023-11-26 11:51:36,774 INFO L495 AbstractCegarLoop]: Abstraction has has 51 places, 42 transitions, 94 flow [2023-11-26 11:51:36,774 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 30.0) internal successors, (90), 3 states have internal predecessors, (90), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-26 11:51:36,775 INFO L200 CegarLoopForPetriNet]: Found error trace [2023-11-26 11:51:36,775 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1] [2023-11-26 11:51:36,775 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable5 [2023-11-26 11:51:36,776 INFO L420 AbstractCegarLoop]: === Iteration 7 === Targeting ULTIMATE.startErr5REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [P0Err0ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 10 more)] === [2023-11-26 11:51:36,776 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-11-26 11:51:36,776 INFO L85 PathProgramCache]: Analyzing trace with hash -508657025, now seen corresponding path program 1 times [2023-11-26 11:51:36,777 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-11-26 11:51:36,777 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [879955665] [2023-11-26 11:51:36,777 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-11-26 11:51:36,778 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-11-26 11:51:36,802 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-26 11:51:36,892 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-11-26 11:51:36,893 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-11-26 11:51:36,893 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [879955665] [2023-11-26 11:51:36,899 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [879955665] provided 1 perfect and 0 imperfect interpolant sequences [2023-11-26 11:51:36,900 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-11-26 11:51:36,900 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2023-11-26 11:51:36,900 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1232679352] [2023-11-26 11:51:36,900 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-11-26 11:51:36,901 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2023-11-26 11:51:36,901 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-11-26 11:51:36,902 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2023-11-26 11:51:36,902 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2023-11-26 11:51:36,921 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 29 out of 55 [2023-11-26 11:51:36,922 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 51 places, 42 transitions, 94 flow. Second operand has 3 states, 3 states have (on average 31.0) internal successors, (93), 3 states have internal predecessors, (93), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-26 11:51:36,922 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2023-11-26 11:51:36,922 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 29 of 55 [2023-11-26 11:51:36,922 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2023-11-26 11:51:37,278 INFO L124 PetriNetUnfolderBase]: 721/1450 cut-off events. [2023-11-26 11:51:37,278 INFO L125 PetriNetUnfolderBase]: For 56/56 co-relation queries the response was YES. [2023-11-26 11:51:37,283 INFO L83 FinitePrefix]: Finished finitePrefix Result has 2637 conditions, 1450 events. 721/1450 cut-off events. For 56/56 co-relation queries the response was YES. Maximal size of possible extension queue 104. Compared 9510 event pairs, 260 based on Foata normal form. 12/1395 useless extension candidates. Maximal degree in co-relation 2627. Up to 905 conditions per place. [2023-11-26 11:51:37,295 INFO L140 encePairwiseOnDemand]: 52/55 looper letters, 26 selfloop transitions, 2 changer transitions 0/49 dead transitions. [2023-11-26 11:51:37,295 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 52 places, 49 transitions, 164 flow [2023-11-26 11:51:37,296 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2023-11-26 11:51:37,297 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2023-11-26 11:51:37,297 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 116 transitions. [2023-11-26 11:51:37,298 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.703030303030303 [2023-11-26 11:51:37,298 INFO L72 ComplementDD]: Start complementDD. Operand 3 states and 116 transitions. [2023-11-26 11:51:37,298 INFO L73 IsDeterministic]: Start isDeterministic. Operand 3 states and 116 transitions. [2023-11-26 11:51:37,298 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2023-11-26 11:51:37,299 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 3 states and 116 transitions. [2023-11-26 11:51:37,299 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 4 states, 3 states have (on average 38.666666666666664) internal successors, (116), 3 states have internal predecessors, (116), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-26 11:51:37,301 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 4 states, 4 states have (on average 55.0) internal successors, (220), 4 states have internal predecessors, (220), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-26 11:51:37,302 INFO L81 ComplementDD]: Finished complementDD. Result has 4 states, 4 states have (on average 55.0) internal successors, (220), 4 states have internal predecessors, (220), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-26 11:51:37,302 INFO L175 Difference]: Start difference. First operand has 51 places, 42 transitions, 94 flow. Second operand 3 states and 116 transitions. [2023-11-26 11:51:37,302 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 52 places, 49 transitions, 164 flow [2023-11-26 11:51:37,306 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 50 places, 49 transitions, 160 flow, removed 0 selfloop flow, removed 2 redundant places. [2023-11-26 11:51:37,307 INFO L231 Difference]: Finished difference. Result has 50 places, 41 transitions, 92 flow [2023-11-26 11:51:37,308 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=55, PETRI_DIFFERENCE_MINUEND_FLOW=88, PETRI_DIFFERENCE_MINUEND_PLACES=48, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=41, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=2, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=39, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=92, PETRI_PLACES=50, PETRI_TRANSITIONS=41} [2023-11-26 11:51:37,309 INFO L281 CegarLoopForPetriNet]: 60 programPoint places, -10 predicate places. [2023-11-26 11:51:37,309 INFO L495 AbstractCegarLoop]: Abstraction has has 50 places, 41 transitions, 92 flow [2023-11-26 11:51:37,311 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 31.0) internal successors, (93), 3 states have internal predecessors, (93), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-26 11:51:37,311 INFO L200 CegarLoopForPetriNet]: Found error trace [2023-11-26 11:51:37,311 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-11-26 11:51:37,312 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable6 [2023-11-26 11:51:37,312 INFO L420 AbstractCegarLoop]: === Iteration 8 === Targeting ULTIMATE.startErr7ASSERT_VIOLATIONMEMORY_LEAK === [P0Err0ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 10 more)] === [2023-11-26 11:51:37,312 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-11-26 11:51:37,313 INFO L85 PathProgramCache]: Analyzing trace with hash -2112956161, now seen corresponding path program 1 times [2023-11-26 11:51:37,313 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-11-26 11:51:37,313 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1941586911] [2023-11-26 11:51:37,313 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-11-26 11:51:37,314 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-11-26 11:51:37,386 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-26 11:51:38,174 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-11-26 11:51:38,174 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-11-26 11:51:38,175 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1941586911] [2023-11-26 11:51:38,175 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1941586911] provided 1 perfect and 0 imperfect interpolant sequences [2023-11-26 11:51:38,175 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-11-26 11:51:38,175 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2023-11-26 11:51:38,176 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1306066204] [2023-11-26 11:51:38,176 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-11-26 11:51:38,177 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 9 states [2023-11-26 11:51:38,177 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-11-26 11:51:38,178 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2023-11-26 11:51:38,178 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=17, Invalid=55, Unknown=0, NotChecked=0, Total=72 [2023-11-26 11:51:38,467 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 26 out of 55 [2023-11-26 11:51:38,467 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 50 places, 41 transitions, 92 flow. Second operand has 9 states, 9 states have (on average 27.666666666666668) internal successors, (249), 9 states have internal predecessors, (249), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-26 11:51:38,468 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2023-11-26 11:51:38,468 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 26 of 55 [2023-11-26 11:51:38,468 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2023-11-26 11:51:39,165 INFO L124 PetriNetUnfolderBase]: 915/1576 cut-off events. [2023-11-26 11:51:39,165 INFO L125 PetriNetUnfolderBase]: For 68/68 co-relation queries the response was YES. [2023-11-26 11:51:39,170 INFO L83 FinitePrefix]: Finished finitePrefix Result has 3058 conditions, 1576 events. 915/1576 cut-off events. For 68/68 co-relation queries the response was YES. Maximal size of possible extension queue 109. Compared 9133 event pairs, 12 based on Foata normal form. 60/1606 useless extension candidates. Maximal degree in co-relation 3047. Up to 936 conditions per place. [2023-11-26 11:51:39,184 INFO L140 encePairwiseOnDemand]: 49/55 looper letters, 36 selfloop transitions, 4 changer transitions 11/68 dead transitions. [2023-11-26 11:51:39,184 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 55 places, 68 transitions, 250 flow [2023-11-26 11:51:39,185 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2023-11-26 11:51:39,185 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 7 states. [2023-11-26 11:51:39,186 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 7 states to 7 states and 234 transitions. [2023-11-26 11:51:39,187 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.6077922077922078 [2023-11-26 11:51:39,187 INFO L72 ComplementDD]: Start complementDD. Operand 7 states and 234 transitions. [2023-11-26 11:51:39,187 INFO L73 IsDeterministic]: Start isDeterministic. Operand 7 states and 234 transitions. [2023-11-26 11:51:39,188 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2023-11-26 11:51:39,188 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 7 states and 234 transitions. [2023-11-26 11:51:39,189 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 8 states, 7 states have (on average 33.42857142857143) internal successors, (234), 7 states have internal predecessors, (234), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-26 11:51:39,191 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 8 states, 8 states have (on average 55.0) internal successors, (440), 8 states have internal predecessors, (440), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-26 11:51:39,191 INFO L81 ComplementDD]: Finished complementDD. Result has 8 states, 8 states have (on average 55.0) internal successors, (440), 8 states have internal predecessors, (440), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-26 11:51:39,192 INFO L175 Difference]: Start difference. First operand has 50 places, 41 transitions, 92 flow. Second operand 7 states and 234 transitions. [2023-11-26 11:51:39,192 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 55 places, 68 transitions, 250 flow [2023-11-26 11:51:39,193 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 53 places, 68 transitions, 244 flow, removed 0 selfloop flow, removed 2 redundant places. [2023-11-26 11:51:39,195 INFO L231 Difference]: Finished difference. Result has 53 places, 39 transitions, 92 flow [2023-11-26 11:51:39,196 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=55, PETRI_DIFFERENCE_MINUEND_FLOW=86, PETRI_DIFFERENCE_MINUEND_PLACES=47, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=40, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=4, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=36, PETRI_DIFFERENCE_SUBTRAHEND_STATES=7, PETRI_FLOW=92, PETRI_PLACES=53, PETRI_TRANSITIONS=39} [2023-11-26 11:51:39,196 INFO L281 CegarLoopForPetriNet]: 60 programPoint places, -7 predicate places. [2023-11-26 11:51:39,197 INFO L495 AbstractCegarLoop]: Abstraction has has 53 places, 39 transitions, 92 flow [2023-11-26 11:51:39,197 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 9 states, 9 states have (on average 27.666666666666668) internal successors, (249), 9 states have internal predecessors, (249), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-26 11:51:39,197 INFO L200 CegarLoopForPetriNet]: Found error trace [2023-11-26 11:51:39,198 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-11-26 11:51:39,198 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable7 [2023-11-26 11:51:39,198 INFO L420 AbstractCegarLoop]: === Iteration 9 === Targeting ULTIMATE.startErr6ASSERT_VIOLATIONMEMORY_LEAK === [P0Err0ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 10 more)] === [2023-11-26 11:51:39,199 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-11-26 11:51:39,199 INFO L85 PathProgramCache]: Analyzing trace with hash -2112954787, now seen corresponding path program 1 times [2023-11-26 11:51:39,199 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-11-26 11:51:39,200 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1056134299] [2023-11-26 11:51:39,200 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-11-26 11:51:39,200 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-11-26 11:51:39,227 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-26 11:51:39,466 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-11-26 11:51:39,467 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-11-26 11:51:39,467 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1056134299] [2023-11-26 11:51:39,467 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1056134299] provided 1 perfect and 0 imperfect interpolant sequences [2023-11-26 11:51:39,467 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-11-26 11:51:39,467 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2023-11-26 11:51:39,468 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1628192102] [2023-11-26 11:51:39,468 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-11-26 11:51:39,469 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2023-11-26 11:51:39,469 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-11-26 11:51:39,469 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2023-11-26 11:51:39,470 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2023-11-26 11:51:39,491 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 23 out of 55 [2023-11-26 11:51:39,491 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 53 places, 39 transitions, 92 flow. Second operand has 5 states, 5 states have (on average 25.4) internal successors, (127), 5 states have internal predecessors, (127), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-26 11:51:39,492 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2023-11-26 11:51:39,492 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 23 of 55 [2023-11-26 11:51:39,492 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2023-11-26 11:51:41,487 INFO L124 PetriNetUnfolderBase]: 6319/10132 cut-off events. [2023-11-26 11:51:41,487 INFO L125 PetriNetUnfolderBase]: For 536/536 co-relation queries the response was YES. [2023-11-26 11:51:41,518 INFO L83 FinitePrefix]: Finished finitePrefix Result has 19947 conditions, 10132 events. 6319/10132 cut-off events. For 536/536 co-relation queries the response was YES. Maximal size of possible extension queue 531. Compared 70427 event pairs, 1321 based on Foata normal form. 0/9803 useless extension candidates. Maximal degree in co-relation 19936. Up to 3178 conditions per place. [2023-11-26 11:51:41,565 INFO L140 encePairwiseOnDemand]: 44/55 looper letters, 38 selfloop transitions, 7 changer transitions 85/143 dead transitions. [2023-11-26 11:51:41,565 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 59 places, 143 transitions, 578 flow [2023-11-26 11:51:41,566 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2023-11-26 11:51:41,566 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 9 states. [2023-11-26 11:51:41,568 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 9 states to 9 states and 339 transitions. [2023-11-26 11:51:41,569 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.6848484848484848 [2023-11-26 11:51:41,569 INFO L72 ComplementDD]: Start complementDD. Operand 9 states and 339 transitions. [2023-11-26 11:51:41,570 INFO L73 IsDeterministic]: Start isDeterministic. Operand 9 states and 339 transitions. [2023-11-26 11:51:41,570 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2023-11-26 11:51:41,570 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 9 states and 339 transitions. [2023-11-26 11:51:41,572 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 10 states, 9 states have (on average 37.666666666666664) internal successors, (339), 9 states have internal predecessors, (339), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-26 11:51:41,574 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 10 states, 10 states have (on average 55.0) internal successors, (550), 10 states have internal predecessors, (550), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-26 11:51:41,574 INFO L81 ComplementDD]: Finished complementDD. Result has 10 states, 10 states have (on average 55.0) internal successors, (550), 10 states have internal predecessors, (550), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-26 11:51:41,575 INFO L175 Difference]: Start difference. First operand has 53 places, 39 transitions, 92 flow. Second operand 9 states and 339 transitions. [2023-11-26 11:51:41,575 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 59 places, 143 transitions, 578 flow [2023-11-26 11:51:41,585 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 55 places, 143 transitions, 562 flow, removed 0 selfloop flow, removed 4 redundant places. [2023-11-26 11:51:41,589 INFO L231 Difference]: Finished difference. Result has 63 places, 44 transitions, 182 flow [2023-11-26 11:51:41,589 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=55, PETRI_DIFFERENCE_MINUEND_FLOW=85, PETRI_DIFFERENCE_MINUEND_PLACES=47, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=39, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=1, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=32, PETRI_DIFFERENCE_SUBTRAHEND_STATES=9, PETRI_FLOW=182, PETRI_PLACES=63, PETRI_TRANSITIONS=44} [2023-11-26 11:51:41,591 INFO L281 CegarLoopForPetriNet]: 60 programPoint places, 3 predicate places. [2023-11-26 11:51:41,591 INFO L495 AbstractCegarLoop]: Abstraction has has 63 places, 44 transitions, 182 flow [2023-11-26 11:51:41,592 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 25.4) internal successors, (127), 5 states have internal predecessors, (127), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-26 11:51:41,592 INFO L200 CegarLoopForPetriNet]: Found error trace [2023-11-26 11:51:41,592 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] [2023-11-26 11:51:41,592 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable8 [2023-11-26 11:51:41,593 INFO L420 AbstractCegarLoop]: === Iteration 10 === Targeting ULTIMATE.startErr6ASSERT_VIOLATIONMEMORY_LEAK === [P0Err0ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 10 more)] === [2023-11-26 11:51:41,593 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-11-26 11:51:41,593 INFO L85 PathProgramCache]: Analyzing trace with hash 67819196, now seen corresponding path program 1 times [2023-11-26 11:51:41,594 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-11-26 11:51:41,594 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1529465656] [2023-11-26 11:51:41,594 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-11-26 11:51:41,594 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-11-26 11:51:41,632 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-26 11:51:41,893 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-11-26 11:51:41,894 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-11-26 11:51:41,894 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1529465656] [2023-11-26 11:51:41,894 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1529465656] provided 1 perfect and 0 imperfect interpolant sequences [2023-11-26 11:51:41,894 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-11-26 11:51:41,895 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2023-11-26 11:51:41,895 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1580158365] [2023-11-26 11:51:41,895 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-11-26 11:51:41,896 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2023-11-26 11:51:41,896 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-11-26 11:51:41,896 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2023-11-26 11:51:41,897 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=10, Invalid=20, Unknown=0, NotChecked=0, Total=30 [2023-11-26 11:51:41,908 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 23 out of 55 [2023-11-26 11:51:41,908 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 63 places, 44 transitions, 182 flow. Second operand has 6 states, 6 states have (on average 25.166666666666668) internal successors, (151), 6 states have internal predecessors, (151), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-26 11:51:41,909 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2023-11-26 11:51:41,909 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 23 of 55 [2023-11-26 11:51:41,909 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2023-11-26 11:51:43,535 INFO L124 PetriNetUnfolderBase]: 4486/7421 cut-off events. [2023-11-26 11:51:43,535 INFO L125 PetriNetUnfolderBase]: For 10148/10173 co-relation queries the response was YES. [2023-11-26 11:51:43,570 INFO L83 FinitePrefix]: Finished finitePrefix Result has 21618 conditions, 7421 events. 4486/7421 cut-off events. For 10148/10173 co-relation queries the response was YES. Maximal size of possible extension queue 377. Compared 50749 event pairs, 744 based on Foata normal form. 253/7639 useless extension candidates. Maximal degree in co-relation 21599. Up to 2381 conditions per place. [2023-11-26 11:51:43,608 INFO L140 encePairwiseOnDemand]: 46/55 looper letters, 50 selfloop transitions, 7 changer transitions 78/148 dead transitions. [2023-11-26 11:51:43,608 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 65 places, 148 transitions, 938 flow [2023-11-26 11:51:43,609 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2023-11-26 11:51:43,609 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 10 states. [2023-11-26 11:51:43,611 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 10 states to 10 states and 353 transitions. [2023-11-26 11:51:43,611 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.6418181818181818 [2023-11-26 11:51:43,612 INFO L72 ComplementDD]: Start complementDD. Operand 10 states and 353 transitions. [2023-11-26 11:51:43,612 INFO L73 IsDeterministic]: Start isDeterministic. Operand 10 states and 353 transitions. [2023-11-26 11:51:43,612 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2023-11-26 11:51:43,612 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 10 states and 353 transitions. [2023-11-26 11:51:43,614 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 11 states, 10 states have (on average 35.3) internal successors, (353), 10 states have internal predecessors, (353), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-26 11:51:43,616 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 11 states, 11 states have (on average 55.0) internal successors, (605), 11 states have internal predecessors, (605), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-26 11:51:43,617 INFO L81 ComplementDD]: Finished complementDD. Result has 11 states, 11 states have (on average 55.0) internal successors, (605), 11 states have internal predecessors, (605), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-26 11:51:43,617 INFO L175 Difference]: Start difference. First operand has 63 places, 44 transitions, 182 flow. Second operand 10 states and 353 transitions. [2023-11-26 11:51:43,617 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 65 places, 148 transitions, 938 flow [2023-11-26 11:51:43,657 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 61 places, 148 transitions, 822 flow, removed 30 selfloop flow, removed 4 redundant places. [2023-11-26 11:51:43,664 INFO L231 Difference]: Finished difference. Result has 70 places, 47 transitions, 226 flow [2023-11-26 11:51:43,665 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=55, PETRI_DIFFERENCE_MINUEND_FLOW=154, PETRI_DIFFERENCE_MINUEND_PLACES=52, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=44, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=4, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=37, PETRI_DIFFERENCE_SUBTRAHEND_STATES=10, PETRI_FLOW=226, PETRI_PLACES=70, PETRI_TRANSITIONS=47} [2023-11-26 11:51:43,666 INFO L281 CegarLoopForPetriNet]: 60 programPoint places, 10 predicate places. [2023-11-26 11:51:43,666 INFO L495 AbstractCegarLoop]: Abstraction has has 70 places, 47 transitions, 226 flow [2023-11-26 11:51:43,667 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 25.166666666666668) internal successors, (151), 6 states have internal predecessors, (151), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-26 11:51:43,668 INFO L200 CegarLoopForPetriNet]: Found error trace [2023-11-26 11:51:43,668 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-11-26 11:51:43,668 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable9 [2023-11-26 11:51:43,669 INFO L420 AbstractCegarLoop]: === Iteration 11 === Targeting ULTIMATE.startErr6ASSERT_VIOLATIONMEMORY_LEAK === [P0Err0ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 10 more)] === [2023-11-26 11:51:43,669 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-11-26 11:51:43,669 INFO L85 PathProgramCache]: Analyzing trace with hash -762097381, now seen corresponding path program 1 times [2023-11-26 11:51:43,670 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-11-26 11:51:43,670 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1011851305] [2023-11-26 11:51:43,670 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-11-26 11:51:43,671 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-11-26 11:51:43,706 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-26 11:51:43,908 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-11-26 11:51:43,908 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-11-26 11:51:43,908 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1011851305] [2023-11-26 11:51:43,909 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1011851305] provided 1 perfect and 0 imperfect interpolant sequences [2023-11-26 11:51:43,909 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-11-26 11:51:43,909 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2023-11-26 11:51:43,909 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1600520505] [2023-11-26 11:51:43,910 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-11-26 11:51:43,910 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2023-11-26 11:51:43,911 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-11-26 11:51:43,911 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2023-11-26 11:51:43,911 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=10, Invalid=20, Unknown=0, NotChecked=0, Total=30 [2023-11-26 11:51:43,926 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 23 out of 55 [2023-11-26 11:51:43,927 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 70 places, 47 transitions, 226 flow. Second operand has 6 states, 6 states have (on average 25.333333333333332) internal successors, (152), 6 states have internal predecessors, (152), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-26 11:51:43,927 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2023-11-26 11:51:43,927 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 23 of 55 [2023-11-26 11:51:43,927 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2023-11-26 11:51:45,447 INFO L124 PetriNetUnfolderBase]: 3966/6589 cut-off events. [2023-11-26 11:51:45,448 INFO L125 PetriNetUnfolderBase]: For 16477/16595 co-relation queries the response was YES. [2023-11-26 11:51:45,490 INFO L83 FinitePrefix]: Finished finitePrefix Result has 20468 conditions, 6589 events. 3966/6589 cut-off events. For 16477/16595 co-relation queries the response was YES. Maximal size of possible extension queue 324. Compared 44063 event pairs, 624 based on Foata normal form. 206/6784 useless extension candidates. Maximal degree in co-relation 20442. Up to 2560 conditions per place. [2023-11-26 11:51:45,521 INFO L140 encePairwiseOnDemand]: 45/55 looper letters, 51 selfloop transitions, 15 changer transitions 60/139 dead transitions. [2023-11-26 11:51:45,521 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 73 places, 139 transitions, 907 flow [2023-11-26 11:51:45,522 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2023-11-26 11:51:45,522 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 10 states. [2023-11-26 11:51:45,523 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 10 states to 10 states and 353 transitions. [2023-11-26 11:51:45,524 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.6418181818181818 [2023-11-26 11:51:45,524 INFO L72 ComplementDD]: Start complementDD. Operand 10 states and 353 transitions. [2023-11-26 11:51:45,524 INFO L73 IsDeterministic]: Start isDeterministic. Operand 10 states and 353 transitions. [2023-11-26 11:51:45,525 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2023-11-26 11:51:45,525 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 10 states and 353 transitions. [2023-11-26 11:51:45,526 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 11 states, 10 states have (on average 35.3) internal successors, (353), 10 states have internal predecessors, (353), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-26 11:51:45,528 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 11 states, 11 states have (on average 55.0) internal successors, (605), 11 states have internal predecessors, (605), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-26 11:51:45,528 INFO L81 ComplementDD]: Finished complementDD. Result has 11 states, 11 states have (on average 55.0) internal successors, (605), 11 states have internal predecessors, (605), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-26 11:51:45,529 INFO L175 Difference]: Start difference. First operand has 70 places, 47 transitions, 226 flow. Second operand 10 states and 353 transitions. [2023-11-26 11:51:45,529 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 73 places, 139 transitions, 907 flow [2023-11-26 11:51:45,718 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 70 places, 139 transitions, 859 flow, removed 22 selfloop flow, removed 3 redundant places. [2023-11-26 11:51:45,720 INFO L231 Difference]: Finished difference. Result has 78 places, 53 transitions, 329 flow [2023-11-26 11:51:45,720 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=55, PETRI_DIFFERENCE_MINUEND_FLOW=209, PETRI_DIFFERENCE_MINUEND_PLACES=61, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=47, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=9, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=35, PETRI_DIFFERENCE_SUBTRAHEND_STATES=10, PETRI_FLOW=329, PETRI_PLACES=78, PETRI_TRANSITIONS=53} [2023-11-26 11:51:45,721 INFO L281 CegarLoopForPetriNet]: 60 programPoint places, 18 predicate places. [2023-11-26 11:51:45,721 INFO L495 AbstractCegarLoop]: Abstraction has has 78 places, 53 transitions, 329 flow [2023-11-26 11:51:45,722 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 25.333333333333332) internal successors, (152), 6 states have internal predecessors, (152), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-26 11:51:45,722 INFO L200 CegarLoopForPetriNet]: Found error trace [2023-11-26 11:51:45,722 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-11-26 11:51:45,722 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable10 [2023-11-26 11:51:45,722 INFO L420 AbstractCegarLoop]: === Iteration 12 === Targeting ULTIMATE.startErr6ASSERT_VIOLATIONMEMORY_LEAK === [P0Err0ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 10 more)] === [2023-11-26 11:51:45,723 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-11-26 11:51:45,723 INFO L85 PathProgramCache]: Analyzing trace with hash 1293888122, now seen corresponding path program 1 times [2023-11-26 11:51:45,723 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-11-26 11:51:45,723 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [605012586] [2023-11-26 11:51:45,724 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-11-26 11:51:45,724 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-11-26 11:51:45,750 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-26 11:51:45,904 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-11-26 11:51:45,904 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-11-26 11:51:45,905 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [605012586] [2023-11-26 11:51:45,905 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [605012586] provided 1 perfect and 0 imperfect interpolant sequences [2023-11-26 11:51:45,905 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-11-26 11:51:45,905 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2023-11-26 11:51:45,905 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [963344866] [2023-11-26 11:51:45,906 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-11-26 11:51:45,906 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2023-11-26 11:51:45,906 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-11-26 11:51:45,907 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2023-11-26 11:51:45,907 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2023-11-26 11:51:45,915 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 26 out of 55 [2023-11-26 11:51:45,916 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 78 places, 53 transitions, 329 flow. Second operand has 4 states, 4 states have (on average 29.0) internal successors, (116), 4 states have internal predecessors, (116), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-26 11:51:45,916 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2023-11-26 11:51:45,916 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 26 of 55 [2023-11-26 11:51:45,916 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2023-11-26 11:51:47,028 INFO L124 PetriNetUnfolderBase]: 4135/7018 cut-off events. [2023-11-26 11:51:47,028 INFO L125 PetriNetUnfolderBase]: For 9746/10087 co-relation queries the response was YES. [2023-11-26 11:51:47,064 INFO L83 FinitePrefix]: Finished finitePrefix Result has 18627 conditions, 7018 events. 4135/7018 cut-off events. For 9746/10087 co-relation queries the response was YES. Maximal size of possible extension queue 326. Compared 48148 event pairs, 616 based on Foata normal form. 361/7159 useless extension candidates. Maximal degree in co-relation 18594. Up to 3640 conditions per place. [2023-11-26 11:51:47,097 INFO L140 encePairwiseOnDemand]: 49/55 looper letters, 46 selfloop transitions, 5 changer transitions 0/80 dead transitions. [2023-11-26 11:51:47,097 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 75 places, 80 transitions, 519 flow [2023-11-26 11:51:47,097 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2023-11-26 11:51:47,098 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 4 states. [2023-11-26 11:51:47,098 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 154 transitions. [2023-11-26 11:51:47,099 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.7 [2023-11-26 11:51:47,099 INFO L72 ComplementDD]: Start complementDD. Operand 4 states and 154 transitions. [2023-11-26 11:51:47,099 INFO L73 IsDeterministic]: Start isDeterministic. Operand 4 states and 154 transitions. [2023-11-26 11:51:47,100 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2023-11-26 11:51:47,100 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 4 states and 154 transitions. [2023-11-26 11:51:47,101 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 5 states, 4 states have (on average 38.5) internal successors, (154), 4 states have internal predecessors, (154), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-26 11:51:47,102 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 5 states, 5 states have (on average 55.0) internal successors, (275), 5 states have internal predecessors, (275), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-26 11:51:47,102 INFO L81 ComplementDD]: Finished complementDD. Result has 5 states, 5 states have (on average 55.0) internal successors, (275), 5 states have internal predecessors, (275), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-26 11:51:47,102 INFO L175 Difference]: Start difference. First operand has 78 places, 53 transitions, 329 flow. Second operand 4 states and 154 transitions. [2023-11-26 11:51:47,103 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 75 places, 80 transitions, 519 flow [2023-11-26 11:51:47,142 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 65 places, 80 transitions, 477 flow, removed 21 selfloop flow, removed 10 redundant places. [2023-11-26 11:51:47,144 INFO L231 Difference]: Finished difference. Result has 67 places, 57 transitions, 325 flow [2023-11-26 11:51:47,145 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=55, PETRI_DIFFERENCE_MINUEND_FLOW=287, PETRI_DIFFERENCE_MINUEND_PLACES=62, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=53, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=1, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=48, PETRI_DIFFERENCE_SUBTRAHEND_STATES=4, PETRI_FLOW=325, PETRI_PLACES=67, PETRI_TRANSITIONS=57} [2023-11-26 11:51:47,146 INFO L281 CegarLoopForPetriNet]: 60 programPoint places, 7 predicate places. [2023-11-26 11:51:47,146 INFO L495 AbstractCegarLoop]: Abstraction has has 67 places, 57 transitions, 325 flow [2023-11-26 11:51:47,146 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 29.0) internal successors, (116), 4 states have internal predecessors, (116), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-26 11:51:47,146 INFO L200 CegarLoopForPetriNet]: Found error trace [2023-11-26 11:51:47,147 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-11-26 11:51:47,147 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable11 [2023-11-26 11:51:47,147 INFO L420 AbstractCegarLoop]: === Iteration 13 === Targeting ULTIMATE.startErr6ASSERT_VIOLATIONMEMORY_LEAK === [P0Err0ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 10 more)] === [2023-11-26 11:51:47,147 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-11-26 11:51:47,148 INFO L85 PathProgramCache]: Analyzing trace with hash -1992709668, now seen corresponding path program 1 times [2023-11-26 11:51:47,148 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-11-26 11:51:47,148 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [471108124] [2023-11-26 11:51:47,148 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-11-26 11:51:47,149 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-11-26 11:51:47,178 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-26 11:51:47,529 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-11-26 11:51:47,529 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-11-26 11:51:47,529 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [471108124] [2023-11-26 11:51:47,529 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [471108124] provided 1 perfect and 0 imperfect interpolant sequences [2023-11-26 11:51:47,530 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-11-26 11:51:47,530 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2023-11-26 11:51:47,530 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2001443405] [2023-11-26 11:51:47,530 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-11-26 11:51:47,530 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2023-11-26 11:51:47,531 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-11-26 11:51:47,531 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2023-11-26 11:51:47,531 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2023-11-26 11:51:47,535 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 26 out of 55 [2023-11-26 11:51:47,536 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 67 places, 57 transitions, 325 flow. Second operand has 5 states, 5 states have (on average 29.0) internal successors, (145), 5 states have internal predecessors, (145), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-26 11:51:47,536 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2023-11-26 11:51:47,536 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 26 of 55 [2023-11-26 11:51:47,536 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2023-11-26 11:51:49,009 INFO L124 PetriNetUnfolderBase]: 4613/8461 cut-off events. [2023-11-26 11:51:49,009 INFO L125 PetriNetUnfolderBase]: For 10950/11300 co-relation queries the response was YES. [2023-11-26 11:51:49,039 INFO L83 FinitePrefix]: Finished finitePrefix Result has 23937 conditions, 8461 events. 4613/8461 cut-off events. For 10950/11300 co-relation queries the response was YES. Maximal size of possible extension queue 484. Compared 68021 event pairs, 1955 based on Foata normal form. 245/8167 useless extension candidates. Maximal degree in co-relation 23910. Up to 3285 conditions per place. [2023-11-26 11:51:49,066 INFO L140 encePairwiseOnDemand]: 50/55 looper letters, 52 selfloop transitions, 14 changer transitions 20/111 dead transitions. [2023-11-26 11:51:49,066 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 73 places, 111 transitions, 726 flow [2023-11-26 11:51:49,067 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2023-11-26 11:51:49,067 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 7 states. [2023-11-26 11:51:49,068 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 7 states to 7 states and 256 transitions. [2023-11-26 11:51:49,069 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.6649350649350649 [2023-11-26 11:51:49,069 INFO L72 ComplementDD]: Start complementDD. Operand 7 states and 256 transitions. [2023-11-26 11:51:49,069 INFO L73 IsDeterministic]: Start isDeterministic. Operand 7 states and 256 transitions. [2023-11-26 11:51:49,069 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2023-11-26 11:51:49,069 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 7 states and 256 transitions. [2023-11-26 11:51:49,070 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 8 states, 7 states have (on average 36.57142857142857) internal successors, (256), 7 states have internal predecessors, (256), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-26 11:51:49,072 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 8 states, 8 states have (on average 55.0) internal successors, (440), 8 states have internal predecessors, (440), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-26 11:51:49,072 INFO L81 ComplementDD]: Finished complementDD. Result has 8 states, 8 states have (on average 55.0) internal successors, (440), 8 states have internal predecessors, (440), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-26 11:51:49,072 INFO L175 Difference]: Start difference. First operand has 67 places, 57 transitions, 325 flow. Second operand 7 states and 256 transitions. [2023-11-26 11:51:49,072 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 73 places, 111 transitions, 726 flow [2023-11-26 11:51:49,096 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 72 places, 111 transitions, 724 flow, removed 0 selfloop flow, removed 1 redundant places. [2023-11-26 11:51:49,098 INFO L231 Difference]: Finished difference. Result has 77 places, 62 transitions, 420 flow [2023-11-26 11:51:49,098 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=55, PETRI_DIFFERENCE_MINUEND_FLOW=323, PETRI_DIFFERENCE_MINUEND_PLACES=66, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=57, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=9, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=46, PETRI_DIFFERENCE_SUBTRAHEND_STATES=7, PETRI_FLOW=420, PETRI_PLACES=77, PETRI_TRANSITIONS=62} [2023-11-26 11:51:49,099 INFO L281 CegarLoopForPetriNet]: 60 programPoint places, 17 predicate places. [2023-11-26 11:51:49,099 INFO L495 AbstractCegarLoop]: Abstraction has has 77 places, 62 transitions, 420 flow [2023-11-26 11:51:49,099 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 29.0) internal successors, (145), 5 states have internal predecessors, (145), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-26 11:51:49,099 INFO L200 CegarLoopForPetriNet]: Found error trace [2023-11-26 11:51:49,099 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-11-26 11:51:49,100 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable12 [2023-11-26 11:51:49,100 INFO L420 AbstractCegarLoop]: === Iteration 14 === Targeting ULTIMATE.startErr6ASSERT_VIOLATIONMEMORY_LEAK === [P0Err0ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 10 more)] === [2023-11-26 11:51:49,100 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-11-26 11:51:49,100 INFO L85 PathProgramCache]: Analyzing trace with hash 962776189, now seen corresponding path program 1 times [2023-11-26 11:51:49,101 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-11-26 11:51:49,101 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1260770665] [2023-11-26 11:51:49,101 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-11-26 11:51:49,101 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-11-26 11:51:49,133 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-26 11:51:49,266 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-11-26 11:51:49,266 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-11-26 11:51:49,266 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1260770665] [2023-11-26 11:51:49,266 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1260770665] provided 1 perfect and 0 imperfect interpolant sequences [2023-11-26 11:51:49,266 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-11-26 11:51:49,267 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2023-11-26 11:51:49,267 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [901886424] [2023-11-26 11:51:49,267 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-11-26 11:51:49,267 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2023-11-26 11:51:49,268 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-11-26 11:51:49,268 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2023-11-26 11:51:49,268 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=8, Invalid=12, Unknown=0, NotChecked=0, Total=20 [2023-11-26 11:51:49,273 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 26 out of 55 [2023-11-26 11:51:49,273 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 77 places, 62 transitions, 420 flow. Second operand has 5 states, 5 states have (on average 28.8) internal successors, (144), 5 states have internal predecessors, (144), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-26 11:51:49,273 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2023-11-26 11:51:49,274 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 26 of 55 [2023-11-26 11:51:49,274 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2023-11-26 11:51:50,385 INFO L124 PetriNetUnfolderBase]: 4601/7695 cut-off events. [2023-11-26 11:51:50,385 INFO L125 PetriNetUnfolderBase]: For 8294/8484 co-relation queries the response was YES. [2023-11-26 11:51:50,442 INFO L83 FinitePrefix]: Finished finitePrefix Result has 21619 conditions, 7695 events. 4601/7695 cut-off events. For 8294/8484 co-relation queries the response was YES. Maximal size of possible extension queue 366. Compared 52104 event pairs, 626 based on Foata normal form. 421/7818 useless extension candidates. Maximal degree in co-relation 21587. Up to 2234 conditions per place. [2023-11-26 11:51:50,466 INFO L140 encePairwiseOnDemand]: 49/55 looper letters, 59 selfloop transitions, 8 changer transitions 3/101 dead transitions. [2023-11-26 11:51:50,466 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 81 places, 101 transitions, 701 flow [2023-11-26 11:51:50,467 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2023-11-26 11:51:50,467 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 5 states. [2023-11-26 11:51:50,468 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 195 transitions. [2023-11-26 11:51:50,468 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.7090909090909091 [2023-11-26 11:51:50,468 INFO L72 ComplementDD]: Start complementDD. Operand 5 states and 195 transitions. [2023-11-26 11:51:50,469 INFO L73 IsDeterministic]: Start isDeterministic. Operand 5 states and 195 transitions. [2023-11-26 11:51:50,469 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2023-11-26 11:51:50,469 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 5 states and 195 transitions. [2023-11-26 11:51:50,470 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 6 states, 5 states have (on average 39.0) internal successors, (195), 5 states have internal predecessors, (195), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-26 11:51:50,471 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 6 states, 6 states have (on average 55.0) internal successors, (330), 6 states have internal predecessors, (330), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-26 11:51:50,472 INFO L81 ComplementDD]: Finished complementDD. Result has 6 states, 6 states have (on average 55.0) internal successors, (330), 6 states have internal predecessors, (330), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-26 11:51:50,472 INFO L175 Difference]: Start difference. First operand has 77 places, 62 transitions, 420 flow. Second operand 5 states and 195 transitions. [2023-11-26 11:51:50,472 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 81 places, 101 transitions, 701 flow [2023-11-26 11:51:50,519 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 80 places, 101 transitions, 674 flow, removed 9 selfloop flow, removed 1 redundant places. [2023-11-26 11:51:50,521 INFO L231 Difference]: Finished difference. Result has 82 places, 63 transitions, 421 flow [2023-11-26 11:51:50,522 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=55, PETRI_DIFFERENCE_MINUEND_FLOW=393, PETRI_DIFFERENCE_MINUEND_PLACES=76, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=62, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=4, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=54, PETRI_DIFFERENCE_SUBTRAHEND_STATES=5, PETRI_FLOW=421, PETRI_PLACES=82, PETRI_TRANSITIONS=63} [2023-11-26 11:51:50,523 INFO L281 CegarLoopForPetriNet]: 60 programPoint places, 22 predicate places. [2023-11-26 11:51:50,523 INFO L495 AbstractCegarLoop]: Abstraction has has 82 places, 63 transitions, 421 flow [2023-11-26 11:51:50,523 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 28.8) internal successors, (144), 5 states have internal predecessors, (144), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-26 11:51:50,523 INFO L200 CegarLoopForPetriNet]: Found error trace [2023-11-26 11:51:50,524 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-11-26 11:51:50,524 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable13 [2023-11-26 11:51:50,524 INFO L420 AbstractCegarLoop]: === Iteration 15 === Targeting ULTIMATE.startErr6ASSERT_VIOLATIONMEMORY_LEAK === [P0Err0ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 10 more)] === [2023-11-26 11:51:50,524 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-11-26 11:51:50,525 INFO L85 PathProgramCache]: Analyzing trace with hash -126333210, now seen corresponding path program 1 times [2023-11-26 11:51:50,525 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-11-26 11:51:50,525 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2014571235] [2023-11-26 11:51:50,525 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-11-26 11:51:50,526 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-11-26 11:51:50,558 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-26 11:51:50,868 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-11-26 11:51:50,868 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-11-26 11:51:50,869 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2014571235] [2023-11-26 11:51:50,869 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2014571235] provided 1 perfect and 0 imperfect interpolant sequences [2023-11-26 11:51:50,869 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-11-26 11:51:50,869 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2023-11-26 11:51:50,870 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [183513204] [2023-11-26 11:51:50,870 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-11-26 11:51:50,870 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2023-11-26 11:51:50,871 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-11-26 11:51:50,871 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2023-11-26 11:51:50,872 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=10, Invalid=20, Unknown=0, NotChecked=0, Total=30 [2023-11-26 11:51:50,881 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 23 out of 55 [2023-11-26 11:51:50,881 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 82 places, 63 transitions, 421 flow. Second operand has 6 states, 6 states have (on average 26.166666666666668) internal successors, (157), 6 states have internal predecessors, (157), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-26 11:51:50,881 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2023-11-26 11:51:50,882 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 23 of 55 [2023-11-26 11:51:50,882 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2023-11-26 11:51:52,408 INFO L124 PetriNetUnfolderBase]: 4913/8985 cut-off events. [2023-11-26 11:51:52,409 INFO L125 PetriNetUnfolderBase]: For 17611/19854 co-relation queries the response was YES. [2023-11-26 11:51:52,467 INFO L83 FinitePrefix]: Finished finitePrefix Result has 28392 conditions, 8985 events. 4913/8985 cut-off events. For 17611/19854 co-relation queries the response was YES. Maximal size of possible extension queue 636. Compared 71595 event pairs, 1135 based on Foata normal form. 255/8650 useless extension candidates. Maximal degree in co-relation 28357. Up to 3412 conditions per place. [2023-11-26 11:51:52,486 INFO L140 encePairwiseOnDemand]: 45/55 looper letters, 51 selfloop transitions, 14 changer transitions 31/117 dead transitions. [2023-11-26 11:51:52,486 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 85 places, 117 transitions, 861 flow [2023-11-26 11:51:52,487 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2023-11-26 11:51:52,487 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 6 states. [2023-11-26 11:51:52,488 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6 states to 6 states and 222 transitions. [2023-11-26 11:51:52,489 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.6727272727272727 [2023-11-26 11:51:52,489 INFO L72 ComplementDD]: Start complementDD. Operand 6 states and 222 transitions. [2023-11-26 11:51:52,489 INFO L73 IsDeterministic]: Start isDeterministic. Operand 6 states and 222 transitions. [2023-11-26 11:51:52,490 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2023-11-26 11:51:52,490 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 6 states and 222 transitions. [2023-11-26 11:51:52,491 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 7 states, 6 states have (on average 37.0) internal successors, (222), 6 states have internal predecessors, (222), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-26 11:51:52,493 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 7 states, 7 states have (on average 55.0) internal successors, (385), 7 states have internal predecessors, (385), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-26 11:51:52,494 INFO L81 ComplementDD]: Finished complementDD. Result has 7 states, 7 states have (on average 55.0) internal successors, (385), 7 states have internal predecessors, (385), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-26 11:51:52,494 INFO L175 Difference]: Start difference. First operand has 82 places, 63 transitions, 421 flow. Second operand 6 states and 222 transitions. [2023-11-26 11:51:52,494 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 85 places, 117 transitions, 861 flow [2023-11-26 11:51:52,627 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 79 places, 117 transitions, 829 flow, removed 13 selfloop flow, removed 6 redundant places. [2023-11-26 11:51:52,629 INFO L231 Difference]: Finished difference. Result has 82 places, 58 transitions, 385 flow [2023-11-26 11:51:52,629 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=55, PETRI_DIFFERENCE_MINUEND_FLOW=397, PETRI_DIFFERENCE_MINUEND_PLACES=74, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=63, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=13, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=50, PETRI_DIFFERENCE_SUBTRAHEND_STATES=6, PETRI_FLOW=385, PETRI_PLACES=82, PETRI_TRANSITIONS=58} [2023-11-26 11:51:52,630 INFO L281 CegarLoopForPetriNet]: 60 programPoint places, 22 predicate places. [2023-11-26 11:51:52,630 INFO L495 AbstractCegarLoop]: Abstraction has has 82 places, 58 transitions, 385 flow [2023-11-26 11:51:52,631 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 26.166666666666668) internal successors, (157), 6 states have internal predecessors, (157), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-26 11:51:52,631 INFO L200 CegarLoopForPetriNet]: Found error trace [2023-11-26 11:51:52,631 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-11-26 11:51:52,631 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable14 [2023-11-26 11:51:52,632 INFO L420 AbstractCegarLoop]: === Iteration 16 === Targeting ULTIMATE.startErr6ASSERT_VIOLATIONMEMORY_LEAK === [P0Err0ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 10 more)] === [2023-11-26 11:51:52,632 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-11-26 11:51:52,632 INFO L85 PathProgramCache]: Analyzing trace with hash 235546404, now seen corresponding path program 2 times [2023-11-26 11:51:52,633 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-11-26 11:51:52,633 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1825784813] [2023-11-26 11:51:52,633 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-11-26 11:51:52,633 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-11-26 11:51:52,702 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-26 11:51:52,949 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-11-26 11:51:52,950 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-11-26 11:51:52,950 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1825784813] [2023-11-26 11:51:52,950 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1825784813] provided 1 perfect and 0 imperfect interpolant sequences [2023-11-26 11:51:52,950 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-11-26 11:51:52,951 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2023-11-26 11:51:52,951 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [800231696] [2023-11-26 11:51:52,951 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-11-26 11:51:52,952 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2023-11-26 11:51:52,952 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-11-26 11:51:52,952 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2023-11-26 11:51:52,953 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=12, Invalid=18, Unknown=0, NotChecked=0, Total=30 [2023-11-26 11:51:52,957 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 26 out of 55 [2023-11-26 11:51:52,957 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 82 places, 58 transitions, 385 flow. Second operand has 6 states, 6 states have (on average 28.833333333333332) internal successors, (173), 6 states have internal predecessors, (173), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-26 11:51:52,957 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2023-11-26 11:51:52,958 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 26 of 55 [2023-11-26 11:51:52,958 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2023-11-26 11:51:53,914 INFO L124 PetriNetUnfolderBase]: 3585/6006 cut-off events. [2023-11-26 11:51:53,915 INFO L125 PetriNetUnfolderBase]: For 7073/7168 co-relation queries the response was YES. [2023-11-26 11:51:53,959 INFO L83 FinitePrefix]: Finished finitePrefix Result has 17332 conditions, 6006 events. 3585/6006 cut-off events. For 7073/7168 co-relation queries the response was YES. Maximal size of possible extension queue 356. Compared 40080 event pairs, 549 based on Foata normal form. 202/6010 useless extension candidates. Maximal degree in co-relation 17298. Up to 2164 conditions per place. [2023-11-26 11:51:53,966 INFO L140 encePairwiseOnDemand]: 49/55 looper letters, 46 selfloop transitions, 11 changer transitions 7/89 dead transitions. [2023-11-26 11:51:53,967 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 83 places, 89 transitions, 617 flow [2023-11-26 11:51:53,967 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2023-11-26 11:51:53,967 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 6 states. [2023-11-26 11:51:53,968 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6 states to 6 states and 218 transitions. [2023-11-26 11:51:53,969 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.6606060606060606 [2023-11-26 11:51:53,969 INFO L72 ComplementDD]: Start complementDD. Operand 6 states and 218 transitions. [2023-11-26 11:51:53,969 INFO L73 IsDeterministic]: Start isDeterministic. Operand 6 states and 218 transitions. [2023-11-26 11:51:53,970 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2023-11-26 11:51:53,970 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 6 states and 218 transitions. [2023-11-26 11:51:53,971 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 7 states, 6 states have (on average 36.333333333333336) internal successors, (218), 6 states have internal predecessors, (218), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-26 11:51:53,973 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 7 states, 7 states have (on average 55.0) internal successors, (385), 7 states have internal predecessors, (385), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-26 11:51:53,973 INFO L81 ComplementDD]: Finished complementDD. Result has 7 states, 7 states have (on average 55.0) internal successors, (385), 7 states have internal predecessors, (385), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-26 11:51:53,973 INFO L175 Difference]: Start difference. First operand has 82 places, 58 transitions, 385 flow. Second operand 6 states and 218 transitions. [2023-11-26 11:51:53,974 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 83 places, 89 transitions, 617 flow [2023-11-26 11:51:53,987 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 75 places, 89 transitions, 572 flow, removed 9 selfloop flow, removed 8 redundant places. [2023-11-26 11:51:53,989 INFO L231 Difference]: Finished difference. Result has 77 places, 56 transitions, 352 flow [2023-11-26 11:51:53,989 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=55, PETRI_DIFFERENCE_MINUEND_FLOW=342, PETRI_DIFFERENCE_MINUEND_PLACES=70, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=58, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=11, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=47, PETRI_DIFFERENCE_SUBTRAHEND_STATES=6, PETRI_FLOW=352, PETRI_PLACES=77, PETRI_TRANSITIONS=56} [2023-11-26 11:51:53,989 INFO L281 CegarLoopForPetriNet]: 60 programPoint places, 17 predicate places. [2023-11-26 11:51:53,989 INFO L495 AbstractCegarLoop]: Abstraction has has 77 places, 56 transitions, 352 flow [2023-11-26 11:51:53,990 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 28.833333333333332) internal successors, (173), 6 states have internal predecessors, (173), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-26 11:51:53,990 INFO L200 CegarLoopForPetriNet]: Found error trace [2023-11-26 11:51:53,990 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-11-26 11:51:53,990 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable15 [2023-11-26 11:51:53,991 INFO L420 AbstractCegarLoop]: === Iteration 17 === Targeting ULTIMATE.startErr6ASSERT_VIOLATIONMEMORY_LEAK === [P0Err0ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 10 more)] === [2023-11-26 11:51:53,991 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-11-26 11:51:53,991 INFO L85 PathProgramCache]: Analyzing trace with hash 485646599, now seen corresponding path program 1 times [2023-11-26 11:51:53,991 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-11-26 11:51:53,992 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1554168407] [2023-11-26 11:51:53,992 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-11-26 11:51:53,992 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-11-26 11:51:54,073 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-26 11:51:55,341 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-11-26 11:51:55,342 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-11-26 11:51:55,342 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1554168407] [2023-11-26 11:51:55,342 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1554168407] provided 1 perfect and 0 imperfect interpolant sequences [2023-11-26 11:51:55,342 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-11-26 11:51:55,342 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2023-11-26 11:51:55,343 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [868959294] [2023-11-26 11:51:55,344 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-11-26 11:51:55,345 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 9 states [2023-11-26 11:51:55,347 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-11-26 11:51:55,347 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2023-11-26 11:51:55,348 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=16, Invalid=56, Unknown=0, NotChecked=0, Total=72 [2023-11-26 11:51:55,351 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 28 out of 55 [2023-11-26 11:51:55,352 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 77 places, 56 transitions, 352 flow. Second operand has 9 states, 9 states have (on average 29.88888888888889) internal successors, (269), 9 states have internal predecessors, (269), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-26 11:51:55,352 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2023-11-26 11:51:55,353 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 28 of 55 [2023-11-26 11:51:55,353 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2023-11-26 11:51:56,171 INFO L124 PetriNetUnfolderBase]: 1291/2660 cut-off events. [2023-11-26 11:51:56,171 INFO L125 PetriNetUnfolderBase]: For 3831/4202 co-relation queries the response was YES. [2023-11-26 11:51:56,189 INFO L83 FinitePrefix]: Finished finitePrefix Result has 7524 conditions, 2660 events. 1291/2660 cut-off events. For 3831/4202 co-relation queries the response was YES. Maximal size of possible extension queue 240. Compared 19854 event pairs, 280 based on Foata normal form. 43/2436 useless extension candidates. Maximal degree in co-relation 7494. Up to 730 conditions per place. [2023-11-26 11:51:56,193 INFO L140 encePairwiseOnDemand]: 47/55 looper letters, 33 selfloop transitions, 4 changer transitions 23/96 dead transitions. [2023-11-26 11:51:56,193 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 85 places, 96 transitions, 588 flow [2023-11-26 11:51:56,194 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2023-11-26 11:51:56,194 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 9 states. [2023-11-26 11:51:56,195 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 9 states to 9 states and 313 transitions. [2023-11-26 11:51:56,196 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.6323232323232323 [2023-11-26 11:51:56,196 INFO L72 ComplementDD]: Start complementDD. Operand 9 states and 313 transitions. [2023-11-26 11:51:56,196 INFO L73 IsDeterministic]: Start isDeterministic. Operand 9 states and 313 transitions. [2023-11-26 11:51:56,197 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2023-11-26 11:51:56,197 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 9 states and 313 transitions. [2023-11-26 11:51:56,198 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 10 states, 9 states have (on average 34.77777777777778) internal successors, (313), 9 states have internal predecessors, (313), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-26 11:51:56,200 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 10 states, 10 states have (on average 55.0) internal successors, (550), 10 states have internal predecessors, (550), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-26 11:51:56,200 INFO L81 ComplementDD]: Finished complementDD. Result has 10 states, 10 states have (on average 55.0) internal successors, (550), 10 states have internal predecessors, (550), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-26 11:51:56,201 INFO L175 Difference]: Start difference. First operand has 77 places, 56 transitions, 352 flow. Second operand 9 states and 313 transitions. [2023-11-26 11:51:56,201 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 85 places, 96 transitions, 588 flow [2023-11-26 11:51:56,231 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 75 places, 96 transitions, 503 flow, removed 22 selfloop flow, removed 10 redundant places. [2023-11-26 11:51:56,233 INFO L231 Difference]: Finished difference. Result has 79 places, 56 transitions, 299 flow [2023-11-26 11:51:56,233 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=55, PETRI_DIFFERENCE_MINUEND_FLOW=281, PETRI_DIFFERENCE_MINUEND_PLACES=67, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=56, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=4, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=52, PETRI_DIFFERENCE_SUBTRAHEND_STATES=9, PETRI_FLOW=299, PETRI_PLACES=79, PETRI_TRANSITIONS=56} [2023-11-26 11:51:56,234 INFO L281 CegarLoopForPetriNet]: 60 programPoint places, 19 predicate places. [2023-11-26 11:51:56,234 INFO L495 AbstractCegarLoop]: Abstraction has has 79 places, 56 transitions, 299 flow [2023-11-26 11:51:56,235 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 9 states, 9 states have (on average 29.88888888888889) internal successors, (269), 9 states have internal predecessors, (269), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-26 11:51:56,235 INFO L200 CegarLoopForPetriNet]: Found error trace [2023-11-26 11:51:56,235 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-11-26 11:51:56,235 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable16 [2023-11-26 11:51:56,236 INFO L420 AbstractCegarLoop]: === Iteration 18 === Targeting ULTIMATE.startErr6ASSERT_VIOLATIONMEMORY_LEAK === [P0Err0ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 10 more)] === [2023-11-26 11:51:56,236 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-11-26 11:51:56,236 INFO L85 PathProgramCache]: Analyzing trace with hash 796107259, now seen corresponding path program 2 times [2023-11-26 11:51:56,236 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-11-26 11:51:56,237 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [377066804] [2023-11-26 11:51:56,237 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-11-26 11:51:56,237 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-11-26 11:51:56,314 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2023-11-26 11:51:56,314 INFO L356 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2023-11-26 11:51:56,381 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2023-11-26 11:51:56,425 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2023-11-26 11:51:56,426 INFO L360 BasicCegarLoop]: Counterexample is feasible [2023-11-26 11:51:56,427 INFO L805 garLoopResultBuilder]: Registering result UNSAFE for location ULTIMATE.startErr6ASSERT_VIOLATIONMEMORY_LEAK (12 of 13 remaining) [2023-11-26 11:51:56,429 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location P0Err0ASSERT_VIOLATIONMEMORY_LEAK (11 of 13 remaining) [2023-11-26 11:51:56,429 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE (10 of 13 remaining) [2023-11-26 11:51:56,429 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE (9 of 13 remaining) [2023-11-26 11:51:56,429 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (8 of 13 remaining) [2023-11-26 11:51:56,430 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr3REQUIRES_VIOLATIONMEMORY_DEREFERENCE (7 of 13 remaining) [2023-11-26 11:51:56,430 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr4REQUIRES_VIOLATIONMEMORY_DEREFERENCE (6 of 13 remaining) [2023-11-26 11:51:56,430 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr5REQUIRES_VIOLATIONMEMORY_DEREFERENCE (5 of 13 remaining) [2023-11-26 11:51:56,430 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr7ASSERT_VIOLATIONMEMORY_LEAK (4 of 13 remaining) [2023-11-26 11:51:56,430 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (3 of 13 remaining) [2023-11-26 11:51:56,431 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (2 of 13 remaining) [2023-11-26 11:51:56,431 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr2INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (1 of 13 remaining) [2023-11-26 11:51:56,431 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location P0Err0ASSERT_VIOLATIONMEMORY_LEAK (0 of 13 remaining) [2023-11-26 11:51:56,431 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable17 [2023-11-26 11:51:56,432 INFO L445 BasicCegarLoop]: Path program histogram: [2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-11-26 11:51:56,440 INFO L228 ceAbstractionStarter]: Analysis of concurrent program completed with 1 thread instances [2023-11-26 11:51:56,440 INFO L178 ceAbstractionStarter]: Computing trace abstraction results [2023-11-26 11:51:56,519 WARN L1572 BoogieBacktranslator]: Unfinished Backtranslation: IdentifierExpression #t~pre5 could not be translated [2023-11-26 11:51:56,523 WARN L1572 BoogieBacktranslator]: Unfinished Backtranslation: IdentifierExpression #t~pre7 could not be translated [2023-11-26 11:51:56,525 WARN L1572 BoogieBacktranslator]: Unfinished Backtranslation: IdentifierExpression #t~pre9 could not be translated [2023-11-26 11:51:56,546 WARN L1572 BoogieBacktranslator]: Unfinished Backtranslation: unknown boogie variable #t~nondet0 [2023-11-26 11:51:56,546 WARN L1572 BoogieBacktranslator]: Unfinished Backtranslation: unknown boogie variable #t~nondet0 [2023-11-26 11:51:56,559 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 26.11 11:51:56 BasicIcfg [2023-11-26 11:51:56,560 INFO L131 PluginConnector]: ------------------------ END TraceAbstraction---------------------------- [2023-11-26 11:51:56,561 INFO L112 PluginConnector]: ------------------------Witness Printer---------------------------- [2023-11-26 11:51:56,561 INFO L270 PluginConnector]: Initializing Witness Printer... [2023-11-26 11:51:56,561 INFO L274 PluginConnector]: Witness Printer initialized [2023-11-26 11:51:56,562 INFO L184 PluginConnector]: Executing the observer RCFGCatcher from plugin Witness Printer for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 26.11 11:51:31" (3/4) ... [2023-11-26 11:51:56,564 INFO L140 WitnessPrinter]: No result that supports witness generation found [2023-11-26 11:51:56,565 INFO L131 PluginConnector]: ------------------------ END Witness Printer---------------------------- [2023-11-26 11:51:56,565 INFO L158 Benchmark]: Toolchain (without parser) took 27681.80ms. Allocated memory was 178.3MB in the beginning and 2.5GB in the end (delta: 2.3GB). Free memory was 128.8MB in the beginning and 977.9MB in the end (delta: -849.1MB). Peak memory consumption was 1.4GB. Max. memory is 16.1GB. [2023-11-26 11:51:56,566 INFO L158 Benchmark]: CDTParser took 0.35ms. Allocated memory is still 178.3MB. Free memory is still 151.6MB. There was no memory consumed. Max. memory is 16.1GB. [2023-11-26 11:51:56,566 INFO L158 Benchmark]: CACSL2BoogieTranslator took 893.34ms. Allocated memory is still 178.3MB. Free memory was 128.6MB in the beginning and 104.8MB in the end (delta: 23.8MB). Peak memory consumption was 23.1MB. Max. memory is 16.1GB. [2023-11-26 11:51:56,566 INFO L158 Benchmark]: Boogie Procedure Inliner took 134.19ms. Allocated memory is still 178.3MB. Free memory was 104.8MB in the beginning and 102.3MB in the end (delta: 2.6MB). Peak memory consumption was 2.1MB. Max. memory is 16.1GB. [2023-11-26 11:51:56,567 INFO L158 Benchmark]: Boogie Preprocessor took 142.47ms. Allocated memory is still 178.3MB. Free memory was 102.3MB in the beginning and 98.8MB in the end (delta: 3.5MB). Peak memory consumption was 4.2MB. Max. memory is 16.1GB. [2023-11-26 11:51:56,567 INFO L158 Benchmark]: RCFGBuilder took 1292.35ms. Allocated memory was 178.3MB in the beginning and 228.6MB in the end (delta: 50.3MB). Free memory was 98.8MB in the beginning and 165.3MB in the end (delta: -66.5MB). Peak memory consumption was 28.2MB. Max. memory is 16.1GB. [2023-11-26 11:51:56,568 INFO L158 Benchmark]: TraceAbstraction took 25205.48ms. Allocated memory was 228.6MB in the beginning and 2.5GB in the end (delta: 2.2GB). Free memory was 164.2MB in the beginning and 978.9MB in the end (delta: -814.7MB). Peak memory consumption was 1.4GB. Max. memory is 16.1GB. [2023-11-26 11:51:56,568 INFO L158 Benchmark]: Witness Printer took 4.06ms. Allocated memory is still 2.5GB. Free memory is still 977.9MB. There was no memory consumed. Max. memory is 16.1GB. [2023-11-26 11:51:56,570 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.35ms. Allocated memory is still 178.3MB. Free memory is still 151.6MB. There was no memory consumed. Max. memory is 16.1GB. * CACSL2BoogieTranslator took 893.34ms. Allocated memory is still 178.3MB. Free memory was 128.6MB in the beginning and 104.8MB in the end (delta: 23.8MB). Peak memory consumption was 23.1MB. Max. memory is 16.1GB. * Boogie Procedure Inliner took 134.19ms. Allocated memory is still 178.3MB. Free memory was 104.8MB in the beginning and 102.3MB in the end (delta: 2.6MB). Peak memory consumption was 2.1MB. Max. memory is 16.1GB. * Boogie Preprocessor took 142.47ms. Allocated memory is still 178.3MB. Free memory was 102.3MB in the beginning and 98.8MB in the end (delta: 3.5MB). Peak memory consumption was 4.2MB. Max. memory is 16.1GB. * RCFGBuilder took 1292.35ms. Allocated memory was 178.3MB in the beginning and 228.6MB in the end (delta: 50.3MB). Free memory was 98.8MB in the beginning and 165.3MB in the end (delta: -66.5MB). Peak memory consumption was 28.2MB. Max. memory is 16.1GB. * TraceAbstraction took 25205.48ms. Allocated memory was 228.6MB in the beginning and 2.5GB in the end (delta: 2.2GB). Free memory was 164.2MB in the beginning and 978.9MB in the end (delta: -814.7MB). Peak memory consumption was 1.4GB. Max. memory is 16.1GB. * Witness Printer took 4.06ms. Allocated memory is still 2.5GB. Free memory is still 977.9MB. There was no memory consumed. Max. memory is 16.1GB. * Results from de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator: - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: IdentifierExpression #t~pre5 could not be translated - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: IdentifierExpression #t~pre7 could not be translated - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: IdentifierExpression #t~pre9 could not be translated - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: unknown boogie variable #t~nondet0 - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: unknown boogie variable #t~nondet0 - GenericResult: Unfinished Backtranslation The program execution was not completely translated back. * Results from de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: - UnprovableResult [Line: 17]: Unable to prove that all allocated memory was freed Unable to prove that all allocated memory was freed Reason: overapproximation of memtrack at line 17. Possible FailurePath: [L709] 0 int __unbuffered_cnt = 0; [L711] 0 int __unbuffered_p2_EAX = 0; [L713] 0 int __unbuffered_p2_EBX = 0; [L715] 0 int a = 0; [L716] 0 _Bool a$flush_delayed; [L717] 0 int a$mem_tmp; [L718] 0 _Bool a$r_buff0_thd0; [L719] 0 _Bool a$r_buff0_thd1; [L720] 0 _Bool a$r_buff0_thd2; [L721] 0 _Bool a$r_buff0_thd3; [L722] 0 _Bool a$r_buff1_thd0; [L723] 0 _Bool a$r_buff1_thd1; [L724] 0 _Bool a$r_buff1_thd2; [L725] 0 _Bool a$r_buff1_thd3; [L726] 0 _Bool a$read_delayed; [L727] 0 int *a$read_delayed_var; [L728] 0 int a$w_buff0; [L729] 0 _Bool a$w_buff0_used; [L730] 0 int a$w_buff1; [L731] 0 _Bool a$w_buff1_used; [L732] 0 _Bool main$tmp_guard0; [L733] 0 _Bool main$tmp_guard1; [L735] 0 int x = 0; [L737] 0 int y = 0; [L739] 0 int z = 0; [L740] 0 _Bool weak$$choice0; [L741] 0 _Bool weak$$choice2; [L841] 0 pthread_t t1193; [L842] FCALL, FORK 0 pthread_create(&t1193, ((void *)0), P0, ((void *)0)) VAL [__unbuffered_cnt=0, __unbuffered_p2_EAX=0, __unbuffered_p2_EBX=0, a$flush_delayed=0, a$mem_tmp=0, a$r_buff0_thd0=0, a$r_buff0_thd1=0, a$r_buff0_thd2=0, a$r_buff0_thd3=0, a$r_buff1_thd0=0, a$r_buff1_thd1=0, a$r_buff1_thd2=0, a$r_buff1_thd3=0, a$read_delayed=0, a$read_delayed_var={0:0}, a$w_buff0=0, a$w_buff0_used=0, a$w_buff1=0, a$w_buff1_used=0, a=0, main$tmp_guard0=0, main$tmp_guard1=0, t1193={5:0}, weak$$choice0=0, weak$$choice2=0, x=0, y=0, z=0] [L843] 0 pthread_t t1194; [L844] FCALL, FORK 0 pthread_create(&t1194, ((void *)0), P1, ((void *)0)) VAL [__unbuffered_cnt=0, __unbuffered_p2_EAX=0, __unbuffered_p2_EBX=0, a$flush_delayed=0, a$mem_tmp=0, a$r_buff0_thd0=0, a$r_buff0_thd1=0, a$r_buff0_thd2=0, a$r_buff0_thd3=0, a$r_buff1_thd0=0, a$r_buff1_thd1=0, a$r_buff1_thd2=0, a$r_buff1_thd3=0, a$read_delayed=0, a$read_delayed_var={0:0}, a$w_buff0=0, a$w_buff0_used=0, a$w_buff1=0, a$w_buff1_used=0, a=0, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, t1193={5:0}, t1194={6:0}, weak$$choice0=0, weak$$choice2=0, x=0, y=0, z=0] [L845] 0 pthread_t t1195; [L846] FCALL, FORK 0 pthread_create(&t1195, ((void *)0), P2, ((void *)0)) VAL [__unbuffered_cnt=0, __unbuffered_p2_EAX=0, __unbuffered_p2_EBX=0, a$flush_delayed=0, a$mem_tmp=0, a$r_buff0_thd0=0, a$r_buff0_thd1=0, a$r_buff0_thd2=0, a$r_buff0_thd3=0, a$r_buff1_thd0=0, a$r_buff1_thd1=0, a$r_buff1_thd2=0, a$r_buff1_thd3=0, a$read_delayed=0, a$read_delayed_var={0:0}, a$w_buff0=0, a$w_buff0_used=0, a$w_buff1=0, a$w_buff1_used=0, a=0, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, t1193={5:0}, t1194={6:0}, t1195={3:0}, weak$$choice0=0, weak$$choice2=0, x=0, y=0, z=0] [L745] 1 a$w_buff1 = a$w_buff0 [L746] 1 a$w_buff0 = 1 [L747] 1 a$w_buff1_used = a$w_buff0_used [L748] 1 a$w_buff0_used = (_Bool)1 [L749] CALL 1 __VERIFIER_assert(!(a$w_buff1_used && a$w_buff0_used)) [L18] COND FALSE 1 !(!expression) [L749] RET 1 __VERIFIER_assert(!(a$w_buff1_used && a$w_buff0_used)) [L750] 1 a$r_buff1_thd0 = a$r_buff0_thd0 [L751] 1 a$r_buff1_thd1 = a$r_buff0_thd1 [L752] 1 a$r_buff1_thd2 = a$r_buff0_thd2 [L753] 1 a$r_buff1_thd3 = a$r_buff0_thd3 [L754] 1 a$r_buff0_thd1 = (_Bool)1 VAL [__unbuffered_cnt=0, __unbuffered_p2_EAX=0, __unbuffered_p2_EBX=0, a$flush_delayed=0, a$mem_tmp=0, a$r_buff0_thd0=0, a$r_buff0_thd1=1, a$r_buff0_thd2=0, a$r_buff0_thd3=0, a$r_buff1_thd0=0, a$r_buff1_thd1=0, a$r_buff1_thd2=0, a$r_buff1_thd3=0, a$read_delayed=0, a$read_delayed_var={0:0}, a$w_buff0=1, a$w_buff0_used=1, a$w_buff1=0, a$w_buff1_used=0, a=0, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=0, x=0, y=0, z=0] [L757] 1 x = 1 VAL [__unbuffered_cnt=0, __unbuffered_p2_EAX=0, __unbuffered_p2_EBX=0, a$flush_delayed=0, a$mem_tmp=0, a$r_buff0_thd0=0, a$r_buff0_thd1=1, a$r_buff0_thd2=0, a$r_buff0_thd3=0, a$r_buff1_thd0=0, a$r_buff1_thd1=0, a$r_buff1_thd2=0, a$r_buff1_thd3=0, a$read_delayed=0, a$read_delayed_var={0:0}, a$w_buff0=1, a$w_buff0_used=1, a$w_buff1=0, a$w_buff1_used=0, a=0, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=0, x=1, y=0, z=0] [L774] 2 x = 2 VAL [__unbuffered_cnt=0, __unbuffered_p2_EAX=0, __unbuffered_p2_EBX=0, a$flush_delayed=0, a$mem_tmp=0, a$r_buff0_thd0=0, a$r_buff0_thd1=1, a$r_buff0_thd2=0, a$r_buff0_thd3=0, a$r_buff1_thd0=0, a$r_buff1_thd1=0, a$r_buff1_thd2=0, a$r_buff1_thd3=0, a$read_delayed=0, a$read_delayed_var={0:0}, a$w_buff0=1, a$w_buff0_used=1, a$w_buff1=0, a$w_buff1_used=0, a=0, arg={0:0}, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=0, x=2, y=0, z=0] [L777] 2 y = 1 VAL [__unbuffered_cnt=0, __unbuffered_p2_EAX=0, __unbuffered_p2_EBX=0, a$flush_delayed=0, a$mem_tmp=0, a$r_buff0_thd0=0, a$r_buff0_thd1=1, a$r_buff0_thd2=0, a$r_buff0_thd3=0, a$r_buff1_thd0=0, a$r_buff1_thd1=0, a$r_buff1_thd2=0, a$r_buff1_thd3=0, a$read_delayed=0, a$read_delayed_var={0:0}, a$w_buff0=1, a$w_buff0_used=1, a$w_buff1=0, a$w_buff1_used=0, a=0, arg={0:0}, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=0, x=2, y=1, z=0] [L794] 3 y = 2 VAL [__unbuffered_cnt=0, __unbuffered_p2_EAX=0, __unbuffered_p2_EBX=0, a$flush_delayed=0, a$mem_tmp=0, a$r_buff0_thd0=0, a$r_buff0_thd1=1, a$r_buff0_thd2=0, a$r_buff0_thd3=0, a$r_buff1_thd0=0, a$r_buff1_thd1=0, a$r_buff1_thd2=0, a$r_buff1_thd3=0, a$read_delayed=0, a$read_delayed_var={0:0}, a$w_buff0=1, a$w_buff0_used=1, a$w_buff1=0, a$w_buff1_used=0, a=0, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=0, x=2, y=2, z=0] [L797] 3 z = 1 VAL [__unbuffered_cnt=0, __unbuffered_p2_EAX=0, __unbuffered_p2_EBX=0, a$flush_delayed=0, a$mem_tmp=0, a$r_buff0_thd0=0, a$r_buff0_thd1=1, a$r_buff0_thd2=0, a$r_buff0_thd3=0, a$r_buff1_thd0=0, a$r_buff1_thd1=0, a$r_buff1_thd2=0, a$r_buff1_thd3=0, a$read_delayed=0, a$read_delayed_var={0:0}, a$w_buff0=1, a$w_buff0_used=1, a$w_buff1=0, a$w_buff1_used=0, a=0, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=0, x=2, y=2, z=1] [L800] 3 __unbuffered_p2_EAX = z VAL [__unbuffered_cnt=0, __unbuffered_p2_EAX=1, __unbuffered_p2_EBX=0, a$flush_delayed=0, a$mem_tmp=0, a$r_buff0_thd0=0, a$r_buff0_thd1=1, a$r_buff0_thd2=0, a$r_buff0_thd3=0, a$r_buff1_thd0=0, a$r_buff1_thd1=0, a$r_buff1_thd2=0, a$r_buff1_thd3=0, a$read_delayed=0, a$read_delayed_var={0:0}, a$w_buff0=1, a$w_buff0_used=1, a$w_buff1=0, a$w_buff1_used=0, a=0, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=0, x=2, y=2, z=1] [L803] 3 weak$$choice0 = __VERIFIER_nondet_bool() [L804] 3 weak$$choice2 = __VERIFIER_nondet_bool() [L805] 3 a$flush_delayed = weak$$choice2 [L806] 3 a$mem_tmp = a [L807] 3 a = !a$w_buff0_used || !a$r_buff0_thd3 && !a$w_buff1_used || !a$r_buff0_thd3 && !a$r_buff1_thd3 ? a : (a$w_buff0_used && a$r_buff0_thd3 ? a$w_buff0 : a$w_buff1) [L808] 3 a$w_buff0 = weak$$choice2 ? a$w_buff0 : (!a$w_buff0_used || !a$r_buff0_thd3 && !a$w_buff1_used || !a$r_buff0_thd3 && !a$r_buff1_thd3 ? a$w_buff0 : (a$w_buff0_used && a$r_buff0_thd3 ? a$w_buff0 : a$w_buff0)) [L809] 3 a$w_buff1 = weak$$choice2 ? a$w_buff1 : (!a$w_buff0_used || !a$r_buff0_thd3 && !a$w_buff1_used || !a$r_buff0_thd3 && !a$r_buff1_thd3 ? a$w_buff1 : (a$w_buff0_used && a$r_buff0_thd3 ? a$w_buff1 : a$w_buff1)) [L810] 3 a$w_buff0_used = weak$$choice2 ? a$w_buff0_used : (!a$w_buff0_used || !a$r_buff0_thd3 && !a$w_buff1_used || !a$r_buff0_thd3 && !a$r_buff1_thd3 ? a$w_buff0_used : (a$w_buff0_used && a$r_buff0_thd3 ? (_Bool)0 : a$w_buff0_used)) [L811] 3 a$w_buff1_used = weak$$choice2 ? a$w_buff1_used : (!a$w_buff0_used || !a$r_buff0_thd3 && !a$w_buff1_used || !a$r_buff0_thd3 && !a$r_buff1_thd3 ? a$w_buff1_used : (a$w_buff0_used && a$r_buff0_thd3 ? (_Bool)0 : (_Bool)0)) [L812] 3 a$r_buff0_thd3 = weak$$choice2 ? a$r_buff0_thd3 : (!a$w_buff0_used || !a$r_buff0_thd3 && !a$w_buff1_used || !a$r_buff0_thd3 && !a$r_buff1_thd3 ? a$r_buff0_thd3 : (a$w_buff0_used && a$r_buff0_thd3 ? (_Bool)0 : a$r_buff0_thd3)) [L813] 3 a$r_buff1_thd3 = weak$$choice2 ? a$r_buff1_thd3 : (!a$w_buff0_used || !a$r_buff0_thd3 && !a$w_buff1_used || !a$r_buff0_thd3 && !a$r_buff1_thd3 ? a$r_buff1_thd3 : (a$w_buff0_used && a$r_buff0_thd3 ? (_Bool)0 : (_Bool)0)) [L814] 3 __unbuffered_p2_EBX = a [L815] 3 a = a$flush_delayed ? a$mem_tmp : a [L816] 3 a$flush_delayed = (_Bool)0 VAL [__unbuffered_cnt=0, __unbuffered_p2_EAX=1, __unbuffered_p2_EBX=0, a$flush_delayed=0, a$mem_tmp=0, a$r_buff0_thd0=0, a$r_buff0_thd1=1, a$r_buff0_thd2=0, a$r_buff0_thd3=0, a$r_buff1_thd0=0, a$r_buff1_thd1=0, a$r_buff1_thd2=0, a$r_buff1_thd3=0, a$read_delayed=0, a$read_delayed_var={0:0}, a$w_buff0=1, a$w_buff0_used=1, a$w_buff1=0, a$w_buff1_used=0, a=0, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice2=0, x=2, y=2, z=1] [L780] 2 a = a$w_buff0_used && a$r_buff0_thd2 ? a$w_buff0 : (a$w_buff1_used && a$r_buff1_thd2 ? a$w_buff1 : a) [L781] 2 a$w_buff0_used = a$w_buff0_used && a$r_buff0_thd2 ? (_Bool)0 : a$w_buff0_used [L782] 2 a$w_buff1_used = a$w_buff0_used && a$r_buff0_thd2 || a$w_buff1_used && a$r_buff1_thd2 ? (_Bool)0 : a$w_buff1_used [L783] 2 a$r_buff0_thd2 = a$w_buff0_used && a$r_buff0_thd2 ? (_Bool)0 : a$r_buff0_thd2 [L784] 2 a$r_buff1_thd2 = a$w_buff0_used && a$r_buff0_thd2 || a$w_buff1_used && a$r_buff1_thd2 ? (_Bool)0 : a$r_buff1_thd2 VAL [__unbuffered_cnt=0, __unbuffered_p2_EAX=1, __unbuffered_p2_EBX=0, a$flush_delayed=0, a$mem_tmp=0, a$r_buff0_thd0=0, a$r_buff0_thd1=1, a$r_buff0_thd2=0, a$r_buff0_thd3=0, a$r_buff1_thd0=0, a$r_buff1_thd1=0, a$r_buff1_thd2=0, a$r_buff1_thd3=0, a$read_delayed=0, a$read_delayed_var={0:0}, a$w_buff0=1, a$w_buff0_used=1, a$w_buff1=0, a$w_buff1_used=0, a=0, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice2=0, x=2, y=2, z=1] [L819] 3 a = a$w_buff0_used && a$r_buff0_thd3 ? a$w_buff0 : (a$w_buff1_used && a$r_buff1_thd3 ? a$w_buff1 : a) [L820] 3 a$w_buff0_used = a$w_buff0_used && a$r_buff0_thd3 ? (_Bool)0 : a$w_buff0_used [L821] 3 a$w_buff1_used = a$w_buff0_used && a$r_buff0_thd3 || a$w_buff1_used && a$r_buff1_thd3 ? (_Bool)0 : a$w_buff1_used [L822] 3 a$r_buff0_thd3 = a$w_buff0_used && a$r_buff0_thd3 ? (_Bool)0 : a$r_buff0_thd3 [L823] 3 a$r_buff1_thd3 = a$w_buff0_used && a$r_buff0_thd3 || a$w_buff1_used && a$r_buff1_thd3 ? (_Bool)0 : a$r_buff1_thd3 VAL [__unbuffered_cnt=0, __unbuffered_p2_EAX=1, __unbuffered_p2_EBX=0, a$flush_delayed=0, a$mem_tmp=0, a$r_buff0_thd0=0, a$r_buff0_thd1=1, a$r_buff0_thd2=0, a$r_buff0_thd3=0, a$r_buff1_thd0=0, a$r_buff1_thd1=0, a$r_buff1_thd2=0, a$r_buff1_thd3=0, a$read_delayed=0, a$read_delayed_var={0:0}, a$w_buff0=1, a$w_buff0_used=1, a$w_buff1=0, a$w_buff1_used=0, a=0, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice2=0, x=2, y=2, z=1] [L760] 1 a = a$w_buff0_used && a$r_buff0_thd1 ? a$w_buff0 : (a$w_buff1_used && a$r_buff1_thd1 ? a$w_buff1 : a) [L761] 1 a$w_buff0_used = a$w_buff0_used && a$r_buff0_thd1 ? (_Bool)0 : a$w_buff0_used [L762] 1 a$w_buff1_used = a$w_buff0_used && a$r_buff0_thd1 || a$w_buff1_used && a$r_buff1_thd1 ? (_Bool)0 : a$w_buff1_used [L763] 1 a$r_buff0_thd1 = a$w_buff0_used && a$r_buff0_thd1 ? (_Bool)0 : a$r_buff0_thd1 [L764] 1 a$r_buff1_thd1 = a$w_buff0_used && a$r_buff0_thd1 || a$w_buff1_used && a$r_buff1_thd1 ? (_Bool)0 : a$r_buff1_thd1 VAL [__unbuffered_cnt=0, __unbuffered_p2_EAX=1, __unbuffered_p2_EBX=0, a$flush_delayed=0, a$mem_tmp=0, a$r_buff0_thd0=0, a$r_buff0_thd1=1, a$r_buff0_thd2=0, a$r_buff0_thd3=0, a$r_buff1_thd0=0, a$r_buff1_thd1=0, a$r_buff1_thd2=0, a$r_buff1_thd3=0, a$read_delayed=0, a$read_delayed_var={0:0}, a$w_buff0=1, a$w_buff0_used=0, a$w_buff1=0, a$w_buff1_used=0, a=1, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice2=0, x=2, y=2, z=1] [L767] 1 __unbuffered_cnt = __unbuffered_cnt + 1 VAL [__unbuffered_cnt=1, __unbuffered_p2_EAX=1, __unbuffered_p2_EBX=0, a$flush_delayed=0, a$mem_tmp=0, a$r_buff0_thd0=0, a$r_buff0_thd1=1, a$r_buff0_thd2=0, a$r_buff0_thd3=0, a$r_buff1_thd0=0, a$r_buff1_thd1=0, a$r_buff1_thd2=0, a$r_buff1_thd3=0, a$read_delayed=0, a$read_delayed_var={0:0}, a$w_buff0=1, a$w_buff0_used=0, a$w_buff1=0, a$w_buff1_used=0, a=1, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice2=0, x=2, y=2, z=1] [L787] 2 __unbuffered_cnt = __unbuffered_cnt + 1 VAL [__unbuffered_cnt=2, __unbuffered_p2_EAX=1, __unbuffered_p2_EBX=0, a$flush_delayed=0, a$mem_tmp=0, a$r_buff0_thd0=0, a$r_buff0_thd1=1, a$r_buff0_thd2=0, a$r_buff0_thd3=0, a$r_buff1_thd0=0, a$r_buff1_thd1=0, a$r_buff1_thd2=0, a$r_buff1_thd3=0, a$read_delayed=0, a$read_delayed_var={0:0}, a$w_buff0=1, a$w_buff0_used=0, a$w_buff1=0, a$w_buff1_used=0, a=1, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice2=0, x=2, y=2, z=1] [L826] 3 __unbuffered_cnt = __unbuffered_cnt + 1 VAL [__unbuffered_cnt=3, __unbuffered_p2_EAX=1, __unbuffered_p2_EBX=0, a$flush_delayed=0, a$mem_tmp=0, a$r_buff0_thd0=0, a$r_buff0_thd1=1, a$r_buff0_thd2=0, a$r_buff0_thd3=0, a$r_buff1_thd0=0, a$r_buff1_thd1=0, a$r_buff1_thd2=0, a$r_buff1_thd3=0, a$read_delayed=0, a$read_delayed_var={0:0}, a$w_buff0=1, a$w_buff0_used=0, a$w_buff1=0, a$w_buff1_used=0, a=1, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice2=0, x=2, y=2, z=1] [L848] 0 main$tmp_guard0 = __unbuffered_cnt == 3 VAL [__unbuffered_cnt=3, __unbuffered_p2_EAX=1, __unbuffered_p2_EBX=0, a$flush_delayed=0, a$mem_tmp=0, a$r_buff0_thd0=0, a$r_buff0_thd1=1, a$r_buff0_thd2=0, a$r_buff0_thd3=0, a$r_buff1_thd0=0, a$r_buff1_thd1=0, a$r_buff1_thd2=0, a$r_buff1_thd3=0, a$read_delayed=0, a$read_delayed_var={0:0}, a$w_buff0=1, a$w_buff0_used=0, a$w_buff1=0, a$w_buff1_used=0, a=1, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, main$tmp_guard0=1, main$tmp_guard1=0, t1193={5:0}, t1194={6:0}, t1195={3:0}, weak$$choice2=0, x=2, y=2, z=1] [L850] CALL 0 assume_abort_if_not(main$tmp_guard0) [L3] COND FALSE 0 !(!cond) [L850] RET 0 assume_abort_if_not(main$tmp_guard0) [L852] 0 a = a$w_buff0_used && a$r_buff0_thd0 ? a$w_buff0 : (a$w_buff1_used && a$r_buff1_thd0 ? a$w_buff1 : a) [L853] 0 a$w_buff0_used = a$w_buff0_used && a$r_buff0_thd0 ? (_Bool)0 : a$w_buff0_used [L854] 0 a$w_buff1_used = a$w_buff0_used && a$r_buff0_thd0 || a$w_buff1_used && a$r_buff1_thd0 ? (_Bool)0 : a$w_buff1_used [L855] 0 a$r_buff0_thd0 = a$w_buff0_used && a$r_buff0_thd0 ? (_Bool)0 : a$r_buff0_thd0 [L856] 0 a$r_buff1_thd0 = a$w_buff0_used && a$r_buff0_thd0 || a$w_buff1_used && a$r_buff1_thd0 ? (_Bool)0 : a$r_buff1_thd0 VAL [__unbuffered_cnt=3, __unbuffered_p2_EAX=1, __unbuffered_p2_EBX=0, a$flush_delayed=0, a$mem_tmp=0, a$r_buff0_thd0=0, a$r_buff0_thd1=1, a$r_buff0_thd2=0, a$r_buff0_thd3=0, a$r_buff1_thd0=0, a$r_buff1_thd1=0, a$r_buff1_thd2=0, a$r_buff1_thd3=0, a$read_delayed=0, a$read_delayed_var={0:0}, a$w_buff0=1, a$w_buff0_used=0, a$w_buff1=0, a$w_buff1_used=0, a=1, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, main$tmp_guard0=1, main$tmp_guard1=0, t1193={5:0}, t1194={6:0}, t1195={3:0}, weak$$choice2=0, x=2, y=2, z=1] [L859] 0 main$tmp_guard1 = !(x == 2 && y == 2 && __unbuffered_p2_EAX == 1 && __unbuffered_p2_EBX == 0) VAL [__unbuffered_cnt=3, __unbuffered_p2_EAX=1, __unbuffered_p2_EBX=0, a$flush_delayed=0, a$mem_tmp=0, a$r_buff0_thd0=0, a$r_buff0_thd1=1, a$r_buff0_thd2=0, a$r_buff0_thd3=0, a$r_buff1_thd0=0, a$r_buff1_thd1=0, a$r_buff1_thd2=0, a$r_buff1_thd3=0, a$read_delayed=0, a$read_delayed_var={0:0}, a$w_buff0=1, a$w_buff0_used=0, a$w_buff1=0, a$w_buff1_used=0, a=1, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, main$tmp_guard0=1, main$tmp_guard1=0, t1193={5:0}, t1194={6:0}, t1195={3:0}, weak$$choice2=0, x=2, y=2, z=1] [L861] CALL 0 __VERIFIER_assert(main$tmp_guard1) [L18] COND TRUE 0 !expression [L18] CALL 0 reach_error() [L17] COND FALSE 0 !(0) VAL [__unbuffered_cnt=3, __unbuffered_p2_EAX=1, __unbuffered_p2_EBX=0, a$flush_delayed=0, a$mem_tmp=0, a$r_buff0_thd0=0, a$r_buff0_thd1=1, a$r_buff0_thd2=0, a$r_buff0_thd3=0, a$r_buff1_thd0=0, a$r_buff1_thd1=0, a$r_buff1_thd2=0, a$r_buff1_thd3=0, a$read_delayed=0, a$read_delayed_var={0:0}, a$w_buff0=1, a$w_buff0_used=0, a$w_buff1=0, a$w_buff1_used=0, a=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=2, y=2, z=1] [L17] 0 __assert_fail ("0", "mix045_power.oepc_pso.oepc_rmo.oepc.c", 8, __extension__ __PRETTY_FUNCTION__) VAL [__unbuffered_cnt=3, __unbuffered_p2_EAX=1, __unbuffered_p2_EBX=0, a$flush_delayed=0, a$mem_tmp=0, a$r_buff0_thd0=0, a$r_buff0_thd1=1, a$r_buff0_thd2=0, a$r_buff0_thd3=0, a$r_buff1_thd0=0, a$r_buff1_thd1=0, a$r_buff1_thd2=0, a$r_buff1_thd3=0, a$read_delayed=0, a$read_delayed_var={0:0}, a$w_buff0=1, a$w_buff0_used=0, a$w_buff1=0, a$w_buff1_used=0, a=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=2, y=2, z=1] - UnprovableResult [Line: 17]: Unable to prove that all allocated memory was freed Unable to prove that all allocated memory was freed 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: 839]: Unable to prove that all allocated memory was freed Unable to prove that all allocated memory was freed Reason: Not analyzed. - UnprovableResult [Line: 842]: Unable to prove that petrification did provide enough thread instances (tool internal message) Unable to prove that petrification did provide enough thread instances (tool internal message) Reason: Not analyzed. - UnprovableResult [Line: 844]: Unable to prove that petrification did provide enough thread instances (tool internal message) Unable to prove that petrification did provide enough thread instances (tool internal message) Reason: Not analyzed. - UnprovableResult [Line: 846]: Unable to prove that petrification did provide enough thread instances (tool internal message) Unable to prove that petrification did provide enough thread instances (tool internal message) Reason: Not analyzed. - StatisticsResult: Ultimate Automizer benchmark data with 1 thread instances CFG has 7 procedures, 81 locations, 13 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: 24.9s, OverallIterations: 18, TraceHistogramMax: 1, PathProgramHistogramMax: 2, EmptinessCheckTime: 0.0s, AutomataDifference: 18.6s, DeadEndRemovalTime: 0.0s, HoareAnnotationTime: 0.0s, InitialAbstractionConstructionTime: 0.1s, HoareTripleCheckerStatistics: 0 mSolverCounterUnknown, 924 SdHoareTripleChecker+Valid, 3.6s IncrementalHoareTripleChecker+Time, 0 mSdLazyCounter, 806 mSDsluCounter, 251 SdHoareTripleChecker+Invalid, 2.9s Time, 0 mProtectedAction, 0 SdHoareTripleChecker+Unchecked, 0 IncrementalHoareTripleChecker+Unchecked, 174 mSDsCounter, 55 IncrementalHoareTripleChecker+Valid, 0 mProtectedPredicate, 2209 IncrementalHoareTripleChecker+Invalid, 2264 SdHoareTripleChecker+Unknown, 0 mSolverCounterNotChecked, 55 mSolverCounterUnsat, 77 mSDtfsCounter, 2209 mSolverCounterSat, 0.1s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Unknown, PredicateUnifierStatistics: 0 DeclaredPredicates, 95 GetRequests, 15 SyntacticMatches, 0 SemanticMatches, 80 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 57 ImplicationChecksByTransitivity, 0.8s Time, 0.0s BasicInterpolantAutomatonTime, BiggestAbstraction: size=421occurred in iteration=14, InterpolantAutomatonStates: 94, 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.1s SsaConstructionTime, 0.5s SatisfiabilityAnalysisTime, 4.9s InterpolantComputationTime, 321 NumberOfCodeBlocks, 321 NumberOfCodeBlocksAsserted, 18 NumberOfCheckSat, 269 ConstructedInterpolants, 0 QuantifiedInterpolants, 1707 SizeOfPredicates, 0 NumberOfNonLiveVariables, 0 ConjunctsInSsa, 0 ConjunctsInUnsatCore, 17 InterpolantComputations, 17 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 could not prove your program: unable to determine feasibility of some traces [2023-11-26 11:51:56,597 INFO L540 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_f1fda7e5-70f6-451b-9e85-d6f04acde80c/bin/uautomizer-verify-VRDe98Ueme/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 (1)] Forceful destruction successful, exit code 0 Received shutdown request... --- End real Ultimate output --- Execution finished normally Using bit-precise analysis Retrying with bit-precise analysis ### Bit-precise run ### Calling Ultimate with: /usr/lib/jvm/java-11-openjdk-amd64/bin/java -Dosgi.configuration.area=/tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_f1fda7e5-70f6-451b-9e85-d6f04acde80c/bin/uautomizer-verify-VRDe98Ueme/data/config -Xmx15G -Xms4m -jar /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_f1fda7e5-70f6-451b-9e85-d6f04acde80c/bin/uautomizer-verify-VRDe98Ueme/plugins/org.eclipse.equinox.launcher_1.5.800.v20200727-1323.jar -data @noDefault -ultimatedata /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_f1fda7e5-70f6-451b-9e85-d6f04acde80c/bin/uautomizer-verify-VRDe98Ueme/data -tc /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_f1fda7e5-70f6-451b-9e85-d6f04acde80c/bin/uautomizer-verify-VRDe98Ueme/config/AutomizerMemDerefMemtrack.xml -i ../../sv-benchmarks/c/pthread-wmm/mix045_power.oepc_pso.oepc_rmo.oepc.i -s /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_f1fda7e5-70f6-451b-9e85-d6f04acde80c/bin/uautomizer-verify-VRDe98Ueme/config/svcomp-DerefFreeMemtrack-32bit-Automizer_Bitvector.epf --cacsl2boogietranslator.entry.function main --witnessprinter.witness.directory /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_f1fda7e5-70f6-451b-9e85-d6f04acde80c/bin/uautomizer-verify-VRDe98Ueme --witnessprinter.witness.filename witness --witnessprinter.write.witness.besides.input.file false --witnessprinter.graph.data.specification CHECK( init(main()), LTL(G valid-free) ) CHECK( init(main()), LTL(G valid-deref) ) CHECK( init(main()), LTL(G valid-memtrack) ) --witnessprinter.graph.data.producer Automizer --witnessprinter.graph.data.architecture 32bit --witnessprinter.graph.data.programhash ac99c7435b3707a16823c102e546d1d8821c1d75e1c740ce64249f2f34cab350 --- Real Ultimate output --- This is Ultimate 0.2.4-dev-0e0057c [2023-11-26 11:51:59,472 INFO L188 SettingsManager]: Resetting all preferences to default values... [2023-11-26 11:51:59,616 INFO L114 SettingsManager]: Loading settings from /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_f1fda7e5-70f6-451b-9e85-d6f04acde80c/bin/uautomizer-verify-VRDe98Ueme/config/svcomp-DerefFreeMemtrack-32bit-Automizer_Bitvector.epf [2023-11-26 11:51:59,624 WARN L101 SettingsManager]: Preference file contains the following unknown settings: [2023-11-26 11:51:59,625 WARN L103 SettingsManager]: * de.uni_freiburg.informatik.ultimate.core.Log level for class [2023-11-26 11:51:59,665 INFO L130 SettingsManager]: Preferences different from defaults after loading the file: [2023-11-26 11:51:59,666 INFO L151 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2023-11-26 11:51:59,667 INFO L153 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2023-11-26 11:51:59,668 INFO L151 SettingsManager]: Preferences of Boogie Preprocessor differ from their defaults: [2023-11-26 11:51:59,673 INFO L153 SettingsManager]: * Use memory slicer=true [2023-11-26 11:51:59,673 INFO L151 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2023-11-26 11:51:59,674 INFO L153 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2023-11-26 11:51:59,675 INFO L151 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2023-11-26 11:51:59,676 INFO L153 SettingsManager]: * Create parallel compositions if possible=false [2023-11-26 11:51:59,677 INFO L153 SettingsManager]: * Use SBE=true [2023-11-26 11:51:59,678 INFO L151 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2023-11-26 11:51:59,678 INFO L153 SettingsManager]: * sizeof long=4 [2023-11-26 11:51:59,679 INFO L153 SettingsManager]: * Overapproximate operations on floating types=true [2023-11-26 11:51:59,679 INFO L153 SettingsManager]: * sizeof POINTER=4 [2023-11-26 11:51:59,680 INFO L153 SettingsManager]: * Check division by zero=IGNORE [2023-11-26 11:51:59,681 INFO L153 SettingsManager]: * Check for the main procedure if all allocated memory was freed=true [2023-11-26 11:51:59,681 INFO L153 SettingsManager]: * Bitprecise bitfields=true [2023-11-26 11:51:59,682 INFO L153 SettingsManager]: * SV-COMP memtrack compatibility mode=true [2023-11-26 11:51:59,682 INFO L153 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2023-11-26 11:51:59,683 INFO L153 SettingsManager]: * Adapt memory model on pointer casts if necessary=true [2023-11-26 11:51:59,683 INFO L153 SettingsManager]: * Use bitvectors instead of ints=true [2023-11-26 11:51:59,684 INFO L153 SettingsManager]: * Memory model=HoenickeLindenmann_4ByteResolution [2023-11-26 11:51:59,684 INFO L153 SettingsManager]: * Check unreachability of reach_error function=false [2023-11-26 11:51:59,685 INFO L153 SettingsManager]: * sizeof long double=12 [2023-11-26 11:51:59,685 INFO L153 SettingsManager]: * Use constant arrays=true [2023-11-26 11:51:59,687 INFO L151 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2023-11-26 11:51:59,687 INFO L153 SettingsManager]: * Size of a code block=SequenceOfStatements [2023-11-26 11:51:59,688 INFO L153 SettingsManager]: * Only consider context switches at boundaries of atomic blocks=true [2023-11-26 11:51:59,688 INFO L153 SettingsManager]: * SMT solver=External_DefaultMode [2023-11-26 11:51:59,688 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2023-11-26 11:51:59,688 INFO L151 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2023-11-26 11:51:59,689 INFO L153 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2023-11-26 11:51:59,690 INFO L153 SettingsManager]: * Trace refinement strategy=WOLF [2023-11-26 11:51:59,690 INFO L153 SettingsManager]: * Command for external solver=cvc4 --incremental --print-success --lang smt [2023-11-26 11:51:59,690 INFO L153 SettingsManager]: * Apply one-shot large block encoding in concurrent analysis=false [2023-11-26 11:51:59,691 INFO L153 SettingsManager]: * Automaton type used in concurrency analysis=PETRI_NET [2023-11-26 11:51:59,691 INFO L153 SettingsManager]: * Order on configurations for Petri net unfoldings=DBO [2023-11-26 11:51:59,691 INFO L153 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2023-11-26 11:51:59,692 INFO L153 SettingsManager]: * Logic for external solver=AUFBV [2023-11-26 11:51:59,692 INFO L153 SettingsManager]: * Looper check in Petri net analysis=SEMANTIC WARNING: An illegal reflective access operation has occurred WARNING: Illegal reflective access by com.sun.xml.bind.v2.runtime.reflect.opt.Injector$1 (file:/tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_f1fda7e5-70f6-451b-9e85-d6f04acde80c/bin/uautomizer-verify-VRDe98Ueme/plugins/com.sun.xml.bind_2.2.0.v201505121915.jar) to method java.lang.ClassLoader.defineClass(java.lang.String,byte[],int,int) WARNING: Please consider reporting this to the maintainers of com.sun.xml.bind.v2.runtime.reflect.opt.Injector$1 WARNING: Use --illegal-access=warn to enable warnings of further illegal reflective access operations WARNING: All illegal access operations will be denied in a future release Applying setting for plugin de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator: Entry function -> main Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Witness directory -> /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_f1fda7e5-70f6-451b-9e85-d6f04acde80c/bin/uautomizer-verify-VRDe98Ueme Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Witness filename -> witness Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Write witness besides input file -> false Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Graph data specification -> CHECK( init(main()), LTL(G valid-free) ) CHECK( init(main()), LTL(G valid-deref) ) CHECK( init(main()), LTL(G valid-memtrack) ) Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Graph data producer -> Automizer Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Graph data architecture -> 32bit Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Graph data programhash -> ac99c7435b3707a16823c102e546d1d8821c1d75e1c740ce64249f2f34cab350 [2023-11-26 11:52:00,101 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2023-11-26 11:52:00,128 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2023-11-26 11:52:00,132 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2023-11-26 11:52:00,134 INFO L270 PluginConnector]: Initializing CDTParser... [2023-11-26 11:52:00,134 INFO L274 PluginConnector]: CDTParser initialized [2023-11-26 11:52:00,135 INFO L431 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_f1fda7e5-70f6-451b-9e85-d6f04acde80c/bin/uautomizer-verify-VRDe98Ueme/../../sv-benchmarks/c/pthread-wmm/mix045_power.oepc_pso.oepc_rmo.oepc.i [2023-11-26 11:52:03,407 INFO L533 CDTParser]: Created temporary CDT project at NULL [2023-11-26 11:52:03,794 INFO L384 CDTParser]: Found 1 translation units. [2023-11-26 11:52:03,794 INFO L180 CDTParser]: Scanning /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_f1fda7e5-70f6-451b-9e85-d6f04acde80c/sv-benchmarks/c/pthread-wmm/mix045_power.oepc_pso.oepc_rmo.oepc.i [2023-11-26 11:52:03,815 INFO L427 CDTParser]: About to delete temporary CDT project at /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_f1fda7e5-70f6-451b-9e85-d6f04acde80c/bin/uautomizer-verify-VRDe98Ueme/data/ea3d3fef9/23ea98d4655141b7b71379e6de0cc170/FLAGc876d8114 [2023-11-26 11:52:03,984 INFO L435 CDTParser]: Successfully deleted /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_f1fda7e5-70f6-451b-9e85-d6f04acde80c/bin/uautomizer-verify-VRDe98Ueme/data/ea3d3fef9/23ea98d4655141b7b71379e6de0cc170 [2023-11-26 11:52:03,990 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2023-11-26 11:52:03,992 INFO L133 ToolchainWalker]: Walking toolchain with 6 elements. [2023-11-26 11:52:03,997 INFO L112 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2023-11-26 11:52:03,997 INFO L270 PluginConnector]: Initializing CACSL2BoogieTranslator... [2023-11-26 11:52:04,005 INFO L274 PluginConnector]: CACSL2BoogieTranslator initialized [2023-11-26 11:52:04,006 INFO L184 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 26.11 11:52:03" (1/1) ... [2023-11-26 11:52:04,007 INFO L204 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@219ef827 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 26.11 11:52:04, skipping insertion in model container [2023-11-26 11:52:04,008 INFO L184 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 26.11 11:52:03" (1/1) ... [2023-11-26 11:52:04,104 INFO L177 MainTranslator]: Built tables and reachable declarations [2023-11-26 11:52:04,757 INFO L209 PostProcessor]: Analyzing one entry point: main [2023-11-26 11:52:04,777 INFO L202 MainTranslator]: Completed pre-run [2023-11-26 11:52:04,878 INFO L209 PostProcessor]: Analyzing one entry point: main [2023-11-26 11:52:04,942 WARN L675 CHandler]: The function __VERIFIER_atomic_begin is called, but not defined or handled by StandardFunctionHandler. [2023-11-26 11:52:04,942 WARN L675 CHandler]: The function __VERIFIER_atomic_end is called, but not defined or handled by StandardFunctionHandler. [2023-11-26 11:52:04,951 INFO L206 MainTranslator]: Completed translation [2023-11-26 11:52:04,951 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 26.11 11:52:04 WrapperNode [2023-11-26 11:52:04,951 INFO L131 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2023-11-26 11:52:04,953 INFO L112 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2023-11-26 11:52:04,953 INFO L270 PluginConnector]: Initializing Boogie Procedure Inliner... [2023-11-26 11:52:04,953 INFO L274 PluginConnector]: Boogie Procedure Inliner initialized [2023-11-26 11:52:04,961 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 26.11 11:52:04" (1/1) ... [2023-11-26 11:52:05,012 INFO L184 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 26.11 11:52:04" (1/1) ... [2023-11-26 11:52:05,049 INFO L138 Inliner]: procedures = 179, calls = 59, calls flagged for inlining = 6, calls inlined = 7, statements flattened = 135 [2023-11-26 11:52:05,049 INFO L131 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2023-11-26 11:52:05,051 INFO L112 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2023-11-26 11:52:05,051 INFO L270 PluginConnector]: Initializing Boogie Preprocessor... [2023-11-26 11:52:05,051 INFO L274 PluginConnector]: Boogie Preprocessor initialized [2023-11-26 11:52:05,073 INFO L184 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 26.11 11:52:04" (1/1) ... [2023-11-26 11:52:05,073 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 26.11 11:52:04" (1/1) ... [2023-11-26 11:52:05,089 INFO L184 PluginConnector]: Executing the observer MemorySlicer from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 26.11 11:52:04" (1/1) ... [2023-11-26 11:52:05,117 INFO L175 MemorySlicer]: Split 5 memory accesses to 4 slices as follows [2, 1, 1, 1]. 40 percent of accesses are in the largest equivalence class. The 2 initializations are split as follows [2, 0, 0, 0]. The 3 writes are split as follows [0, 1, 1, 1]. [2023-11-26 11:52:05,126 INFO L184 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 26.11 11:52:04" (1/1) ... [2023-11-26 11:52:05,126 INFO L184 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 26.11 11:52:04" (1/1) ... [2023-11-26 11:52:05,150 INFO L184 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 26.11 11:52:04" (1/1) ... [2023-11-26 11:52:05,153 INFO L184 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 26.11 11:52:04" (1/1) ... [2023-11-26 11:52:05,157 INFO L184 PluginConnector]: Executing the observer LTLStepAnnotator from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 26.11 11:52:04" (1/1) ... [2023-11-26 11:52:05,167 INFO L184 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 26.11 11:52:04" (1/1) ... [2023-11-26 11:52:05,171 INFO L131 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2023-11-26 11:52:05,176 INFO L112 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2023-11-26 11:52:05,176 INFO L270 PluginConnector]: Initializing RCFGBuilder... [2023-11-26 11:52:05,176 INFO L274 PluginConnector]: RCFGBuilder initialized [2023-11-26 11:52:05,177 INFO L184 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 26.11 11:52:04" (1/1) ... [2023-11-26 11:52:05,184 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2023-11-26 11:52:05,195 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_f1fda7e5-70f6-451b-9e85-d6f04acde80c/bin/uautomizer-verify-VRDe98Ueme/z3 [2023-11-26 11:52:05,210 INFO L229 MonitoredProcess]: Starting monitored process 1 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_f1fda7e5-70f6-451b-9e85-d6f04acde80c/bin/uautomizer-verify-VRDe98Ueme/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 (exit command is (exit), workingDir is null) [2023-11-26 11:52:05,250 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_f1fda7e5-70f6-451b-9e85-d6f04acde80c/bin/uautomizer-verify-VRDe98Ueme/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 (1)] Waiting until timeout for monitored process [2023-11-26 11:52:05,265 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_atomic_begin [2023-11-26 11:52:05,265 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2023-11-26 11:52:05,266 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnStack [2023-11-26 11:52:05,266 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.dealloc [2023-11-26 11:52:05,266 INFO L130 BoogieDeclarations]: Found specification of procedure write~intINTTYPE4#0 [2023-11-26 11:52:05,266 INFO L130 BoogieDeclarations]: Found specification of procedure write~intINTTYPE4#1 [2023-11-26 11:52:05,266 INFO L130 BoogieDeclarations]: Found specification of procedure write~intINTTYPE4#2 [2023-11-26 11:52:05,267 INFO L130 BoogieDeclarations]: Found specification of procedure write~intINTTYPE4#3 [2023-11-26 11:52:05,267 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~intINTTYPE1#0 [2023-11-26 11:52:05,267 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~intINTTYPE1#1 [2023-11-26 11:52:05,267 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~intINTTYPE1#2 [2023-11-26 11:52:05,268 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~intINTTYPE1#3 [2023-11-26 11:52:05,268 INFO L130 BoogieDeclarations]: Found specification of procedure P0 [2023-11-26 11:52:05,268 INFO L138 BoogieDeclarations]: Found implementation of procedure P0 [2023-11-26 11:52:05,268 INFO L130 BoogieDeclarations]: Found specification of procedure P1 [2023-11-26 11:52:05,268 INFO L138 BoogieDeclarations]: Found implementation of procedure P1 [2023-11-26 11:52:05,269 INFO L130 BoogieDeclarations]: Found specification of procedure P2 [2023-11-26 11:52:05,269 INFO L138 BoogieDeclarations]: Found implementation of procedure P2 [2023-11-26 11:52:05,269 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_atomic_end [2023-11-26 11:52:05,269 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2023-11-26 11:52:05,269 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2023-11-26 11:52:05,271 WARN L213 CfgBuilder]: User set CodeBlockSize to SequenceOfStatements but program contains fork statements. Overwriting the user preferences and setting CodeBlockSize to OneNontrivialStatement [2023-11-26 11:52:05,457 INFO L241 CfgBuilder]: Building ICFG [2023-11-26 11:52:05,461 INFO L267 CfgBuilder]: Building CFG for each procedure with an implementation [2023-11-26 11:52:05,878 INFO L282 CfgBuilder]: Performing block encoding [2023-11-26 11:52:06,173 INFO L304 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2023-11-26 11:52:06,173 INFO L309 CfgBuilder]: Removed 0 assume(true) statements. [2023-11-26 11:52:06,174 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 26.11 11:52:06 BoogieIcfgContainer [2023-11-26 11:52:06,174 INFO L131 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2023-11-26 11:52:06,177 INFO L112 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2023-11-26 11:52:06,177 INFO L270 PluginConnector]: Initializing TraceAbstraction... [2023-11-26 11:52:06,180 INFO L274 PluginConnector]: TraceAbstraction initialized [2023-11-26 11:52:06,180 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 26.11 11:52:03" (1/3) ... [2023-11-26 11:52:06,181 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@2cfefb9a and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 26.11 11:52:06, skipping insertion in model container [2023-11-26 11:52:06,181 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 26.11 11:52:04" (2/3) ... [2023-11-26 11:52:06,181 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@2cfefb9a and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 26.11 11:52:06, skipping insertion in model container [2023-11-26 11:52:06,182 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 26.11 11:52:06" (3/3) ... [2023-11-26 11:52:06,183 INFO L112 eAbstractionObserver]: Analyzing ICFG mix045_power.oepc_pso.oepc_rmo.oepc.i [2023-11-26 11:52:06,202 INFO L203 ceAbstractionStarter]: Automizer settings: Hoare:false NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2023-11-26 11:52:06,203 INFO L162 ceAbstractionStarter]: Applying trace abstraction to program that has 9 error locations. [2023-11-26 11:52:06,203 INFO L514 ceAbstractionStarter]: Constructing petrified ICFG for 1 thread instances. [2023-11-26 11:52:06,265 INFO L144 ThreadInstanceAdder]: Constructed 0 joinOtherThreadTransitions. [2023-11-26 11:52:06,300 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 63 places, 55 transitions, 122 flow [2023-11-26 11:52:06,332 INFO L124 PetriNetUnfolderBase]: 2/52 cut-off events. [2023-11-26 11:52:06,333 INFO L125 PetriNetUnfolderBase]: For 0/0 co-relation queries the response was YES. [2023-11-26 11:52:06,337 INFO L83 FinitePrefix]: Finished finitePrefix Result has 62 conditions, 52 events. 2/52 cut-off events. For 0/0 co-relation queries the response was YES. Maximal size of possible extension queue 5. Compared 103 event pairs, 0 based on Foata normal form. 0/41 useless extension candidates. Maximal degree in co-relation 51. Up to 2 conditions per place. [2023-11-26 11:52:06,337 INFO L82 GeneralOperation]: Start removeDead. Operand has 63 places, 55 transitions, 122 flow [2023-11-26 11:52:06,341 INFO L88 GeneralOperation]: Finished RemoveDead, result has has 60 places, 52 transitions, 113 flow [2023-11-26 11:52:06,352 INFO L356 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2023-11-26 11:52:06,359 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=All, 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;@2bc000f5, mLbeIndependenceSettings=[IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=false, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2023-11-26 11:52:06,359 INFO L358 AbstractCegarLoop]: Starting to check reachability of 13 error locations. [2023-11-26 11:52:06,362 INFO L185 PetriNetUnfolderBase]: Found word, exiting Unfolder. [2023-11-26 11:52:06,362 INFO L124 PetriNetUnfolderBase]: 0/2 cut-off events. [2023-11-26 11:52:06,363 INFO L125 PetriNetUnfolderBase]: For 0/0 co-relation queries the response was YES. [2023-11-26 11:52:06,363 INFO L200 CegarLoopForPetriNet]: Found error trace [2023-11-26 11:52:06,364 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1] [2023-11-26 11:52:06,364 INFO L420 AbstractCegarLoop]: === Iteration 1 === Targeting ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [P0Err0ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 10 more)] === [2023-11-26 11:52:06,369 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-11-26 11:52:06,370 INFO L85 PathProgramCache]: Analyzing trace with hash 12696, now seen corresponding path program 1 times [2023-11-26 11:52:06,385 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2023-11-26 11:52:06,385 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [635475933] [2023-11-26 11:52:06,386 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-11-26 11:52:06,386 INFO L173 SolverBuilder]: Constructing external solver with command: mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2023-11-26 11:52:06,386 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_f1fda7e5-70f6-451b-9e85-d6f04acde80c/bin/uautomizer-verify-VRDe98Ueme/mathsat [2023-11-26 11:52:06,390 INFO L229 MonitoredProcess]: Starting monitored process 2 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_f1fda7e5-70f6-451b-9e85-d6f04acde80c/bin/uautomizer-verify-VRDe98Ueme/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (exit command is (exit), workingDir is null) [2023-11-26 11:52:06,430 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_f1fda7e5-70f6-451b-9e85-d6f04acde80c/bin/uautomizer-verify-VRDe98Ueme/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (2)] Waiting until timeout for monitored process [2023-11-26 11:52:06,533 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-26 11:52:06,536 INFO L262 TraceCheckSpWp]: Trace formula consists of 51 conjuncts, 3 conjunts are in the unsatisfiable core [2023-11-26 11:52:06,541 INFO L285 TraceCheckSpWp]: Computing forward predicates... [2023-11-26 11:52:06,608 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 6 treesize of output 7 [2023-11-26 11:52:06,628 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-11-26 11:52:06,628 INFO L323 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2023-11-26 11:52:06,629 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2023-11-26 11:52:06,630 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [635475933] [2023-11-26 11:52:06,631 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [635475933] provided 1 perfect and 0 imperfect interpolant sequences [2023-11-26 11:52:06,631 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-11-26 11:52:06,631 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [1] imperfect sequences [] total 1 [2023-11-26 11:52:06,633 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [136436221] [2023-11-26 11:52:06,634 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-11-26 11:52:06,643 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2023-11-26 11:52:06,656 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2023-11-26 11:52:06,682 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2023-11-26 11:52:06,682 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2023-11-26 11:52:06,719 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 28 out of 55 [2023-11-26 11:52:06,721 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 60 places, 52 transitions, 113 flow. Second operand has 3 states, 3 states have (on average 28.666666666666668) internal successors, (86), 3 states have internal predecessors, (86), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-26 11:52:06,722 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2023-11-26 11:52:06,722 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 28 of 55 [2023-11-26 11:52:06,723 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2023-11-26 11:52:07,287 INFO L124 PetriNetUnfolderBase]: 1057/2068 cut-off events. [2023-11-26 11:52:07,287 INFO L125 PetriNetUnfolderBase]: For 20/20 co-relation queries the response was YES. [2023-11-26 11:52:07,296 INFO L83 FinitePrefix]: Finished finitePrefix Result has 3694 conditions, 2068 events. 1057/2068 cut-off events. For 20/20 co-relation queries the response was YES. Maximal size of possible extension queue 142. Compared 14095 event pairs, 791 based on Foata normal form. 120/1951 useless extension candidates. Maximal degree in co-relation 3680. Up to 1193 conditions per place. [2023-11-26 11:52:07,327 INFO L140 encePairwiseOnDemand]: 50/55 looper letters, 30 selfloop transitions, 2 changer transitions 0/57 dead transitions. [2023-11-26 11:52:07,327 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 60 places, 57 transitions, 187 flow [2023-11-26 11:52:07,329 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2023-11-26 11:52:07,331 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2023-11-26 11:52:07,339 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 119 transitions. [2023-11-26 11:52:07,341 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.7212121212121212 [2023-11-26 11:52:07,342 INFO L72 ComplementDD]: Start complementDD. Operand 3 states and 119 transitions. [2023-11-26 11:52:07,342 INFO L73 IsDeterministic]: Start isDeterministic. Operand 3 states and 119 transitions. [2023-11-26 11:52:07,343 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2023-11-26 11:52:07,346 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 3 states and 119 transitions. [2023-11-26 11:52:07,348 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 4 states, 3 states have (on average 39.666666666666664) internal successors, (119), 3 states have internal predecessors, (119), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-26 11:52:07,352 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 4 states, 4 states have (on average 55.0) internal successors, (220), 4 states have internal predecessors, (220), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-26 11:52:07,353 INFO L81 ComplementDD]: Finished complementDD. Result has 4 states, 4 states have (on average 55.0) internal successors, (220), 4 states have internal predecessors, (220), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-26 11:52:07,355 INFO L175 Difference]: Start difference. First operand has 60 places, 52 transitions, 113 flow. Second operand 3 states and 119 transitions. [2023-11-26 11:52:07,356 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 60 places, 57 transitions, 187 flow [2023-11-26 11:52:07,359 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 57 places, 57 transitions, 184 flow, removed 0 selfloop flow, removed 3 redundant places. [2023-11-26 11:52:07,362 INFO L231 Difference]: Finished difference. Result has 57 places, 48 transitions, 106 flow [2023-11-26 11:52:07,364 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=55, PETRI_DIFFERENCE_MINUEND_FLOW=102, PETRI_DIFFERENCE_MINUEND_PLACES=55, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=48, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=2, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=46, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=106, PETRI_PLACES=57, PETRI_TRANSITIONS=48} [2023-11-26 11:52:07,368 INFO L281 CegarLoopForPetriNet]: 60 programPoint places, -3 predicate places. [2023-11-26 11:52:07,368 INFO L495 AbstractCegarLoop]: Abstraction has has 57 places, 48 transitions, 106 flow [2023-11-26 11:52:07,369 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 28.666666666666668) internal successors, (86), 3 states have internal predecessors, (86), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-26 11:52:07,369 INFO L200 CegarLoopForPetriNet]: Found error trace [2023-11-26 11:52:07,369 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1] [2023-11-26 11:52:07,373 INFO L552 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_f1fda7e5-70f6-451b-9e85-d6f04acde80c/bin/uautomizer-verify-VRDe98Ueme/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (2)] Ended with exit code 0 [2023-11-26 11:52:07,571 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 2 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_f1fda7e5-70f6-451b-9e85-d6f04acde80c/bin/uautomizer-verify-VRDe98Ueme/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2023-11-26 11:52:07,572 INFO L420 AbstractCegarLoop]: === Iteration 2 === Targeting ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [P0Err0ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 10 more)] === [2023-11-26 11:52:07,572 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-11-26 11:52:07,573 INFO L85 PathProgramCache]: Analyzing trace with hash 12697, now seen corresponding path program 1 times [2023-11-26 11:52:07,573 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2023-11-26 11:52:07,574 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [1294926701] [2023-11-26 11:52:07,574 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-11-26 11:52:07,574 INFO L173 SolverBuilder]: Constructing external solver with command: mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2023-11-26 11:52:07,574 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_f1fda7e5-70f6-451b-9e85-d6f04acde80c/bin/uautomizer-verify-VRDe98Ueme/mathsat [2023-11-26 11:52:07,576 INFO L229 MonitoredProcess]: Starting monitored process 3 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_f1fda7e5-70f6-451b-9e85-d6f04acde80c/bin/uautomizer-verify-VRDe98Ueme/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (exit command is (exit), workingDir is null) [2023-11-26 11:52:07,606 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_f1fda7e5-70f6-451b-9e85-d6f04acde80c/bin/uautomizer-verify-VRDe98Ueme/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (3)] Waiting until timeout for monitored process [2023-11-26 11:52:07,684 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-26 11:52:07,686 INFO L262 TraceCheckSpWp]: Trace formula consists of 51 conjuncts, 4 conjunts are in the unsatisfiable core [2023-11-26 11:52:07,687 INFO L285 TraceCheckSpWp]: Computing forward predicates... [2023-11-26 11:52:07,696 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 6 treesize of output 5 [2023-11-26 11:52:07,710 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-11-26 11:52:07,710 INFO L323 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2023-11-26 11:52:07,710 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2023-11-26 11:52:07,711 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [1294926701] [2023-11-26 11:52:07,711 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [1294926701] provided 1 perfect and 0 imperfect interpolant sequences [2023-11-26 11:52:07,711 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-11-26 11:52:07,711 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [1] imperfect sequences [] total 1 [2023-11-26 11:52:07,712 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [474277481] [2023-11-26 11:52:07,712 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-11-26 11:52:07,713 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2023-11-26 11:52:07,713 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2023-11-26 11:52:07,714 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2023-11-26 11:52:07,714 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2023-11-26 11:52:07,756 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 29 out of 55 [2023-11-26 11:52:07,756 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 57 places, 48 transitions, 106 flow. Second operand has 3 states, 3 states have (on average 29.666666666666668) internal successors, (89), 3 states have internal predecessors, (89), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-26 11:52:07,757 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2023-11-26 11:52:07,757 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 29 of 55 [2023-11-26 11:52:07,757 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2023-11-26 11:52:08,271 INFO L124 PetriNetUnfolderBase]: 1057/2067 cut-off events. [2023-11-26 11:52:08,272 INFO L125 PetriNetUnfolderBase]: For 60/60 co-relation queries the response was YES. [2023-11-26 11:52:08,278 INFO L83 FinitePrefix]: Finished finitePrefix Result has 3751 conditions, 2067 events. 1057/2067 cut-off events. For 60/60 co-relation queries the response was YES. Maximal size of possible extension queue 142. Compared 14121 event pairs, 791 based on Foata normal form. 1/1831 useless extension candidates. Maximal degree in co-relation 3740. Up to 1192 conditions per place. [2023-11-26 11:52:08,293 INFO L140 encePairwiseOnDemand]: 52/55 looper letters, 29 selfloop transitions, 2 changer transitions 0/56 dead transitions. [2023-11-26 11:52:08,294 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 58 places, 56 transitions, 184 flow [2023-11-26 11:52:08,296 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2023-11-26 11:52:08,296 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2023-11-26 11:52:08,297 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 119 transitions. [2023-11-26 11:52:08,298 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.7212121212121212 [2023-11-26 11:52:08,298 INFO L72 ComplementDD]: Start complementDD. Operand 3 states and 119 transitions. [2023-11-26 11:52:08,299 INFO L73 IsDeterministic]: Start isDeterministic. Operand 3 states and 119 transitions. [2023-11-26 11:52:08,299 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2023-11-26 11:52:08,299 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 3 states and 119 transitions. [2023-11-26 11:52:08,300 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 4 states, 3 states have (on average 39.666666666666664) internal successors, (119), 3 states have internal predecessors, (119), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-26 11:52:08,302 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 4 states, 4 states have (on average 55.0) internal successors, (220), 4 states have internal predecessors, (220), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-26 11:52:08,302 INFO L81 ComplementDD]: Finished complementDD. Result has 4 states, 4 states have (on average 55.0) internal successors, (220), 4 states have internal predecessors, (220), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-26 11:52:08,302 INFO L175 Difference]: Start difference. First operand has 57 places, 48 transitions, 106 flow. Second operand 3 states and 119 transitions. [2023-11-26 11:52:08,303 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 58 places, 56 transitions, 184 flow [2023-11-26 11:52:08,305 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 56 places, 56 transitions, 180 flow, removed 0 selfloop flow, removed 2 redundant places. [2023-11-26 11:52:08,307 INFO L231 Difference]: Finished difference. Result has 56 places, 47 transitions, 104 flow [2023-11-26 11:52:08,307 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=55, PETRI_DIFFERENCE_MINUEND_FLOW=100, PETRI_DIFFERENCE_MINUEND_PLACES=54, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=47, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=2, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=45, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=104, PETRI_PLACES=56, PETRI_TRANSITIONS=47} [2023-11-26 11:52:08,308 INFO L281 CegarLoopForPetriNet]: 60 programPoint places, -4 predicate places. [2023-11-26 11:52:08,308 INFO L495 AbstractCegarLoop]: Abstraction has has 56 places, 47 transitions, 104 flow [2023-11-26 11:52:08,309 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 29.666666666666668) internal successors, (89), 3 states have internal predecessors, (89), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-26 11:52:08,309 INFO L200 CegarLoopForPetriNet]: Found error trace [2023-11-26 11:52:08,309 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1] [2023-11-26 11:52:08,317 INFO L540 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_f1fda7e5-70f6-451b-9e85-d6f04acde80c/bin/uautomizer-verify-VRDe98Ueme/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (3)] Forceful destruction successful, exit code 0 [2023-11-26 11:52:08,512 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 3 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_f1fda7e5-70f6-451b-9e85-d6f04acde80c/bin/uautomizer-verify-VRDe98Ueme/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2023-11-26 11:52:08,513 INFO L420 AbstractCegarLoop]: === Iteration 3 === Targeting ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [P0Err0ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 10 more)] === [2023-11-26 11:52:08,513 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-11-26 11:52:08,514 INFO L85 PathProgramCache]: Analyzing trace with hash 378607630, now seen corresponding path program 1 times [2023-11-26 11:52:08,514 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2023-11-26 11:52:08,515 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [701136330] [2023-11-26 11:52:08,515 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-11-26 11:52:08,515 INFO L173 SolverBuilder]: Constructing external solver with command: mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2023-11-26 11:52:08,515 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_f1fda7e5-70f6-451b-9e85-d6f04acde80c/bin/uautomizer-verify-VRDe98Ueme/mathsat [2023-11-26 11:52:08,517 INFO L229 MonitoredProcess]: Starting monitored process 4 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_f1fda7e5-70f6-451b-9e85-d6f04acde80c/bin/uautomizer-verify-VRDe98Ueme/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (exit command is (exit), workingDir is null) [2023-11-26 11:52:08,520 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_f1fda7e5-70f6-451b-9e85-d6f04acde80c/bin/uautomizer-verify-VRDe98Ueme/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (4)] Waiting until timeout for monitored process [2023-11-26 11:52:08,609 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-26 11:52:08,611 INFO L262 TraceCheckSpWp]: Trace formula consists of 72 conjuncts, 3 conjunts are in the unsatisfiable core [2023-11-26 11:52:08,612 INFO L285 TraceCheckSpWp]: Computing forward predicates... [2023-11-26 11:52:08,620 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 6 treesize of output 7 [2023-11-26 11:52:08,627 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-11-26 11:52:08,628 INFO L323 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2023-11-26 11:52:08,628 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2023-11-26 11:52:08,628 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [701136330] [2023-11-26 11:52:08,628 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [701136330] provided 1 perfect and 0 imperfect interpolant sequences [2023-11-26 11:52:08,629 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-11-26 11:52:08,629 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2023-11-26 11:52:08,629 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1463254108] [2023-11-26 11:52:08,629 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-11-26 11:52:08,630 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2023-11-26 11:52:08,630 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2023-11-26 11:52:08,631 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2023-11-26 11:52:08,631 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2023-11-26 11:52:08,662 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 28 out of 55 [2023-11-26 11:52:08,662 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 56 places, 47 transitions, 104 flow. Second operand has 3 states, 3 states have (on average 29.333333333333332) internal successors, (88), 3 states have internal predecessors, (88), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-26 11:52:08,662 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2023-11-26 11:52:08,663 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 28 of 55 [2023-11-26 11:52:08,663 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2023-11-26 11:52:09,140 INFO L124 PetriNetUnfolderBase]: 1061/2066 cut-off events. [2023-11-26 11:52:09,141 INFO L125 PetriNetUnfolderBase]: For 60/60 co-relation queries the response was YES. [2023-11-26 11:52:09,147 INFO L83 FinitePrefix]: Finished finitePrefix Result has 3759 conditions, 2066 events. 1061/2066 cut-off events. For 60/60 co-relation queries the response was YES. Maximal size of possible extension queue 142. Compared 14237 event pairs, 571 based on Foata normal form. 0/1841 useless extension candidates. Maximal degree in co-relation 3748. Up to 1195 conditions per place. [2023-11-26 11:52:09,163 INFO L140 encePairwiseOnDemand]: 52/55 looper letters, 30 selfloop transitions, 2 changer transitions 0/55 dead transitions. [2023-11-26 11:52:09,164 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 57 places, 55 transitions, 184 flow [2023-11-26 11:52:09,164 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2023-11-26 11:52:09,165 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2023-11-26 11:52:09,166 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 117 transitions. [2023-11-26 11:52:09,166 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.7090909090909091 [2023-11-26 11:52:09,167 INFO L72 ComplementDD]: Start complementDD. Operand 3 states and 117 transitions. [2023-11-26 11:52:09,167 INFO L73 IsDeterministic]: Start isDeterministic. Operand 3 states and 117 transitions. [2023-11-26 11:52:09,167 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2023-11-26 11:52:09,167 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 3 states and 117 transitions. [2023-11-26 11:52:09,168 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 4 states, 3 states have (on average 39.0) internal successors, (117), 3 states have internal predecessors, (117), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-26 11:52:09,170 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 4 states, 4 states have (on average 55.0) internal successors, (220), 4 states have internal predecessors, (220), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-26 11:52:09,170 INFO L81 ComplementDD]: Finished complementDD. Result has 4 states, 4 states have (on average 55.0) internal successors, (220), 4 states have internal predecessors, (220), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-26 11:52:09,170 INFO L175 Difference]: Start difference. First operand has 56 places, 47 transitions, 104 flow. Second operand 3 states and 117 transitions. [2023-11-26 11:52:09,171 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 57 places, 55 transitions, 184 flow [2023-11-26 11:52:09,173 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 55 places, 55 transitions, 180 flow, removed 0 selfloop flow, removed 2 redundant places. [2023-11-26 11:52:09,175 INFO L231 Difference]: Finished difference. Result has 55 places, 46 transitions, 102 flow [2023-11-26 11:52:09,176 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=55, PETRI_DIFFERENCE_MINUEND_FLOW=98, PETRI_DIFFERENCE_MINUEND_PLACES=53, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=46, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=2, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=44, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=102, PETRI_PLACES=55, PETRI_TRANSITIONS=46} [2023-11-26 11:52:09,176 INFO L281 CegarLoopForPetriNet]: 60 programPoint places, -5 predicate places. [2023-11-26 11:52:09,177 INFO L495 AbstractCegarLoop]: Abstraction has has 55 places, 46 transitions, 102 flow [2023-11-26 11:52:09,177 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 29.333333333333332) internal successors, (88), 3 states have internal predecessors, (88), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-26 11:52:09,177 INFO L200 CegarLoopForPetriNet]: Found error trace [2023-11-26 11:52:09,178 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1] [2023-11-26 11:52:09,185 INFO L552 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_f1fda7e5-70f6-451b-9e85-d6f04acde80c/bin/uautomizer-verify-VRDe98Ueme/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (4)] Ended with exit code 0 [2023-11-26 11:52:09,380 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 4 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_f1fda7e5-70f6-451b-9e85-d6f04acde80c/bin/uautomizer-verify-VRDe98Ueme/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2023-11-26 11:52:09,381 INFO L420 AbstractCegarLoop]: === Iteration 4 === Targeting ULTIMATE.startErr3REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [P0Err0ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 10 more)] === [2023-11-26 11:52:09,381 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-11-26 11:52:09,381 INFO L85 PathProgramCache]: Analyzing trace with hash 378607631, now seen corresponding path program 1 times [2023-11-26 11:52:09,382 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2023-11-26 11:52:09,382 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [2038681081] [2023-11-26 11:52:09,382 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-11-26 11:52:09,383 INFO L173 SolverBuilder]: Constructing external solver with command: mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2023-11-26 11:52:09,383 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_f1fda7e5-70f6-451b-9e85-d6f04acde80c/bin/uautomizer-verify-VRDe98Ueme/mathsat [2023-11-26 11:52:09,384 INFO L229 MonitoredProcess]: Starting monitored process 5 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_f1fda7e5-70f6-451b-9e85-d6f04acde80c/bin/uautomizer-verify-VRDe98Ueme/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (exit command is (exit), workingDir is null) [2023-11-26 11:52:09,387 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_f1fda7e5-70f6-451b-9e85-d6f04acde80c/bin/uautomizer-verify-VRDe98Ueme/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (5)] Waiting until timeout for monitored process [2023-11-26 11:52:09,477 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-26 11:52:09,479 INFO L262 TraceCheckSpWp]: Trace formula consists of 72 conjuncts, 4 conjunts are in the unsatisfiable core [2023-11-26 11:52:09,481 INFO L285 TraceCheckSpWp]: Computing forward predicates... [2023-11-26 11:52:09,492 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 6 treesize of output 5 [2023-11-26 11:52:09,503 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-11-26 11:52:09,503 INFO L323 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2023-11-26 11:52:09,503 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2023-11-26 11:52:09,504 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [2038681081] [2023-11-26 11:52:09,504 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [2038681081] provided 1 perfect and 0 imperfect interpolant sequences [2023-11-26 11:52:09,504 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-11-26 11:52:09,504 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2023-11-26 11:52:09,505 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [715811546] [2023-11-26 11:52:09,505 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-11-26 11:52:09,505 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2023-11-26 11:52:09,505 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2023-11-26 11:52:09,506 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2023-11-26 11:52:09,506 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2023-11-26 11:52:09,537 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 29 out of 55 [2023-11-26 11:52:09,538 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 55 places, 46 transitions, 102 flow. Second operand has 3 states, 3 states have (on average 30.333333333333332) internal successors, (91), 3 states have internal predecessors, (91), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-26 11:52:09,538 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2023-11-26 11:52:09,538 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 29 of 55 [2023-11-26 11:52:09,538 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand