./Ultimate.py --spec ../../sv-benchmarks/c/properties/valid-memsafety.prp --file ../../sv-benchmarks/c/pthread-wmm/mix002.opt.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_0ecd337b-3e48-422e-ab03-8a746d4d653d/bin/uautomizer-verify-VRDe98Ueme/data/config -Xmx15G -Xms4m -jar /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_0ecd337b-3e48-422e-ab03-8a746d4d653d/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_0ecd337b-3e48-422e-ab03-8a746d4d653d/bin/uautomizer-verify-VRDe98Ueme/data -tc /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_0ecd337b-3e48-422e-ab03-8a746d4d653d/bin/uautomizer-verify-VRDe98Ueme/config/AutomizerMemDerefMemtrack.xml -i ../../sv-benchmarks/c/pthread-wmm/mix002.opt.i -s /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_0ecd337b-3e48-422e-ab03-8a746d4d653d/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_0ecd337b-3e48-422e-ab03-8a746d4d653d/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 dab8e857d69436654e6c7f0511b4cf3ecd6cd037fe32ed910d6d601721dfd494 --- Real Ultimate output --- This is Ultimate 0.2.4-dev-0e0057c [2023-11-26 11:47:09,895 INFO L188 SettingsManager]: Resetting all preferences to default values... [2023-11-26 11:47:09,996 INFO L114 SettingsManager]: Loading settings from /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_0ecd337b-3e48-422e-ab03-8a746d4d653d/bin/uautomizer-verify-VRDe98Ueme/config/svcomp-DerefFreeMemtrack-32bit-Automizer_Default.epf [2023-11-26 11:47:10,004 WARN L101 SettingsManager]: Preference file contains the following unknown settings: [2023-11-26 11:47:10,005 WARN L103 SettingsManager]: * de.uni_freiburg.informatik.ultimate.core.Log level for class [2023-11-26 11:47:10,050 INFO L130 SettingsManager]: Preferences different from defaults after loading the file: [2023-11-26 11:47:10,051 INFO L151 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2023-11-26 11:47:10,052 INFO L153 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2023-11-26 11:47:10,053 INFO L151 SettingsManager]: Preferences of Boogie Preprocessor differ from their defaults: [2023-11-26 11:47:10,057 INFO L153 SettingsManager]: * Use memory slicer=true [2023-11-26 11:47:10,058 INFO L151 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2023-11-26 11:47:10,059 INFO L153 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2023-11-26 11:47:10,060 INFO L151 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2023-11-26 11:47:10,061 INFO L153 SettingsManager]: * Create parallel compositions if possible=false [2023-11-26 11:47:10,062 INFO L153 SettingsManager]: * Use SBE=true [2023-11-26 11:47:10,062 INFO L151 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2023-11-26 11:47:10,062 INFO L153 SettingsManager]: * sizeof long=4 [2023-11-26 11:47:10,063 INFO L153 SettingsManager]: * Overapproximate operations on floating types=true [2023-11-26 11:47:10,063 INFO L153 SettingsManager]: * sizeof POINTER=4 [2023-11-26 11:47:10,063 INFO L153 SettingsManager]: * Check division by zero=IGNORE [2023-11-26 11:47:10,064 INFO L153 SettingsManager]: * Check for the main procedure if all allocated memory was freed=true [2023-11-26 11:47:10,064 INFO L153 SettingsManager]: * Bitprecise bitfields=true [2023-11-26 11:47:10,065 INFO L153 SettingsManager]: * SV-COMP memtrack compatibility mode=true [2023-11-26 11:47:10,065 INFO L153 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2023-11-26 11:47:10,065 INFO L153 SettingsManager]: * Adapt memory model on pointer casts if necessary=true [2023-11-26 11:47:10,066 INFO L153 SettingsManager]: * Check unreachability of reach_error function=false [2023-11-26 11:47:10,066 INFO L153 SettingsManager]: * sizeof long double=12 [2023-11-26 11:47:10,067 INFO L153 SettingsManager]: * Use constant arrays=true [2023-11-26 11:47:10,067 INFO L151 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2023-11-26 11:47:10,068 INFO L153 SettingsManager]: * Size of a code block=SequenceOfStatements [2023-11-26 11:47:10,069 INFO L153 SettingsManager]: * Only consider context switches at boundaries of atomic blocks=true [2023-11-26 11:47:10,069 INFO L153 SettingsManager]: * SMT solver=External_DefaultMode [2023-11-26 11:47:10,069 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2023-11-26 11:47:10,070 INFO L151 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2023-11-26 11:47:10,070 INFO L153 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2023-11-26 11:47:10,070 INFO L153 SettingsManager]: * Trace refinement strategy=CAMEL [2023-11-26 11:47:10,070 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2023-11-26 11:47:10,071 INFO L153 SettingsManager]: * Apply one-shot large block encoding in concurrent analysis=false [2023-11-26 11:47:10,071 INFO L153 SettingsManager]: * Automaton type used in concurrency analysis=PETRI_NET [2023-11-26 11:47:10,071 INFO L153 SettingsManager]: * Order on configurations for Petri net unfoldings=DBO [2023-11-26 11:47:10,071 INFO L153 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2023-11-26 11:47:10,071 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_0ecd337b-3e48-422e-ab03-8a746d4d653d/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_0ecd337b-3e48-422e-ab03-8a746d4d653d/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 -> dab8e857d69436654e6c7f0511b4cf3ecd6cd037fe32ed910d6d601721dfd494 [2023-11-26 11:47:10,402 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2023-11-26 11:47:10,430 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2023-11-26 11:47:10,433 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2023-11-26 11:47:10,434 INFO L270 PluginConnector]: Initializing CDTParser... [2023-11-26 11:47:10,435 INFO L274 PluginConnector]: CDTParser initialized [2023-11-26 11:47:10,436 INFO L431 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_0ecd337b-3e48-422e-ab03-8a746d4d653d/bin/uautomizer-verify-VRDe98Ueme/../../sv-benchmarks/c/pthread-wmm/mix002.opt.i [2023-11-26 11:47:13,457 INFO L533 CDTParser]: Created temporary CDT project at NULL [2023-11-26 11:47:13,710 INFO L384 CDTParser]: Found 1 translation units. [2023-11-26 11:47:13,711 INFO L180 CDTParser]: Scanning /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_0ecd337b-3e48-422e-ab03-8a746d4d653d/sv-benchmarks/c/pthread-wmm/mix002.opt.i [2023-11-26 11:47:13,740 INFO L427 CDTParser]: About to delete temporary CDT project at /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_0ecd337b-3e48-422e-ab03-8a746d4d653d/bin/uautomizer-verify-VRDe98Ueme/data/4e08844f3/3700a28021d549fcb9c854d2971543a8/FLAGd33407fd6 [2023-11-26 11:47:13,757 INFO L435 CDTParser]: Successfully deleted /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_0ecd337b-3e48-422e-ab03-8a746d4d653d/bin/uautomizer-verify-VRDe98Ueme/data/4e08844f3/3700a28021d549fcb9c854d2971543a8 [2023-11-26 11:47:13,762 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2023-11-26 11:47:13,764 INFO L133 ToolchainWalker]: Walking toolchain with 6 elements. [2023-11-26 11:47:13,767 INFO L112 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2023-11-26 11:47:13,768 INFO L270 PluginConnector]: Initializing CACSL2BoogieTranslator... [2023-11-26 11:47:13,773 INFO L274 PluginConnector]: CACSL2BoogieTranslator initialized [2023-11-26 11:47:13,774 INFO L184 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 26.11 11:47:13" (1/1) ... [2023-11-26 11:47:13,775 INFO L204 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@78006fa3 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 26.11 11:47:13, skipping insertion in model container [2023-11-26 11:47:13,775 INFO L184 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 26.11 11:47:13" (1/1) ... [2023-11-26 11:47:13,850 INFO L177 MainTranslator]: Built tables and reachable declarations [2023-11-26 11:47:14,473 INFO L209 PostProcessor]: Analyzing one entry point: main [2023-11-26 11:47:14,495 INFO L202 MainTranslator]: Completed pre-run [2023-11-26 11:47:14,569 INFO L209 PostProcessor]: Analyzing one entry point: main [2023-11-26 11:47:14,600 WARN L675 CHandler]: The function __VERIFIER_atomic_begin is called, but not defined or handled by StandardFunctionHandler. [2023-11-26 11:47:14,600 WARN L675 CHandler]: The function __VERIFIER_atomic_end is called, but not defined or handled by StandardFunctionHandler. [2023-11-26 11:47:14,608 INFO L206 MainTranslator]: Completed translation [2023-11-26 11:47:14,608 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 26.11 11:47:14 WrapperNode [2023-11-26 11:47:14,608 INFO L131 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2023-11-26 11:47:14,610 INFO L112 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2023-11-26 11:47:14,610 INFO L270 PluginConnector]: Initializing Boogie Procedure Inliner... [2023-11-26 11:47:14,610 INFO L274 PluginConnector]: Boogie Procedure Inliner initialized [2023-11-26 11:47:14,618 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:47:14" (1/1) ... [2023-11-26 11:47:14,634 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:47:14" (1/1) ... [2023-11-26 11:47:14,671 INFO L138 Inliner]: procedures = 176, calls = 63, calls flagged for inlining = 6, calls inlined = 7, statements flattened = 158 [2023-11-26 11:47:14,672 INFO L131 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2023-11-26 11:47:14,673 INFO L112 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2023-11-26 11:47:14,673 INFO L270 PluginConnector]: Initializing Boogie Preprocessor... [2023-11-26 11:47:14,673 INFO L274 PluginConnector]: Boogie Preprocessor initialized [2023-11-26 11:47:14,684 INFO L184 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 26.11 11:47:14" (1/1) ... [2023-11-26 11:47:14,685 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 26.11 11:47:14" (1/1) ... [2023-11-26 11:47:14,689 INFO L184 PluginConnector]: Executing the observer MemorySlicer from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 26.11 11:47:14" (1/1) ... [2023-11-26 11:47:14,708 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:47:14,709 INFO L184 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 26.11 11:47:14" (1/1) ... [2023-11-26 11:47:14,709 INFO L184 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 26.11 11:47:14" (1/1) ... [2023-11-26 11:47:14,721 INFO L184 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 26.11 11:47:14" (1/1) ... [2023-11-26 11:47:14,724 INFO L184 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 26.11 11:47:14" (1/1) ... [2023-11-26 11:47:14,727 INFO L184 PluginConnector]: Executing the observer LTLStepAnnotator from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 26.11 11:47:14" (1/1) ... [2023-11-26 11:47:14,729 INFO L184 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 26.11 11:47:14" (1/1) ... [2023-11-26 11:47:14,734 INFO L131 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2023-11-26 11:47:14,735 INFO L112 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2023-11-26 11:47:14,735 INFO L270 PluginConnector]: Initializing RCFGBuilder... [2023-11-26 11:47:14,735 INFO L274 PluginConnector]: RCFGBuilder initialized [2023-11-26 11:47:14,736 INFO L184 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 26.11 11:47:14" (1/1) ... [2023-11-26 11:47:14,753 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2023-11-26 11:47:14,764 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_0ecd337b-3e48-422e-ab03-8a746d4d653d/bin/uautomizer-verify-VRDe98Ueme/z3 [2023-11-26 11:47:14,782 INFO L229 MonitoredProcess]: Starting monitored process 1 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_0ecd337b-3e48-422e-ab03-8a746d4d653d/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:47:14,786 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_0ecd337b-3e48-422e-ab03-8a746d4d653d/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:47:14,818 INFO L130 BoogieDeclarations]: Found specification of procedure write~int#0 [2023-11-26 11:47:14,818 INFO L130 BoogieDeclarations]: Found specification of procedure write~int#1 [2023-11-26 11:47:14,819 INFO L130 BoogieDeclarations]: Found specification of procedure write~int#2 [2023-11-26 11:47:14,819 INFO L130 BoogieDeclarations]: Found specification of procedure write~int#3 [2023-11-26 11:47:14,819 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_atomic_begin [2023-11-26 11:47:14,819 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2023-11-26 11:47:14,819 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnStack [2023-11-26 11:47:14,819 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.dealloc [2023-11-26 11:47:14,820 INFO L130 BoogieDeclarations]: Found specification of procedure P0 [2023-11-26 11:47:14,820 INFO L138 BoogieDeclarations]: Found implementation of procedure P0 [2023-11-26 11:47:14,820 INFO L130 BoogieDeclarations]: Found specification of procedure P1 [2023-11-26 11:47:14,820 INFO L138 BoogieDeclarations]: Found implementation of procedure P1 [2023-11-26 11:47:14,820 INFO L130 BoogieDeclarations]: Found specification of procedure P2 [2023-11-26 11:47:14,820 INFO L138 BoogieDeclarations]: Found implementation of procedure P2 [2023-11-26 11:47:14,821 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#0 [2023-11-26 11:47:14,821 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#1 [2023-11-26 11:47:14,821 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#2 [2023-11-26 11:47:14,821 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#3 [2023-11-26 11:47:14,821 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_atomic_end [2023-11-26 11:47:14,821 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2023-11-26 11:47:14,821 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2023-11-26 11:47:14,823 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:47:14,982 INFO L241 CfgBuilder]: Building ICFG [2023-11-26 11:47:14,984 INFO L267 CfgBuilder]: Building CFG for each procedure with an implementation [2023-11-26 11:47:15,391 INFO L282 CfgBuilder]: Performing block encoding [2023-11-26 11:47:15,636 INFO L304 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2023-11-26 11:47:15,637 INFO L309 CfgBuilder]: Removed 0 assume(true) statements. [2023-11-26 11:47:15,637 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 26.11 11:47:15 BoogieIcfgContainer [2023-11-26 11:47:15,638 INFO L131 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2023-11-26 11:47:15,640 INFO L112 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2023-11-26 11:47:15,641 INFO L270 PluginConnector]: Initializing TraceAbstraction... [2023-11-26 11:47:15,644 INFO L274 PluginConnector]: TraceAbstraction initialized [2023-11-26 11:47:15,645 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 26.11 11:47:13" (1/3) ... [2023-11-26 11:47:15,645 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@9dd7c9a and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 26.11 11:47:15, skipping insertion in model container [2023-11-26 11:47:15,646 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 26.11 11:47:14" (2/3) ... [2023-11-26 11:47:15,648 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@9dd7c9a and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 26.11 11:47:15, skipping insertion in model container [2023-11-26 11:47:15,648 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 26.11 11:47:15" (3/3) ... [2023-11-26 11:47:15,649 INFO L112 eAbstractionObserver]: Analyzing ICFG mix002.opt.i [2023-11-26 11:47:15,670 INFO L203 ceAbstractionStarter]: Automizer settings: Hoare:false NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2023-11-26 11:47:15,670 INFO L162 ceAbstractionStarter]: Applying trace abstraction to program that has 9 error locations. [2023-11-26 11:47:15,670 INFO L514 ceAbstractionStarter]: Constructing petrified ICFG for 1 thread instances. [2023-11-26 11:47:15,737 INFO L144 ThreadInstanceAdder]: Constructed 0 joinOtherThreadTransitions. [2023-11-26 11:47:15,776 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 65 places, 57 transitions, 126 flow [2023-11-26 11:47:15,834 INFO L124 PetriNetUnfolderBase]: 2/54 cut-off events. [2023-11-26 11:47:15,834 INFO L125 PetriNetUnfolderBase]: For 0/0 co-relation queries the response was YES. [2023-11-26 11:47:15,838 INFO L83 FinitePrefix]: Finished finitePrefix Result has 64 conditions, 54 events. 2/54 cut-off events. For 0/0 co-relation queries the response was YES. Maximal size of possible extension queue 5. Compared 111 event pairs, 0 based on Foata normal form. 0/43 useless extension candidates. Maximal degree in co-relation 53. Up to 2 conditions per place. [2023-11-26 11:47:15,838 INFO L82 GeneralOperation]: Start removeDead. Operand has 65 places, 57 transitions, 126 flow [2023-11-26 11:47:15,842 INFO L88 GeneralOperation]: Finished RemoveDead, result has has 62 places, 54 transitions, 117 flow [2023-11-26 11:47:15,851 INFO L356 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2023-11-26 11:47:15,858 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;@4daee1d8, mLbeIndependenceSettings=[IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=false, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2023-11-26 11:47:15,858 INFO L358 AbstractCegarLoop]: Starting to check reachability of 13 error locations. [2023-11-26 11:47:15,861 INFO L185 PetriNetUnfolderBase]: Found word, exiting Unfolder. [2023-11-26 11:47:15,862 INFO L124 PetriNetUnfolderBase]: 0/2 cut-off events. [2023-11-26 11:47:15,862 INFO L125 PetriNetUnfolderBase]: For 0/0 co-relation queries the response was YES. [2023-11-26 11:47:15,862 INFO L200 CegarLoopForPetriNet]: Found error trace [2023-11-26 11:47:15,863 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1] [2023-11-26 11:47:15,864 INFO L420 AbstractCegarLoop]: === Iteration 1 === Targeting ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [P2Err0ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 10 more)] === [2023-11-26 11:47:15,869 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-11-26 11:47:15,869 INFO L85 PathProgramCache]: Analyzing trace with hash 13779, now seen corresponding path program 1 times [2023-11-26 11:47:15,879 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-11-26 11:47:15,880 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1109021088] [2023-11-26 11:47:15,880 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-11-26 11:47:15,881 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-11-26 11:47:16,025 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-26 11:47:16,206 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:47:16,206 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-11-26 11:47:16,207 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1109021088] [2023-11-26 11:47:16,207 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1109021088] provided 1 perfect and 0 imperfect interpolant sequences [2023-11-26 11:47:16,208 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-11-26 11:47:16,208 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [1] imperfect sequences [] total 1 [2023-11-26 11:47:16,211 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [922479293] [2023-11-26 11:47:16,213 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-11-26 11:47:16,223 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2023-11-26 11:47:16,231 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-11-26 11:47:16,263 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2023-11-26 11:47:16,264 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2023-11-26 11:47:16,294 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 31 out of 57 [2023-11-26 11:47:16,297 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 62 places, 54 transitions, 117 flow. Second operand has 3 states, 3 states have (on average 31.666666666666668) internal successors, (95), 3 states have internal predecessors, (95), 0 states have call successors, (0), 0 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:47:16,298 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2023-11-26 11:47:16,298 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 31 of 57 [2023-11-26 11:47:16,299 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2023-11-26 11:47:16,667 INFO L124 PetriNetUnfolderBase]: 557/1145 cut-off events. [2023-11-26 11:47:16,667 INFO L125 PetriNetUnfolderBase]: For 8/8 co-relation queries the response was YES. [2023-11-26 11:47:16,674 INFO L83 FinitePrefix]: Finished finitePrefix Result has 2031 conditions, 1145 events. 557/1145 cut-off events. For 8/8 co-relation queries the response was YES. Maximal size of possible extension queue 124. Compared 8677 event pairs, 413 based on Foata normal form. 72/1137 useless extension candidates. Maximal degree in co-relation 2017. Up to 647 conditions per place. [2023-11-26 11:47:16,685 INFO L140 encePairwiseOnDemand]: 52/57 looper letters, 28 selfloop transitions, 2 changer transitions 0/58 dead transitions. [2023-11-26 11:47:16,686 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 62 places, 58 transitions, 185 flow [2023-11-26 11:47:16,687 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2023-11-26 11:47:16,689 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2023-11-26 11:47:16,697 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 126 transitions. [2023-11-26 11:47:16,699 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.7368421052631579 [2023-11-26 11:47:16,700 INFO L72 ComplementDD]: Start complementDD. Operand 3 states and 126 transitions. [2023-11-26 11:47:16,701 INFO L73 IsDeterministic]: Start isDeterministic. Operand 3 states and 126 transitions. [2023-11-26 11:47:16,702 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2023-11-26 11:47:16,704 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 3 states and 126 transitions. [2023-11-26 11:47:16,707 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 4 states, 3 states have (on average 42.0) internal successors, (126), 3 states have internal predecessors, (126), 0 states have call successors, (0), 0 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:47:16,714 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 4 states, 4 states have (on average 57.0) internal successors, (228), 4 states have internal predecessors, (228), 0 states have call successors, (0), 0 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:47:16,714 INFO L81 ComplementDD]: Finished complementDD. Result has 4 states, 4 states have (on average 57.0) internal successors, (228), 4 states have internal predecessors, (228), 0 states have call successors, (0), 0 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:47:16,716 INFO L175 Difference]: Start difference. First operand has 62 places, 54 transitions, 117 flow. Second operand 3 states and 126 transitions. [2023-11-26 11:47:16,717 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 62 places, 58 transitions, 185 flow [2023-11-26 11:47:16,721 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 59 places, 58 transitions, 182 flow, removed 0 selfloop flow, removed 3 redundant places. [2023-11-26 11:47:16,728 INFO L231 Difference]: Finished difference. Result has 59 places, 50 transitions, 110 flow [2023-11-26 11:47:16,730 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=57, PETRI_DIFFERENCE_MINUEND_FLOW=106, PETRI_DIFFERENCE_MINUEND_PLACES=57, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=50, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=2, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=48, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=110, PETRI_PLACES=59, PETRI_TRANSITIONS=50} [2023-11-26 11:47:16,734 INFO L281 CegarLoopForPetriNet]: 62 programPoint places, -3 predicate places. [2023-11-26 11:47:16,734 INFO L495 AbstractCegarLoop]: Abstraction has has 59 places, 50 transitions, 110 flow [2023-11-26 11:47:16,735 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 31.666666666666668) internal successors, (95), 3 states have internal predecessors, (95), 0 states have call successors, (0), 0 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:47:16,735 INFO L200 CegarLoopForPetriNet]: Found error trace [2023-11-26 11:47:16,735 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1] [2023-11-26 11:47:16,735 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable0 [2023-11-26 11:47:16,737 INFO L420 AbstractCegarLoop]: === Iteration 2 === Targeting ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [P2Err0ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 10 more)] === [2023-11-26 11:47:16,738 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-11-26 11:47:16,738 INFO L85 PathProgramCache]: Analyzing trace with hash 13780, now seen corresponding path program 1 times [2023-11-26 11:47:16,738 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-11-26 11:47:16,739 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1657290775] [2023-11-26 11:47:16,739 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-11-26 11:47:16,739 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-11-26 11:47:16,793 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-26 11:47:16,962 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:47:16,963 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-11-26 11:47:16,964 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1657290775] [2023-11-26 11:47:16,964 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1657290775] provided 1 perfect and 0 imperfect interpolant sequences [2023-11-26 11:47:16,964 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-11-26 11:47:16,965 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [1] imperfect sequences [] total 1 [2023-11-26 11:47:16,965 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1978050096] [2023-11-26 11:47:16,965 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-11-26 11:47:16,966 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2023-11-26 11:47:16,967 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-11-26 11:47:16,967 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2023-11-26 11:47:16,968 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2023-11-26 11:47:16,992 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 32 out of 57 [2023-11-26 11:47:16,993 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 59 places, 50 transitions, 110 flow. Second operand has 3 states, 3 states have (on average 32.666666666666664) internal successors, (98), 3 states have internal predecessors, (98), 0 states have call successors, (0), 0 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:47:16,993 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2023-11-26 11:47:16,994 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 32 of 57 [2023-11-26 11:47:16,994 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2023-11-26 11:47:17,347 INFO L124 PetriNetUnfolderBase]: 557/1144 cut-off events. [2023-11-26 11:47:17,347 INFO L125 PetriNetUnfolderBase]: For 36/36 co-relation queries the response was YES. [2023-11-26 11:47:17,353 INFO L83 FinitePrefix]: Finished finitePrefix Result has 2064 conditions, 1144 events. 557/1144 cut-off events. For 36/36 co-relation queries the response was YES. Maximal size of possible extension queue 124. Compared 8585 event pairs, 413 based on Foata normal form. 1/1065 useless extension candidates. Maximal degree in co-relation 2053. Up to 646 conditions per place. [2023-11-26 11:47:17,362 INFO L140 encePairwiseOnDemand]: 54/57 looper letters, 27 selfloop transitions, 2 changer transitions 0/57 dead transitions. [2023-11-26 11:47:17,363 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 60 places, 57 transitions, 182 flow [2023-11-26 11:47:17,364 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2023-11-26 11:47:17,364 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2023-11-26 11:47:17,367 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 126 transitions. [2023-11-26 11:47:17,369 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.7368421052631579 [2023-11-26 11:47:17,369 INFO L72 ComplementDD]: Start complementDD. Operand 3 states and 126 transitions. [2023-11-26 11:47:17,370 INFO L73 IsDeterministic]: Start isDeterministic. Operand 3 states and 126 transitions. [2023-11-26 11:47:17,372 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2023-11-26 11:47:17,372 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 3 states and 126 transitions. [2023-11-26 11:47:17,373 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 4 states, 3 states have (on average 42.0) internal successors, (126), 3 states have internal predecessors, (126), 0 states have call successors, (0), 0 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:47:17,375 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 4 states, 4 states have (on average 57.0) internal successors, (228), 4 states have internal predecessors, (228), 0 states have call successors, (0), 0 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:47:17,376 INFO L81 ComplementDD]: Finished complementDD. Result has 4 states, 4 states have (on average 57.0) internal successors, (228), 4 states have internal predecessors, (228), 0 states have call successors, (0), 0 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:47:17,379 INFO L175 Difference]: Start difference. First operand has 59 places, 50 transitions, 110 flow. Second operand 3 states and 126 transitions. [2023-11-26 11:47:17,380 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 60 places, 57 transitions, 182 flow [2023-11-26 11:47:17,384 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 58 places, 57 transitions, 178 flow, removed 0 selfloop flow, removed 2 redundant places. [2023-11-26 11:47:17,385 INFO L231 Difference]: Finished difference. Result has 58 places, 49 transitions, 108 flow [2023-11-26 11:47:17,386 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=57, PETRI_DIFFERENCE_MINUEND_FLOW=104, PETRI_DIFFERENCE_MINUEND_PLACES=56, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=49, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=2, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=47, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=108, PETRI_PLACES=58, PETRI_TRANSITIONS=49} [2023-11-26 11:47:17,387 INFO L281 CegarLoopForPetriNet]: 62 programPoint places, -4 predicate places. [2023-11-26 11:47:17,388 INFO L495 AbstractCegarLoop]: Abstraction has has 58 places, 49 transitions, 108 flow [2023-11-26 11:47:17,389 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 32.666666666666664) internal successors, (98), 3 states have internal predecessors, (98), 0 states have call successors, (0), 0 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:47:17,389 INFO L200 CegarLoopForPetriNet]: Found error trace [2023-11-26 11:47:17,395 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1] [2023-11-26 11:47:17,395 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1 [2023-11-26 11:47:17,396 INFO L420 AbstractCegarLoop]: === Iteration 3 === Targeting ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [P2Err0ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 10 more)] === [2023-11-26 11:47:17,398 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-11-26 11:47:17,398 INFO L85 PathProgramCache]: Analyzing trace with hash 410904177, now seen corresponding path program 1 times [2023-11-26 11:47:17,399 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-11-26 11:47:17,399 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [968469981] [2023-11-26 11:47:17,399 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-11-26 11:47:17,400 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-11-26 11:47:17,423 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-26 11:47:17,465 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:47:17,465 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-11-26 11:47:17,465 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [968469981] [2023-11-26 11:47:17,466 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [968469981] provided 1 perfect and 0 imperfect interpolant sequences [2023-11-26 11:47:17,466 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-11-26 11:47:17,466 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2023-11-26 11:47:17,466 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [24288916] [2023-11-26 11:47:17,467 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-11-26 11:47:17,467 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2023-11-26 11:47:17,467 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-11-26 11:47:17,468 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2023-11-26 11:47:17,468 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2023-11-26 11:47:17,484 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 31 out of 57 [2023-11-26 11:47:17,484 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 58 places, 49 transitions, 108 flow. Second operand has 3 states, 3 states have (on average 32.333333333333336) internal successors, (97), 3 states have internal predecessors, (97), 0 states have call successors, (0), 0 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:47:17,484 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2023-11-26 11:47:17,485 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 31 of 57 [2023-11-26 11:47:17,485 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2023-11-26 11:47:17,749 INFO L124 PetriNetUnfolderBase]: 558/1142 cut-off events. [2023-11-26 11:47:17,750 INFO L125 PetriNetUnfolderBase]: For 36/36 co-relation queries the response was YES. [2023-11-26 11:47:17,754 INFO L83 FinitePrefix]: Finished finitePrefix Result has 2065 conditions, 1142 events. 558/1142 cut-off events. For 36/36 co-relation queries the response was YES. Maximal size of possible extension queue 124. Compared 8599 event pairs, 413 based on Foata normal form. 0/1066 useless extension candidates. Maximal degree in co-relation 2054. Up to 646 conditions per place. [2023-11-26 11:47:17,762 INFO L140 encePairwiseOnDemand]: 54/57 looper letters, 28 selfloop transitions, 2 changer transitions 0/56 dead transitions. [2023-11-26 11:47:17,763 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 59 places, 56 transitions, 182 flow [2023-11-26 11:47:17,763 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2023-11-26 11:47:17,763 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2023-11-26 11:47:17,764 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 124 transitions. [2023-11-26 11:47:17,765 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.7251461988304093 [2023-11-26 11:47:17,765 INFO L72 ComplementDD]: Start complementDD. Operand 3 states and 124 transitions. [2023-11-26 11:47:17,765 INFO L73 IsDeterministic]: Start isDeterministic. Operand 3 states and 124 transitions. [2023-11-26 11:47:17,765 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2023-11-26 11:47:17,765 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 3 states and 124 transitions. [2023-11-26 11:47:17,766 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 4 states, 3 states have (on average 41.333333333333336) internal successors, (124), 3 states have internal predecessors, (124), 0 states have call successors, (0), 0 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:47:17,767 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 4 states, 4 states have (on average 57.0) internal successors, (228), 4 states have internal predecessors, (228), 0 states have call successors, (0), 0 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:47:17,768 INFO L81 ComplementDD]: Finished complementDD. Result has 4 states, 4 states have (on average 57.0) internal successors, (228), 4 states have internal predecessors, (228), 0 states have call successors, (0), 0 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:47:17,768 INFO L175 Difference]: Start difference. First operand has 58 places, 49 transitions, 108 flow. Second operand 3 states and 124 transitions. [2023-11-26 11:47:17,768 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 59 places, 56 transitions, 182 flow [2023-11-26 11:47:17,770 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 57 places, 56 transitions, 178 flow, removed 0 selfloop flow, removed 2 redundant places. [2023-11-26 11:47:17,772 INFO L231 Difference]: Finished difference. Result has 57 places, 48 transitions, 106 flow [2023-11-26 11:47:17,772 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=57, 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:47:17,773 INFO L281 CegarLoopForPetriNet]: 62 programPoint places, -5 predicate places. [2023-11-26 11:47:17,773 INFO L495 AbstractCegarLoop]: Abstraction has has 57 places, 48 transitions, 106 flow [2023-11-26 11:47:17,774 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 32.333333333333336) internal successors, (97), 3 states have internal predecessors, (97), 0 states have call successors, (0), 0 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:47:17,774 INFO L200 CegarLoopForPetriNet]: Found error trace [2023-11-26 11:47:17,774 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1] [2023-11-26 11:47:17,774 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2 [2023-11-26 11:47:17,774 INFO L420 AbstractCegarLoop]: === Iteration 4 === Targeting ULTIMATE.startErr3REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [P2Err0ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 10 more)] === [2023-11-26 11:47:17,775 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-11-26 11:47:17,775 INFO L85 PathProgramCache]: Analyzing trace with hash 410904178, now seen corresponding path program 1 times [2023-11-26 11:47:17,775 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-11-26 11:47:17,776 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2042459216] [2023-11-26 11:47:17,776 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-11-26 11:47:17,776 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-11-26 11:47:17,791 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-26 11:47:17,877 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:47:17,878 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-11-26 11:47:17,878 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2042459216] [2023-11-26 11:47:17,878 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2042459216] provided 1 perfect and 0 imperfect interpolant sequences [2023-11-26 11:47:17,879 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-11-26 11:47:17,879 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2023-11-26 11:47:17,883 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1330550667] [2023-11-26 11:47:17,884 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-11-26 11:47:17,884 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2023-11-26 11:47:17,884 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-11-26 11:47:17,886 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2023-11-26 11:47:17,886 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2023-11-26 11:47:17,905 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 32 out of 57 [2023-11-26 11:47:17,905 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 57 places, 48 transitions, 106 flow. Second operand has 3 states, 3 states have (on average 33.333333333333336) internal successors, (100), 3 states have internal predecessors, (100), 0 states have call successors, (0), 0 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:47:17,905 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2023-11-26 11:47:17,906 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 32 of 57 [2023-11-26 11:47:17,906 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2023-11-26 11:47:18,178 INFO L124 PetriNetUnfolderBase]: 557/1140 cut-off events. [2023-11-26 11:47:18,179 INFO L125 PetriNetUnfolderBase]: For 37/37 co-relation queries the response was YES. [2023-11-26 11:47:18,183 INFO L83 FinitePrefix]: Finished finitePrefix Result has 2061 conditions, 1140 events. 557/1140 cut-off events. For 37/37 co-relation queries the response was YES. Maximal size of possible extension queue 124. Compared 8561 event pairs, 334 based on Foata normal form. 2/1067 useless extension candidates. Maximal degree in co-relation 2051. Up to 643 conditions per place. [2023-11-26 11:47:18,193 INFO L140 encePairwiseOnDemand]: 54/57 looper letters, 27 selfloop transitions, 2 changer transitions 0/55 dead transitions. [2023-11-26 11:47:18,193 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 58 places, 55 transitions, 178 flow [2023-11-26 11:47:18,193 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2023-11-26 11:47:18,194 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2023-11-26 11:47:18,195 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 126 transitions. [2023-11-26 11:47:18,196 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.7368421052631579 [2023-11-26 11:47:18,196 INFO L72 ComplementDD]: Start complementDD. Operand 3 states and 126 transitions. [2023-11-26 11:47:18,196 INFO L73 IsDeterministic]: Start isDeterministic. Operand 3 states and 126 transitions. [2023-11-26 11:47:18,197 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2023-11-26 11:47:18,197 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 3 states and 126 transitions. [2023-11-26 11:47:18,198 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 4 states, 3 states have (on average 42.0) internal successors, (126), 3 states have internal predecessors, (126), 0 states have call successors, (0), 0 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:47:18,199 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 4 states, 4 states have (on average 57.0) internal successors, (228), 4 states have internal predecessors, (228), 0 states have call successors, (0), 0 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:47:18,200 INFO L81 ComplementDD]: Finished complementDD. Result has 4 states, 4 states have (on average 57.0) internal successors, (228), 4 states have internal predecessors, (228), 0 states have call successors, (0), 0 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:47:18,200 INFO L175 Difference]: Start difference. First operand has 57 places, 48 transitions, 106 flow. Second operand 3 states and 126 transitions. [2023-11-26 11:47:18,200 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 58 places, 55 transitions, 178 flow [2023-11-26 11:47:18,202 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 56 places, 55 transitions, 174 flow, removed 0 selfloop flow, removed 2 redundant places. [2023-11-26 11:47:18,203 INFO L231 Difference]: Finished difference. Result has 56 places, 47 transitions, 104 flow [2023-11-26 11:47:18,204 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=57, 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:47:18,205 INFO L281 CegarLoopForPetriNet]: 62 programPoint places, -6 predicate places. [2023-11-26 11:47:18,206 INFO L495 AbstractCegarLoop]: Abstraction has has 56 places, 47 transitions, 104 flow [2023-11-26 11:47:18,206 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 33.333333333333336) internal successors, (100), 3 states have internal predecessors, (100), 0 states have call successors, (0), 0 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:47:18,206 INFO L200 CegarLoopForPetriNet]: Found error trace [2023-11-26 11:47:18,206 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1] [2023-11-26 11:47:18,207 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable3 [2023-11-26 11:47:18,208 INFO L420 AbstractCegarLoop]: === Iteration 5 === Targeting ULTIMATE.startErr4REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [P2Err0ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 10 more)] === [2023-11-26 11:47:18,208 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-11-26 11:47:18,208 INFO L85 PathProgramCache]: Analyzing trace with hash 589955765, now seen corresponding path program 1 times [2023-11-26 11:47:18,209 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-11-26 11:47:18,209 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [588705545] [2023-11-26 11:47:18,209 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-11-26 11:47:18,209 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-11-26 11:47:18,233 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-26 11:47:18,312 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:47:18,312 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-11-26 11:47:18,312 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [588705545] [2023-11-26 11:47:18,314 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [588705545] provided 1 perfect and 0 imperfect interpolant sequences [2023-11-26 11:47:18,317 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-11-26 11:47:18,318 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2023-11-26 11:47:18,318 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1524081605] [2023-11-26 11:47:18,318 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-11-26 11:47:18,319 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2023-11-26 11:47:18,319 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-11-26 11:47:18,319 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2023-11-26 11:47:18,320 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2023-11-26 11:47:18,336 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 31 out of 57 [2023-11-26 11:47:18,338 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 56 places, 47 transitions, 104 flow. Second operand has 3 states, 3 states have (on average 33.0) internal successors, (99), 3 states have internal predecessors, (99), 0 states have call successors, (0), 0 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:47:18,338 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2023-11-26 11:47:18,338 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 31 of 57 [2023-11-26 11:47:18,338 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2023-11-26 11:47:18,589 INFO L124 PetriNetUnfolderBase]: 564/1134 cut-off events. [2023-11-26 11:47:18,589 INFO L125 PetriNetUnfolderBase]: For 37/37 co-relation queries the response was YES. [2023-11-26 11:47:18,593 INFO L83 FinitePrefix]: Finished finitePrefix Result has 2068 conditions, 1134 events. 564/1134 cut-off events. For 37/37 co-relation queries the response was YES. Maximal size of possible extension queue 123. Compared 8439 event pairs, 427 based on Foata normal form. 0/1066 useless extension candidates. Maximal degree in co-relation 2058. Up to 644 conditions per place. [2023-11-26 11:47:18,602 INFO L140 encePairwiseOnDemand]: 54/57 looper letters, 28 selfloop transitions, 2 changer transitions 0/54 dead transitions. [2023-11-26 11:47:18,602 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 57 places, 54 transitions, 178 flow [2023-11-26 11:47:18,603 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2023-11-26 11:47:18,603 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2023-11-26 11:47:18,604 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 124 transitions. [2023-11-26 11:47:18,605 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.7251461988304093 [2023-11-26 11:47:18,605 INFO L72 ComplementDD]: Start complementDD. Operand 3 states and 124 transitions. [2023-11-26 11:47:18,605 INFO L73 IsDeterministic]: Start isDeterministic. Operand 3 states and 124 transitions. [2023-11-26 11:47:18,605 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2023-11-26 11:47:18,605 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 3 states and 124 transitions. [2023-11-26 11:47:18,606 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 4 states, 3 states have (on average 41.333333333333336) internal successors, (124), 3 states have internal predecessors, (124), 0 states have call successors, (0), 0 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:47:18,608 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 4 states, 4 states have (on average 57.0) internal successors, (228), 4 states have internal predecessors, (228), 0 states have call successors, (0), 0 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:47:18,608 INFO L81 ComplementDD]: Finished complementDD. Result has 4 states, 4 states have (on average 57.0) internal successors, (228), 4 states have internal predecessors, (228), 0 states have call successors, (0), 0 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:47:18,609 INFO L175 Difference]: Start difference. First operand has 56 places, 47 transitions, 104 flow. Second operand 3 states and 124 transitions. [2023-11-26 11:47:18,609 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 57 places, 54 transitions, 178 flow [2023-11-26 11:47:18,612 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 55 places, 54 transitions, 174 flow, removed 0 selfloop flow, removed 2 redundant places. [2023-11-26 11:47:18,614 INFO L231 Difference]: Finished difference. Result has 55 places, 46 transitions, 102 flow [2023-11-26 11:47:18,614 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=57, 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:47:18,617 INFO L281 CegarLoopForPetriNet]: 62 programPoint places, -7 predicate places. [2023-11-26 11:47:18,617 INFO L495 AbstractCegarLoop]: Abstraction has has 55 places, 46 transitions, 102 flow [2023-11-26 11:47:18,617 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 33.0) internal successors, (99), 3 states have internal predecessors, (99), 0 states have call successors, (0), 0 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:47:18,618 INFO L200 CegarLoopForPetriNet]: Found error trace [2023-11-26 11:47:18,618 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1] [2023-11-26 11:47:18,618 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable4 [2023-11-26 11:47:18,618 INFO L420 AbstractCegarLoop]: === Iteration 6 === Targeting ULTIMATE.startErr5REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [P2Err0ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 10 more)] === [2023-11-26 11:47:18,620 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-11-26 11:47:18,620 INFO L85 PathProgramCache]: Analyzing trace with hash 589955766, now seen corresponding path program 1 times [2023-11-26 11:47:18,620 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-11-26 11:47:18,620 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [550464227] [2023-11-26 11:47:18,621 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-11-26 11:47:18,621 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-11-26 11:47:18,645 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-26 11:47:18,761 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:47:18,762 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-11-26 11:47:18,762 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [550464227] [2023-11-26 11:47:18,762 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [550464227] provided 1 perfect and 0 imperfect interpolant sequences [2023-11-26 11:47:18,762 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-11-26 11:47:18,763 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2023-11-26 11:47:18,763 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [209367893] [2023-11-26 11:47:18,763 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-11-26 11:47:18,764 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2023-11-26 11:47:18,764 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-11-26 11:47:18,764 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2023-11-26 11:47:18,765 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2023-11-26 11:47:18,779 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 32 out of 57 [2023-11-26 11:47:18,780 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 55 places, 46 transitions, 102 flow. Second operand has 3 states, 3 states have (on average 34.0) internal successors, (102), 3 states have internal predecessors, (102), 0 states have call successors, (0), 0 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:47:18,780 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2023-11-26 11:47:18,780 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 32 of 57 [2023-11-26 11:47:18,780 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2023-11-26 11:47:19,044 INFO L124 PetriNetUnfolderBase]: 557/1119 cut-off events. [2023-11-26 11:47:19,044 INFO L125 PetriNetUnfolderBase]: For 40/40 co-relation queries the response was YES. [2023-11-26 11:47:19,047 INFO L83 FinitePrefix]: Finished finitePrefix Result has 2044 conditions, 1119 events. 557/1119 cut-off events. For 40/40 co-relation queries the response was YES. Maximal size of possible extension queue 123. Compared 8287 event pairs, 420 based on Foata normal form. 6/1060 useless extension candidates. Maximal degree in co-relation 2034. Up to 631 conditions per place. [2023-11-26 11:47:19,055 INFO L140 encePairwiseOnDemand]: 54/57 looper letters, 27 selfloop transitions, 2 changer transitions 0/53 dead transitions. [2023-11-26 11:47:19,056 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 56 places, 53 transitions, 174 flow [2023-11-26 11:47:19,056 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2023-11-26 11:47:19,056 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2023-11-26 11:47:19,057 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 126 transitions. [2023-11-26 11:47:19,057 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.7368421052631579 [2023-11-26 11:47:19,057 INFO L72 ComplementDD]: Start complementDD. Operand 3 states and 126 transitions. [2023-11-26 11:47:19,058 INFO L73 IsDeterministic]: Start isDeterministic. Operand 3 states and 126 transitions. [2023-11-26 11:47:19,058 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2023-11-26 11:47:19,058 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 3 states and 126 transitions. [2023-11-26 11:47:19,059 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 4 states, 3 states have (on average 42.0) internal successors, (126), 3 states have internal predecessors, (126), 0 states have call successors, (0), 0 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:47:19,060 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 4 states, 4 states have (on average 57.0) internal successors, (228), 4 states have internal predecessors, (228), 0 states have call successors, (0), 0 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:47:19,060 INFO L81 ComplementDD]: Finished complementDD. Result has 4 states, 4 states have (on average 57.0) internal successors, (228), 4 states have internal predecessors, (228), 0 states have call successors, (0), 0 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:47:19,060 INFO L175 Difference]: Start difference. First operand has 55 places, 46 transitions, 102 flow. Second operand 3 states and 126 transitions. [2023-11-26 11:47:19,060 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 56 places, 53 transitions, 174 flow [2023-11-26 11:47:19,063 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 54 places, 53 transitions, 170 flow, removed 0 selfloop flow, removed 2 redundant places. [2023-11-26 11:47:19,066 INFO L231 Difference]: Finished difference. Result has 54 places, 45 transitions, 100 flow [2023-11-26 11:47:19,066 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=57, 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:47:19,069 INFO L281 CegarLoopForPetriNet]: 62 programPoint places, -8 predicate places. [2023-11-26 11:47:19,070 INFO L495 AbstractCegarLoop]: Abstraction has has 54 places, 45 transitions, 100 flow [2023-11-26 11:47:19,070 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 34.0) internal successors, (102), 3 states have internal predecessors, (102), 0 states have call successors, (0), 0 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:47:19,070 INFO L200 CegarLoopForPetriNet]: Found error trace [2023-11-26 11:47:19,070 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-11-26 11:47:19,071 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable5 [2023-11-26 11:47:19,071 INFO L420 AbstractCegarLoop]: === Iteration 7 === Targeting P2Err0ASSERT_VIOLATIONMEMORY_LEAK === [P2Err0ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 10 more)] === [2023-11-26 11:47:19,071 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-11-26 11:47:19,071 INFO L85 PathProgramCache]: Analyzing trace with hash 366431690, now seen corresponding path program 1 times [2023-11-26 11:47:19,072 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-11-26 11:47:19,072 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2120490230] [2023-11-26 11:47:19,072 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-11-26 11:47:19,072 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-11-26 11:47:19,099 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-26 11:47:19,254 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:47:19,254 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-11-26 11:47:19,255 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2120490230] [2023-11-26 11:47:19,260 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2120490230] provided 1 perfect and 0 imperfect interpolant sequences [2023-11-26 11:47:19,260 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-11-26 11:47:19,260 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [1] imperfect sequences [] total 1 [2023-11-26 11:47:19,261 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1910347652] [2023-11-26 11:47:19,261 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-11-26 11:47:19,262 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2023-11-26 11:47:19,262 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-11-26 11:47:19,262 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2023-11-26 11:47:19,263 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2023-11-26 11:47:19,265 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 33 out of 57 [2023-11-26 11:47:19,265 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 54 places, 45 transitions, 100 flow. Second operand has 3 states, 3 states have (on average 35.333333333333336) internal successors, (106), 3 states have internal predecessors, (106), 0 states have call successors, (0), 0 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:47:19,266 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2023-11-26 11:47:19,266 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 33 of 57 [2023-11-26 11:47:19,266 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2023-11-26 11:47:19,513 INFO L124 PetriNetUnfolderBase]: 459/880 cut-off events. [2023-11-26 11:47:19,513 INFO L125 PetriNetUnfolderBase]: For 34/34 co-relation queries the response was YES. [2023-11-26 11:47:19,515 INFO L83 FinitePrefix]: Finished finitePrefix Result has 1653 conditions, 880 events. 459/880 cut-off events. For 34/34 co-relation queries the response was YES. Maximal size of possible extension queue 98. Compared 6213 event pairs, 67 based on Foata normal form. 0/870 useless extension candidates. Maximal degree in co-relation 1643. Up to 585 conditions per place. [2023-11-26 11:47:19,522 INFO L140 encePairwiseOnDemand]: 54/57 looper letters, 26 selfloop transitions, 2 changer transitions 2/54 dead transitions. [2023-11-26 11:47:19,522 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 55 places, 54 transitions, 180 flow [2023-11-26 11:47:19,523 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2023-11-26 11:47:19,523 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2023-11-26 11:47:19,524 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 130 transitions. [2023-11-26 11:47:19,524 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.7602339181286549 [2023-11-26 11:47:19,524 INFO L72 ComplementDD]: Start complementDD. Operand 3 states and 130 transitions. [2023-11-26 11:47:19,524 INFO L73 IsDeterministic]: Start isDeterministic. Operand 3 states and 130 transitions. [2023-11-26 11:47:19,525 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2023-11-26 11:47:19,525 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 3 states and 130 transitions. [2023-11-26 11:47:19,526 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 4 states, 3 states have (on average 43.333333333333336) internal successors, (130), 3 states have internal predecessors, (130), 0 states have call successors, (0), 0 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:47:19,527 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 4 states, 4 states have (on average 57.0) internal successors, (228), 4 states have internal predecessors, (228), 0 states have call successors, (0), 0 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:47:19,527 INFO L81 ComplementDD]: Finished complementDD. Result has 4 states, 4 states have (on average 57.0) internal successors, (228), 4 states have internal predecessors, (228), 0 states have call successors, (0), 0 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:47:19,527 INFO L175 Difference]: Start difference. First operand has 54 places, 45 transitions, 100 flow. Second operand 3 states and 130 transitions. [2023-11-26 11:47:19,528 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 55 places, 54 transitions, 180 flow [2023-11-26 11:47:19,528 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 53 places, 54 transitions, 174 flow, removed 0 selfloop flow, removed 2 redundant places. [2023-11-26 11:47:19,530 INFO L231 Difference]: Finished difference. Result has 53 places, 43 transitions, 96 flow [2023-11-26 11:47:19,530 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=57, 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:47:19,531 INFO L281 CegarLoopForPetriNet]: 62 programPoint places, -9 predicate places. [2023-11-26 11:47:19,531 INFO L495 AbstractCegarLoop]: Abstraction has has 53 places, 43 transitions, 96 flow [2023-11-26 11:47:19,532 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 35.333333333333336) internal successors, (106), 3 states have internal predecessors, (106), 0 states have call successors, (0), 0 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:47:19,532 INFO L200 CegarLoopForPetriNet]: Found error trace [2023-11-26 11:47:19,532 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:47:19,532 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable6 [2023-11-26 11:47:19,532 INFO L420 AbstractCegarLoop]: === Iteration 8 === Targeting ULTIMATE.startErr7ASSERT_VIOLATIONMEMORY_LEAK === [P2Err0ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 10 more)] === [2023-11-26 11:47:19,533 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-11-26 11:47:19,533 INFO L85 PathProgramCache]: Analyzing trace with hash -46083604, now seen corresponding path program 1 times [2023-11-26 11:47:19,533 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-11-26 11:47:19,534 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1066323317] [2023-11-26 11:47:19,534 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-11-26 11:47:19,534 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-11-26 11:47:19,573 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-26 11:47:20,042 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:47:20,043 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-11-26 11:47:20,043 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1066323317] [2023-11-26 11:47:20,043 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1066323317] provided 1 perfect and 0 imperfect interpolant sequences [2023-11-26 11:47:20,043 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-11-26 11:47:20,043 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2023-11-26 11:47:20,044 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1031875797] [2023-11-26 11:47:20,044 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-11-26 11:47:20,044 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 9 states [2023-11-26 11:47:20,045 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-11-26 11:47:20,045 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2023-11-26 11:47:20,045 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=17, Invalid=55, Unknown=0, NotChecked=0, Total=72 [2023-11-26 11:47:20,293 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 29 out of 57 [2023-11-26 11:47:20,293 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 53 places, 43 transitions, 96 flow. Second operand has 9 states, 9 states have (on average 30.666666666666668) internal successors, (276), 9 states have internal predecessors, (276), 0 states have call successors, (0), 0 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:47:20,294 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2023-11-26 11:47:20,294 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 29 of 57 [2023-11-26 11:47:20,294 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2023-11-26 11:47:20,926 INFO L124 PetriNetUnfolderBase]: 1007/1940 cut-off events. [2023-11-26 11:47:20,926 INFO L125 PetriNetUnfolderBase]: For 104/104 co-relation queries the response was YES. [2023-11-26 11:47:20,931 INFO L83 FinitePrefix]: Finished finitePrefix Result has 3639 conditions, 1940 events. 1007/1940 cut-off events. For 104/104 co-relation queries the response was YES. Maximal size of possible extension queue 213. Compared 15190 event pairs, 374 based on Foata normal form. 40/1964 useless extension candidates. Maximal degree in co-relation 3627. Up to 711 conditions per place. [2023-11-26 11:47:20,945 INFO L140 encePairwiseOnDemand]: 51/57 looper letters, 46 selfloop transitions, 5 changer transitions 10/81 dead transitions. [2023-11-26 11:47:20,945 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 58 places, 81 transitions, 304 flow [2023-11-26 11:47:20,946 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2023-11-26 11:47:20,946 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 7 states. [2023-11-26 11:47:20,947 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 7 states to 7 states and 265 transitions. [2023-11-26 11:47:20,947 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.6641604010025063 [2023-11-26 11:47:20,948 INFO L72 ComplementDD]: Start complementDD. Operand 7 states and 265 transitions. [2023-11-26 11:47:20,948 INFO L73 IsDeterministic]: Start isDeterministic. Operand 7 states and 265 transitions. [2023-11-26 11:47:20,948 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2023-11-26 11:47:20,948 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 7 states and 265 transitions. [2023-11-26 11:47:20,949 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 8 states, 7 states have (on average 37.857142857142854) internal successors, (265), 7 states have internal predecessors, (265), 0 states have call successors, (0), 0 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:47:20,951 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 8 states, 8 states have (on average 57.0) internal successors, (456), 8 states have internal predecessors, (456), 0 states have call successors, (0), 0 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:47:20,951 INFO L81 ComplementDD]: Finished complementDD. Result has 8 states, 8 states have (on average 57.0) internal successors, (456), 8 states have internal predecessors, (456), 0 states have call successors, (0), 0 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:47:20,951 INFO L175 Difference]: Start difference. First operand has 53 places, 43 transitions, 96 flow. Second operand 7 states and 265 transitions. [2023-11-26 11:47:20,951 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 58 places, 81 transitions, 304 flow [2023-11-26 11:47:20,953 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 56 places, 81 transitions, 294 flow, removed 0 selfloop flow, removed 2 redundant places. [2023-11-26 11:47:20,954 INFO L231 Difference]: Finished difference. Result has 60 places, 45 transitions, 120 flow [2023-11-26 11:47:20,954 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=57, PETRI_DIFFERENCE_MINUEND_FLOW=92, PETRI_DIFFERENCE_MINUEND_PLACES=50, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=43, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=3, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=39, PETRI_DIFFERENCE_SUBTRAHEND_STATES=7, PETRI_FLOW=120, PETRI_PLACES=60, PETRI_TRANSITIONS=45} [2023-11-26 11:47:20,957 INFO L281 CegarLoopForPetriNet]: 62 programPoint places, -2 predicate places. [2023-11-26 11:47:20,957 INFO L495 AbstractCegarLoop]: Abstraction has has 60 places, 45 transitions, 120 flow [2023-11-26 11:47:20,957 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 9 states, 9 states have (on average 30.666666666666668) internal successors, (276), 9 states have internal predecessors, (276), 0 states have call successors, (0), 0 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:47:20,957 INFO L200 CegarLoopForPetriNet]: Found error trace [2023-11-26 11:47:20,958 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:47:20,958 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable7 [2023-11-26 11:47:20,958 INFO L420 AbstractCegarLoop]: === Iteration 9 === Targeting ULTIMATE.startErr6ASSERT_VIOLATIONMEMORY_LEAK === [P2Err0ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 10 more)] === [2023-11-26 11:47:20,958 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-11-26 11:47:20,959 INFO L85 PathProgramCache]: Analyzing trace with hash -46082282, now seen corresponding path program 1 times [2023-11-26 11:47:20,959 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-11-26 11:47:20,959 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1376984205] [2023-11-26 11:47:20,959 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-11-26 11:47:20,959 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-11-26 11:47:21,003 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-26 11:47:21,241 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:47:21,242 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-11-26 11:47:21,242 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1376984205] [2023-11-26 11:47:21,242 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1376984205] provided 1 perfect and 0 imperfect interpolant sequences [2023-11-26 11:47:21,242 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-11-26 11:47:21,242 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2023-11-26 11:47:21,243 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [502046850] [2023-11-26 11:47:21,243 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-11-26 11:47:21,243 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2023-11-26 11:47:21,243 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-11-26 11:47:21,244 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2023-11-26 11:47:21,244 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2023-11-26 11:47:21,250 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 30 out of 57 [2023-11-26 11:47:21,250 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 60 places, 45 transitions, 120 flow. Second operand has 5 states, 5 states have (on average 32.4) internal successors, (162), 5 states have internal predecessors, (162), 0 states have call successors, (0), 0 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:47:21,251 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2023-11-26 11:47:21,251 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 30 of 57 [2023-11-26 11:47:21,251 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2023-11-26 11:47:21,798 INFO L124 PetriNetUnfolderBase]: 1271/2284 cut-off events. [2023-11-26 11:47:21,798 INFO L125 PetriNetUnfolderBase]: For 261/265 co-relation queries the response was YES. [2023-11-26 11:47:21,804 INFO L83 FinitePrefix]: Finished finitePrefix Result has 4544 conditions, 2284 events. 1271/2284 cut-off events. For 261/265 co-relation queries the response was YES. Maximal size of possible extension queue 279. Compared 17491 event pairs, 651 based on Foata normal form. 0/2201 useless extension candidates. Maximal degree in co-relation 4529. Up to 1359 conditions per place. [2023-11-26 11:47:21,862 INFO L140 encePairwiseOnDemand]: 50/57 looper letters, 35 selfloop transitions, 5 changer transitions 31/92 dead transitions. [2023-11-26 11:47:21,862 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 66 places, 92 transitions, 366 flow [2023-11-26 11:47:21,863 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2023-11-26 11:47:21,864 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 8 states. [2023-11-26 11:47:21,865 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 8 states to 8 states and 312 transitions. [2023-11-26 11:47:21,865 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.6842105263157895 [2023-11-26 11:47:21,865 INFO L72 ComplementDD]: Start complementDD. Operand 8 states and 312 transitions. [2023-11-26 11:47:21,865 INFO L73 IsDeterministic]: Start isDeterministic. Operand 8 states and 312 transitions. [2023-11-26 11:47:21,866 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2023-11-26 11:47:21,866 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 8 states and 312 transitions. [2023-11-26 11:47:21,867 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 9 states, 8 states have (on average 39.0) internal successors, (312), 8 states have internal predecessors, (312), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-26 11:47:21,868 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 9 states, 9 states have (on average 57.0) internal successors, (513), 9 states have internal predecessors, (513), 0 states have call successors, (0), 0 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:47:21,869 INFO L81 ComplementDD]: Finished complementDD. Result has 9 states, 9 states have (on average 57.0) internal successors, (513), 9 states have internal predecessors, (513), 0 states have call successors, (0), 0 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:47:21,869 INFO L175 Difference]: Start difference. First operand has 60 places, 45 transitions, 120 flow. Second operand 8 states and 312 transitions. [2023-11-26 11:47:21,869 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 66 places, 92 transitions, 366 flow [2023-11-26 11:47:21,871 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 63 places, 92 transitions, 360 flow, removed 1 selfloop flow, removed 3 redundant places. [2023-11-26 11:47:21,873 INFO L231 Difference]: Finished difference. Result has 68 places, 45 transitions, 137 flow [2023-11-26 11:47:21,873 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=57, PETRI_DIFFERENCE_MINUEND_FLOW=114, PETRI_DIFFERENCE_MINUEND_PLACES=56, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=45, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=5, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=40, PETRI_DIFFERENCE_SUBTRAHEND_STATES=8, PETRI_FLOW=137, PETRI_PLACES=68, PETRI_TRANSITIONS=45} [2023-11-26 11:47:21,873 INFO L281 CegarLoopForPetriNet]: 62 programPoint places, 6 predicate places. [2023-11-26 11:47:21,874 INFO L495 AbstractCegarLoop]: Abstraction has has 68 places, 45 transitions, 137 flow [2023-11-26 11:47:21,874 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 32.4) internal successors, (162), 5 states have internal predecessors, (162), 0 states have call successors, (0), 0 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:47:21,874 INFO L200 CegarLoopForPetriNet]: Found error trace [2023-11-26 11:47:21,874 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-11-26 11:47:21,874 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable8 [2023-11-26 11:47:21,875 INFO L420 AbstractCegarLoop]: === Iteration 10 === Targeting ULTIMATE.startErr6ASSERT_VIOLATIONMEMORY_LEAK === [P2Err0ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 10 more)] === [2023-11-26 11:47:21,875 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-11-26 11:47:21,875 INFO L85 PathProgramCache]: Analyzing trace with hash 361276898, now seen corresponding path program 1 times [2023-11-26 11:47:21,875 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-11-26 11:47:21,875 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [809276488] [2023-11-26 11:47:21,876 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-11-26 11:47:21,876 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-11-26 11:47:21,901 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-26 11:47:22,105 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:47:22,105 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-11-26 11:47:22,106 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [809276488] [2023-11-26 11:47:22,106 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [809276488] provided 1 perfect and 0 imperfect interpolant sequences [2023-11-26 11:47:22,106 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-11-26 11:47:22,106 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2023-11-26 11:47:22,106 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [434538778] [2023-11-26 11:47:22,106 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-11-26 11:47:22,107 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2023-11-26 11:47:22,107 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-11-26 11:47:22,107 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2023-11-26 11:47:22,108 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=10, Invalid=20, Unknown=0, NotChecked=0, Total=30 [2023-11-26 11:47:22,116 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 27 out of 57 [2023-11-26 11:47:22,117 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 68 places, 45 transitions, 137 flow. Second operand has 6 states, 6 states have (on average 29.166666666666668) internal successors, (175), 6 states have internal predecessors, (175), 0 states have call successors, (0), 0 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:47:22,117 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2023-11-26 11:47:22,117 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 27 of 57 [2023-11-26 11:47:22,117 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2023-11-26 11:47:23,267 INFO L124 PetriNetUnfolderBase]: 3527/6212 cut-off events. [2023-11-26 11:47:23,267 INFO L125 PetriNetUnfolderBase]: For 2198/2200 co-relation queries the response was YES. [2023-11-26 11:47:23,284 INFO L83 FinitePrefix]: Finished finitePrefix Result has 13462 conditions, 6212 events. 3527/6212 cut-off events. For 2198/2200 co-relation queries the response was YES. Maximal size of possible extension queue 373. Compared 46327 event pairs, 479 based on Foata normal form. 144/6309 useless extension candidates. Maximal degree in co-relation 13443. Up to 2962 conditions per place. [2023-11-26 11:47:23,320 INFO L140 encePairwiseOnDemand]: 50/57 looper letters, 83 selfloop transitions, 11 changer transitions 0/112 dead transitions. [2023-11-26 11:47:23,320 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 71 places, 112 transitions, 509 flow [2023-11-26 11:47:23,321 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2023-11-26 11:47:23,321 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 8 states. [2023-11-26 11:47:23,322 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 8 states to 8 states and 308 transitions. [2023-11-26 11:47:23,323 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.6754385964912281 [2023-11-26 11:47:23,323 INFO L72 ComplementDD]: Start complementDD. Operand 8 states and 308 transitions. [2023-11-26 11:47:23,323 INFO L73 IsDeterministic]: Start isDeterministic. Operand 8 states and 308 transitions. [2023-11-26 11:47:23,323 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2023-11-26 11:47:23,323 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 8 states and 308 transitions. [2023-11-26 11:47:23,325 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 9 states, 8 states have (on average 38.5) internal successors, (308), 8 states have internal predecessors, (308), 0 states have call successors, (0), 0 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:47:23,326 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 9 states, 9 states have (on average 57.0) internal successors, (513), 9 states have internal predecessors, (513), 0 states have call successors, (0), 0 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:47:23,326 INFO L81 ComplementDD]: Finished complementDD. Result has 9 states, 9 states have (on average 57.0) internal successors, (513), 9 states have internal predecessors, (513), 0 states have call successors, (0), 0 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:47:23,326 INFO L175 Difference]: Start difference. First operand has 68 places, 45 transitions, 137 flow. Second operand 8 states and 308 transitions. [2023-11-26 11:47:23,326 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 71 places, 112 transitions, 509 flow [2023-11-26 11:47:23,400 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 63 places, 112 transitions, 461 flow, removed 11 selfloop flow, removed 8 redundant places. [2023-11-26 11:47:23,402 INFO L231 Difference]: Finished difference. Result has 67 places, 53 transitions, 182 flow [2023-11-26 11:47:23,403 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=57, PETRI_DIFFERENCE_MINUEND_FLOW=115, PETRI_DIFFERENCE_MINUEND_PLACES=56, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=45, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=4, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=39, PETRI_DIFFERENCE_SUBTRAHEND_STATES=8, PETRI_FLOW=182, PETRI_PLACES=67, PETRI_TRANSITIONS=53} [2023-11-26 11:47:23,404 INFO L281 CegarLoopForPetriNet]: 62 programPoint places, 5 predicate places. [2023-11-26 11:47:23,404 INFO L495 AbstractCegarLoop]: Abstraction has has 67 places, 53 transitions, 182 flow [2023-11-26 11:47:23,404 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 29.166666666666668) internal successors, (175), 6 states have internal predecessors, (175), 0 states have call successors, (0), 0 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:47:23,404 INFO L200 CegarLoopForPetriNet]: Found error trace [2023-11-26 11:47:23,405 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-11-26 11:47:23,405 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable9 [2023-11-26 11:47:23,405 INFO L420 AbstractCegarLoop]: === Iteration 11 === Targeting ULTIMATE.startErr7ASSERT_VIOLATIONMEMORY_LEAK === [P2Err0ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 10 more)] === [2023-11-26 11:47:23,406 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-11-26 11:47:23,406 INFO L85 PathProgramCache]: Analyzing trace with hash -512786148, now seen corresponding path program 1 times [2023-11-26 11:47:23,406 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-11-26 11:47:23,408 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [299710436] [2023-11-26 11:47:23,408 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-11-26 11:47:23,409 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-11-26 11:47:23,452 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-26 11:47:23,966 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:47:23,967 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-11-26 11:47:23,967 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [299710436] [2023-11-26 11:47:23,967 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [299710436] provided 1 perfect and 0 imperfect interpolant sequences [2023-11-26 11:47:23,967 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-11-26 11:47:23,967 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2023-11-26 11:47:23,967 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1435516904] [2023-11-26 11:47:23,968 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-11-26 11:47:23,968 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 8 states [2023-11-26 11:47:23,968 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-11-26 11:47:23,969 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2023-11-26 11:47:23,969 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=14, Invalid=42, Unknown=0, NotChecked=0, Total=56 [2023-11-26 11:47:24,219 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 30 out of 57 [2023-11-26 11:47:24,219 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 67 places, 53 transitions, 182 flow. Second operand has 8 states, 8 states have (on average 31.75) internal successors, (254), 8 states have internal predecessors, (254), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-26 11:47:24,220 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2023-11-26 11:47:24,220 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 30 of 57 [2023-11-26 11:47:24,220 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2023-11-26 11:47:25,190 INFO L124 PetriNetUnfolderBase]: 2175/4617 cut-off events. [2023-11-26 11:47:25,190 INFO L125 PetriNetUnfolderBase]: For 1147/1147 co-relation queries the response was YES. [2023-11-26 11:47:25,207 INFO L83 FinitePrefix]: Finished finitePrefix Result has 9685 conditions, 4617 events. 2175/4617 cut-off events. For 1147/1147 co-relation queries the response was YES. Maximal size of possible extension queue 349. Compared 40347 event pairs, 855 based on Foata normal form. 75/4652 useless extension candidates. Maximal degree in co-relation 9667. Up to 1516 conditions per place. [2023-11-26 11:47:25,226 INFO L140 encePairwiseOnDemand]: 51/57 looper letters, 48 selfloop transitions, 7 changer transitions 16/94 dead transitions. [2023-11-26 11:47:25,226 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 73 places, 94 transitions, 438 flow [2023-11-26 11:47:25,226 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2023-11-26 11:47:25,227 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 7 states. [2023-11-26 11:47:25,228 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 7 states to 7 states and 275 transitions. [2023-11-26 11:47:25,228 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.6892230576441103 [2023-11-26 11:47:25,228 INFO L72 ComplementDD]: Start complementDD. Operand 7 states and 275 transitions. [2023-11-26 11:47:25,228 INFO L73 IsDeterministic]: Start isDeterministic. Operand 7 states and 275 transitions. [2023-11-26 11:47:25,229 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2023-11-26 11:47:25,229 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 7 states and 275 transitions. [2023-11-26 11:47:25,230 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 8 states, 7 states have (on average 39.285714285714285) internal successors, (275), 7 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:47:25,231 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 8 states, 8 states have (on average 57.0) internal successors, (456), 8 states have internal predecessors, (456), 0 states have call successors, (0), 0 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:47:25,231 INFO L81 ComplementDD]: Finished complementDD. Result has 8 states, 8 states have (on average 57.0) internal successors, (456), 8 states have internal predecessors, (456), 0 states have call successors, (0), 0 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:47:25,232 INFO L175 Difference]: Start difference. First operand has 67 places, 53 transitions, 182 flow. Second operand 7 states and 275 transitions. [2023-11-26 11:47:25,232 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 73 places, 94 transitions, 438 flow [2023-11-26 11:47:25,249 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 73 places, 94 transitions, 438 flow, removed 0 selfloop flow, removed 0 redundant places. [2023-11-26 11:47:25,251 INFO L231 Difference]: Finished difference. Result has 77 places, 51 transitions, 201 flow [2023-11-26 11:47:25,251 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=57, PETRI_DIFFERENCE_MINUEND_FLOW=182, PETRI_DIFFERENCE_MINUEND_PLACES=67, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=53, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=2, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=48, PETRI_DIFFERENCE_SUBTRAHEND_STATES=7, PETRI_FLOW=201, PETRI_PLACES=77, PETRI_TRANSITIONS=51} [2023-11-26 11:47:25,252 INFO L281 CegarLoopForPetriNet]: 62 programPoint places, 15 predicate places. [2023-11-26 11:47:25,252 INFO L495 AbstractCegarLoop]: Abstraction has has 77 places, 51 transitions, 201 flow [2023-11-26 11:47:25,252 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 8 states, 8 states have (on average 31.75) internal successors, (254), 8 states have internal predecessors, (254), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-26 11:47:25,252 INFO L200 CegarLoopForPetriNet]: Found error trace [2023-11-26 11:47:25,252 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] [2023-11-26 11:47:25,253 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable10 [2023-11-26 11:47:25,253 INFO L420 AbstractCegarLoop]: === Iteration 12 === Targeting ULTIMATE.startErr6ASSERT_VIOLATIONMEMORY_LEAK === [P2Err0ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 10 more)] === [2023-11-26 11:47:25,253 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-11-26 11:47:25,253 INFO L85 PathProgramCache]: Analyzing trace with hash 1351984096, now seen corresponding path program 1 times [2023-11-26 11:47:25,253 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-11-26 11:47:25,254 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [531053634] [2023-11-26 11:47:25,254 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-11-26 11:47:25,254 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-11-26 11:47:25,273 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-26 11:47:25,479 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:47:25,479 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-11-26 11:47:25,479 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [531053634] [2023-11-26 11:47:25,479 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [531053634] provided 1 perfect and 0 imperfect interpolant sequences [2023-11-26 11:47:25,480 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-11-26 11:47:25,480 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2023-11-26 11:47:25,480 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [771290186] [2023-11-26 11:47:25,480 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-11-26 11:47:25,480 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2023-11-26 11:47:25,481 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-11-26 11:47:25,481 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2023-11-26 11:47:25,481 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=10, Invalid=20, Unknown=0, NotChecked=0, Total=30 [2023-11-26 11:47:25,494 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 27 out of 57 [2023-11-26 11:47:25,494 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 77 places, 51 transitions, 201 flow. Second operand has 6 states, 6 states have (on average 29.333333333333332) internal successors, (176), 6 states have internal predecessors, (176), 0 states have call successors, (0), 0 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:47:25,494 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2023-11-26 11:47:25,494 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 27 of 57 [2023-11-26 11:47:25,494 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2023-11-26 11:47:26,970 INFO L124 PetriNetUnfolderBase]: 5183/8632 cut-off events. [2023-11-26 11:47:26,971 INFO L125 PetriNetUnfolderBase]: For 3538/3545 co-relation queries the response was YES. [2023-11-26 11:47:27,007 INFO L83 FinitePrefix]: Finished finitePrefix Result has 19752 conditions, 8632 events. 5183/8632 cut-off events. For 3538/3545 co-relation queries the response was YES. Maximal size of possible extension queue 550. Compared 65544 event pairs, 1125 based on Foata normal form. 216/8793 useless extension candidates. Maximal degree in co-relation 19728. Up to 3994 conditions per place. [2023-11-26 11:47:27,042 INFO L140 encePairwiseOnDemand]: 50/57 looper letters, 70 selfloop transitions, 11 changer transitions 2/101 dead transitions. [2023-11-26 11:47:27,043 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 80 places, 101 transitions, 511 flow [2023-11-26 11:47:27,043 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2023-11-26 11:47:27,043 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 8 states. [2023-11-26 11:47:27,044 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 8 states to 8 states and 292 transitions. [2023-11-26 11:47:27,045 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.6403508771929824 [2023-11-26 11:47:27,045 INFO L72 ComplementDD]: Start complementDD. Operand 8 states and 292 transitions. [2023-11-26 11:47:27,045 INFO L73 IsDeterministic]: Start isDeterministic. Operand 8 states and 292 transitions. [2023-11-26 11:47:27,045 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2023-11-26 11:47:27,046 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 8 states and 292 transitions. [2023-11-26 11:47:27,047 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 9 states, 8 states have (on average 36.5) internal successors, (292), 8 states have internal predecessors, (292), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-26 11:47:27,048 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 9 states, 9 states have (on average 57.0) internal successors, (513), 9 states have internal predecessors, (513), 0 states have call successors, (0), 0 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:47:27,048 INFO L81 ComplementDD]: Finished complementDD. Result has 9 states, 9 states have (on average 57.0) internal successors, (513), 9 states have internal predecessors, (513), 0 states have call successors, (0), 0 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:47:27,048 INFO L175 Difference]: Start difference. First operand has 77 places, 51 transitions, 201 flow. Second operand 8 states and 292 transitions. [2023-11-26 11:47:27,049 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 80 places, 101 transitions, 511 flow [2023-11-26 11:47:27,107 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 74 places, 101 transitions, 485 flow, removed 3 selfloop flow, removed 6 redundant places. [2023-11-26 11:47:27,110 INFO L231 Difference]: Finished difference. Result has 78 places, 58 transitions, 257 flow [2023-11-26 11:47:27,110 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=57, PETRI_DIFFERENCE_MINUEND_FLOW=184, PETRI_DIFFERENCE_MINUEND_PLACES=67, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=51, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=4, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=45, PETRI_DIFFERENCE_SUBTRAHEND_STATES=8, PETRI_FLOW=257, PETRI_PLACES=78, PETRI_TRANSITIONS=58} [2023-11-26 11:47:27,111 INFO L281 CegarLoopForPetriNet]: 62 programPoint places, 16 predicate places. [2023-11-26 11:47:27,111 INFO L495 AbstractCegarLoop]: Abstraction has has 78 places, 58 transitions, 257 flow [2023-11-26 11:47:27,111 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 29.333333333333332) internal successors, (176), 6 states have internal predecessors, (176), 0 states have call successors, (0), 0 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:47:27,111 INFO L200 CegarLoopForPetriNet]: Found error trace [2023-11-26 11:47:27,112 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] [2023-11-26 11:47:27,112 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable11 [2023-11-26 11:47:27,112 INFO L420 AbstractCegarLoop]: === Iteration 13 === Targeting ULTIMATE.startErr7ASSERT_VIOLATIONMEMORY_LEAK === [P2Err0ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 10 more)] === [2023-11-26 11:47:27,113 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-11-26 11:47:27,113 INFO L85 PathProgramCache]: Analyzing trace with hash -1020823282, now seen corresponding path program 1 times [2023-11-26 11:47:27,113 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-11-26 11:47:27,114 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2035748204] [2023-11-26 11:47:27,114 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-11-26 11:47:27,114 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-11-26 11:47:27,141 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-26 11:47:27,835 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:47:27,835 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-11-26 11:47:27,835 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2035748204] [2023-11-26 11:47:27,836 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2035748204] provided 1 perfect and 0 imperfect interpolant sequences [2023-11-26 11:47:27,836 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-11-26 11:47:27,836 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2023-11-26 11:47:27,836 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1221823382] [2023-11-26 11:47:27,836 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-11-26 11:47:27,837 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 8 states [2023-11-26 11:47:27,837 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-11-26 11:47:27,838 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2023-11-26 11:47:27,839 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=14, Invalid=42, Unknown=0, NotChecked=0, Total=56 [2023-11-26 11:47:28,038 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 31 out of 57 [2023-11-26 11:47:28,039 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 78 places, 58 transitions, 257 flow. Second operand has 8 states, 8 states have (on average 32.75) internal successors, (262), 8 states have internal predecessors, (262), 0 states have call successors, (0), 0 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:47:28,039 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2023-11-26 11:47:28,039 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 31 of 57 [2023-11-26 11:47:28,039 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2023-11-26 11:47:28,933 INFO L124 PetriNetUnfolderBase]: 1546/3199 cut-off events. [2023-11-26 11:47:28,933 INFO L125 PetriNetUnfolderBase]: For 1590/1592 co-relation queries the response was YES. [2023-11-26 11:47:28,944 INFO L83 FinitePrefix]: Finished finitePrefix Result has 7255 conditions, 3199 events. 1546/3199 cut-off events. For 1590/1592 co-relation queries the response was YES. Maximal size of possible extension queue 280. Compared 26796 event pairs, 442 based on Foata normal form. 48/3194 useless extension candidates. Maximal degree in co-relation 7230. Up to 1632 conditions per place. [2023-11-26 11:47:28,958 INFO L140 encePairwiseOnDemand]: 51/57 looper letters, 25 selfloop transitions, 8 changer transitions 15/74 dead transitions. [2023-11-26 11:47:28,958 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 82 places, 74 transitions, 385 flow [2023-11-26 11:47:28,959 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2023-11-26 11:47:28,959 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 7 states. [2023-11-26 11:47:28,960 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 7 states to 7 states and 257 transitions. [2023-11-26 11:47:28,960 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.6441102756892231 [2023-11-26 11:47:28,961 INFO L72 ComplementDD]: Start complementDD. Operand 7 states and 257 transitions. [2023-11-26 11:47:28,961 INFO L73 IsDeterministic]: Start isDeterministic. Operand 7 states and 257 transitions. [2023-11-26 11:47:28,961 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2023-11-26 11:47:28,961 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 7 states and 257 transitions. [2023-11-26 11:47:28,962 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 8 states, 7 states have (on average 36.714285714285715) internal successors, (257), 7 states have internal predecessors, (257), 0 states have call successors, (0), 0 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:47:28,963 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 8 states, 8 states have (on average 57.0) internal successors, (456), 8 states have internal predecessors, (456), 0 states have call successors, (0), 0 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:47:28,964 INFO L81 ComplementDD]: Finished complementDD. Result has 8 states, 8 states have (on average 57.0) internal successors, (456), 8 states have internal predecessors, (456), 0 states have call successors, (0), 0 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:47:28,964 INFO L175 Difference]: Start difference. First operand has 78 places, 58 transitions, 257 flow. Second operand 7 states and 257 transitions. [2023-11-26 11:47:28,964 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 82 places, 74 transitions, 385 flow [2023-11-26 11:47:28,980 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 80 places, 74 transitions, 366 flow, removed 3 selfloop flow, removed 2 redundant places. [2023-11-26 11:47:28,981 INFO L231 Difference]: Finished difference. Result has 80 places, 49 transitions, 201 flow [2023-11-26 11:47:28,982 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=57, PETRI_DIFFERENCE_MINUEND_FLOW=236, PETRI_DIFFERENCE_MINUEND_PLACES=74, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=57, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=8, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=49, PETRI_DIFFERENCE_SUBTRAHEND_STATES=7, PETRI_FLOW=201, PETRI_PLACES=80, PETRI_TRANSITIONS=49} [2023-11-26 11:47:28,983 INFO L281 CegarLoopForPetriNet]: 62 programPoint places, 18 predicate places. [2023-11-26 11:47:28,983 INFO L495 AbstractCegarLoop]: Abstraction has has 80 places, 49 transitions, 201 flow [2023-11-26 11:47:28,983 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 8 states, 8 states have (on average 32.75) internal successors, (262), 8 states have internal predecessors, (262), 0 states have call successors, (0), 0 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:47:28,983 INFO L200 CegarLoopForPetriNet]: Found error trace [2023-11-26 11:47:28,983 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] [2023-11-26 11:47:28,983 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable12 [2023-11-26 11:47:28,984 INFO L420 AbstractCegarLoop]: === Iteration 14 === Targeting ULTIMATE.startErr6ASSERT_VIOLATIONMEMORY_LEAK === [P2Err0ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 10 more)] === [2023-11-26 11:47:28,984 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-11-26 11:47:28,984 INFO L85 PathProgramCache]: Analyzing trace with hash 1340639519, now seen corresponding path program 1 times [2023-11-26 11:47:28,984 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-11-26 11:47:28,984 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [306117739] [2023-11-26 11:47:28,984 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-11-26 11:47:28,985 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-11-26 11:47:29,043 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-26 11:47:29,263 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:47:29,264 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-11-26 11:47:29,264 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [306117739] [2023-11-26 11:47:29,264 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [306117739] provided 1 perfect and 0 imperfect interpolant sequences [2023-11-26 11:47:29,264 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-11-26 11:47:29,264 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2023-11-26 11:47:29,264 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [330314223] [2023-11-26 11:47:29,265 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-11-26 11:47:29,265 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2023-11-26 11:47:29,265 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-11-26 11:47:29,266 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2023-11-26 11:47:29,266 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2023-11-26 11:47:29,277 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 29 out of 57 [2023-11-26 11:47:29,278 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 80 places, 49 transitions, 201 flow. Second operand has 4 states, 4 states have (on average 32.5) internal successors, (130), 4 states have internal predecessors, (130), 0 states have call successors, (0), 0 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:47:29,278 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2023-11-26 11:47:29,278 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 29 of 57 [2023-11-26 11:47:29,278 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2023-11-26 11:47:30,320 INFO L124 PetriNetUnfolderBase]: 3891/6793 cut-off events. [2023-11-26 11:47:30,320 INFO L125 PetriNetUnfolderBase]: For 2830/2831 co-relation queries the response was YES. [2023-11-26 11:47:30,348 INFO L83 FinitePrefix]: Finished finitePrefix Result has 15475 conditions, 6793 events. 3891/6793 cut-off events. For 2830/2831 co-relation queries the response was YES. Maximal size of possible extension queue 465. Compared 52213 event pairs, 420 based on Foata normal form. 288/7052 useless extension candidates. Maximal degree in co-relation 15450. Up to 3513 conditions per place. [2023-11-26 11:47:30,377 INFO L140 encePairwiseOnDemand]: 51/57 looper letters, 45 selfloop transitions, 5 changer transitions 1/74 dead transitions. [2023-11-26 11:47:30,377 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 78 places, 74 transitions, 395 flow [2023-11-26 11:47:30,378 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2023-11-26 11:47:30,378 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 4 states. [2023-11-26 11:47:30,378 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 163 transitions. [2023-11-26 11:47:30,379 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.7149122807017544 [2023-11-26 11:47:30,379 INFO L72 ComplementDD]: Start complementDD. Operand 4 states and 163 transitions. [2023-11-26 11:47:30,379 INFO L73 IsDeterministic]: Start isDeterministic. Operand 4 states and 163 transitions. [2023-11-26 11:47:30,379 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2023-11-26 11:47:30,379 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 4 states and 163 transitions. [2023-11-26 11:47:30,380 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 5 states, 4 states have (on average 40.75) internal successors, (163), 4 states have internal predecessors, (163), 0 states have call successors, (0), 0 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:47:30,381 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 5 states, 5 states have (on average 57.0) internal successors, (285), 5 states have internal predecessors, (285), 0 states have call successors, (0), 0 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:47:30,381 INFO L81 ComplementDD]: Finished complementDD. Result has 5 states, 5 states have (on average 57.0) internal successors, (285), 5 states have internal predecessors, (285), 0 states have call successors, (0), 0 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:47:30,381 INFO L175 Difference]: Start difference. First operand has 80 places, 49 transitions, 201 flow. Second operand 4 states and 163 transitions. [2023-11-26 11:47:30,382 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 78 places, 74 transitions, 395 flow [2023-11-26 11:47:30,414 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 69 places, 74 transitions, 359 flow, removed 2 selfloop flow, removed 9 redundant places. [2023-11-26 11:47:30,416 INFO L231 Difference]: Finished difference. Result has 71 places, 52 transitions, 211 flow [2023-11-26 11:47:30,416 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=57, PETRI_DIFFERENCE_MINUEND_FLOW=177, PETRI_DIFFERENCE_MINUEND_PLACES=66, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=49, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=2, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=44, PETRI_DIFFERENCE_SUBTRAHEND_STATES=4, PETRI_FLOW=211, PETRI_PLACES=71, PETRI_TRANSITIONS=52} [2023-11-26 11:47:30,417 INFO L281 CegarLoopForPetriNet]: 62 programPoint places, 9 predicate places. [2023-11-26 11:47:30,417 INFO L495 AbstractCegarLoop]: Abstraction has has 71 places, 52 transitions, 211 flow [2023-11-26 11:47:30,417 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 32.5) internal successors, (130), 4 states have internal predecessors, (130), 0 states have call successors, (0), 0 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:47:30,417 INFO L200 CegarLoopForPetriNet]: Found error trace [2023-11-26 11:47:30,418 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] [2023-11-26 11:47:30,418 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable13 [2023-11-26 11:47:30,418 INFO L420 AbstractCegarLoop]: === Iteration 15 === Targeting ULTIMATE.startErr6ASSERT_VIOLATIONMEMORY_LEAK === [P2Err0ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 10 more)] === [2023-11-26 11:47:30,418 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-11-26 11:47:30,418 INFO L85 PathProgramCache]: Analyzing trace with hash -1047853009, now seen corresponding path program 1 times [2023-11-26 11:47:30,419 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-11-26 11:47:30,419 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [379501345] [2023-11-26 11:47:30,419 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-11-26 11:47:30,419 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-11-26 11:47:30,452 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-26 11:47:30,624 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:47:30,624 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-11-26 11:47:30,625 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [379501345] [2023-11-26 11:47:30,625 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [379501345] provided 1 perfect and 0 imperfect interpolant sequences [2023-11-26 11:47:30,625 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-11-26 11:47:30,625 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2023-11-26 11:47:30,625 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [368992842] [2023-11-26 11:47:30,625 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-11-26 11:47:30,626 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2023-11-26 11:47:30,626 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-11-26 11:47:30,626 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2023-11-26 11:47:30,627 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=8, Invalid=12, Unknown=0, NotChecked=0, Total=20 [2023-11-26 11:47:30,631 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 29 out of 57 [2023-11-26 11:47:30,632 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 71 places, 52 transitions, 211 flow. Second operand has 5 states, 5 states have (on average 32.0) internal successors, (160), 5 states have internal predecessors, (160), 0 states have call successors, (0), 0 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:47:30,632 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2023-11-26 11:47:30,632 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 29 of 57 [2023-11-26 11:47:30,632 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2023-11-26 11:47:31,377 INFO L124 PetriNetUnfolderBase]: 2747/4840 cut-off events. [2023-11-26 11:47:31,378 INFO L125 PetriNetUnfolderBase]: For 2136/2163 co-relation queries the response was YES. [2023-11-26 11:47:31,396 INFO L83 FinitePrefix]: Finished finitePrefix Result has 12371 conditions, 4840 events. 2747/4840 cut-off events. For 2136/2163 co-relation queries the response was YES. Maximal size of possible extension queue 277. Compared 34256 event pairs, 162 based on Foata normal form. 258/5070 useless extension candidates. Maximal degree in co-relation 12349. Up to 1889 conditions per place. [2023-11-26 11:47:31,415 INFO L140 encePairwiseOnDemand]: 51/57 looper letters, 55 selfloop transitions, 8 changer transitions 1/87 dead transitions. [2023-11-26 11:47:31,415 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 75 places, 87 transitions, 464 flow [2023-11-26 11:47:31,415 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2023-11-26 11:47:31,416 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 5 states. [2023-11-26 11:47:31,416 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 205 transitions. [2023-11-26 11:47:31,417 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.7192982456140351 [2023-11-26 11:47:31,417 INFO L72 ComplementDD]: Start complementDD. Operand 5 states and 205 transitions. [2023-11-26 11:47:31,417 INFO L73 IsDeterministic]: Start isDeterministic. Operand 5 states and 205 transitions. [2023-11-26 11:47:31,417 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2023-11-26 11:47:31,417 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 5 states and 205 transitions. [2023-11-26 11:47:31,418 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 6 states, 5 states have (on average 41.0) internal successors, (205), 5 states have internal predecessors, (205), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-26 11:47:31,419 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 6 states, 6 states have (on average 57.0) internal successors, (342), 6 states have internal predecessors, (342), 0 states have call successors, (0), 0 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:47:31,419 INFO L81 ComplementDD]: Finished complementDD. Result has 6 states, 6 states have (on average 57.0) internal successors, (342), 6 states have internal predecessors, (342), 0 states have call successors, (0), 0 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:47:31,420 INFO L175 Difference]: Start difference. First operand has 71 places, 52 transitions, 211 flow. Second operand 5 states and 205 transitions. [2023-11-26 11:47:31,420 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 75 places, 87 transitions, 464 flow [2023-11-26 11:47:31,424 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 73 places, 87 transitions, 454 flow, removed 1 selfloop flow, removed 2 redundant places. [2023-11-26 11:47:31,426 INFO L231 Difference]: Finished difference. Result has 75 places, 55 transitions, 251 flow [2023-11-26 11:47:31,426 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=57, PETRI_DIFFERENCE_MINUEND_FLOW=203, PETRI_DIFFERENCE_MINUEND_PLACES=69, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=52, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=5, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=44, PETRI_DIFFERENCE_SUBTRAHEND_STATES=5, PETRI_FLOW=251, PETRI_PLACES=75, PETRI_TRANSITIONS=55} [2023-11-26 11:47:31,427 INFO L281 CegarLoopForPetriNet]: 62 programPoint places, 13 predicate places. [2023-11-26 11:47:31,427 INFO L495 AbstractCegarLoop]: Abstraction has has 75 places, 55 transitions, 251 flow [2023-11-26 11:47:31,427 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 32.0) internal successors, (160), 5 states have internal predecessors, (160), 0 states have call successors, (0), 0 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:47:31,427 INFO L200 CegarLoopForPetriNet]: Found error trace [2023-11-26 11:47:31,427 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] [2023-11-26 11:47:31,427 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable14 [2023-11-26 11:47:31,428 INFO L420 AbstractCegarLoop]: === Iteration 16 === Targeting ULTIMATE.startErr6ASSERT_VIOLATIONMEMORY_LEAK === [P2Err0ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 10 more)] === [2023-11-26 11:47:31,428 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-11-26 11:47:31,428 INFO L85 PathProgramCache]: Analyzing trace with hash 1491661768, now seen corresponding path program 1 times [2023-11-26 11:47:31,428 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-11-26 11:47:31,429 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1576217495] [2023-11-26 11:47:31,429 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-11-26 11:47:31,429 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-11-26 11:47:31,465 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-26 11:47:31,747 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:47:31,747 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-11-26 11:47:31,747 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1576217495] [2023-11-26 11:47:31,748 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1576217495] provided 1 perfect and 0 imperfect interpolant sequences [2023-11-26 11:47:31,748 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-11-26 11:47:31,748 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2023-11-26 11:47:31,748 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [745855699] [2023-11-26 11:47:31,748 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-11-26 11:47:31,749 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2023-11-26 11:47:31,749 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-11-26 11:47:31,749 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2023-11-26 11:47:31,750 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2023-11-26 11:47:31,774 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 26 out of 57 [2023-11-26 11:47:31,774 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 75 places, 55 transitions, 251 flow. Second operand has 6 states, 6 states have (on average 29.166666666666668) internal successors, (175), 6 states have internal predecessors, (175), 0 states have call successors, (0), 0 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:47:31,774 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2023-11-26 11:47:31,774 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 26 of 57 [2023-11-26 11:47:31,775 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2023-11-26 11:47:33,338 INFO L124 PetriNetUnfolderBase]: 5519/10047 cut-off events. [2023-11-26 11:47:33,339 INFO L125 PetriNetUnfolderBase]: For 4582/4819 co-relation queries the response was YES. [2023-11-26 11:47:33,369 INFO L83 FinitePrefix]: Finished finitePrefix Result has 25325 conditions, 10047 events. 5519/10047 cut-off events. For 4582/4819 co-relation queries the response was YES. Maximal size of possible extension queue 412. Compared 78880 event pairs, 2181 based on Foata normal form. 256/9969 useless extension candidates. Maximal degree in co-relation 25301. Up to 4352 conditions per place. [2023-11-26 11:47:33,406 INFO L140 encePairwiseOnDemand]: 45/57 looper letters, 64 selfloop transitions, 16 changer transitions 33/135 dead transitions. [2023-11-26 11:47:33,406 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 85 places, 135 transitions, 735 flow [2023-11-26 11:47:33,407 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 11 states. [2023-11-26 11:47:33,407 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 11 states. [2023-11-26 11:47:33,408 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 11 states to 11 states and 389 transitions. [2023-11-26 11:47:33,409 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.620414673046252 [2023-11-26 11:47:33,409 INFO L72 ComplementDD]: Start complementDD. Operand 11 states and 389 transitions. [2023-11-26 11:47:33,409 INFO L73 IsDeterministic]: Start isDeterministic. Operand 11 states and 389 transitions. [2023-11-26 11:47:33,409 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2023-11-26 11:47:33,410 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 11 states and 389 transitions. [2023-11-26 11:47:33,411 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 12 states, 11 states have (on average 35.36363636363637) internal successors, (389), 11 states have internal predecessors, (389), 0 states have call successors, (0), 0 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:47:33,412 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 12 states, 12 states have (on average 57.0) internal successors, (684), 12 states have internal predecessors, (684), 0 states have call successors, (0), 0 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:47:33,413 INFO L81 ComplementDD]: Finished complementDD. Result has 12 states, 12 states have (on average 57.0) internal successors, (684), 12 states have internal predecessors, (684), 0 states have call successors, (0), 0 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:47:33,413 INFO L175 Difference]: Start difference. First operand has 75 places, 55 transitions, 251 flow. Second operand 11 states and 389 transitions. [2023-11-26 11:47:33,413 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 85 places, 135 transitions, 735 flow [2023-11-26 11:47:33,440 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 81 places, 135 transitions, 709 flow, removed 6 selfloop flow, removed 4 redundant places. [2023-11-26 11:47:33,442 INFO L231 Difference]: Finished difference. Result has 89 places, 66 transitions, 368 flow [2023-11-26 11:47:33,442 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=57, PETRI_DIFFERENCE_MINUEND_FLOW=229, PETRI_DIFFERENCE_MINUEND_PLACES=71, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=55, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=5, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=43, PETRI_DIFFERENCE_SUBTRAHEND_STATES=11, PETRI_FLOW=368, PETRI_PLACES=89, PETRI_TRANSITIONS=66} [2023-11-26 11:47:33,443 INFO L281 CegarLoopForPetriNet]: 62 programPoint places, 27 predicate places. [2023-11-26 11:47:33,443 INFO L495 AbstractCegarLoop]: Abstraction has has 89 places, 66 transitions, 368 flow [2023-11-26 11:47:33,443 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 29.166666666666668) internal successors, (175), 6 states have internal predecessors, (175), 0 states have call successors, (0), 0 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:47:33,444 INFO L200 CegarLoopForPetriNet]: Found error trace [2023-11-26 11:47:33,444 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] [2023-11-26 11:47:33,444 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable15 [2023-11-26 11:47:33,444 INFO L420 AbstractCegarLoop]: === Iteration 17 === Targeting ULTIMATE.startErr6ASSERT_VIOLATIONMEMORY_LEAK === [P2Err0ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 10 more)] === [2023-11-26 11:47:33,445 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-11-26 11:47:33,445 INFO L85 PathProgramCache]: Analyzing trace with hash 1548492534, now seen corresponding path program 2 times [2023-11-26 11:47:33,445 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-11-26 11:47:33,445 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [76509476] [2023-11-26 11:47:33,445 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-11-26 11:47:33,445 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-11-26 11:47:33,480 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-26 11:47:33,705 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:47:33,705 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-11-26 11:47:33,705 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [76509476] [2023-11-26 11:47:33,706 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [76509476] provided 1 perfect and 0 imperfect interpolant sequences [2023-11-26 11:47:33,706 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-11-26 11:47:33,706 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2023-11-26 11:47:33,706 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [508318725] [2023-11-26 11:47:33,706 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-11-26 11:47:33,707 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2023-11-26 11:47:33,707 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-11-26 11:47:33,707 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2023-11-26 11:47:33,707 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=12, Invalid=18, Unknown=0, NotChecked=0, Total=30 [2023-11-26 11:47:33,719 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 29 out of 57 [2023-11-26 11:47:33,719 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 89 places, 66 transitions, 368 flow. Second operand has 6 states, 6 states have (on average 31.833333333333332) internal successors, (191), 6 states have internal predecessors, (191), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-26 11:47:33,719 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2023-11-26 11:47:33,720 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 29 of 57 [2023-11-26 11:47:33,720 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2023-11-26 11:47:35,017 INFO L124 PetriNetUnfolderBase]: 3877/6551 cut-off events. [2023-11-26 11:47:35,017 INFO L125 PetriNetUnfolderBase]: For 7408/7820 co-relation queries the response was YES. [2023-11-26 11:47:35,044 INFO L83 FinitePrefix]: Finished finitePrefix Result has 19522 conditions, 6551 events. 3877/6551 cut-off events. For 7408/7820 co-relation queries the response was YES. Maximal size of possible extension queue 374. Compared 44315 event pairs, 399 based on Foata normal form. 427/6797 useless extension candidates. Maximal degree in co-relation 19491. Up to 2584 conditions per place. [2023-11-26 11:47:35,074 INFO L140 encePairwiseOnDemand]: 51/57 looper letters, 57 selfloop transitions, 11 changer transitions 0/99 dead transitions. [2023-11-26 11:47:35,074 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 88 places, 99 transitions, 651 flow [2023-11-26 11:47:35,074 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2023-11-26 11:47:35,074 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 6 states. [2023-11-26 11:47:35,075 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6 states to 6 states and 231 transitions. [2023-11-26 11:47:35,076 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.6754385964912281 [2023-11-26 11:47:35,076 INFO L72 ComplementDD]: Start complementDD. Operand 6 states and 231 transitions. [2023-11-26 11:47:35,076 INFO L73 IsDeterministic]: Start isDeterministic. Operand 6 states and 231 transitions. [2023-11-26 11:47:35,077 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2023-11-26 11:47:35,077 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 6 states and 231 transitions. [2023-11-26 11:47:35,078 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 7 states, 6 states have (on average 38.5) internal successors, (231), 6 states have internal predecessors, (231), 0 states have call successors, (0), 0 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:47:35,079 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 7 states, 7 states have (on average 57.0) internal successors, (399), 7 states have internal predecessors, (399), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-26 11:47:35,080 INFO L81 ComplementDD]: Finished complementDD. Result has 7 states, 7 states have (on average 57.0) internal successors, (399), 7 states have internal predecessors, (399), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-26 11:47:35,080 INFO L175 Difference]: Start difference. First operand has 89 places, 66 transitions, 368 flow. Second operand 6 states and 231 transitions. [2023-11-26 11:47:35,080 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 88 places, 99 transitions, 651 flow [2023-11-26 11:47:35,092 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 80 places, 99 transitions, 594 flow, removed 9 selfloop flow, removed 8 redundant places. [2023-11-26 11:47:35,095 INFO L231 Difference]: Finished difference. Result has 82 places, 67 transitions, 364 flow [2023-11-26 11:47:35,095 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=57, PETRI_DIFFERENCE_MINUEND_FLOW=323, PETRI_DIFFERENCE_MINUEND_PLACES=75, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=66, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=10, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=55, PETRI_DIFFERENCE_SUBTRAHEND_STATES=6, PETRI_FLOW=364, PETRI_PLACES=82, PETRI_TRANSITIONS=67} [2023-11-26 11:47:35,096 INFO L281 CegarLoopForPetriNet]: 62 programPoint places, 20 predicate places. [2023-11-26 11:47:35,096 INFO L495 AbstractCegarLoop]: Abstraction has has 82 places, 67 transitions, 364 flow [2023-11-26 11:47:35,096 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 31.833333333333332) internal successors, (191), 6 states have internal predecessors, (191), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-26 11:47:35,096 INFO L200 CegarLoopForPetriNet]: Found error trace [2023-11-26 11:47:35,097 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, 1, 1] [2023-11-26 11:47:35,097 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable16 [2023-11-26 11:47:35,097 INFO L420 AbstractCegarLoop]: === Iteration 18 === Targeting ULTIMATE.startErr6ASSERT_VIOLATIONMEMORY_LEAK === [P2Err0ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 10 more)] === [2023-11-26 11:47:35,098 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-11-26 11:47:35,098 INFO L85 PathProgramCache]: Analyzing trace with hash -693071313, now seen corresponding path program 1 times [2023-11-26 11:47:35,098 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-11-26 11:47:35,098 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1046943269] [2023-11-26 11:47:35,098 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-11-26 11:47:35,099 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-11-26 11:47:35,138 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-26 11:47:35,966 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:47:35,966 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-11-26 11:47:35,966 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1046943269] [2023-11-26 11:47:35,966 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1046943269] provided 1 perfect and 0 imperfect interpolant sequences [2023-11-26 11:47:35,967 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-11-26 11:47:35,967 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2023-11-26 11:47:35,967 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [79990806] [2023-11-26 11:47:35,967 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-11-26 11:47:35,967 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 9 states [2023-11-26 11:47:35,968 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-11-26 11:47:35,968 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2023-11-26 11:47:35,969 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=18, Invalid=54, Unknown=0, NotChecked=0, Total=72 [2023-11-26 11:47:35,984 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 26 out of 57 [2023-11-26 11:47:35,985 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 82 places, 67 transitions, 364 flow. Second operand has 9 states, 9 states have (on average 28.333333333333332) internal successors, (255), 9 states have internal predecessors, (255), 0 states have call successors, (0), 0 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:47:35,985 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2023-11-26 11:47:35,985 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 26 of 57 [2023-11-26 11:47:35,985 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2023-11-26 11:47:37,289 INFO L124 PetriNetUnfolderBase]: 4018/7556 cut-off events. [2023-11-26 11:47:37,290 INFO L125 PetriNetUnfolderBase]: For 8101/8248 co-relation queries the response was YES. [2023-11-26 11:47:37,329 INFO L83 FinitePrefix]: Finished finitePrefix Result has 22089 conditions, 7556 events. 4018/7556 cut-off events. For 8101/8248 co-relation queries the response was YES. Maximal size of possible extension queue 529. Compared 58880 event pairs, 646 based on Foata normal form. 75/7315 useless extension candidates. Maximal degree in co-relation 22062. Up to 3386 conditions per place. [2023-11-26 11:47:37,369 INFO L140 encePairwiseOnDemand]: 44/57 looper letters, 68 selfloop transitions, 40 changer transitions 26/158 dead transitions. [2023-11-26 11:47:37,377 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 95 places, 158 transitions, 1065 flow [2023-11-26 11:47:37,378 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 14 states. [2023-11-26 11:47:37,378 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 14 states. [2023-11-26 11:47:37,380 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 14 states to 14 states and 468 transitions. [2023-11-26 11:47:37,380 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.5864661654135338 [2023-11-26 11:47:37,381 INFO L72 ComplementDD]: Start complementDD. Operand 14 states and 468 transitions. [2023-11-26 11:47:37,381 INFO L73 IsDeterministic]: Start isDeterministic. Operand 14 states and 468 transitions. [2023-11-26 11:47:37,381 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2023-11-26 11:47:37,382 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 14 states and 468 transitions. [2023-11-26 11:47:37,385 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 15 states, 14 states have (on average 33.42857142857143) internal successors, (468), 14 states have internal predecessors, (468), 0 states have call successors, (0), 0 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:47:37,388 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 15 states, 15 states have (on average 57.0) internal successors, (855), 15 states have internal predecessors, (855), 0 states have call successors, (0), 0 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:47:37,389 INFO L81 ComplementDD]: Finished complementDD. Result has 15 states, 15 states have (on average 57.0) internal successors, (855), 15 states have internal predecessors, (855), 0 states have call successors, (0), 0 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:47:37,389 INFO L175 Difference]: Start difference. First operand has 82 places, 67 transitions, 364 flow. Second operand 14 states and 468 transitions. [2023-11-26 11:47:37,389 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 95 places, 158 transitions, 1065 flow [2023-11-26 11:47:37,460 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 90 places, 158 transitions, 1009 flow, removed 22 selfloop flow, removed 5 redundant places. [2023-11-26 11:47:37,463 INFO L231 Difference]: Finished difference. Result has 95 places, 98 transitions, 669 flow [2023-11-26 11:47:37,464 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=57, PETRI_DIFFERENCE_MINUEND_FLOW=332, PETRI_DIFFERENCE_MINUEND_PLACES=77, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=67, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=13, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=47, PETRI_DIFFERENCE_SUBTRAHEND_STATES=14, PETRI_FLOW=669, PETRI_PLACES=95, PETRI_TRANSITIONS=98} [2023-11-26 11:47:37,464 INFO L281 CegarLoopForPetriNet]: 62 programPoint places, 33 predicate places. [2023-11-26 11:47:37,464 INFO L495 AbstractCegarLoop]: Abstraction has has 95 places, 98 transitions, 669 flow [2023-11-26 11:47:37,465 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 9 states, 9 states have (on average 28.333333333333332) internal successors, (255), 9 states have internal predecessors, (255), 0 states have call successors, (0), 0 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:47:37,465 INFO L200 CegarLoopForPetriNet]: Found error trace [2023-11-26 11:47:37,465 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, 1, 1] [2023-11-26 11:47:37,465 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable17 [2023-11-26 11:47:37,465 INFO L420 AbstractCegarLoop]: === Iteration 19 === Targeting ULTIMATE.startErr6ASSERT_VIOLATIONMEMORY_LEAK === [P2Err0ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 10 more)] === [2023-11-26 11:47:37,466 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-11-26 11:47:37,466 INFO L85 PathProgramCache]: Analyzing trace with hash -309751345, now seen corresponding path program 2 times [2023-11-26 11:47:37,466 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-11-26 11:47:37,466 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [738196555] [2023-11-26 11:47:37,466 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-11-26 11:47:37,467 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-11-26 11:47:37,498 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-26 11:47:37,825 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:47:37,825 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-11-26 11:47:37,826 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [738196555] [2023-11-26 11:47:37,826 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [738196555] provided 1 perfect and 0 imperfect interpolant sequences [2023-11-26 11:47:37,826 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-11-26 11:47:37,826 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2023-11-26 11:47:37,826 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [265532181] [2023-11-26 11:47:37,826 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-11-26 11:47:37,828 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2023-11-26 11:47:37,828 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-11-26 11:47:37,828 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2023-11-26 11:47:37,829 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2023-11-26 11:47:37,834 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 29 out of 57 [2023-11-26 11:47:37,835 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 95 places, 98 transitions, 669 flow. Second operand has 6 states, 6 states have (on average 32.0) internal successors, (192), 6 states have internal predecessors, (192), 0 states have call successors, (0), 0 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:47:37,835 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2023-11-26 11:47:37,835 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 29 of 57 [2023-11-26 11:47:37,835 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2023-11-26 11:47:38,997 INFO L124 PetriNetUnfolderBase]: 3569/7356 cut-off events. [2023-11-26 11:47:38,997 INFO L125 PetriNetUnfolderBase]: For 7991/8270 co-relation queries the response was YES. [2023-11-26 11:47:39,030 INFO L83 FinitePrefix]: Finished finitePrefix Result has 21509 conditions, 7356 events. 3569/7356 cut-off events. For 7991/8270 co-relation queries the response was YES. Maximal size of possible extension queue 537. Compared 64158 event pairs, 1282 based on Foata normal form. 80/6942 useless extension candidates. Maximal degree in co-relation 21479. Up to 2483 conditions per place. [2023-11-26 11:47:39,038 INFO L140 encePairwiseOnDemand]: 52/57 looper letters, 28 selfloop transitions, 1 changer transitions 65/126 dead transitions. [2023-11-26 11:47:39,038 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 94 places, 126 transitions, 929 flow [2023-11-26 11:47:39,039 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2023-11-26 11:47:39,039 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 6 states. [2023-11-26 11:47:39,041 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6 states to 6 states and 224 transitions. [2023-11-26 11:47:39,041 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.6549707602339181 [2023-11-26 11:47:39,042 INFO L72 ComplementDD]: Start complementDD. Operand 6 states and 224 transitions. [2023-11-26 11:47:39,042 INFO L73 IsDeterministic]: Start isDeterministic. Operand 6 states and 224 transitions. [2023-11-26 11:47:39,042 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2023-11-26 11:47:39,042 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 6 states and 224 transitions. [2023-11-26 11:47:39,043 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 7 states, 6 states have (on average 37.333333333333336) internal successors, (224), 6 states have internal predecessors, (224), 0 states have call successors, (0), 0 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:47:39,044 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 7 states, 7 states have (on average 57.0) internal successors, (399), 7 states have internal predecessors, (399), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-26 11:47:39,045 INFO L81 ComplementDD]: Finished complementDD. Result has 7 states, 7 states have (on average 57.0) internal successors, (399), 7 states have internal predecessors, (399), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-26 11:47:39,045 INFO L175 Difference]: Start difference. First operand has 95 places, 98 transitions, 669 flow. Second operand 6 states and 224 transitions. [2023-11-26 11:47:39,045 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 94 places, 126 transitions, 929 flow [2023-11-26 11:47:39,163 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 90 places, 126 transitions, 905 flow, removed 7 selfloop flow, removed 4 redundant places. [2023-11-26 11:47:39,166 INFO L231 Difference]: Finished difference. Result has 93 places, 58 transitions, 305 flow [2023-11-26 11:47:39,166 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=57, PETRI_DIFFERENCE_MINUEND_FLOW=651, PETRI_DIFFERENCE_MINUEND_PLACES=85, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=98, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=1, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=97, PETRI_DIFFERENCE_SUBTRAHEND_STATES=6, PETRI_FLOW=305, PETRI_PLACES=93, PETRI_TRANSITIONS=58} [2023-11-26 11:47:39,166 INFO L281 CegarLoopForPetriNet]: 62 programPoint places, 31 predicate places. [2023-11-26 11:47:39,167 INFO L495 AbstractCegarLoop]: Abstraction has has 93 places, 58 transitions, 305 flow [2023-11-26 11:47:39,167 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 32.0) internal successors, (192), 6 states have internal predecessors, (192), 0 states have call successors, (0), 0 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:47:39,167 INFO L200 CegarLoopForPetriNet]: Found error trace [2023-11-26 11:47:39,167 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, 1, 1] [2023-11-26 11:47:39,167 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable18 [2023-11-26 11:47:39,168 INFO L420 AbstractCegarLoop]: === Iteration 20 === Targeting ULTIMATE.startErr6ASSERT_VIOLATIONMEMORY_LEAK === [P2Err0ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 10 more)] === [2023-11-26 11:47:39,168 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-11-26 11:47:39,168 INFO L85 PathProgramCache]: Analyzing trace with hash -1506353087, now seen corresponding path program 3 times [2023-11-26 11:47:39,168 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-11-26 11:47:39,168 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [559619223] [2023-11-26 11:47:39,169 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-11-26 11:47:39,169 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-11-26 11:47:39,207 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-26 11:47:41,006 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:47:41,007 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-11-26 11:47:41,007 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [559619223] [2023-11-26 11:47:41,007 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [559619223] provided 1 perfect and 0 imperfect interpolant sequences [2023-11-26 11:47:41,007 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-11-26 11:47:41,007 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [9] imperfect sequences [] total 9 [2023-11-26 11:47:41,007 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1911535934] [2023-11-26 11:47:41,007 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-11-26 11:47:41,008 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 10 states [2023-11-26 11:47:41,008 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-11-26 11:47:41,009 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2023-11-26 11:47:41,009 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=19, Invalid=71, Unknown=0, NotChecked=0, Total=90 [2023-11-26 11:47:41,013 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 31 out of 57 [2023-11-26 11:47:41,014 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 93 places, 58 transitions, 305 flow. Second operand has 10 states, 10 states have (on average 32.6) internal successors, (326), 10 states have internal predecessors, (326), 0 states have call successors, (0), 0 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:47:41,014 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2023-11-26 11:47:41,014 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 31 of 57 [2023-11-26 11:47:41,014 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2023-11-26 11:47:41,866 INFO L124 PetriNetUnfolderBase]: 1147/2486 cut-off events. [2023-11-26 11:47:41,866 INFO L125 PetriNetUnfolderBase]: For 1797/1847 co-relation queries the response was YES. [2023-11-26 11:47:41,879 INFO L83 FinitePrefix]: Finished finitePrefix Result has 6370 conditions, 2486 events. 1147/2486 cut-off events. For 1797/1847 co-relation queries the response was YES. Maximal size of possible extension queue 154. Compared 17581 event pairs, 356 based on Foata normal form. 31/2294 useless extension candidates. Maximal degree in co-relation 6340. Up to 644 conditions per place. [2023-11-26 11:47:41,883 INFO L140 encePairwiseOnDemand]: 49/57 looper letters, 22 selfloop transitions, 8 changer transitions 28/92 dead transitions. [2023-11-26 11:47:41,884 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 95 places, 92 transitions, 547 flow [2023-11-26 11:47:41,884 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 11 states. [2023-11-26 11:47:41,885 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 11 states. [2023-11-26 11:47:41,885 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 11 states to 11 states and 393 transitions. [2023-11-26 11:47:41,886 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.6267942583732058 [2023-11-26 11:47:41,886 INFO L72 ComplementDD]: Start complementDD. Operand 11 states and 393 transitions. [2023-11-26 11:47:41,886 INFO L73 IsDeterministic]: Start isDeterministic. Operand 11 states and 393 transitions. [2023-11-26 11:47:41,887 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2023-11-26 11:47:41,887 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 11 states and 393 transitions. [2023-11-26 11:47:41,888 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 12 states, 11 states have (on average 35.72727272727273) internal successors, (393), 11 states have internal predecessors, (393), 0 states have call successors, (0), 0 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:47:41,890 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 12 states, 12 states have (on average 57.0) internal successors, (684), 12 states have internal predecessors, (684), 0 states have call successors, (0), 0 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:47:41,890 INFO L81 ComplementDD]: Finished complementDD. Result has 12 states, 12 states have (on average 57.0) internal successors, (684), 12 states have internal predecessors, (684), 0 states have call successors, (0), 0 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:47:41,891 INFO L175 Difference]: Start difference. First operand has 93 places, 58 transitions, 305 flow. Second operand 11 states and 393 transitions. [2023-11-26 11:47:41,891 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 95 places, 92 transitions, 547 flow [2023-11-26 11:47:41,907 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 85 places, 92 transitions, 498 flow, removed 16 selfloop flow, removed 10 redundant places. [2023-11-26 11:47:41,909 INFO L231 Difference]: Finished difference. Result has 91 places, 59 transitions, 326 flow [2023-11-26 11:47:41,910 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=57, PETRI_DIFFERENCE_MINUEND_FLOW=277, PETRI_DIFFERENCE_MINUEND_PLACES=75, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=58, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=7, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=50, PETRI_DIFFERENCE_SUBTRAHEND_STATES=11, PETRI_FLOW=326, PETRI_PLACES=91, PETRI_TRANSITIONS=59} [2023-11-26 11:47:41,910 INFO L281 CegarLoopForPetriNet]: 62 programPoint places, 29 predicate places. [2023-11-26 11:47:41,910 INFO L495 AbstractCegarLoop]: Abstraction has has 91 places, 59 transitions, 326 flow [2023-11-26 11:47:41,911 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 10 states, 10 states have (on average 32.6) internal successors, (326), 10 states have internal predecessors, (326), 0 states have call successors, (0), 0 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:47:41,911 INFO L200 CegarLoopForPetriNet]: Found error trace [2023-11-26 11:47:41,911 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, 1, 1] [2023-11-26 11:47:41,911 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable19 [2023-11-26 11:47:41,912 INFO L420 AbstractCegarLoop]: === Iteration 21 === Targeting ULTIMATE.startErr6ASSERT_VIOLATIONMEMORY_LEAK === [P2Err0ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 10 more)] === [2023-11-26 11:47:41,912 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-11-26 11:47:41,912 INFO L85 PathProgramCache]: Analyzing trace with hash -514736321, now seen corresponding path program 4 times [2023-11-26 11:47:41,912 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-11-26 11:47:41,913 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1493515926] [2023-11-26 11:47:41,913 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-11-26 11:47:41,913 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-11-26 11:47:41,942 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-26 11:47:42,471 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:47:42,471 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-11-26 11:47:42,471 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1493515926] [2023-11-26 11:47:42,471 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1493515926] provided 1 perfect and 0 imperfect interpolant sequences [2023-11-26 11:47:42,471 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-11-26 11:47:42,472 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [9] imperfect sequences [] total 9 [2023-11-26 11:47:42,472 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1626028581] [2023-11-26 11:47:42,472 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-11-26 11:47:42,472 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 10 states [2023-11-26 11:47:42,473 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-11-26 11:47:42,473 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2023-11-26 11:47:42,473 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=21, Invalid=69, Unknown=0, NotChecked=0, Total=90 [2023-11-26 11:47:42,494 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 26 out of 57 [2023-11-26 11:47:42,495 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 91 places, 59 transitions, 326 flow. Second operand has 10 states, 10 states have (on average 28.1) internal successors, (281), 10 states have internal predecessors, (281), 0 states have call successors, (0), 0 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:47:42,495 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2023-11-26 11:47:42,495 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 26 of 57 [2023-11-26 11:47:42,495 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2023-11-26 11:47:43,254 INFO L124 PetriNetUnfolderBase]: 1425/3010 cut-off events. [2023-11-26 11:47:43,254 INFO L125 PetriNetUnfolderBase]: For 2733/2869 co-relation queries the response was YES. [2023-11-26 11:47:43,266 INFO L83 FinitePrefix]: Finished finitePrefix Result has 8058 conditions, 3010 events. 1425/3010 cut-off events. For 2733/2869 co-relation queries the response was YES. Maximal size of possible extension queue 217. Compared 22371 event pairs, 406 based on Foata normal form. 20/2812 useless extension candidates. Maximal degree in co-relation 8028. Up to 1138 conditions per place. [2023-11-26 11:47:43,269 INFO L140 encePairwiseOnDemand]: 48/57 looper letters, 24 selfloop transitions, 4 changer transitions 50/101 dead transitions. [2023-11-26 11:47:43,269 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 100 places, 101 transitions, 667 flow [2023-11-26 11:47:43,270 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 14 states. [2023-11-26 11:47:43,270 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 14 states. [2023-11-26 11:47:43,271 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 14 states to 14 states and 439 transitions. [2023-11-26 11:47:43,271 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.550125313283208 [2023-11-26 11:47:43,271 INFO L72 ComplementDD]: Start complementDD. Operand 14 states and 439 transitions. [2023-11-26 11:47:43,271 INFO L73 IsDeterministic]: Start isDeterministic. Operand 14 states and 439 transitions. [2023-11-26 11:47:43,272 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2023-11-26 11:47:43,272 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 14 states and 439 transitions. [2023-11-26 11:47:43,273 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 15 states, 14 states have (on average 31.357142857142858) internal successors, (439), 14 states have internal predecessors, (439), 0 states have call successors, (0), 0 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:47:43,275 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 15 states, 15 states have (on average 57.0) internal successors, (855), 15 states have internal predecessors, (855), 0 states have call successors, (0), 0 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:47:43,276 INFO L81 ComplementDD]: Finished complementDD. Result has 15 states, 15 states have (on average 57.0) internal successors, (855), 15 states have internal predecessors, (855), 0 states have call successors, (0), 0 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:47:43,276 INFO L175 Difference]: Start difference. First operand has 91 places, 59 transitions, 326 flow. Second operand 14 states and 439 transitions. [2023-11-26 11:47:43,276 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 100 places, 101 transitions, 667 flow [2023-11-26 11:47:43,295 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 94 places, 101 transitions, 640 flow, removed 3 selfloop flow, removed 6 redundant places. [2023-11-26 11:47:43,297 INFO L231 Difference]: Finished difference. Result has 97 places, 47 transitions, 221 flow [2023-11-26 11:47:43,297 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=57, PETRI_DIFFERENCE_MINUEND_FLOW=309, PETRI_DIFFERENCE_MINUEND_PLACES=81, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=59, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=4, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=55, PETRI_DIFFERENCE_SUBTRAHEND_STATES=14, PETRI_FLOW=221, PETRI_PLACES=97, PETRI_TRANSITIONS=47} [2023-11-26 11:47:43,297 INFO L281 CegarLoopForPetriNet]: 62 programPoint places, 35 predicate places. [2023-11-26 11:47:43,298 INFO L495 AbstractCegarLoop]: Abstraction has has 97 places, 47 transitions, 221 flow [2023-11-26 11:47:43,298 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 10 states, 10 states have (on average 28.1) internal successors, (281), 10 states have internal predecessors, (281), 0 states have call successors, (0), 0 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:47:43,298 INFO L200 CegarLoopForPetriNet]: Found error trace [2023-11-26 11:47:43,299 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, 1, 1] [2023-11-26 11:47:43,299 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable20 [2023-11-26 11:47:43,299 INFO L420 AbstractCegarLoop]: === Iteration 22 === Targeting ULTIMATE.startErr6ASSERT_VIOLATIONMEMORY_LEAK === [P2Err0ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 10 more)] === [2023-11-26 11:47:43,299 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-11-26 11:47:43,299 INFO L85 PathProgramCache]: Analyzing trace with hash -1843964569, now seen corresponding path program 5 times [2023-11-26 11:47:43,300 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-11-26 11:47:43,300 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1997752846] [2023-11-26 11:47:43,300 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-11-26 11:47:43,300 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-11-26 11:47:43,348 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2023-11-26 11:47:43,348 INFO L356 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2023-11-26 11:47:43,391 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2023-11-26 11:47:43,442 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2023-11-26 11:47:43,442 INFO L360 BasicCegarLoop]: Counterexample is feasible [2023-11-26 11:47:43,443 INFO L805 garLoopResultBuilder]: Registering result UNSAFE for location ULTIMATE.startErr6ASSERT_VIOLATIONMEMORY_LEAK (12 of 13 remaining) [2023-11-26 11:47:43,445 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location P2Err0ASSERT_VIOLATIONMEMORY_LEAK (11 of 13 remaining) [2023-11-26 11:47:43,446 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE (10 of 13 remaining) [2023-11-26 11:47:43,446 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE (9 of 13 remaining) [2023-11-26 11:47:43,446 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (8 of 13 remaining) [2023-11-26 11:47:43,446 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr3REQUIRES_VIOLATIONMEMORY_DEREFERENCE (7 of 13 remaining) [2023-11-26 11:47:43,446 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr4REQUIRES_VIOLATIONMEMORY_DEREFERENCE (6 of 13 remaining) [2023-11-26 11:47:43,447 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr5REQUIRES_VIOLATIONMEMORY_DEREFERENCE (5 of 13 remaining) [2023-11-26 11:47:43,447 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr7ASSERT_VIOLATIONMEMORY_LEAK (4 of 13 remaining) [2023-11-26 11:47:43,447 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (3 of 13 remaining) [2023-11-26 11:47:43,447 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (2 of 13 remaining) [2023-11-26 11:47:43,447 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr2INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (1 of 13 remaining) [2023-11-26 11:47:43,448 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location P2Err0ASSERT_VIOLATIONMEMORY_LEAK (0 of 13 remaining) [2023-11-26 11:47:43,448 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable21 [2023-11-26 11:47:43,448 INFO L445 BasicCegarLoop]: Path program histogram: [5, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-11-26 11:47:43,457 INFO L228 ceAbstractionStarter]: Analysis of concurrent program completed with 1 thread instances [2023-11-26 11:47:43,457 INFO L178 ceAbstractionStarter]: Computing trace abstraction results [2023-11-26 11:47:43,539 WARN L1572 BoogieBacktranslator]: Unfinished Backtranslation: IdentifierExpression #t~pre7 could not be translated [2023-11-26 11:47:43,541 WARN L1572 BoogieBacktranslator]: Unfinished Backtranslation: IdentifierExpression #t~pre9 could not be translated [2023-11-26 11:47:43,545 WARN L1572 BoogieBacktranslator]: Unfinished Backtranslation: IdentifierExpression #t~pre11 could not be translated [2023-11-26 11:47:43,573 WARN L1572 BoogieBacktranslator]: Unfinished Backtranslation: unknown boogie variable #t~nondet0 [2023-11-26 11:47:43,575 WARN L1572 BoogieBacktranslator]: Unfinished Backtranslation: unknown boogie variable #t~nondet0 [2023-11-26 11:47:43,594 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 26.11 11:47:43 BasicIcfg [2023-11-26 11:47:43,594 INFO L131 PluginConnector]: ------------------------ END TraceAbstraction---------------------------- [2023-11-26 11:47:43,595 INFO L112 PluginConnector]: ------------------------Witness Printer---------------------------- [2023-11-26 11:47:43,595 INFO L270 PluginConnector]: Initializing Witness Printer... [2023-11-26 11:47:43,595 INFO L274 PluginConnector]: Witness Printer initialized [2023-11-26 11:47:43,596 INFO L184 PluginConnector]: Executing the observer RCFGCatcher from plugin Witness Printer for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 26.11 11:47:15" (3/4) ... [2023-11-26 11:47:43,597 INFO L140 WitnessPrinter]: No result that supports witness generation found [2023-11-26 11:47:43,599 INFO L131 PluginConnector]: ------------------------ END Witness Printer---------------------------- [2023-11-26 11:47:43,599 INFO L158 Benchmark]: Toolchain (without parser) took 29835.65ms. Allocated memory was 176.2MB in the beginning and 1.1GB in the end (delta: 943.7MB). Free memory was 136.6MB in the beginning and 906.9MB in the end (delta: -770.3MB). Peak memory consumption was 173.1MB. Max. memory is 16.1GB. [2023-11-26 11:47:43,600 INFO L158 Benchmark]: CDTParser took 0.22ms. Allocated memory is still 107.0MB. Free memory is still 78.9MB. There was no memory consumed. Max. memory is 16.1GB. [2023-11-26 11:47:43,600 INFO L158 Benchmark]: CACSL2BoogieTranslator took 841.51ms. Allocated memory is still 176.2MB. Free memory was 136.3MB in the beginning and 135.6MB in the end (delta: 653.9kB). Peak memory consumption was 16.8MB. Max. memory is 16.1GB. [2023-11-26 11:47:43,600 INFO L158 Benchmark]: Boogie Procedure Inliner took 62.66ms. Allocated memory is still 176.2MB. Free memory was 135.6MB in the beginning and 132.4MB in the end (delta: 3.2MB). Peak memory consumption was 2.1MB. Max. memory is 16.1GB. [2023-11-26 11:47:43,601 INFO L158 Benchmark]: Boogie Preprocessor took 61.08ms. Allocated memory is still 176.2MB. Free memory was 132.4MB in the beginning and 128.5MB in the end (delta: 4.0MB). Peak memory consumption was 4.2MB. Max. memory is 16.1GB. [2023-11-26 11:47:43,601 INFO L158 Benchmark]: RCFGBuilder took 903.24ms. Allocated memory is still 176.2MB. Free memory was 128.5MB in the beginning and 75.7MB in the end (delta: 52.8MB). Peak memory consumption was 52.4MB. Max. memory is 16.1GB. [2023-11-26 11:47:43,601 INFO L158 Benchmark]: TraceAbstraction took 27954.37ms. Allocated memory was 176.2MB in the beginning and 1.1GB in the end (delta: 943.7MB). Free memory was 74.8MB in the beginning and 906.9MB in the end (delta: -832.1MB). Peak memory consumption was 112.5MB. Max. memory is 16.1GB. [2023-11-26 11:47:43,602 INFO L158 Benchmark]: Witness Printer took 3.79ms. Allocated memory is still 1.1GB. Free memory is still 906.9MB. There was no memory consumed. Max. memory is 16.1GB. [2023-11-26 11:47:43,603 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.22ms. Allocated memory is still 107.0MB. Free memory is still 78.9MB. There was no memory consumed. Max. memory is 16.1GB. * CACSL2BoogieTranslator took 841.51ms. Allocated memory is still 176.2MB. Free memory was 136.3MB in the beginning and 135.6MB in the end (delta: 653.9kB). Peak memory consumption was 16.8MB. Max. memory is 16.1GB. * Boogie Procedure Inliner took 62.66ms. Allocated memory is still 176.2MB. Free memory was 135.6MB in the beginning and 132.4MB in the end (delta: 3.2MB). Peak memory consumption was 2.1MB. Max. memory is 16.1GB. * Boogie Preprocessor took 61.08ms. Allocated memory is still 176.2MB. Free memory was 132.4MB in the beginning and 128.5MB in the end (delta: 4.0MB). Peak memory consumption was 4.2MB. Max. memory is 16.1GB. * RCFGBuilder took 903.24ms. Allocated memory is still 176.2MB. Free memory was 128.5MB in the beginning and 75.7MB in the end (delta: 52.8MB). Peak memory consumption was 52.4MB. Max. memory is 16.1GB. * TraceAbstraction took 27954.37ms. Allocated memory was 176.2MB in the beginning and 1.1GB in the end (delta: 943.7MB). Free memory was 74.8MB in the beginning and 906.9MB in the end (delta: -832.1MB). Peak memory consumption was 112.5MB. Max. memory is 16.1GB. * Witness Printer took 3.79ms. Allocated memory is still 1.1GB. Free memory is still 906.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~pre7 could not be translated - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: IdentifierExpression #t~pre9 could not be translated - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: IdentifierExpression #t~pre11 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_p0_EAX = 0; [L713] 0 int __unbuffered_p0_EBX = 0; [L715] 0 int __unbuffered_p1_EAX = 0; [L717] 0 int __unbuffered_p1_EBX = 0; [L719] 0 int __unbuffered_p2_EAX = 0; [L721] 0 int __unbuffered_p2_EBX = 0; [L723] 0 int a = 0; [L724] 0 _Bool main$tmp_guard0; [L725] 0 _Bool main$tmp_guard1; [L727] 0 int x = 0; [L729] 0 int y = 0; [L731] 0 int z = 0; [L732] 0 _Bool z$flush_delayed; [L733] 0 int z$mem_tmp; [L734] 0 _Bool z$r_buff0_thd0; [L735] 0 _Bool z$r_buff0_thd1; [L736] 0 _Bool z$r_buff0_thd2; [L737] 0 _Bool z$r_buff0_thd3; [L738] 0 _Bool z$r_buff1_thd0; [L739] 0 _Bool z$r_buff1_thd1; [L740] 0 _Bool z$r_buff1_thd2; [L741] 0 _Bool z$r_buff1_thd3; [L742] 0 _Bool z$read_delayed; [L743] 0 int *z$read_delayed_var; [L744] 0 int z$w_buff0; [L745] 0 _Bool z$w_buff0_used; [L746] 0 int z$w_buff1; [L747] 0 _Bool z$w_buff1_used; [L748] 0 _Bool weak$$choice0; [L749] 0 _Bool weak$$choice2; [L858] 0 pthread_t t41; [L859] FCALL, FORK 0 pthread_create(&t41, ((void *)0), P0, ((void *)0)) VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=0, __unbuffered_p0_EBX=0, __unbuffered_p1_EAX=0, __unbuffered_p1_EBX=0, __unbuffered_p2_EAX=0, __unbuffered_p2_EBX=0, a=0, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, t41={5:0}, weak$$choice0=0, weak$$choice2=0, x=0, y=0, z$flush_delayed=0, z$mem_tmp=0, z$r_buff0_thd0=0, z$r_buff0_thd1=0, z$r_buff0_thd2=0, z$r_buff0_thd3=0, z$r_buff1_thd0=0, z$r_buff1_thd1=0, z$r_buff1_thd2=0, z$r_buff1_thd3=0, z$read_delayed=0, z$read_delayed_var={0:0}, z$w_buff0=0, z$w_buff0_used=0, z$w_buff1=0, z$w_buff1_used=0, z=0] [L860] 0 pthread_t t42; [L861] FCALL, FORK 0 pthread_create(&t42, ((void *)0), P1, ((void *)0)) VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=0, __unbuffered_p0_EBX=0, __unbuffered_p1_EAX=0, __unbuffered_p1_EBX=0, __unbuffered_p2_EAX=0, __unbuffered_p2_EBX=0, a=0, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, t41={5:0}, t42={6:0}, weak$$choice0=0, weak$$choice2=0, x=0, y=0, z$flush_delayed=0, z$mem_tmp=0, z$r_buff0_thd0=0, z$r_buff0_thd1=0, z$r_buff0_thd2=0, z$r_buff0_thd3=0, z$r_buff1_thd0=0, z$r_buff1_thd1=0, z$r_buff1_thd2=0, z$r_buff1_thd3=0, z$read_delayed=0, z$read_delayed_var={0:0}, z$w_buff0=0, z$w_buff0_used=0, z$w_buff1=0, z$w_buff1_used=0, z=0] [L862] 0 pthread_t t43; [L863] FCALL, FORK 0 pthread_create(&t43, ((void *)0), P2, ((void *)0)) VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=0, __unbuffered_p0_EBX=0, __unbuffered_p1_EAX=0, __unbuffered_p1_EBX=0, __unbuffered_p2_EAX=0, __unbuffered_p2_EBX=0, a=0, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, t41={5:0}, t42={6:0}, t43={3:0}, weak$$choice0=0, weak$$choice2=0, x=0, y=0, z$flush_delayed=0, z$mem_tmp=0, z$r_buff0_thd0=0, z$r_buff0_thd1=0, z$r_buff0_thd2=0, z$r_buff0_thd3=0, z$r_buff1_thd0=0, z$r_buff1_thd1=0, z$r_buff1_thd2=0, z$r_buff1_thd3=0, z$read_delayed=0, z$read_delayed_var={0:0}, z$w_buff0=0, z$w_buff0_used=0, z$w_buff1=0, z$w_buff1_used=0, z=0] [L805] 3 z$w_buff1 = z$w_buff0 [L806] 3 z$w_buff0 = 1 [L807] 3 z$w_buff1_used = z$w_buff0_used [L808] 3 z$w_buff0_used = (_Bool)1 [L809] CALL 3 __VERIFIER_assert(!(z$w_buff1_used && z$w_buff0_used)) [L18] COND FALSE 3 !(!expression) [L809] RET 3 __VERIFIER_assert(!(z$w_buff1_used && z$w_buff0_used)) [L810] 3 z$r_buff1_thd0 = z$r_buff0_thd0 [L811] 3 z$r_buff1_thd1 = z$r_buff0_thd1 [L812] 3 z$r_buff1_thd2 = z$r_buff0_thd2 [L813] 3 z$r_buff1_thd3 = z$r_buff0_thd3 [L814] 3 z$r_buff0_thd3 = (_Bool)1 VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=0, __unbuffered_p0_EBX=0, __unbuffered_p1_EAX=0, __unbuffered_p1_EBX=0, __unbuffered_p2_EAX=0, __unbuffered_p2_EBX=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$flush_delayed=0, z$mem_tmp=0, z$r_buff0_thd0=0, z$r_buff0_thd1=0, z$r_buff0_thd2=0, z$r_buff0_thd3=1, z$r_buff1_thd0=0, z$r_buff1_thd1=0, z$r_buff1_thd2=0, z$r_buff1_thd3=0, z$read_delayed=0, z$read_delayed_var={0:0}, z$w_buff0=1, z$w_buff0_used=1, z$w_buff1=0, z$w_buff1_used=0, z=0] [L817] 3 weak$$choice0 = __VERIFIER_nondet_bool() [L818] 3 weak$$choice2 = __VERIFIER_nondet_bool() [L819] 3 z$flush_delayed = weak$$choice2 [L820] 3 z$mem_tmp = z [L821] 3 z = !z$w_buff0_used || !z$r_buff0_thd3 && !z$w_buff1_used || !z$r_buff0_thd3 && !z$r_buff1_thd3 ? z : (z$w_buff0_used && z$r_buff0_thd3 ? z$w_buff0 : z$w_buff1) [L822] 3 z$w_buff0 = weak$$choice2 ? z$w_buff0 : (!z$w_buff0_used || !z$r_buff0_thd3 && !z$w_buff1_used || !z$r_buff0_thd3 && !z$r_buff1_thd3 ? z$w_buff0 : (z$w_buff0_used && z$r_buff0_thd3 ? z$w_buff0 : z$w_buff0)) [L823] 3 z$w_buff1 = weak$$choice2 ? z$w_buff1 : (!z$w_buff0_used || !z$r_buff0_thd3 && !z$w_buff1_used || !z$r_buff0_thd3 && !z$r_buff1_thd3 ? z$w_buff1 : (z$w_buff0_used && z$r_buff0_thd3 ? z$w_buff1 : z$w_buff1)) [L824] 3 z$w_buff0_used = weak$$choice2 ? z$w_buff0_used : (!z$w_buff0_used || !z$r_buff0_thd3 && !z$w_buff1_used || !z$r_buff0_thd3 && !z$r_buff1_thd3 ? z$w_buff0_used : (z$w_buff0_used && z$r_buff0_thd3 ? (_Bool)0 : z$w_buff0_used)) [L825] 3 z$w_buff1_used = weak$$choice2 ? z$w_buff1_used : (!z$w_buff0_used || !z$r_buff0_thd3 && !z$w_buff1_used || !z$r_buff0_thd3 && !z$r_buff1_thd3 ? z$w_buff1_used : (z$w_buff0_used && z$r_buff0_thd3 ? (_Bool)0 : (_Bool)0)) [L826] 3 z$r_buff0_thd3 = weak$$choice2 ? z$r_buff0_thd3 : (!z$w_buff0_used || !z$r_buff0_thd3 && !z$w_buff1_used || !z$r_buff0_thd3 && !z$r_buff1_thd3 ? z$r_buff0_thd3 : (z$w_buff0_used && z$r_buff0_thd3 ? (_Bool)0 : z$r_buff0_thd3)) [L827] 3 z$r_buff1_thd3 = weak$$choice2 ? z$r_buff1_thd3 : (!z$w_buff0_used || !z$r_buff0_thd3 && !z$w_buff1_used || !z$r_buff0_thd3 && !z$r_buff1_thd3 ? z$r_buff1_thd3 : (z$w_buff0_used && z$r_buff0_thd3 ? (_Bool)0 : (_Bool)0)) [L828] 3 __unbuffered_p2_EAX = z [L829] 3 z = z$flush_delayed ? z$mem_tmp : z [L830] 3 z$flush_delayed = (_Bool)0 VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=0, __unbuffered_p0_EBX=0, __unbuffered_p1_EAX=0, __unbuffered_p1_EBX=0, __unbuffered_p2_EAX=1, __unbuffered_p2_EBX=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=1, x=0, y=0, z$flush_delayed=0, z$mem_tmp=0, z$r_buff0_thd0=0, z$r_buff0_thd1=0, z$r_buff0_thd2=0, z$r_buff0_thd3=1, z$r_buff1_thd0=0, z$r_buff1_thd1=0, z$r_buff1_thd2=0, z$r_buff1_thd3=0, z$read_delayed=0, z$read_delayed_var={0:0}, z$w_buff0=1, z$w_buff0_used=1, z$w_buff1=0, z$w_buff1_used=0, z=0] [L833] 3 __unbuffered_p2_EBX = a VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=0, __unbuffered_p0_EBX=0, __unbuffered_p1_EAX=0, __unbuffered_p1_EBX=0, __unbuffered_p2_EAX=1, __unbuffered_p2_EBX=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=1, x=0, y=0, z$flush_delayed=0, z$mem_tmp=0, z$r_buff0_thd0=0, z$r_buff0_thd1=0, z$r_buff0_thd2=0, z$r_buff0_thd3=1, z$r_buff1_thd0=0, z$r_buff1_thd1=0, z$r_buff1_thd2=0, z$r_buff1_thd3=0, z$read_delayed=0, z$read_delayed_var={0:0}, z$w_buff0=1, z$w_buff0_used=1, z$w_buff1=0, z$w_buff1_used=0, z=0] [L753] 1 a = 1 VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=0, __unbuffered_p0_EBX=0, __unbuffered_p1_EAX=0, __unbuffered_p1_EBX=0, __unbuffered_p2_EAX=1, __unbuffered_p2_EBX=0, a=1, arg={0:0}, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice2=1, x=0, y=0, z$flush_delayed=0, z$mem_tmp=0, z$r_buff0_thd0=0, z$r_buff0_thd1=0, z$r_buff0_thd2=0, z$r_buff0_thd3=1, z$r_buff1_thd0=0, z$r_buff1_thd1=0, z$r_buff1_thd2=0, z$r_buff1_thd3=0, z$read_delayed=0, z$read_delayed_var={0:0}, z$w_buff0=1, z$w_buff0_used=1, z$w_buff1=0, z$w_buff1_used=0, z=0] [L756] 1 x = 1 VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=0, __unbuffered_p0_EBX=0, __unbuffered_p1_EAX=0, __unbuffered_p1_EBX=0, __unbuffered_p2_EAX=1, __unbuffered_p2_EBX=0, a=1, arg={0:0}, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice2=1, x=1, y=0, z$flush_delayed=0, z$mem_tmp=0, z$r_buff0_thd0=0, z$r_buff0_thd1=0, z$r_buff0_thd2=0, z$r_buff0_thd3=1, z$r_buff1_thd0=0, z$r_buff1_thd1=0, z$r_buff1_thd2=0, z$r_buff1_thd3=0, z$read_delayed=0, z$read_delayed_var={0:0}, z$w_buff0=1, z$w_buff0_used=1, z$w_buff1=0, z$w_buff1_used=0, z=0] [L759] 1 __unbuffered_p0_EAX = x VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=1, __unbuffered_p0_EBX=0, __unbuffered_p1_EAX=0, __unbuffered_p1_EBX=0, __unbuffered_p2_EAX=1, __unbuffered_p2_EBX=0, a=1, arg={0:0}, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice2=1, x=1, y=0, z$flush_delayed=0, z$mem_tmp=0, z$r_buff0_thd0=0, z$r_buff0_thd1=0, z$r_buff0_thd2=0, z$r_buff0_thd3=1, z$r_buff1_thd0=0, z$r_buff1_thd1=0, z$r_buff1_thd2=0, z$r_buff1_thd3=0, z$read_delayed=0, z$read_delayed_var={0:0}, z$w_buff0=1, z$w_buff0_used=1, z$w_buff1=0, z$w_buff1_used=0, z=0] [L762] 1 __unbuffered_p0_EBX = y VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=1, __unbuffered_p0_EBX=0, __unbuffered_p1_EAX=0, __unbuffered_p1_EBX=0, __unbuffered_p2_EAX=1, __unbuffered_p2_EBX=0, a=1, arg={0:0}, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice2=1, x=1, y=0, z$flush_delayed=0, z$mem_tmp=0, z$r_buff0_thd0=0, z$r_buff0_thd1=0, z$r_buff0_thd2=0, z$r_buff0_thd3=1, z$r_buff1_thd0=0, z$r_buff1_thd1=0, z$r_buff1_thd2=0, z$r_buff1_thd3=0, z$read_delayed=0, z$read_delayed_var={0:0}, z$w_buff0=1, z$w_buff0_used=1, z$w_buff1=0, z$w_buff1_used=0, z=0] [L774] 2 y = 1 VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=1, __unbuffered_p0_EBX=0, __unbuffered_p1_EAX=0, __unbuffered_p1_EBX=0, __unbuffered_p2_EAX=1, __unbuffered_p2_EBX=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=1, x=1, y=1, z$flush_delayed=0, z$mem_tmp=0, z$r_buff0_thd0=0, z$r_buff0_thd1=0, z$r_buff0_thd2=0, z$r_buff0_thd3=1, z$r_buff1_thd0=0, z$r_buff1_thd1=0, z$r_buff1_thd2=0, z$r_buff1_thd3=0, z$read_delayed=0, z$read_delayed_var={0:0}, z$w_buff0=1, z$w_buff0_used=1, z$w_buff1=0, z$w_buff1_used=0, z=0] [L777] 2 __unbuffered_p1_EAX = y VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=1, __unbuffered_p0_EBX=0, __unbuffered_p1_EAX=1, __unbuffered_p1_EBX=0, __unbuffered_p2_EAX=1, __unbuffered_p2_EBX=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=1, x=1, y=1, z$flush_delayed=0, z$mem_tmp=0, z$r_buff0_thd0=0, z$r_buff0_thd1=0, z$r_buff0_thd2=0, z$r_buff0_thd3=1, z$r_buff1_thd0=0, z$r_buff1_thd1=0, z$r_buff1_thd2=0, z$r_buff1_thd3=0, z$read_delayed=0, z$read_delayed_var={0:0}, z$w_buff0=1, z$w_buff0_used=1, z$w_buff1=0, z$w_buff1_used=0, z=0] [L780] 2 weak$$choice0 = __VERIFIER_nondet_bool() [L781] 2 weak$$choice2 = __VERIFIER_nondet_bool() [L782] 2 z$flush_delayed = weak$$choice2 [L783] 2 z$mem_tmp = z [L784] 2 z = !z$w_buff0_used || !z$r_buff0_thd2 && !z$w_buff1_used || !z$r_buff0_thd2 && !z$r_buff1_thd2 ? z : (z$w_buff0_used && z$r_buff0_thd2 ? z$w_buff0 : z$w_buff1) [L785] 2 z$w_buff0 = weak$$choice2 ? z$w_buff0 : (!z$w_buff0_used || !z$r_buff0_thd2 && !z$w_buff1_used || !z$r_buff0_thd2 && !z$r_buff1_thd2 ? z$w_buff0 : (z$w_buff0_used && z$r_buff0_thd2 ? z$w_buff0 : z$w_buff0)) [L786] 2 z$w_buff1 = weak$$choice2 ? z$w_buff1 : (!z$w_buff0_used || !z$r_buff0_thd2 && !z$w_buff1_used || !z$r_buff0_thd2 && !z$r_buff1_thd2 ? z$w_buff1 : (z$w_buff0_used && z$r_buff0_thd2 ? z$w_buff1 : z$w_buff1)) [L787] 2 z$w_buff0_used = weak$$choice2 ? z$w_buff0_used : (!z$w_buff0_used || !z$r_buff0_thd2 && !z$w_buff1_used || !z$r_buff0_thd2 && !z$r_buff1_thd2 ? z$w_buff0_used : (z$w_buff0_used && z$r_buff0_thd2 ? (_Bool)0 : z$w_buff0_used)) [L788] 2 z$w_buff1_used = weak$$choice2 ? z$w_buff1_used : (!z$w_buff0_used || !z$r_buff0_thd2 && !z$w_buff1_used || !z$r_buff0_thd2 && !z$r_buff1_thd2 ? z$w_buff1_used : (z$w_buff0_used && z$r_buff0_thd2 ? (_Bool)0 : (_Bool)0)) [L789] 2 z$r_buff0_thd2 = weak$$choice2 ? z$r_buff0_thd2 : (!z$w_buff0_used || !z$r_buff0_thd2 && !z$w_buff1_used || !z$r_buff0_thd2 && !z$r_buff1_thd2 ? z$r_buff0_thd2 : (z$w_buff0_used && z$r_buff0_thd2 ? (_Bool)0 : z$r_buff0_thd2)) [L790] 2 z$r_buff1_thd2 = weak$$choice2 ? z$r_buff1_thd2 : (!z$w_buff0_used || !z$r_buff0_thd2 && !z$w_buff1_used || !z$r_buff0_thd2 && !z$r_buff1_thd2 ? z$r_buff1_thd2 : (z$w_buff0_used && z$r_buff0_thd2 ? (_Bool)0 : (_Bool)0)) [L791] 2 __unbuffered_p1_EBX = z [L792] 2 z = z$flush_delayed ? z$mem_tmp : z [L793] 2 z$flush_delayed = (_Bool)0 VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=1, __unbuffered_p0_EBX=0, __unbuffered_p1_EAX=1, __unbuffered_p1_EBX=0, __unbuffered_p2_EAX=1, __unbuffered_p2_EBX=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=1, y=1, z$flush_delayed=0, z$mem_tmp=0, z$r_buff0_thd0=0, z$r_buff0_thd1=0, z$r_buff0_thd2=0, z$r_buff0_thd3=1, z$r_buff1_thd0=0, z$r_buff1_thd1=0, z$r_buff1_thd2=0, z$r_buff1_thd3=0, z$read_delayed=0, z$read_delayed_var={0:0}, z$w_buff0=1, z$w_buff0_used=1, z$w_buff1=0, z$w_buff1_used=0, z=0] [L836] 3 z = z$w_buff0_used && z$r_buff0_thd3 ? z$w_buff0 : (z$w_buff1_used && z$r_buff1_thd3 ? z$w_buff1 : z) [L837] 3 z$w_buff0_used = z$w_buff0_used && z$r_buff0_thd3 ? (_Bool)0 : z$w_buff0_used [L838] 3 z$w_buff1_used = z$w_buff0_used && z$r_buff0_thd3 || z$w_buff1_used && z$r_buff1_thd3 ? (_Bool)0 : z$w_buff1_used [L839] 3 z$r_buff0_thd3 = z$w_buff0_used && z$r_buff0_thd3 ? (_Bool)0 : z$r_buff0_thd3 [L840] 3 z$r_buff1_thd3 = z$w_buff0_used && z$r_buff0_thd3 || z$w_buff1_used && z$r_buff1_thd3 ? (_Bool)0 : z$r_buff1_thd3 VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=1, __unbuffered_p0_EBX=0, __unbuffered_p1_EAX=1, __unbuffered_p1_EBX=0, __unbuffered_p2_EAX=1, __unbuffered_p2_EBX=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=1, y=1, z$flush_delayed=0, z$mem_tmp=0, z$r_buff0_thd0=0, z$r_buff0_thd1=0, z$r_buff0_thd2=0, z$r_buff0_thd3=1, z$r_buff1_thd0=0, z$r_buff1_thd1=0, z$r_buff1_thd2=0, z$r_buff1_thd3=0, z$read_delayed=0, z$read_delayed_var={0:0}, z$w_buff0=1, z$w_buff0_used=0, z$w_buff1=0, z$w_buff1_used=0, z=1] [L843] 3 __unbuffered_cnt = __unbuffered_cnt + 1 VAL [__unbuffered_cnt=1, __unbuffered_p0_EAX=1, __unbuffered_p0_EBX=0, __unbuffered_p1_EAX=1, __unbuffered_p1_EBX=0, __unbuffered_p2_EAX=1, __unbuffered_p2_EBX=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=1, y=1, z$flush_delayed=0, z$mem_tmp=0, z$r_buff0_thd0=0, z$r_buff0_thd1=0, z$r_buff0_thd2=0, z$r_buff0_thd3=1, z$r_buff1_thd0=0, z$r_buff1_thd1=0, z$r_buff1_thd2=0, z$r_buff1_thd3=0, z$read_delayed=0, z$read_delayed_var={0:0}, z$w_buff0=1, z$w_buff0_used=0, z$w_buff1=0, z$w_buff1_used=0, z=1] [L798] 2 __unbuffered_cnt = __unbuffered_cnt + 1 VAL [__unbuffered_cnt=2, __unbuffered_p0_EAX=1, __unbuffered_p0_EBX=0, __unbuffered_p1_EAX=1, __unbuffered_p1_EBX=0, __unbuffered_p2_EAX=1, __unbuffered_p2_EBX=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=1, y=1, z$flush_delayed=0, z$mem_tmp=0, z$r_buff0_thd0=0, z$r_buff0_thd1=0, z$r_buff0_thd2=0, z$r_buff0_thd3=1, z$r_buff1_thd0=0, z$r_buff1_thd1=0, z$r_buff1_thd2=0, z$r_buff1_thd3=0, z$read_delayed=0, z$read_delayed_var={0:0}, z$w_buff0=1, z$w_buff0_used=0, z$w_buff1=0, z$w_buff1_used=0, z=1] [L767] 1 __unbuffered_cnt = __unbuffered_cnt + 1 VAL [__unbuffered_cnt=3, __unbuffered_p0_EAX=1, __unbuffered_p0_EBX=0, __unbuffered_p1_EAX=1, __unbuffered_p1_EBX=0, __unbuffered_p2_EAX=1, __unbuffered_p2_EBX=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=1, y=1, z$flush_delayed=0, z$mem_tmp=0, z$r_buff0_thd0=0, z$r_buff0_thd1=0, z$r_buff0_thd2=0, z$r_buff0_thd3=1, z$r_buff1_thd0=0, z$r_buff1_thd1=0, z$r_buff1_thd2=0, z$r_buff1_thd3=0, z$read_delayed=0, z$read_delayed_var={0:0}, z$w_buff0=1, z$w_buff0_used=0, z$w_buff1=0, z$w_buff1_used=0, z=1] [L865] 0 main$tmp_guard0 = __unbuffered_cnt == 3 VAL [__unbuffered_cnt=3, __unbuffered_p0_EAX=1, __unbuffered_p0_EBX=0, __unbuffered_p1_EAX=1, __unbuffered_p1_EBX=0, __unbuffered_p2_EAX=1, __unbuffered_p2_EBX=0, a=1, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, main$tmp_guard0=1, main$tmp_guard1=0, t41={5:0}, t42={6:0}, t43={3:0}, weak$$choice2=0, x=1, y=1, z$flush_delayed=0, z$mem_tmp=0, z$r_buff0_thd0=0, z$r_buff0_thd1=0, z$r_buff0_thd2=0, z$r_buff0_thd3=1, z$r_buff1_thd0=0, z$r_buff1_thd1=0, z$r_buff1_thd2=0, z$r_buff1_thd3=0, z$read_delayed=0, z$read_delayed_var={0:0}, z$w_buff0=1, z$w_buff0_used=0, z$w_buff1=0, z$w_buff1_used=0, z=1] [L867] CALL 0 assume_abort_if_not(main$tmp_guard0) [L3] COND FALSE 0 !(!cond) [L867] RET 0 assume_abort_if_not(main$tmp_guard0) [L869] 0 z = z$w_buff0_used && z$r_buff0_thd0 ? z$w_buff0 : (z$w_buff1_used && z$r_buff1_thd0 ? z$w_buff1 : z) [L870] 0 z$w_buff0_used = z$w_buff0_used && z$r_buff0_thd0 ? (_Bool)0 : z$w_buff0_used [L871] 0 z$w_buff1_used = z$w_buff0_used && z$r_buff0_thd0 || z$w_buff1_used && z$r_buff1_thd0 ? (_Bool)0 : z$w_buff1_used [L872] 0 z$r_buff0_thd0 = z$w_buff0_used && z$r_buff0_thd0 ? (_Bool)0 : z$r_buff0_thd0 [L873] 0 z$r_buff1_thd0 = z$w_buff0_used && z$r_buff0_thd0 || z$w_buff1_used && z$r_buff1_thd0 ? (_Bool)0 : z$r_buff1_thd0 VAL [__unbuffered_cnt=3, __unbuffered_p0_EAX=1, __unbuffered_p0_EBX=0, __unbuffered_p1_EAX=1, __unbuffered_p1_EBX=0, __unbuffered_p2_EAX=1, __unbuffered_p2_EBX=0, a=1, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, main$tmp_guard0=1, main$tmp_guard1=0, t41={5:0}, t42={6:0}, t43={3:0}, weak$$choice2=0, x=1, y=1, z$flush_delayed=0, z$mem_tmp=0, z$r_buff0_thd0=0, z$r_buff0_thd1=0, z$r_buff0_thd2=0, z$r_buff0_thd3=1, z$r_buff1_thd0=0, z$r_buff1_thd1=0, z$r_buff1_thd2=0, z$r_buff1_thd3=0, z$read_delayed=0, z$read_delayed_var={0:0}, z$w_buff0=1, z$w_buff0_used=0, z$w_buff1=0, z$w_buff1_used=0, z=1] [L876] 0 main$tmp_guard1 = !(__unbuffered_p0_EAX == 1 && __unbuffered_p0_EBX == 0 && __unbuffered_p1_EAX == 1 && __unbuffered_p1_EBX == 0 && __unbuffered_p2_EAX == 1 && __unbuffered_p2_EBX == 0) VAL [__unbuffered_cnt=3, __unbuffered_p0_EAX=1, __unbuffered_p0_EBX=0, __unbuffered_p1_EAX=1, __unbuffered_p1_EBX=0, __unbuffered_p2_EAX=1, __unbuffered_p2_EBX=0, a=1, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, main$tmp_guard0=1, main$tmp_guard1=0, t41={5:0}, t42={6:0}, t43={3:0}, weak$$choice2=0, x=1, y=1, z$flush_delayed=0, z$mem_tmp=0, z$r_buff0_thd0=0, z$r_buff0_thd1=0, z$r_buff0_thd2=0, z$r_buff0_thd3=1, z$r_buff1_thd0=0, z$r_buff1_thd1=0, z$r_buff1_thd2=0, z$r_buff1_thd3=0, z$read_delayed=0, z$read_delayed_var={0:0}, z$w_buff0=1, z$w_buff0_used=0, z$w_buff1=0, z$w_buff1_used=0, z=1] [L878] 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_p0_EAX=1, __unbuffered_p0_EBX=0, __unbuffered_p1_EAX=1, __unbuffered_p1_EBX=0, __unbuffered_p2_EAX=1, __unbuffered_p2_EBX=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=1, y=1, z$flush_delayed=0, z$mem_tmp=0, z$r_buff0_thd0=0, z$r_buff0_thd1=0, z$r_buff0_thd2=0, z$r_buff0_thd3=1, z$r_buff1_thd0=0, z$r_buff1_thd1=0, z$r_buff1_thd2=0, z$r_buff1_thd3=0, z$read_delayed=0, z$read_delayed_var={0:0}, z$w_buff0=1, z$w_buff0_used=0, z$w_buff1=0, z$w_buff1_used=0, z=1] [L17] 0 __assert_fail ("0", "mix002.opt.c", 8, __extension__ __PRETTY_FUNCTION__) VAL [__unbuffered_cnt=3, __unbuffered_p0_EAX=1, __unbuffered_p0_EBX=0, __unbuffered_p1_EAX=1, __unbuffered_p1_EBX=0, __unbuffered_p2_EAX=1, __unbuffered_p2_EBX=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=1, y=1, z$flush_delayed=0, z$mem_tmp=0, z$r_buff0_thd0=0, z$r_buff0_thd1=0, z$r_buff0_thd2=0, z$r_buff0_thd3=1, z$r_buff1_thd0=0, z$r_buff1_thd1=0, z$r_buff1_thd2=0, z$r_buff1_thd3=0, z$read_delayed=0, z$read_delayed_var={0:0}, z$w_buff0=1, z$w_buff0_used=0, z$w_buff1=0, z$w_buff1_used=0, 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: 856]: Unable to prove that all allocated memory was freed Unable to prove that all allocated memory was freed Reason: Not analyzed. - UnprovableResult [Line: 859]: 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: 863]: 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: 861]: 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, 85 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: 27.7s, OverallIterations: 22, TraceHistogramMax: 1, PathProgramHistogramMax: 5, EmptinessCheckTime: 0.0s, AutomataDifference: 18.9s, DeadEndRemovalTime: 0.0s, HoareAnnotationTime: 0.0s, InitialAbstractionConstructionTime: 0.1s, HoareTripleCheckerStatistics: 0 mSolverCounterUnknown, 1222 SdHoareTripleChecker+Valid, 4.3s IncrementalHoareTripleChecker+Time, 0 mSdLazyCounter, 1043 mSDsluCounter, 351 SdHoareTripleChecker+Invalid, 3.6s Time, 0 mProtectedAction, 0 SdHoareTripleChecker+Unchecked, 0 IncrementalHoareTripleChecker+Unchecked, 267 mSDsCounter, 51 IncrementalHoareTripleChecker+Valid, 0 mProtectedPredicate, 3677 IncrementalHoareTripleChecker+Invalid, 3728 SdHoareTripleChecker+Unknown, 0 mSolverCounterNotChecked, 51 mSolverCounterUnsat, 84 mSDtfsCounter, 3677 mSolverCounterSat, 0.1s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Unknown, PredicateUnifierStatistics: 0 DeclaredPredicates, 145 GetRequests, 20 SyntacticMatches, 0 SemanticMatches, 125 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 123 ImplicationChecksByTransitivity, 1.5s Time, 0.0s BasicInterpolantAutomatonTime, BiggestAbstraction: size=669occurred in iteration=18, InterpolantAutomatonStates: 137, traceCheckStatistics: No data available, InterpolantConsolidationStatistics: No data available, PathInvariantsStatistics: No data available, 0/0 InterpolantCoveringCapability, TotalInterpolationStatistics: No data available, 0.0s DumpTime, AutomataMinimizationStatistics: No data available, HoareAnnotationStatistics: No data available, RefinementEngineStatistics: TRACE_CHECK: 0.1s SsaConstructionTime, 0.5s SatisfiabilityAnalysisTime, 7.5s InterpolantComputationTime, 481 NumberOfCodeBlocks, 481 NumberOfCodeBlocksAsserted, 22 NumberOfCheckSat, 423 ConstructedInterpolants, 0 QuantifiedInterpolants, 4107 SizeOfPredicates, 0 NumberOfNonLiveVariables, 0 ConjunctsInSsa, 0 ConjunctsInUnsatCore, 21 InterpolantComputations, 21 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:47:43,642 INFO L540 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_0ecd337b-3e48-422e-ab03-8a746d4d653d/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_0ecd337b-3e48-422e-ab03-8a746d4d653d/bin/uautomizer-verify-VRDe98Ueme/data/config -Xmx15G -Xms4m -jar /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_0ecd337b-3e48-422e-ab03-8a746d4d653d/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_0ecd337b-3e48-422e-ab03-8a746d4d653d/bin/uautomizer-verify-VRDe98Ueme/data -tc /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_0ecd337b-3e48-422e-ab03-8a746d4d653d/bin/uautomizer-verify-VRDe98Ueme/config/AutomizerMemDerefMemtrack.xml -i ../../sv-benchmarks/c/pthread-wmm/mix002.opt.i -s /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_0ecd337b-3e48-422e-ab03-8a746d4d653d/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_0ecd337b-3e48-422e-ab03-8a746d4d653d/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 dab8e857d69436654e6c7f0511b4cf3ecd6cd037fe32ed910d6d601721dfd494 --- Real Ultimate output --- This is Ultimate 0.2.4-dev-0e0057c [2023-11-26 11:47:46,320 INFO L188 SettingsManager]: Resetting all preferences to default values... [2023-11-26 11:47:46,468 INFO L114 SettingsManager]: Loading settings from /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_0ecd337b-3e48-422e-ab03-8a746d4d653d/bin/uautomizer-verify-VRDe98Ueme/config/svcomp-DerefFreeMemtrack-32bit-Automizer_Bitvector.epf [2023-11-26 11:47:46,476 WARN L101 SettingsManager]: Preference file contains the following unknown settings: [2023-11-26 11:47:46,479 WARN L103 SettingsManager]: * de.uni_freiburg.informatik.ultimate.core.Log level for class [2023-11-26 11:47:46,526 INFO L130 SettingsManager]: Preferences different from defaults after loading the file: [2023-11-26 11:47:46,527 INFO L151 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2023-11-26 11:47:46,528 INFO L153 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2023-11-26 11:47:46,529 INFO L151 SettingsManager]: Preferences of Boogie Preprocessor differ from their defaults: [2023-11-26 11:47:46,532 INFO L153 SettingsManager]: * Use memory slicer=true [2023-11-26 11:47:46,532 INFO L151 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2023-11-26 11:47:46,533 INFO L153 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2023-11-26 11:47:46,534 INFO L151 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2023-11-26 11:47:46,534 INFO L153 SettingsManager]: * Create parallel compositions if possible=false [2023-11-26 11:47:46,535 INFO L153 SettingsManager]: * Use SBE=true [2023-11-26 11:47:46,535 INFO L151 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2023-11-26 11:47:46,536 INFO L153 SettingsManager]: * sizeof long=4 [2023-11-26 11:47:46,536 INFO L153 SettingsManager]: * Overapproximate operations on floating types=true [2023-11-26 11:47:46,537 INFO L153 SettingsManager]: * sizeof POINTER=4 [2023-11-26 11:47:46,538 INFO L153 SettingsManager]: * Check division by zero=IGNORE [2023-11-26 11:47:46,538 INFO L153 SettingsManager]: * Check for the main procedure if all allocated memory was freed=true [2023-11-26 11:47:46,539 INFO L153 SettingsManager]: * Bitprecise bitfields=true [2023-11-26 11:47:46,539 INFO L153 SettingsManager]: * SV-COMP memtrack compatibility mode=true [2023-11-26 11:47:46,540 INFO L153 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2023-11-26 11:47:46,540 INFO L153 SettingsManager]: * Adapt memory model on pointer casts if necessary=true [2023-11-26 11:47:46,541 INFO L153 SettingsManager]: * Use bitvectors instead of ints=true [2023-11-26 11:47:46,541 INFO L153 SettingsManager]: * Memory model=HoenickeLindenmann_4ByteResolution [2023-11-26 11:47:46,542 INFO L153 SettingsManager]: * Check unreachability of reach_error function=false [2023-11-26 11:47:46,542 INFO L153 SettingsManager]: * sizeof long double=12 [2023-11-26 11:47:46,543 INFO L153 SettingsManager]: * Use constant arrays=true [2023-11-26 11:47:46,544 INFO L151 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2023-11-26 11:47:46,545 INFO L153 SettingsManager]: * Size of a code block=SequenceOfStatements [2023-11-26 11:47:46,545 INFO L153 SettingsManager]: * Only consider context switches at boundaries of atomic blocks=true [2023-11-26 11:47:46,545 INFO L153 SettingsManager]: * SMT solver=External_DefaultMode [2023-11-26 11:47:46,546 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2023-11-26 11:47:46,546 INFO L151 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2023-11-26 11:47:46,547 INFO L153 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2023-11-26 11:47:46,547 INFO L153 SettingsManager]: * Trace refinement strategy=WOLF [2023-11-26 11:47:46,548 INFO L153 SettingsManager]: * Command for external solver=cvc4 --incremental --print-success --lang smt [2023-11-26 11:47:46,548 INFO L153 SettingsManager]: * Apply one-shot large block encoding in concurrent analysis=false [2023-11-26 11:47:46,548 INFO L153 SettingsManager]: * Automaton type used in concurrency analysis=PETRI_NET [2023-11-26 11:47:46,549 INFO L153 SettingsManager]: * Order on configurations for Petri net unfoldings=DBO [2023-11-26 11:47:46,549 INFO L153 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2023-11-26 11:47:46,549 INFO L153 SettingsManager]: * Logic for external solver=AUFBV [2023-11-26 11:47:46,550 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_0ecd337b-3e48-422e-ab03-8a746d4d653d/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_0ecd337b-3e48-422e-ab03-8a746d4d653d/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 -> dab8e857d69436654e6c7f0511b4cf3ecd6cd037fe32ed910d6d601721dfd494 [2023-11-26 11:47:47,023 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2023-11-26 11:47:47,048 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2023-11-26 11:47:47,051 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2023-11-26 11:47:47,052 INFO L270 PluginConnector]: Initializing CDTParser... [2023-11-26 11:47:47,053 INFO L274 PluginConnector]: CDTParser initialized [2023-11-26 11:47:47,055 INFO L431 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_0ecd337b-3e48-422e-ab03-8a746d4d653d/bin/uautomizer-verify-VRDe98Ueme/../../sv-benchmarks/c/pthread-wmm/mix002.opt.i [2023-11-26 11:47:50,349 INFO L533 CDTParser]: Created temporary CDT project at NULL [2023-11-26 11:47:50,716 INFO L384 CDTParser]: Found 1 translation units. [2023-11-26 11:47:50,717 INFO L180 CDTParser]: Scanning /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_0ecd337b-3e48-422e-ab03-8a746d4d653d/sv-benchmarks/c/pthread-wmm/mix002.opt.i [2023-11-26 11:47:50,738 INFO L427 CDTParser]: About to delete temporary CDT project at /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_0ecd337b-3e48-422e-ab03-8a746d4d653d/bin/uautomizer-verify-VRDe98Ueme/data/0b69854d7/bd71ec890fd943ea9cc24737ca5bc805/FLAG8ad91f1ed [2023-11-26 11:47:50,763 INFO L435 CDTParser]: Successfully deleted /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_0ecd337b-3e48-422e-ab03-8a746d4d653d/bin/uautomizer-verify-VRDe98Ueme/data/0b69854d7/bd71ec890fd943ea9cc24737ca5bc805 [2023-11-26 11:47:50,770 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2023-11-26 11:47:50,772 INFO L133 ToolchainWalker]: Walking toolchain with 6 elements. [2023-11-26 11:47:50,775 INFO L112 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2023-11-26 11:47:50,776 INFO L270 PluginConnector]: Initializing CACSL2BoogieTranslator... [2023-11-26 11:47:50,781 INFO L274 PluginConnector]: CACSL2BoogieTranslator initialized [2023-11-26 11:47:50,782 INFO L184 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 26.11 11:47:50" (1/1) ... [2023-11-26 11:47:50,783 INFO L204 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@36e92cb4 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 26.11 11:47:50, skipping insertion in model container [2023-11-26 11:47:50,784 INFO L184 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 26.11 11:47:50" (1/1) ... [2023-11-26 11:47:50,860 INFO L177 MainTranslator]: Built tables and reachable declarations [2023-11-26 11:47:51,378 INFO L209 PostProcessor]: Analyzing one entry point: main [2023-11-26 11:47:51,405 INFO L202 MainTranslator]: Completed pre-run [2023-11-26 11:47:51,495 INFO L209 PostProcessor]: Analyzing one entry point: main [2023-11-26 11:47:51,558 WARN L675 CHandler]: The function __VERIFIER_atomic_begin is called, but not defined or handled by StandardFunctionHandler. [2023-11-26 11:47:51,558 WARN L675 CHandler]: The function __VERIFIER_atomic_end is called, but not defined or handled by StandardFunctionHandler. [2023-11-26 11:47:51,567 INFO L206 MainTranslator]: Completed translation [2023-11-26 11:47:51,568 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 26.11 11:47:51 WrapperNode [2023-11-26 11:47:51,568 INFO L131 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2023-11-26 11:47:51,570 INFO L112 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2023-11-26 11:47:51,570 INFO L270 PluginConnector]: Initializing Boogie Procedure Inliner... [2023-11-26 11:47:51,570 INFO L274 PluginConnector]: Boogie Procedure Inliner initialized [2023-11-26 11:47:51,579 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:47:51" (1/1) ... [2023-11-26 11:47:51,624 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:47:51" (1/1) ... [2023-11-26 11:47:51,678 INFO L138 Inliner]: procedures = 179, calls = 63, calls flagged for inlining = 6, calls inlined = 7, statements flattened = 159 [2023-11-26 11:47:51,678 INFO L131 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2023-11-26 11:47:51,679 INFO L112 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2023-11-26 11:47:51,680 INFO L270 PluginConnector]: Initializing Boogie Preprocessor... [2023-11-26 11:47:51,680 INFO L274 PluginConnector]: Boogie Preprocessor initialized [2023-11-26 11:47:51,697 INFO L184 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 26.11 11:47:51" (1/1) ... [2023-11-26 11:47:51,697 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 26.11 11:47:51" (1/1) ... [2023-11-26 11:47:51,712 INFO L184 PluginConnector]: Executing the observer MemorySlicer from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 26.11 11:47:51" (1/1) ... [2023-11-26 11:47:51,746 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:47:51,747 INFO L184 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 26.11 11:47:51" (1/1) ... [2023-11-26 11:47:51,753 INFO L184 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 26.11 11:47:51" (1/1) ... [2023-11-26 11:47:51,765 INFO L184 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 26.11 11:47:51" (1/1) ... [2023-11-26 11:47:51,782 INFO L184 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 26.11 11:47:51" (1/1) ... [2023-11-26 11:47:51,786 INFO L184 PluginConnector]: Executing the observer LTLStepAnnotator from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 26.11 11:47:51" (1/1) ... [2023-11-26 11:47:51,792 INFO L184 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 26.11 11:47:51" (1/1) ... [2023-11-26 11:47:51,813 INFO L131 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2023-11-26 11:47:51,814 INFO L112 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2023-11-26 11:47:51,815 INFO L270 PluginConnector]: Initializing RCFGBuilder... [2023-11-26 11:47:51,816 INFO L274 PluginConnector]: RCFGBuilder initialized [2023-11-26 11:47:51,817 INFO L184 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 26.11 11:47:51" (1/1) ... [2023-11-26 11:47:51,824 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2023-11-26 11:47:51,837 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_0ecd337b-3e48-422e-ab03-8a746d4d653d/bin/uautomizer-verify-VRDe98Ueme/z3 [2023-11-26 11:47:51,861 INFO L229 MonitoredProcess]: Starting monitored process 1 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_0ecd337b-3e48-422e-ab03-8a746d4d653d/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:47:51,885 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_0ecd337b-3e48-422e-ab03-8a746d4d653d/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:47:51,916 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_atomic_begin [2023-11-26 11:47:51,916 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2023-11-26 11:47:51,916 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnStack [2023-11-26 11:47:51,917 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.dealloc [2023-11-26 11:47:51,917 INFO L130 BoogieDeclarations]: Found specification of procedure write~intINTTYPE4#0 [2023-11-26 11:47:51,917 INFO L130 BoogieDeclarations]: Found specification of procedure write~intINTTYPE4#1 [2023-11-26 11:47:51,917 INFO L130 BoogieDeclarations]: Found specification of procedure write~intINTTYPE4#2 [2023-11-26 11:47:51,919 INFO L130 BoogieDeclarations]: Found specification of procedure write~intINTTYPE4#3 [2023-11-26 11:47:51,920 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~intINTTYPE1#0 [2023-11-26 11:47:51,921 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~intINTTYPE1#1 [2023-11-26 11:47:51,921 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~intINTTYPE1#2 [2023-11-26 11:47:51,921 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~intINTTYPE1#3 [2023-11-26 11:47:51,921 INFO L130 BoogieDeclarations]: Found specification of procedure P0 [2023-11-26 11:47:51,921 INFO L138 BoogieDeclarations]: Found implementation of procedure P0 [2023-11-26 11:47:51,922 INFO L130 BoogieDeclarations]: Found specification of procedure P1 [2023-11-26 11:47:51,922 INFO L138 BoogieDeclarations]: Found implementation of procedure P1 [2023-11-26 11:47:51,922 INFO L130 BoogieDeclarations]: Found specification of procedure P2 [2023-11-26 11:47:51,923 INFO L138 BoogieDeclarations]: Found implementation of procedure P2 [2023-11-26 11:47:51,923 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_atomic_end [2023-11-26 11:47:51,924 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2023-11-26 11:47:51,932 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2023-11-26 11:47:51,934 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:47:52,100 INFO L241 CfgBuilder]: Building ICFG [2023-11-26 11:47:52,102 INFO L267 CfgBuilder]: Building CFG for each procedure with an implementation [2023-11-26 11:47:52,560 INFO L282 CfgBuilder]: Performing block encoding [2023-11-26 11:47:52,949 INFO L304 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2023-11-26 11:47:52,950 INFO L309 CfgBuilder]: Removed 0 assume(true) statements. [2023-11-26 11:47:52,951 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 26.11 11:47:52 BoogieIcfgContainer [2023-11-26 11:47:52,951 INFO L131 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2023-11-26 11:47:52,953 INFO L112 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2023-11-26 11:47:52,953 INFO L270 PluginConnector]: Initializing TraceAbstraction... [2023-11-26 11:47:52,957 INFO L274 PluginConnector]: TraceAbstraction initialized [2023-11-26 11:47:52,957 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 26.11 11:47:50" (1/3) ... [2023-11-26 11:47:52,958 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@7042ce87 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 26.11 11:47:52, skipping insertion in model container [2023-11-26 11:47:52,958 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 26.11 11:47:51" (2/3) ... [2023-11-26 11:47:52,960 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@7042ce87 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 26.11 11:47:52, skipping insertion in model container [2023-11-26 11:47:52,960 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 26.11 11:47:52" (3/3) ... [2023-11-26 11:47:52,962 INFO L112 eAbstractionObserver]: Analyzing ICFG mix002.opt.i [2023-11-26 11:47:52,982 INFO L203 ceAbstractionStarter]: Automizer settings: Hoare:false NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2023-11-26 11:47:52,982 INFO L162 ceAbstractionStarter]: Applying trace abstraction to program that has 9 error locations. [2023-11-26 11:47:52,982 INFO L514 ceAbstractionStarter]: Constructing petrified ICFG for 1 thread instances. [2023-11-26 11:47:53,052 INFO L144 ThreadInstanceAdder]: Constructed 0 joinOtherThreadTransitions. [2023-11-26 11:47:53,100 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 65 places, 57 transitions, 126 flow [2023-11-26 11:47:53,150 INFO L124 PetriNetUnfolderBase]: 2/54 cut-off events. [2023-11-26 11:47:53,151 INFO L125 PetriNetUnfolderBase]: For 0/0 co-relation queries the response was YES. [2023-11-26 11:47:53,159 INFO L83 FinitePrefix]: Finished finitePrefix Result has 64 conditions, 54 events. 2/54 cut-off events. For 0/0 co-relation queries the response was YES. Maximal size of possible extension queue 5. Compared 119 event pairs, 0 based on Foata normal form. 0/43 useless extension candidates. Maximal degree in co-relation 53. Up to 2 conditions per place. [2023-11-26 11:47:53,160 INFO L82 GeneralOperation]: Start removeDead. Operand has 65 places, 57 transitions, 126 flow [2023-11-26 11:47:53,166 INFO L88 GeneralOperation]: Finished RemoveDead, result has has 62 places, 54 transitions, 117 flow [2023-11-26 11:47:53,185 INFO L356 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2023-11-26 11:47:53,193 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;@5459842f, mLbeIndependenceSettings=[IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=false, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2023-11-26 11:47:53,193 INFO L358 AbstractCegarLoop]: Starting to check reachability of 13 error locations. [2023-11-26 11:47:53,198 INFO L185 PetriNetUnfolderBase]: Found word, exiting Unfolder. [2023-11-26 11:47:53,198 INFO L124 PetriNetUnfolderBase]: 0/2 cut-off events. [2023-11-26 11:47:53,198 INFO L125 PetriNetUnfolderBase]: For 0/0 co-relation queries the response was YES. [2023-11-26 11:47:53,199 INFO L200 CegarLoopForPetriNet]: Found error trace [2023-11-26 11:47:53,200 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1] [2023-11-26 11:47:53,200 INFO L420 AbstractCegarLoop]: === Iteration 1 === Targeting ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [P2Err0ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 10 more)] === [2023-11-26 11:47:53,207 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-11-26 11:47:53,208 INFO L85 PathProgramCache]: Analyzing trace with hash 13843, now seen corresponding path program 1 times [2023-11-26 11:47:53,223 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2023-11-26 11:47:53,224 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [796923715] [2023-11-26 11:47:53,224 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-11-26 11:47:53,225 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:47:53,225 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_0ecd337b-3e48-422e-ab03-8a746d4d653d/bin/uautomizer-verify-VRDe98Ueme/mathsat [2023-11-26 11:47:53,232 INFO L229 MonitoredProcess]: Starting monitored process 2 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_0ecd337b-3e48-422e-ab03-8a746d4d653d/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:47:53,280 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_0ecd337b-3e48-422e-ab03-8a746d4d653d/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:47:53,365 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-26 11:47:53,368 INFO L262 TraceCheckSpWp]: Trace formula consists of 55 conjuncts, 3 conjunts are in the unsatisfiable core [2023-11-26 11:47:53,373 INFO L285 TraceCheckSpWp]: Computing forward predicates... [2023-11-26 11:47:53,456 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:47:53,469 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:47:53,470 INFO L323 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2023-11-26 11:47:53,470 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2023-11-26 11:47:53,471 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [796923715] [2023-11-26 11:47:53,471 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [796923715] provided 1 perfect and 0 imperfect interpolant sequences [2023-11-26 11:47:53,472 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-11-26 11:47:53,472 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [1] imperfect sequences [] total 1 [2023-11-26 11:47:53,474 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1546317314] [2023-11-26 11:47:53,475 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-11-26 11:47:53,483 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2023-11-26 11:47:53,490 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2023-11-26 11:47:53,516 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2023-11-26 11:47:53,517 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2023-11-26 11:47:53,551 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 31 out of 57 [2023-11-26 11:47:53,554 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 62 places, 54 transitions, 117 flow. Second operand has 3 states, 3 states have (on average 31.666666666666668) internal successors, (95), 3 states have internal predecessors, (95), 0 states have call successors, (0), 0 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:47:53,555 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2023-11-26 11:47:53,555 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 31 of 57 [2023-11-26 11:47:53,556 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2023-11-26 11:47:54,003 INFO L124 PetriNetUnfolderBase]: 557/1145 cut-off events. [2023-11-26 11:47:54,003 INFO L125 PetriNetUnfolderBase]: For 8/8 co-relation queries the response was YES. [2023-11-26 11:47:54,012 INFO L83 FinitePrefix]: Finished finitePrefix Result has 2031 conditions, 1145 events. 557/1145 cut-off events. For 8/8 co-relation queries the response was YES. Maximal size of possible extension queue 124. Compared 8668 event pairs, 413 based on Foata normal form. 72/1125 useless extension candidates. Maximal degree in co-relation 2017. Up to 647 conditions per place. [2023-11-26 11:47:54,038 INFO L140 encePairwiseOnDemand]: 52/57 looper letters, 28 selfloop transitions, 2 changer transitions 0/58 dead transitions. [2023-11-26 11:47:54,039 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 62 places, 58 transitions, 185 flow [2023-11-26 11:47:54,040 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2023-11-26 11:47:54,043 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2023-11-26 11:47:54,051 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 126 transitions. [2023-11-26 11:47:54,054 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.7368421052631579 [2023-11-26 11:47:54,055 INFO L72 ComplementDD]: Start complementDD. Operand 3 states and 126 transitions. [2023-11-26 11:47:54,056 INFO L73 IsDeterministic]: Start isDeterministic. Operand 3 states and 126 transitions. [2023-11-26 11:47:54,058 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2023-11-26 11:47:54,060 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 3 states and 126 transitions. [2023-11-26 11:47:54,064 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 4 states, 3 states have (on average 42.0) internal successors, (126), 3 states have internal predecessors, (126), 0 states have call successors, (0), 0 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:47:54,071 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 4 states, 4 states have (on average 57.0) internal successors, (228), 4 states have internal predecessors, (228), 0 states have call successors, (0), 0 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:47:54,072 INFO L81 ComplementDD]: Finished complementDD. Result has 4 states, 4 states have (on average 57.0) internal successors, (228), 4 states have internal predecessors, (228), 0 states have call successors, (0), 0 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:47:54,074 INFO L175 Difference]: Start difference. First operand has 62 places, 54 transitions, 117 flow. Second operand 3 states and 126 transitions. [2023-11-26 11:47:54,075 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 62 places, 58 transitions, 185 flow [2023-11-26 11:47:54,079 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 59 places, 58 transitions, 182 flow, removed 0 selfloop flow, removed 3 redundant places. [2023-11-26 11:47:54,087 INFO L231 Difference]: Finished difference. Result has 59 places, 50 transitions, 110 flow [2023-11-26 11:47:54,089 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=57, PETRI_DIFFERENCE_MINUEND_FLOW=106, PETRI_DIFFERENCE_MINUEND_PLACES=57, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=50, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=2, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=48, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=110, PETRI_PLACES=59, PETRI_TRANSITIONS=50} [2023-11-26 11:47:54,094 INFO L281 CegarLoopForPetriNet]: 62 programPoint places, -3 predicate places. [2023-11-26 11:47:54,094 INFO L495 AbstractCegarLoop]: Abstraction has has 59 places, 50 transitions, 110 flow [2023-11-26 11:47:54,094 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 31.666666666666668) internal successors, (95), 3 states have internal predecessors, (95), 0 states have call successors, (0), 0 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:47:54,095 INFO L200 CegarLoopForPetriNet]: Found error trace [2023-11-26 11:47:54,095 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1] [2023-11-26 11:47:54,103 INFO L540 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_0ecd337b-3e48-422e-ab03-8a746d4d653d/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)] Forceful destruction successful, exit code 0 [2023-11-26 11:47:54,297 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 2 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_0ecd337b-3e48-422e-ab03-8a746d4d653d/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:47:54,297 INFO L420 AbstractCegarLoop]: === Iteration 2 === Targeting ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [P2Err0ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 10 more)] === [2023-11-26 11:47:54,298 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-11-26 11:47:54,298 INFO L85 PathProgramCache]: Analyzing trace with hash 13844, now seen corresponding path program 1 times [2023-11-26 11:47:54,299 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2023-11-26 11:47:54,299 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [300919341] [2023-11-26 11:47:54,299 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-11-26 11:47:54,299 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:47:54,300 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_0ecd337b-3e48-422e-ab03-8a746d4d653d/bin/uautomizer-verify-VRDe98Ueme/mathsat [2023-11-26 11:47:54,302 INFO L229 MonitoredProcess]: Starting monitored process 3 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_0ecd337b-3e48-422e-ab03-8a746d4d653d/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:47:54,303 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_0ecd337b-3e48-422e-ab03-8a746d4d653d/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:47:54,439 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-26 11:47:54,441 INFO L262 TraceCheckSpWp]: Trace formula consists of 55 conjuncts, 4 conjunts are in the unsatisfiable core [2023-11-26 11:47:54,443 INFO L285 TraceCheckSpWp]: Computing forward predicates... [2023-11-26 11:47:54,454 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:47:54,469 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:47:54,469 INFO L323 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2023-11-26 11:47:54,471 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2023-11-26 11:47:54,471 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [300919341] [2023-11-26 11:47:54,472 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [300919341] provided 1 perfect and 0 imperfect interpolant sequences [2023-11-26 11:47:54,473 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-11-26 11:47:54,473 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [1] imperfect sequences [] total 1 [2023-11-26 11:47:54,473 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1136732379] [2023-11-26 11:47:54,474 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-11-26 11:47:54,475 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2023-11-26 11:47:54,475 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2023-11-26 11:47:54,476 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2023-11-26 11:47:54,476 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2023-11-26 11:47:54,518 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 32 out of 57 [2023-11-26 11:47:54,519 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 59 places, 50 transitions, 110 flow. Second operand has 3 states, 3 states have (on average 32.666666666666664) internal successors, (98), 3 states have internal predecessors, (98), 0 states have call successors, (0), 0 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:47:54,520 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2023-11-26 11:47:54,523 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 32 of 57 [2023-11-26 11:47:54,524 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2023-11-26 11:47:54,867 INFO L124 PetriNetUnfolderBase]: 557/1144 cut-off events. [2023-11-26 11:47:54,867 INFO L125 PetriNetUnfolderBase]: For 36/36 co-relation queries the response was YES. [2023-11-26 11:47:54,870 INFO L83 FinitePrefix]: Finished finitePrefix Result has 2064 conditions, 1144 events. 557/1144 cut-off events. For 36/36 co-relation queries the response was YES. Maximal size of possible extension queue 124. Compared 8698 event pairs, 413 based on Foata normal form. 1/1053 useless extension candidates. Maximal degree in co-relation 2053. Up to 646 conditions per place. [2023-11-26 11:47:54,879 INFO L140 encePairwiseOnDemand]: 54/57 looper letters, 27 selfloop transitions, 2 changer transitions 0/57 dead transitions. [2023-11-26 11:47:54,880 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 60 places, 57 transitions, 182 flow [2023-11-26 11:47:54,880 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2023-11-26 11:47:54,880 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2023-11-26 11:47:54,881 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 126 transitions. [2023-11-26 11:47:54,882 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.7368421052631579 [2023-11-26 11:47:54,882 INFO L72 ComplementDD]: Start complementDD. Operand 3 states and 126 transitions. [2023-11-26 11:47:54,883 INFO L73 IsDeterministic]: Start isDeterministic. Operand 3 states and 126 transitions. [2023-11-26 11:47:54,883 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2023-11-26 11:47:54,883 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 3 states and 126 transitions. [2023-11-26 11:47:54,885 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 4 states, 3 states have (on average 42.0) internal successors, (126), 3 states have internal predecessors, (126), 0 states have call successors, (0), 0 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:47:54,886 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 4 states, 4 states have (on average 57.0) internal successors, (228), 4 states have internal predecessors, (228), 0 states have call successors, (0), 0 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:47:54,886 INFO L81 ComplementDD]: Finished complementDD. Result has 4 states, 4 states have (on average 57.0) internal successors, (228), 4 states have internal predecessors, (228), 0 states have call successors, (0), 0 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:47:54,887 INFO L175 Difference]: Start difference. First operand has 59 places, 50 transitions, 110 flow. Second operand 3 states and 126 transitions. [2023-11-26 11:47:54,887 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 60 places, 57 transitions, 182 flow [2023-11-26 11:47:54,890 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 58 places, 57 transitions, 178 flow, removed 0 selfloop flow, removed 2 redundant places. [2023-11-26 11:47:54,891 INFO L231 Difference]: Finished difference. Result has 58 places, 49 transitions, 108 flow [2023-11-26 11:47:54,892 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=57, PETRI_DIFFERENCE_MINUEND_FLOW=104, PETRI_DIFFERENCE_MINUEND_PLACES=56, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=49, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=2, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=47, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=108, PETRI_PLACES=58, PETRI_TRANSITIONS=49} [2023-11-26 11:47:54,893 INFO L281 CegarLoopForPetriNet]: 62 programPoint places, -4 predicate places. [2023-11-26 11:47:54,893 INFO L495 AbstractCegarLoop]: Abstraction has has 58 places, 49 transitions, 108 flow [2023-11-26 11:47:54,893 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 32.666666666666664) internal successors, (98), 3 states have internal predecessors, (98), 0 states have call successors, (0), 0 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:47:54,893 INFO L200 CegarLoopForPetriNet]: Found error trace [2023-11-26 11:47:54,894 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1] [2023-11-26 11:47:54,901 INFO L540 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_0ecd337b-3e48-422e-ab03-8a746d4d653d/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:47:55,096 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 3 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_0ecd337b-3e48-422e-ab03-8a746d4d653d/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:47:55,096 INFO L420 AbstractCegarLoop]: === Iteration 3 === Targeting ULTIMATE.startErr3REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [P2Err0ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 10 more)] === [2023-11-26 11:47:55,097 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-11-26 11:47:55,097 INFO L85 PathProgramCache]: Analyzing trace with hash 412808944, now seen corresponding path program 1 times [2023-11-26 11:47:55,097 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2023-11-26 11:47:55,098 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [380823158] [2023-11-26 11:47:55,098 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-11-26 11:47:55,098 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:47:55,098 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_0ecd337b-3e48-422e-ab03-8a746d4d653d/bin/uautomizer-verify-VRDe98Ueme/mathsat [2023-11-26 11:47:55,100 INFO L229 MonitoredProcess]: Starting monitored process 4 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_0ecd337b-3e48-422e-ab03-8a746d4d653d/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:47:55,105 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_0ecd337b-3e48-422e-ab03-8a746d4d653d/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:47:55,206 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-26 11:47:55,208 INFO L262 TraceCheckSpWp]: Trace formula consists of 76 conjuncts, 4 conjunts are in the unsatisfiable core [2023-11-26 11:47:55,210 INFO L285 TraceCheckSpWp]: Computing forward predicates... [2023-11-26 11:47:55,221 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:47:55,233 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:47:55,233 INFO L323 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2023-11-26 11:47:55,233 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2023-11-26 11:47:55,234 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [380823158] [2023-11-26 11:47:55,234 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [380823158] provided 1 perfect and 0 imperfect interpolant sequences [2023-11-26 11:47:55,234 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-11-26 11:47:55,234 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2023-11-26 11:47:55,235 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [306110346] [2023-11-26 11:47:55,235 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-11-26 11:47:55,235 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2023-11-26 11:47:55,236 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2023-11-26 11:47:55,236 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2023-11-26 11:47:55,237 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2023-11-26 11:47:55,268 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 32 out of 57 [2023-11-26 11:47:55,268 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 58 places, 49 transitions, 108 flow. Second operand has 3 states, 3 states have (on average 33.333333333333336) internal successors, (100), 3 states have internal predecessors, (100), 0 states have call successors, (0), 0 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:47:55,269 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2023-11-26 11:47:55,269 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 32 of 57 [2023-11-26 11:47:55,269 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand