./Ultimate.py --spec ../../sv-benchmarks/c/properties/valid-memsafety.prp --file ../../sv-benchmarks/c/pthread-wmm/mix042.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_f41a68e7-fafa-48a2-aca6-8783e0010a4f/bin/uautomizer-verify-BQ2R08f2Ya/data/config -Xmx15G -Xms4m -jar /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_f41a68e7-fafa-48a2-aca6-8783e0010a4f/bin/uautomizer-verify-BQ2R08f2Ya/plugins/org.eclipse.equinox.launcher_1.5.800.v20200727-1323.jar -data @noDefault -ultimatedata /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_f41a68e7-fafa-48a2-aca6-8783e0010a4f/bin/uautomizer-verify-BQ2R08f2Ya/data -tc /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_f41a68e7-fafa-48a2-aca6-8783e0010a4f/bin/uautomizer-verify-BQ2R08f2Ya/config/AutomizerMemDerefMemtrack.xml -i ../../sv-benchmarks/c/pthread-wmm/mix042.opt.i -s /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_f41a68e7-fafa-48a2-aca6-8783e0010a4f/bin/uautomizer-verify-BQ2R08f2Ya/config/svcomp-DerefFreeMemtrack-32bit-Automizer_Default.epf --cacsl2boogietranslator.entry.function main --witnessprinter.witness.directory /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_f41a68e7-fafa-48a2-aca6-8783e0010a4f/bin/uautomizer-verify-BQ2R08f2Ya --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 94656be5559ee6994f8d95e82c06571dfbe5b53833c4e842ade3fa022ec89a57 --- Real Ultimate output --- This is Ultimate 0.2.4-dev-0e0057c [2023-11-29 06:41:11,913 INFO L188 SettingsManager]: Resetting all preferences to default values... [2023-11-29 06:41:11,986 INFO L114 SettingsManager]: Loading settings from /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_f41a68e7-fafa-48a2-aca6-8783e0010a4f/bin/uautomizer-verify-BQ2R08f2Ya/config/svcomp-DerefFreeMemtrack-32bit-Automizer_Default.epf [2023-11-29 06:41:11,991 WARN L101 SettingsManager]: Preference file contains the following unknown settings: [2023-11-29 06:41:11,992 WARN L103 SettingsManager]: * de.uni_freiburg.informatik.ultimate.core.Log level for class [2023-11-29 06:41:12,017 INFO L130 SettingsManager]: Preferences different from defaults after loading the file: [2023-11-29 06:41:12,018 INFO L151 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2023-11-29 06:41:12,018 INFO L153 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2023-11-29 06:41:12,020 INFO L151 SettingsManager]: Preferences of Boogie Preprocessor differ from their defaults: [2023-11-29 06:41:12,020 INFO L153 SettingsManager]: * Use memory slicer=true [2023-11-29 06:41:12,021 INFO L151 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2023-11-29 06:41:12,022 INFO L153 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2023-11-29 06:41:12,023 INFO L151 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2023-11-29 06:41:12,023 INFO L153 SettingsManager]: * Create parallel compositions if possible=false [2023-11-29 06:41:12,024 INFO L153 SettingsManager]: * Use SBE=true [2023-11-29 06:41:12,025 INFO L151 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2023-11-29 06:41:12,025 INFO L153 SettingsManager]: * sizeof long=4 [2023-11-29 06:41:12,026 INFO L153 SettingsManager]: * Overapproximate operations on floating types=true [2023-11-29 06:41:12,027 INFO L153 SettingsManager]: * sizeof POINTER=4 [2023-11-29 06:41:12,027 INFO L153 SettingsManager]: * Check division by zero=IGNORE [2023-11-29 06:41:12,028 INFO L153 SettingsManager]: * Check for the main procedure if all allocated memory was freed=true [2023-11-29 06:41:12,029 INFO L153 SettingsManager]: * Bitprecise bitfields=true [2023-11-29 06:41:12,030 INFO L153 SettingsManager]: * SV-COMP memtrack compatibility mode=true [2023-11-29 06:41:12,030 INFO L153 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2023-11-29 06:41:12,031 INFO L153 SettingsManager]: * Adapt memory model on pointer casts if necessary=true [2023-11-29 06:41:12,031 INFO L153 SettingsManager]: * Check unreachability of reach_error function=false [2023-11-29 06:41:12,032 INFO L153 SettingsManager]: * sizeof long double=12 [2023-11-29 06:41:12,033 INFO L153 SettingsManager]: * Use constant arrays=true [2023-11-29 06:41:12,033 INFO L151 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2023-11-29 06:41:12,034 INFO L153 SettingsManager]: * Size of a code block=SequenceOfStatements [2023-11-29 06:41:12,034 INFO L153 SettingsManager]: * Only consider context switches at boundaries of atomic blocks=true [2023-11-29 06:41:12,035 INFO L153 SettingsManager]: * SMT solver=External_DefaultMode [2023-11-29 06:41:12,035 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2023-11-29 06:41:12,035 INFO L151 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2023-11-29 06:41:12,036 INFO L153 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2023-11-29 06:41:12,036 INFO L153 SettingsManager]: * Trace refinement strategy=CAMEL [2023-11-29 06:41:12,036 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2023-11-29 06:41:12,036 INFO L153 SettingsManager]: * Apply one-shot large block encoding in concurrent analysis=false [2023-11-29 06:41:12,037 INFO L153 SettingsManager]: * Automaton type used in concurrency analysis=PETRI_NET [2023-11-29 06:41:12,037 INFO L153 SettingsManager]: * Order on configurations for Petri net unfoldings=DBO [2023-11-29 06:41:12,037 INFO L153 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2023-11-29 06:41:12,038 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_f41a68e7-fafa-48a2-aca6-8783e0010a4f/bin/uautomizer-verify-BQ2R08f2Ya/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_f41a68e7-fafa-48a2-aca6-8783e0010a4f/bin/uautomizer-verify-BQ2R08f2Ya 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 -> 94656be5559ee6994f8d95e82c06571dfbe5b53833c4e842ade3fa022ec89a57 [2023-11-29 06:41:12,319 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2023-11-29 06:41:12,347 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2023-11-29 06:41:12,351 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2023-11-29 06:41:12,352 INFO L270 PluginConnector]: Initializing CDTParser... [2023-11-29 06:41:12,353 INFO L274 PluginConnector]: CDTParser initialized [2023-11-29 06:41:12,354 INFO L431 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_f41a68e7-fafa-48a2-aca6-8783e0010a4f/bin/uautomizer-verify-BQ2R08f2Ya/../../sv-benchmarks/c/pthread-wmm/mix042.opt.i [2023-11-29 06:41:15,697 INFO L533 CDTParser]: Created temporary CDT project at NULL [2023-11-29 06:41:16,006 INFO L384 CDTParser]: Found 1 translation units. [2023-11-29 06:41:16,007 INFO L180 CDTParser]: Scanning /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_f41a68e7-fafa-48a2-aca6-8783e0010a4f/sv-benchmarks/c/pthread-wmm/mix042.opt.i [2023-11-29 06:41:16,027 INFO L427 CDTParser]: About to delete temporary CDT project at /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_f41a68e7-fafa-48a2-aca6-8783e0010a4f/bin/uautomizer-verify-BQ2R08f2Ya/data/aa360da77/5ffa975fd2df4ee987726b5b5c5b4201/FLAG71294d928 [2023-11-29 06:41:16,045 INFO L435 CDTParser]: Successfully deleted /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_f41a68e7-fafa-48a2-aca6-8783e0010a4f/bin/uautomizer-verify-BQ2R08f2Ya/data/aa360da77/5ffa975fd2df4ee987726b5b5c5b4201 [2023-11-29 06:41:16,048 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2023-11-29 06:41:16,050 INFO L133 ToolchainWalker]: Walking toolchain with 6 elements. [2023-11-29 06:41:16,052 INFO L112 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2023-11-29 06:41:16,052 INFO L270 PluginConnector]: Initializing CACSL2BoogieTranslator... [2023-11-29 06:41:16,058 INFO L274 PluginConnector]: CACSL2BoogieTranslator initialized [2023-11-29 06:41:16,059 INFO L184 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 29.11 06:41:16" (1/1) ... [2023-11-29 06:41:16,061 INFO L204 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@5ad8b4ab and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 29.11 06:41:16, skipping insertion in model container [2023-11-29 06:41:16,061 INFO L184 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 29.11 06:41:16" (1/1) ... [2023-11-29 06:41:16,122 INFO L177 MainTranslator]: Built tables and reachable declarations [2023-11-29 06:41:16,528 INFO L209 PostProcessor]: Analyzing one entry point: main [2023-11-29 06:41:16,541 INFO L202 MainTranslator]: Completed pre-run [2023-11-29 06:41:16,607 INFO L209 PostProcessor]: Analyzing one entry point: main [2023-11-29 06:41:16,643 WARN L675 CHandler]: The function __VERIFIER_atomic_begin is called, but not defined or handled by StandardFunctionHandler. [2023-11-29 06:41:16,643 WARN L675 CHandler]: The function __VERIFIER_atomic_end is called, but not defined or handled by StandardFunctionHandler. [2023-11-29 06:41:16,650 INFO L206 MainTranslator]: Completed translation [2023-11-29 06:41:16,650 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 29.11 06:41:16 WrapperNode [2023-11-29 06:41:16,651 INFO L131 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2023-11-29 06:41:16,652 INFO L112 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2023-11-29 06:41:16,652 INFO L270 PluginConnector]: Initializing Boogie Procedure Inliner... [2023-11-29 06:41:16,652 INFO L274 PluginConnector]: Boogie Procedure Inliner initialized [2023-11-29 06:41:16,659 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 29.11 06:41:16" (1/1) ... [2023-11-29 06:41:16,680 INFO L184 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 29.11 06:41:16" (1/1) ... [2023-11-29 06:41:16,713 INFO L138 Inliner]: procedures = 176, calls = 59, calls flagged for inlining = 6, calls inlined = 7, statements flattened = 158 [2023-11-29 06:41:16,714 INFO L131 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2023-11-29 06:41:16,715 INFO L112 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2023-11-29 06:41:16,715 INFO L270 PluginConnector]: Initializing Boogie Preprocessor... [2023-11-29 06:41:16,716 INFO L274 PluginConnector]: Boogie Preprocessor initialized [2023-11-29 06:41:16,730 INFO L184 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 29.11 06:41:16" (1/1) ... [2023-11-29 06:41:16,730 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 29.11 06:41:16" (1/1) ... [2023-11-29 06:41:16,735 INFO L184 PluginConnector]: Executing the observer MemorySlicer from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 29.11 06:41:16" (1/1) ... [2023-11-29 06:41:16,757 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-29 06:41:16,757 INFO L184 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 29.11 06:41:16" (1/1) ... [2023-11-29 06:41:16,758 INFO L184 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 29.11 06:41:16" (1/1) ... [2023-11-29 06:41:16,768 INFO L184 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 29.11 06:41:16" (1/1) ... [2023-11-29 06:41:16,771 INFO L184 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 29.11 06:41:16" (1/1) ... [2023-11-29 06:41:16,774 INFO L184 PluginConnector]: Executing the observer LTLStepAnnotator from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 29.11 06:41:16" (1/1) ... [2023-11-29 06:41:16,777 INFO L184 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 29.11 06:41:16" (1/1) ... [2023-11-29 06:41:16,781 INFO L131 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2023-11-29 06:41:16,783 INFO L112 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2023-11-29 06:41:16,783 INFO L270 PluginConnector]: Initializing RCFGBuilder... [2023-11-29 06:41:16,783 INFO L274 PluginConnector]: RCFGBuilder initialized [2023-11-29 06:41:16,784 INFO L184 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 29.11 06:41:16" (1/1) ... [2023-11-29 06:41:16,792 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2023-11-29 06:41:16,803 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_f41a68e7-fafa-48a2-aca6-8783e0010a4f/bin/uautomizer-verify-BQ2R08f2Ya/z3 [2023-11-29 06:41:16,817 INFO L229 MonitoredProcess]: Starting monitored process 1 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_f41a68e7-fafa-48a2-aca6-8783e0010a4f/bin/uautomizer-verify-BQ2R08f2Ya/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 (exit command is (exit), workingDir is null) [2023-11-29 06:41:16,821 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_f41a68e7-fafa-48a2-aca6-8783e0010a4f/bin/uautomizer-verify-BQ2R08f2Ya/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 (1)] Waiting until timeout for monitored process [2023-11-29 06:41:16,855 INFO L130 BoogieDeclarations]: Found specification of procedure write~int#0 [2023-11-29 06:41:16,855 INFO L130 BoogieDeclarations]: Found specification of procedure write~int#1 [2023-11-29 06:41:16,856 INFO L130 BoogieDeclarations]: Found specification of procedure write~int#2 [2023-11-29 06:41:16,856 INFO L130 BoogieDeclarations]: Found specification of procedure write~int#3 [2023-11-29 06:41:16,856 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_atomic_begin [2023-11-29 06:41:16,856 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2023-11-29 06:41:16,856 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnStack [2023-11-29 06:41:16,856 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.dealloc [2023-11-29 06:41:16,857 INFO L130 BoogieDeclarations]: Found specification of procedure P0 [2023-11-29 06:41:16,857 INFO L138 BoogieDeclarations]: Found implementation of procedure P0 [2023-11-29 06:41:16,857 INFO L130 BoogieDeclarations]: Found specification of procedure P1 [2023-11-29 06:41:16,857 INFO L138 BoogieDeclarations]: Found implementation of procedure P1 [2023-11-29 06:41:16,858 INFO L130 BoogieDeclarations]: Found specification of procedure P2 [2023-11-29 06:41:16,858 INFO L138 BoogieDeclarations]: Found implementation of procedure P2 [2023-11-29 06:41:16,858 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#0 [2023-11-29 06:41:16,858 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#1 [2023-11-29 06:41:16,859 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#2 [2023-11-29 06:41:16,859 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#3 [2023-11-29 06:41:16,859 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_atomic_end [2023-11-29 06:41:16,859 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2023-11-29 06:41:16,860 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2023-11-29 06:41:16,861 WARN L213 CfgBuilder]: User set CodeBlockSize to SequenceOfStatements but program contains fork statements. Overwriting the user preferences and setting CodeBlockSize to OneNontrivialStatement [2023-11-29 06:41:17,034 INFO L241 CfgBuilder]: Building ICFG [2023-11-29 06:41:17,037 INFO L267 CfgBuilder]: Building CFG for each procedure with an implementation [2023-11-29 06:41:17,394 INFO L282 CfgBuilder]: Performing block encoding [2023-11-29 06:41:17,644 INFO L304 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2023-11-29 06:41:17,644 INFO L309 CfgBuilder]: Removed 0 assume(true) statements. [2023-11-29 06:41:17,645 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 29.11 06:41:17 BoogieIcfgContainer [2023-11-29 06:41:17,645 INFO L131 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2023-11-29 06:41:17,649 INFO L112 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2023-11-29 06:41:17,649 INFO L270 PluginConnector]: Initializing TraceAbstraction... [2023-11-29 06:41:17,653 INFO L274 PluginConnector]: TraceAbstraction initialized [2023-11-29 06:41:17,654 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 29.11 06:41:16" (1/3) ... [2023-11-29 06:41:17,654 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@4aff6bbc and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 29.11 06:41:17, skipping insertion in model container [2023-11-29 06:41:17,655 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 29.11 06:41:16" (2/3) ... [2023-11-29 06:41:17,655 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@4aff6bbc and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 29.11 06:41:17, skipping insertion in model container [2023-11-29 06:41:17,655 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 29.11 06:41:17" (3/3) ... [2023-11-29 06:41:17,657 INFO L112 eAbstractionObserver]: Analyzing ICFG mix042.opt.i [2023-11-29 06:41:17,682 INFO L203 ceAbstractionStarter]: Automizer settings: Hoare:false NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2023-11-29 06:41:17,683 INFO L162 ceAbstractionStarter]: Applying trace abstraction to program that has 9 error locations. [2023-11-29 06:41:17,683 INFO L514 ceAbstractionStarter]: Constructing petrified ICFG for 1 thread instances. [2023-11-29 06:41:17,746 INFO L144 ThreadInstanceAdder]: Constructed 0 joinOtherThreadTransitions. [2023-11-29 06:41:17,791 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 63 places, 55 transitions, 122 flow [2023-11-29 06:41:17,830 INFO L124 PetriNetUnfolderBase]: 2/52 cut-off events. [2023-11-29 06:41:17,831 INFO L125 PetriNetUnfolderBase]: For 0/0 co-relation queries the response was YES. [2023-11-29 06:41:17,836 INFO L83 FinitePrefix]: Finished finitePrefix Result has 62 conditions, 52 events. 2/52 cut-off events. For 0/0 co-relation queries the response was YES. Maximal size of possible extension queue 5. Compared 100 event pairs, 0 based on Foata normal form. 0/41 useless extension candidates. Maximal degree in co-relation 51. Up to 2 conditions per place. [2023-11-29 06:41:17,836 INFO L82 GeneralOperation]: Start removeDead. Operand has 63 places, 55 transitions, 122 flow [2023-11-29 06:41:17,842 INFO L88 GeneralOperation]: Finished RemoveDead, result has has 60 places, 52 transitions, 113 flow [2023-11-29 06:41:17,854 INFO L356 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2023-11-29 06:41:17,862 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;@26afcbd7, mLbeIndependenceSettings=[IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=false, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2023-11-29 06:41:17,863 INFO L358 AbstractCegarLoop]: Starting to check reachability of 13 error locations. [2023-11-29 06:41:17,867 INFO L185 PetriNetUnfolderBase]: Found word, exiting Unfolder. [2023-11-29 06:41:17,867 INFO L124 PetriNetUnfolderBase]: 0/2 cut-off events. [2023-11-29 06:41:17,867 INFO L125 PetriNetUnfolderBase]: For 0/0 co-relation queries the response was YES. [2023-11-29 06:41:17,868 INFO L200 CegarLoopForPetriNet]: Found error trace [2023-11-29 06:41:17,868 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1] [2023-11-29 06:41:17,869 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-29 06:41:17,876 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-11-29 06:41:17,876 INFO L85 PathProgramCache]: Analyzing trace with hash 12208, now seen corresponding path program 1 times [2023-11-29 06:41:17,889 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-11-29 06:41:17,890 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [118506835] [2023-11-29 06:41:17,890 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-11-29 06:41:17,891 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-11-29 06:41:18,036 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 06:41:18,203 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-29 06:41:18,204 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-11-29 06:41:18,204 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [118506835] [2023-11-29 06:41:18,205 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [118506835] provided 1 perfect and 0 imperfect interpolant sequences [2023-11-29 06:41:18,205 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-11-29 06:41:18,206 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [1] imperfect sequences [] total 1 [2023-11-29 06:41:18,208 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [680155719] [2023-11-29 06:41:18,209 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-11-29 06:41:18,220 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2023-11-29 06:41:18,227 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-11-29 06:41:18,260 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2023-11-29 06:41:18,261 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2023-11-29 06:41:18,287 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 29 out of 55 [2023-11-29 06:41:18,291 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 60 places, 52 transitions, 113 flow. Second operand has 3 states, 3 states have (on average 29.666666666666668) internal successors, (89), 3 states have internal predecessors, (89), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-29 06:41:18,291 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2023-11-29 06:41:18,291 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 29 of 55 [2023-11-29 06:41:18,293 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2023-11-29 06:41:18,676 INFO L124 PetriNetUnfolderBase]: 518/1024 cut-off events. [2023-11-29 06:41:18,677 INFO L125 PetriNetUnfolderBase]: For 8/8 co-relation queries the response was YES. [2023-11-29 06:41:18,682 INFO L83 FinitePrefix]: Finished finitePrefix Result has 1853 conditions, 1024 events. 518/1024 cut-off events. For 8/8 co-relation queries the response was YES. Maximal size of possible extension queue 100. Compared 7390 event pairs, 400 based on Foata normal form. 60/981 useless extension candidates. Maximal degree in co-relation 1839. Up to 628 conditions per place. [2023-11-29 06:41:18,694 INFO L140 encePairwiseOnDemand]: 50/55 looper letters, 27 selfloop transitions, 2 changer transitions 0/55 dead transitions. [2023-11-29 06:41:18,694 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 60 places, 55 transitions, 177 flow [2023-11-29 06:41:18,696 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2023-11-29 06:41:18,699 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2023-11-29 06:41:18,707 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 119 transitions. [2023-11-29 06:41:18,710 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.7212121212121212 [2023-11-29 06:41:18,711 INFO L72 ComplementDD]: Start complementDD. Operand 3 states and 119 transitions. [2023-11-29 06:41:18,712 INFO L73 IsDeterministic]: Start isDeterministic. Operand 3 states and 119 transitions. [2023-11-29 06:41:18,714 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2023-11-29 06:41:18,717 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 3 states and 119 transitions. [2023-11-29 06:41:18,720 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 4 states, 3 states have (on average 39.666666666666664) internal successors, (119), 3 states have internal predecessors, (119), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-29 06:41:18,740 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 4 states, 4 states have (on average 55.0) internal successors, (220), 4 states have internal predecessors, (220), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-29 06:41:18,741 INFO L81 ComplementDD]: Finished complementDD. Result has 4 states, 4 states have (on average 55.0) internal successors, (220), 4 states have internal predecessors, (220), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-29 06:41:18,743 INFO L175 Difference]: Start difference. First operand has 60 places, 52 transitions, 113 flow. Second operand 3 states and 119 transitions. [2023-11-29 06:41:18,744 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 60 places, 55 transitions, 177 flow [2023-11-29 06:41:18,748 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 57 places, 55 transitions, 174 flow, removed 0 selfloop flow, removed 3 redundant places. [2023-11-29 06:41:18,752 INFO L231 Difference]: Finished difference. Result has 57 places, 48 transitions, 106 flow [2023-11-29 06:41:18,755 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=55, PETRI_DIFFERENCE_MINUEND_FLOW=102, PETRI_DIFFERENCE_MINUEND_PLACES=55, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=48, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=2, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=46, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=106, PETRI_PLACES=57, PETRI_TRANSITIONS=48} [2023-11-29 06:41:18,759 INFO L281 CegarLoopForPetriNet]: 60 programPoint places, -3 predicate places. [2023-11-29 06:41:18,760 INFO L495 AbstractCegarLoop]: Abstraction has has 57 places, 48 transitions, 106 flow [2023-11-29 06:41:18,760 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 29.666666666666668) internal successors, (89), 3 states have internal predecessors, (89), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-29 06:41:18,761 INFO L200 CegarLoopForPetriNet]: Found error trace [2023-11-29 06:41:18,761 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1] [2023-11-29 06:41:18,761 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable0 [2023-11-29 06:41:18,762 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-29 06:41:18,763 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-11-29 06:41:18,763 INFO L85 PathProgramCache]: Analyzing trace with hash 12209, now seen corresponding path program 1 times [2023-11-29 06:41:18,763 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-11-29 06:41:18,764 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [689605815] [2023-11-29 06:41:18,764 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-11-29 06:41:18,764 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-11-29 06:41:18,789 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 06:41:18,901 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-29 06:41:18,901 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-11-29 06:41:18,901 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [689605815] [2023-11-29 06:41:18,902 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [689605815] provided 1 perfect and 0 imperfect interpolant sequences [2023-11-29 06:41:18,902 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-11-29 06:41:18,902 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [1] imperfect sequences [] total 1 [2023-11-29 06:41:18,902 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [12758619] [2023-11-29 06:41:18,902 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-11-29 06:41:18,904 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2023-11-29 06:41:18,904 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-11-29 06:41:18,905 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2023-11-29 06:41:18,905 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2023-11-29 06:41:18,925 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 30 out of 55 [2023-11-29 06:41:18,926 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 57 places, 48 transitions, 106 flow. Second operand has 3 states, 3 states have (on average 30.666666666666668) internal successors, (92), 3 states have internal predecessors, (92), 0 states have call successors, (0), 0 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-29 06:41:18,926 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2023-11-29 06:41:18,926 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 30 of 55 [2023-11-29 06:41:18,926 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2023-11-29 06:41:19,218 INFO L124 PetriNetUnfolderBase]: 518/1023 cut-off events. [2023-11-29 06:41:19,218 INFO L125 PetriNetUnfolderBase]: For 30/30 co-relation queries the response was YES. [2023-11-29 06:41:19,223 INFO L83 FinitePrefix]: Finished finitePrefix Result has 1880 conditions, 1023 events. 518/1023 cut-off events. For 30/30 co-relation queries the response was YES. Maximal size of possible extension queue 100. Compared 7405 event pairs, 400 based on Foata normal form. 1/921 useless extension candidates. Maximal degree in co-relation 1869. Up to 627 conditions per place. [2023-11-29 06:41:19,233 INFO L140 encePairwiseOnDemand]: 52/55 looper letters, 26 selfloop transitions, 2 changer transitions 0/54 dead transitions. [2023-11-29 06:41:19,233 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 58 places, 54 transitions, 174 flow [2023-11-29 06:41:19,234 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2023-11-29 06:41:19,234 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2023-11-29 06:41:19,235 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 119 transitions. [2023-11-29 06:41:19,236 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.7212121212121212 [2023-11-29 06:41:19,236 INFO L72 ComplementDD]: Start complementDD. Operand 3 states and 119 transitions. [2023-11-29 06:41:19,236 INFO L73 IsDeterministic]: Start isDeterministic. Operand 3 states and 119 transitions. [2023-11-29 06:41:19,237 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2023-11-29 06:41:19,237 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 3 states and 119 transitions. [2023-11-29 06:41:19,238 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 4 states, 3 states have (on average 39.666666666666664) internal successors, (119), 3 states have internal predecessors, (119), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-29 06:41:19,240 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 4 states, 4 states have (on average 55.0) internal successors, (220), 4 states have internal predecessors, (220), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-29 06:41:19,240 INFO L81 ComplementDD]: Finished complementDD. Result has 4 states, 4 states have (on average 55.0) internal successors, (220), 4 states have internal predecessors, (220), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-29 06:41:19,240 INFO L175 Difference]: Start difference. First operand has 57 places, 48 transitions, 106 flow. Second operand 3 states and 119 transitions. [2023-11-29 06:41:19,241 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 58 places, 54 transitions, 174 flow [2023-11-29 06:41:19,244 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 56 places, 54 transitions, 170 flow, removed 0 selfloop flow, removed 2 redundant places. [2023-11-29 06:41:19,246 INFO L231 Difference]: Finished difference. Result has 56 places, 47 transitions, 104 flow [2023-11-29 06:41:19,246 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=55, PETRI_DIFFERENCE_MINUEND_FLOW=100, PETRI_DIFFERENCE_MINUEND_PLACES=54, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=47, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=2, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=45, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=104, PETRI_PLACES=56, PETRI_TRANSITIONS=47} [2023-11-29 06:41:19,247 INFO L281 CegarLoopForPetriNet]: 60 programPoint places, -4 predicate places. [2023-11-29 06:41:19,248 INFO L495 AbstractCegarLoop]: Abstraction has has 56 places, 47 transitions, 104 flow [2023-11-29 06:41:19,248 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 30.666666666666668) internal successors, (92), 3 states have internal predecessors, (92), 0 states have call successors, (0), 0 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-29 06:41:19,248 INFO L200 CegarLoopForPetriNet]: Found error trace [2023-11-29 06:41:19,248 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1] [2023-11-29 06:41:19,249 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1 [2023-11-29 06:41:19,249 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-29 06:41:19,250 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-11-29 06:41:19,250 INFO L85 PathProgramCache]: Analyzing trace with hash 364063086, now seen corresponding path program 1 times [2023-11-29 06:41:19,250 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-11-29 06:41:19,250 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1954323000] [2023-11-29 06:41:19,251 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-11-29 06:41:19,251 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-11-29 06:41:19,270 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 06:41:19,321 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-29 06:41:19,322 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-11-29 06:41:19,322 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1954323000] [2023-11-29 06:41:19,322 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1954323000] provided 1 perfect and 0 imperfect interpolant sequences [2023-11-29 06:41:19,323 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-11-29 06:41:19,323 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2023-11-29 06:41:19,323 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1880125471] [2023-11-29 06:41:19,323 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-11-29 06:41:19,324 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2023-11-29 06:41:19,324 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-11-29 06:41:19,325 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2023-11-29 06:41:19,325 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2023-11-29 06:41:19,344 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 29 out of 55 [2023-11-29 06:41:19,344 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 56 places, 47 transitions, 104 flow. Second operand has 3 states, 3 states have (on average 30.333333333333332) internal successors, (91), 3 states have internal predecessors, (91), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-29 06:41:19,344 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2023-11-29 06:41:19,344 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 29 of 55 [2023-11-29 06:41:19,345 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2023-11-29 06:41:19,603 INFO L124 PetriNetUnfolderBase]: 519/1022 cut-off events. [2023-11-29 06:41:19,604 INFO L125 PetriNetUnfolderBase]: For 30/30 co-relation queries the response was YES. [2023-11-29 06:41:19,606 INFO L83 FinitePrefix]: Finished finitePrefix Result has 1882 conditions, 1022 events. 519/1022 cut-off events. For 30/30 co-relation queries the response was YES. Maximal size of possible extension queue 100. Compared 7261 event pairs, 318 based on Foata normal form. 0/923 useless extension candidates. Maximal degree in co-relation 1871. Up to 627 conditions per place. [2023-11-29 06:41:19,616 INFO L140 encePairwiseOnDemand]: 52/55 looper letters, 27 selfloop transitions, 2 changer transitions 0/53 dead transitions. [2023-11-29 06:41:19,616 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 57 places, 53 transitions, 174 flow [2023-11-29 06:41:19,616 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2023-11-29 06:41:19,617 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2023-11-29 06:41:19,618 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 117 transitions. [2023-11-29 06:41:19,618 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.7090909090909091 [2023-11-29 06:41:19,619 INFO L72 ComplementDD]: Start complementDD. Operand 3 states and 117 transitions. [2023-11-29 06:41:19,619 INFO L73 IsDeterministic]: Start isDeterministic. Operand 3 states and 117 transitions. [2023-11-29 06:41:19,619 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2023-11-29 06:41:19,619 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 3 states and 117 transitions. [2023-11-29 06:41:19,621 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 4 states, 3 states have (on average 39.0) internal successors, (117), 3 states have internal predecessors, (117), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-29 06:41:19,622 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 4 states, 4 states have (on average 55.0) internal successors, (220), 4 states have internal predecessors, (220), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-29 06:41:19,622 INFO L81 ComplementDD]: Finished complementDD. Result has 4 states, 4 states have (on average 55.0) internal successors, (220), 4 states have internal predecessors, (220), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-29 06:41:19,622 INFO L175 Difference]: Start difference. First operand has 56 places, 47 transitions, 104 flow. Second operand 3 states and 117 transitions. [2023-11-29 06:41:19,622 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 57 places, 53 transitions, 174 flow [2023-11-29 06:41:19,625 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 55 places, 53 transitions, 170 flow, removed 0 selfloop flow, removed 2 redundant places. [2023-11-29 06:41:19,626 INFO L231 Difference]: Finished difference. Result has 55 places, 46 transitions, 102 flow [2023-11-29 06:41:19,627 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=55, PETRI_DIFFERENCE_MINUEND_FLOW=98, PETRI_DIFFERENCE_MINUEND_PLACES=53, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=46, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=2, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=44, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=102, PETRI_PLACES=55, PETRI_TRANSITIONS=46} [2023-11-29 06:41:19,628 INFO L281 CegarLoopForPetriNet]: 60 programPoint places, -5 predicate places. [2023-11-29 06:41:19,628 INFO L495 AbstractCegarLoop]: Abstraction has has 55 places, 46 transitions, 102 flow [2023-11-29 06:41:19,628 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 30.333333333333332) internal successors, (91), 3 states have internal predecessors, (91), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-29 06:41:19,629 INFO L200 CegarLoopForPetriNet]: Found error trace [2023-11-29 06:41:19,629 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1] [2023-11-29 06:41:19,629 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2 [2023-11-29 06:41:19,629 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-29 06:41:19,630 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-11-29 06:41:19,630 INFO L85 PathProgramCache]: Analyzing trace with hash 364063087, now seen corresponding path program 1 times [2023-11-29 06:41:19,630 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-11-29 06:41:19,630 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1288200836] [2023-11-29 06:41:19,631 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-11-29 06:41:19,631 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-11-29 06:41:19,650 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 06:41:19,720 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-29 06:41:19,720 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-11-29 06:41:19,721 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1288200836] [2023-11-29 06:41:19,721 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1288200836] provided 1 perfect and 0 imperfect interpolant sequences [2023-11-29 06:41:19,721 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-11-29 06:41:19,722 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2023-11-29 06:41:19,722 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1036949372] [2023-11-29 06:41:19,722 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-11-29 06:41:19,723 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2023-11-29 06:41:19,723 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-11-29 06:41:19,724 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2023-11-29 06:41:19,724 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2023-11-29 06:41:19,742 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 30 out of 55 [2023-11-29 06:41:19,743 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 55 places, 46 transitions, 102 flow. Second operand has 3 states, 3 states have (on average 31.333333333333332) internal successors, (94), 3 states have internal predecessors, (94), 0 states have call successors, (0), 0 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-29 06:41:19,743 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2023-11-29 06:41:19,743 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 30 of 55 [2023-11-29 06:41:19,743 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2023-11-29 06:41:19,999 INFO L124 PetriNetUnfolderBase]: 518/1019 cut-off events. [2023-11-29 06:41:20,000 INFO L125 PetriNetUnfolderBase]: For 31/31 co-relation queries the response was YES. [2023-11-29 06:41:20,002 INFO L83 FinitePrefix]: Finished finitePrefix Result has 1877 conditions, 1019 events. 518/1019 cut-off events. For 31/31 co-relation queries the response was YES. Maximal size of possible extension queue 100. Compared 7248 event pairs, 318 based on Foata normal form. 2/923 useless extension candidates. Maximal degree in co-relation 1867. Up to 624 conditions per place. [2023-11-29 06:41:20,011 INFO L140 encePairwiseOnDemand]: 52/55 looper letters, 26 selfloop transitions, 2 changer transitions 0/52 dead transitions. [2023-11-29 06:41:20,012 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 56 places, 52 transitions, 170 flow [2023-11-29 06:41:20,012 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2023-11-29 06:41:20,012 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2023-11-29 06:41:20,013 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 119 transitions. [2023-11-29 06:41:20,014 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.7212121212121212 [2023-11-29 06:41:20,014 INFO L72 ComplementDD]: Start complementDD. Operand 3 states and 119 transitions. [2023-11-29 06:41:20,014 INFO L73 IsDeterministic]: Start isDeterministic. Operand 3 states and 119 transitions. [2023-11-29 06:41:20,015 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2023-11-29 06:41:20,015 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 3 states and 119 transitions. [2023-11-29 06:41:20,016 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 4 states, 3 states have (on average 39.666666666666664) internal successors, (119), 3 states have internal predecessors, (119), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-29 06:41:20,017 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 4 states, 4 states have (on average 55.0) internal successors, (220), 4 states have internal predecessors, (220), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-29 06:41:20,018 INFO L81 ComplementDD]: Finished complementDD. Result has 4 states, 4 states have (on average 55.0) internal successors, (220), 4 states have internal predecessors, (220), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-29 06:41:20,018 INFO L175 Difference]: Start difference. First operand has 55 places, 46 transitions, 102 flow. Second operand 3 states and 119 transitions. [2023-11-29 06:41:20,018 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 56 places, 52 transitions, 170 flow [2023-11-29 06:41:20,020 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 54 places, 52 transitions, 166 flow, removed 0 selfloop flow, removed 2 redundant places. [2023-11-29 06:41:20,021 INFO L231 Difference]: Finished difference. Result has 54 places, 45 transitions, 100 flow [2023-11-29 06:41:20,021 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=55, PETRI_DIFFERENCE_MINUEND_FLOW=96, PETRI_DIFFERENCE_MINUEND_PLACES=52, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=45, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=2, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=43, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=100, PETRI_PLACES=54, PETRI_TRANSITIONS=45} [2023-11-29 06:41:20,022 INFO L281 CegarLoopForPetriNet]: 60 programPoint places, -6 predicate places. [2023-11-29 06:41:20,023 INFO L495 AbstractCegarLoop]: Abstraction has has 54 places, 45 transitions, 100 flow [2023-11-29 06:41:20,023 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 31.333333333333332) internal successors, (94), 3 states have internal predecessors, (94), 0 states have call successors, (0), 0 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-29 06:41:20,023 INFO L200 CegarLoopForPetriNet]: Found error trace [2023-11-29 06:41:20,023 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1] [2023-11-29 06:41:20,024 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable3 [2023-11-29 06:41:20,024 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-29 06:41:20,024 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-11-29 06:41:20,025 INFO L85 PathProgramCache]: Analyzing trace with hash 1011345159, now seen corresponding path program 1 times [2023-11-29 06:41:20,025 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-11-29 06:41:20,025 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [486512607] [2023-11-29 06:41:20,025 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-11-29 06:41:20,026 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-11-29 06:41:20,047 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 06:41:20,102 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-29 06:41:20,103 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-11-29 06:41:20,103 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [486512607] [2023-11-29 06:41:20,103 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [486512607] provided 1 perfect and 0 imperfect interpolant sequences [2023-11-29 06:41:20,103 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-11-29 06:41:20,104 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2023-11-29 06:41:20,104 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1992038127] [2023-11-29 06:41:20,104 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-11-29 06:41:20,104 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2023-11-29 06:41:20,105 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-11-29 06:41:20,105 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2023-11-29 06:41:20,106 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2023-11-29 06:41:20,122 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 29 out of 55 [2023-11-29 06:41:20,123 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 54 places, 45 transitions, 100 flow. Second operand has 3 states, 3 states have (on average 31.0) internal successors, (93), 3 states have internal predecessors, (93), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-29 06:41:20,123 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2023-11-29 06:41:20,123 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 29 of 55 [2023-11-29 06:41:20,123 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2023-11-29 06:41:20,360 INFO L124 PetriNetUnfolderBase]: 525/996 cut-off events. [2023-11-29 06:41:20,360 INFO L125 PetriNetUnfolderBase]: For 31/31 co-relation queries the response was YES. [2023-11-29 06:41:20,363 INFO L83 FinitePrefix]: Finished finitePrefix Result has 1867 conditions, 996 events. 525/996 cut-off events. For 31/31 co-relation queries the response was YES. Maximal size of possible extension queue 97. Compared 6694 event pairs, 412 based on Foata normal form. 0/920 useless extension candidates. Maximal degree in co-relation 1857. Up to 625 conditions per place. [2023-11-29 06:41:20,372 INFO L140 encePairwiseOnDemand]: 52/55 looper letters, 27 selfloop transitions, 2 changer transitions 0/51 dead transitions. [2023-11-29 06:41:20,372 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 55 places, 51 transitions, 170 flow [2023-11-29 06:41:20,373 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2023-11-29 06:41:20,373 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2023-11-29 06:41:20,374 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 117 transitions. [2023-11-29 06:41:20,374 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.7090909090909091 [2023-11-29 06:41:20,374 INFO L72 ComplementDD]: Start complementDD. Operand 3 states and 117 transitions. [2023-11-29 06:41:20,374 INFO L73 IsDeterministic]: Start isDeterministic. Operand 3 states and 117 transitions. [2023-11-29 06:41:20,375 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2023-11-29 06:41:20,375 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 3 states and 117 transitions. [2023-11-29 06:41:20,376 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 4 states, 3 states have (on average 39.0) internal successors, (117), 3 states have internal predecessors, (117), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-29 06:41:20,377 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 4 states, 4 states have (on average 55.0) internal successors, (220), 4 states have internal predecessors, (220), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-29 06:41:20,377 INFO L81 ComplementDD]: Finished complementDD. Result has 4 states, 4 states have (on average 55.0) internal successors, (220), 4 states have internal predecessors, (220), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-29 06:41:20,377 INFO L175 Difference]: Start difference. First operand has 54 places, 45 transitions, 100 flow. Second operand 3 states and 117 transitions. [2023-11-29 06:41:20,377 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 55 places, 51 transitions, 170 flow [2023-11-29 06:41:20,379 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 53 places, 51 transitions, 166 flow, removed 0 selfloop flow, removed 2 redundant places. [2023-11-29 06:41:20,381 INFO L231 Difference]: Finished difference. Result has 53 places, 44 transitions, 98 flow [2023-11-29 06:41:20,381 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=55, PETRI_DIFFERENCE_MINUEND_FLOW=94, PETRI_DIFFERENCE_MINUEND_PLACES=51, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=44, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=2, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=42, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=98, PETRI_PLACES=53, PETRI_TRANSITIONS=44} [2023-11-29 06:41:20,382 INFO L281 CegarLoopForPetriNet]: 60 programPoint places, -7 predicate places. [2023-11-29 06:41:20,382 INFO L495 AbstractCegarLoop]: Abstraction has has 53 places, 44 transitions, 98 flow [2023-11-29 06:41:20,382 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 31.0) internal successors, (93), 3 states have internal predecessors, (93), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-29 06:41:20,383 INFO L200 CegarLoopForPetriNet]: Found error trace [2023-11-29 06:41:20,383 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1] [2023-11-29 06:41:20,383 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable4 [2023-11-29 06:41:20,383 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-29 06:41:20,384 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-11-29 06:41:20,384 INFO L85 PathProgramCache]: Analyzing trace with hash 1011345160, now seen corresponding path program 1 times [2023-11-29 06:41:20,384 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-11-29 06:41:20,384 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1924868170] [2023-11-29 06:41:20,384 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-11-29 06:41:20,385 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-11-29 06:41:20,404 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 06:41:20,475 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-29 06:41:20,476 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-11-29 06:41:20,476 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1924868170] [2023-11-29 06:41:20,476 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1924868170] provided 1 perfect and 0 imperfect interpolant sequences [2023-11-29 06:41:20,477 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-11-29 06:41:20,477 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2023-11-29 06:41:20,477 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1176447139] [2023-11-29 06:41:20,477 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-11-29 06:41:20,478 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2023-11-29 06:41:20,478 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-11-29 06:41:20,478 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2023-11-29 06:41:20,479 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2023-11-29 06:41:20,495 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 30 out of 55 [2023-11-29 06:41:20,496 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 53 places, 44 transitions, 98 flow. Second operand has 3 states, 3 states have (on average 32.0) internal successors, (96), 3 states have internal predecessors, (96), 0 states have call successors, (0), 0 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-29 06:41:20,496 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2023-11-29 06:41:20,496 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 30 of 55 [2023-11-29 06:41:20,496 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2023-11-29 06:41:20,680 INFO L124 PetriNetUnfolderBase]: 518/978 cut-off events. [2023-11-29 06:41:20,680 INFO L125 PetriNetUnfolderBase]: For 34/34 co-relation queries the response was YES. [2023-11-29 06:41:20,682 INFO L83 FinitePrefix]: Finished finitePrefix Result has 1840 conditions, 978 events. 518/978 cut-off events. For 34/34 co-relation queries the response was YES. Maximal size of possible extension queue 97. Compared 6485 event pairs, 405 based on Foata normal form. 6/916 useless extension candidates. Maximal degree in co-relation 1830. Up to 612 conditions per place. [2023-11-29 06:41:20,688 INFO L140 encePairwiseOnDemand]: 52/55 looper letters, 26 selfloop transitions, 2 changer transitions 0/50 dead transitions. [2023-11-29 06:41:20,688 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 54 places, 50 transitions, 166 flow [2023-11-29 06:41:20,689 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2023-11-29 06:41:20,689 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2023-11-29 06:41:20,690 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 119 transitions. [2023-11-29 06:41:20,690 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.7212121212121212 [2023-11-29 06:41:20,690 INFO L72 ComplementDD]: Start complementDD. Operand 3 states and 119 transitions. [2023-11-29 06:41:20,690 INFO L73 IsDeterministic]: Start isDeterministic. Operand 3 states and 119 transitions. [2023-11-29 06:41:20,691 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2023-11-29 06:41:20,691 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 3 states and 119 transitions. [2023-11-29 06:41:20,692 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 4 states, 3 states have (on average 39.666666666666664) internal successors, (119), 3 states have internal predecessors, (119), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-29 06:41:20,693 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 4 states, 4 states have (on average 55.0) internal successors, (220), 4 states have internal predecessors, (220), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-29 06:41:20,693 INFO L81 ComplementDD]: Finished complementDD. Result has 4 states, 4 states have (on average 55.0) internal successors, (220), 4 states have internal predecessors, (220), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-29 06:41:20,693 INFO L175 Difference]: Start difference. First operand has 53 places, 44 transitions, 98 flow. Second operand 3 states and 119 transitions. [2023-11-29 06:41:20,694 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 54 places, 50 transitions, 166 flow [2023-11-29 06:41:20,695 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 52 places, 50 transitions, 162 flow, removed 0 selfloop flow, removed 2 redundant places. [2023-11-29 06:41:20,697 INFO L231 Difference]: Finished difference. Result has 52 places, 43 transitions, 96 flow [2023-11-29 06:41:20,697 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=55, PETRI_DIFFERENCE_MINUEND_FLOW=92, PETRI_DIFFERENCE_MINUEND_PLACES=50, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=43, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=2, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=41, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=96, PETRI_PLACES=52, PETRI_TRANSITIONS=43} [2023-11-29 06:41:20,698 INFO L281 CegarLoopForPetriNet]: 60 programPoint places, -8 predicate places. [2023-11-29 06:41:20,698 INFO L495 AbstractCegarLoop]: Abstraction has has 52 places, 43 transitions, 96 flow [2023-11-29 06:41:20,699 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 32.0) internal successors, (96), 3 states have internal predecessors, (96), 0 states have call successors, (0), 0 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-29 06:41:20,699 INFO L200 CegarLoopForPetriNet]: Found error trace [2023-11-29 06:41:20,699 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-11-29 06:41:20,699 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable5 [2023-11-29 06:41:20,699 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-29 06:41:20,700 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-11-29 06:41:20,700 INFO L85 PathProgramCache]: Analyzing trace with hash -211571786, now seen corresponding path program 1 times [2023-11-29 06:41:20,700 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-11-29 06:41:20,701 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1978992399] [2023-11-29 06:41:20,701 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-11-29 06:41:20,701 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-11-29 06:41:20,720 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 06:41:20,815 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-29 06:41:20,816 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-11-29 06:41:20,816 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1978992399] [2023-11-29 06:41:20,816 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1978992399] provided 1 perfect and 0 imperfect interpolant sequences [2023-11-29 06:41:20,817 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-11-29 06:41:20,817 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [1] imperfect sequences [] total 1 [2023-11-29 06:41:20,817 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [368538189] [2023-11-29 06:41:20,818 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-11-29 06:41:20,818 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2023-11-29 06:41:20,818 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-11-29 06:41:20,819 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2023-11-29 06:41:20,819 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2023-11-29 06:41:20,819 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 31 out of 55 [2023-11-29 06:41:20,820 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 52 places, 43 transitions, 96 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-29 06:41:20,820 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2023-11-29 06:41:20,820 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 31 of 55 [2023-11-29 06:41:20,820 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2023-11-29 06:41:21,022 INFO L124 PetriNetUnfolderBase]: 407/914 cut-off events. [2023-11-29 06:41:21,022 INFO L125 PetriNetUnfolderBase]: For 28/28 co-relation queries the response was YES. [2023-11-29 06:41:21,024 INFO L83 FinitePrefix]: Finished finitePrefix Result has 1605 conditions, 914 events. 407/914 cut-off events. For 28/28 co-relation queries the response was YES. Maximal size of possible extension queue 83. Compared 6444 event pairs, 74 based on Foata normal form. 0/899 useless extension candidates. Maximal degree in co-relation 1595. Up to 496 conditions per place. [2023-11-29 06:41:21,031 INFO L140 encePairwiseOnDemand]: 52/55 looper letters, 27 selfloop transitions, 2 changer transitions 2/53 dead transitions. [2023-11-29 06:41:21,032 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 53 places, 53 transitions, 180 flow [2023-11-29 06:41:21,032 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2023-11-29 06:41:21,032 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2023-11-29 06:41:21,033 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 125 transitions. [2023-11-29 06:41:21,034 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.7575757575757576 [2023-11-29 06:41:21,034 INFO L72 ComplementDD]: Start complementDD. Operand 3 states and 125 transitions. [2023-11-29 06:41:21,034 INFO L73 IsDeterministic]: Start isDeterministic. Operand 3 states and 125 transitions. [2023-11-29 06:41:21,034 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2023-11-29 06:41:21,034 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 3 states and 125 transitions. [2023-11-29 06:41:21,035 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 4 states, 3 states have (on average 41.666666666666664) internal successors, (125), 3 states have internal predecessors, (125), 0 states have call successors, (0), 0 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-29 06:41:21,036 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 4 states, 4 states have (on average 55.0) internal successors, (220), 4 states have internal predecessors, (220), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-29 06:41:21,036 INFO L81 ComplementDD]: Finished complementDD. Result has 4 states, 4 states have (on average 55.0) internal successors, (220), 4 states have internal predecessors, (220), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-29 06:41:21,036 INFO L175 Difference]: Start difference. First operand has 52 places, 43 transitions, 96 flow. Second operand 3 states and 125 transitions. [2023-11-29 06:41:21,037 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 53 places, 53 transitions, 180 flow [2023-11-29 06:41:21,038 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 51 places, 53 transitions, 174 flow, removed 0 selfloop flow, removed 2 redundant places. [2023-11-29 06:41:21,039 INFO L231 Difference]: Finished difference. Result has 51 places, 41 transitions, 92 flow [2023-11-29 06:41:21,039 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=55, PETRI_DIFFERENCE_MINUEND_FLOW=90, PETRI_DIFFERENCE_MINUEND_PLACES=49, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=42, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=2, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=40, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=92, PETRI_PLACES=51, PETRI_TRANSITIONS=41} [2023-11-29 06:41:21,040 INFO L281 CegarLoopForPetriNet]: 60 programPoint places, -9 predicate places. [2023-11-29 06:41:21,040 INFO L495 AbstractCegarLoop]: Abstraction has has 51 places, 41 transitions, 92 flow [2023-11-29 06:41:21,041 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-29 06:41:21,041 INFO L200 CegarLoopForPetriNet]: Found error trace [2023-11-29 06:41:21,041 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-29 06:41:21,041 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable6 [2023-11-29 06:41:21,042 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-29 06:41:21,042 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-11-29 06:41:21,042 INFO L85 PathProgramCache]: Analyzing trace with hash 1137403152, now seen corresponding path program 1 times [2023-11-29 06:41:21,042 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-11-29 06:41:21,043 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1622821912] [2023-11-29 06:41:21,043 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-11-29 06:41:21,043 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-11-29 06:41:21,101 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 06:41:21,601 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-29 06:41:21,602 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-11-29 06:41:21,602 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1622821912] [2023-11-29 06:41:21,602 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1622821912] provided 1 perfect and 0 imperfect interpolant sequences [2023-11-29 06:41:21,602 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-11-29 06:41:21,602 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2023-11-29 06:41:21,603 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2111913535] [2023-11-29 06:41:21,603 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-11-29 06:41:21,603 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 8 states [2023-11-29 06:41:21,604 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-11-29 06:41:21,604 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2023-11-29 06:41:21,604 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=15, Invalid=41, Unknown=0, NotChecked=0, Total=56 [2023-11-29 06:41:21,741 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 26 out of 55 [2023-11-29 06:41:21,742 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 51 places, 41 transitions, 92 flow. Second operand has 8 states, 8 states have (on average 27.875) internal successors, (223), 8 states have internal predecessors, (223), 0 states have call successors, (0), 0 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-29 06:41:21,742 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2023-11-29 06:41:21,742 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 26 of 55 [2023-11-29 06:41:21,743 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2023-11-29 06:41:22,051 INFO L124 PetriNetUnfolderBase]: 362/719 cut-off events. [2023-11-29 06:41:22,051 INFO L125 PetriNetUnfolderBase]: For 48/48 co-relation queries the response was YES. [2023-11-29 06:41:22,053 INFO L83 FinitePrefix]: Finished finitePrefix Result has 1363 conditions, 719 events. 362/719 cut-off events. For 48/48 co-relation queries the response was YES. Maximal size of possible extension queue 70. Compared 4790 event pairs, 112 based on Foata normal form. 24/715 useless extension candidates. Maximal degree in co-relation 1351. Up to 485 conditions per place. [2023-11-29 06:41:22,059 INFO L140 encePairwiseOnDemand]: 50/55 looper letters, 21 selfloop transitions, 3 changer transitions 7/50 dead transitions. [2023-11-29 06:41:22,059 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 54 places, 50 transitions, 174 flow [2023-11-29 06:41:22,059 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2023-11-29 06:41:22,060 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 6 states. [2023-11-29 06:41:22,060 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6 states to 6 states and 188 transitions. [2023-11-29 06:41:22,061 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.5696969696969697 [2023-11-29 06:41:22,061 INFO L72 ComplementDD]: Start complementDD. Operand 6 states and 188 transitions. [2023-11-29 06:41:22,061 INFO L73 IsDeterministic]: Start isDeterministic. Operand 6 states and 188 transitions. [2023-11-29 06:41:22,061 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2023-11-29 06:41:22,062 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 6 states and 188 transitions. [2023-11-29 06:41:22,063 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 7 states, 6 states have (on average 31.333333333333332) internal successors, (188), 6 states have internal predecessors, (188), 0 states have call successors, (0), 0 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-29 06:41:22,064 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 7 states, 7 states have (on average 55.0) internal successors, (385), 7 states have internal predecessors, (385), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-29 06:41:22,064 INFO L81 ComplementDD]: Finished complementDD. Result has 7 states, 7 states have (on average 55.0) internal successors, (385), 7 states have internal predecessors, (385), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-29 06:41:22,065 INFO L175 Difference]: Start difference. First operand has 51 places, 41 transitions, 92 flow. Second operand 6 states and 188 transitions. [2023-11-29 06:41:22,065 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 54 places, 50 transitions, 174 flow [2023-11-29 06:41:22,066 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 52 places, 50 transitions, 168 flow, removed 0 selfloop flow, removed 2 redundant places. [2023-11-29 06:41:22,067 INFO L231 Difference]: Finished difference. Result has 52 places, 39 transitions, 90 flow [2023-11-29 06:41:22,067 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=55, PETRI_DIFFERENCE_MINUEND_FLOW=86, PETRI_DIFFERENCE_MINUEND_PLACES=47, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=40, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=3, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=37, PETRI_DIFFERENCE_SUBTRAHEND_STATES=6, PETRI_FLOW=90, PETRI_PLACES=52, PETRI_TRANSITIONS=39} [2023-11-29 06:41:22,068 INFO L281 CegarLoopForPetriNet]: 60 programPoint places, -8 predicate places. [2023-11-29 06:41:22,068 INFO L495 AbstractCegarLoop]: Abstraction has has 52 places, 39 transitions, 90 flow [2023-11-29 06:41:22,069 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 8 states, 8 states have (on average 27.875) internal successors, (223), 8 states have internal predecessors, (223), 0 states have call successors, (0), 0 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-29 06:41:22,069 INFO L200 CegarLoopForPetriNet]: Found error trace [2023-11-29 06:41:22,069 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-29 06:41:22,069 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable7 [2023-11-29 06:41:22,069 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-29 06:41:22,070 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-11-29 06:41:22,070 INFO L85 PathProgramCache]: Analyzing trace with hash 1137404277, now seen corresponding path program 1 times [2023-11-29 06:41:22,070 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-11-29 06:41:22,070 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [766067999] [2023-11-29 06:41:22,070 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-11-29 06:41:22,071 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-11-29 06:41:22,100 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 06:41:22,837 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-29 06:41:22,837 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-11-29 06:41:22,838 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [766067999] [2023-11-29 06:41:22,838 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [766067999] provided 1 perfect and 0 imperfect interpolant sequences [2023-11-29 06:41:22,838 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-11-29 06:41:22,838 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2023-11-29 06:41:22,838 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [978682853] [2023-11-29 06:41:22,838 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-11-29 06:41:22,839 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2023-11-29 06:41:22,839 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-11-29 06:41:22,840 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2023-11-29 06:41:22,840 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=10, Invalid=20, Unknown=0, NotChecked=0, Total=30 [2023-11-29 06:41:22,862 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 27 out of 55 [2023-11-29 06:41:22,863 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 52 places, 39 transitions, 90 flow. Second operand has 6 states, 6 states have (on average 29.0) internal successors, (174), 6 states have internal predecessors, (174), 0 states have call successors, (0), 0 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-29 06:41:22,863 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2023-11-29 06:41:22,863 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 27 of 55 [2023-11-29 06:41:22,863 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2023-11-29 06:41:23,378 INFO L124 PetriNetUnfolderBase]: 1058/1805 cut-off events. [2023-11-29 06:41:23,378 INFO L125 PetriNetUnfolderBase]: For 8/8 co-relation queries the response was YES. [2023-11-29 06:41:23,381 INFO L83 FinitePrefix]: Finished finitePrefix Result has 3452 conditions, 1805 events. 1058/1805 cut-off events. For 8/8 co-relation queries the response was YES. Maximal size of possible extension queue 135. Compared 11524 event pairs, 224 based on Foata normal form. 0/1743 useless extension candidates. Maximal degree in co-relation 3441. Up to 778 conditions per place. [2023-11-29 06:41:23,388 INFO L140 encePairwiseOnDemand]: 49/55 looper letters, 26 selfloop transitions, 2 changer transitions 39/84 dead transitions. [2023-11-29 06:41:23,388 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 57 places, 84 transitions, 314 flow [2023-11-29 06:41:23,389 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2023-11-29 06:41:23,389 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 8 states. [2023-11-29 06:41:23,390 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 8 states to 8 states and 285 transitions. [2023-11-29 06:41:23,391 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.6477272727272727 [2023-11-29 06:41:23,391 INFO L72 ComplementDD]: Start complementDD. Operand 8 states and 285 transitions. [2023-11-29 06:41:23,391 INFO L73 IsDeterministic]: Start isDeterministic. Operand 8 states and 285 transitions. [2023-11-29 06:41:23,391 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2023-11-29 06:41:23,391 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 8 states and 285 transitions. [2023-11-29 06:41:23,392 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 9 states, 8 states have (on average 35.625) internal successors, (285), 8 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-29 06:41:23,394 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 9 states, 9 states have (on average 55.0) internal successors, (495), 9 states have internal predecessors, (495), 0 states have call successors, (0), 0 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-29 06:41:23,394 INFO L81 ComplementDD]: Finished complementDD. Result has 9 states, 9 states have (on average 55.0) internal successors, (495), 9 states have internal predecessors, (495), 0 states have call successors, (0), 0 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-29 06:41:23,394 INFO L175 Difference]: Start difference. First operand has 52 places, 39 transitions, 90 flow. Second operand 8 states and 285 transitions. [2023-11-29 06:41:23,395 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 57 places, 84 transitions, 314 flow [2023-11-29 06:41:23,396 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 54 places, 84 transitions, 309 flow, removed 0 selfloop flow, removed 3 redundant places. [2023-11-29 06:41:23,397 INFO L231 Difference]: Finished difference. Result has 59 places, 38 transitions, 99 flow [2023-11-29 06:41:23,397 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=55, PETRI_DIFFERENCE_MINUEND_FLOW=85, PETRI_DIFFERENCE_MINUEND_PLACES=47, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=39, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=2, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=37, PETRI_DIFFERENCE_SUBTRAHEND_STATES=8, PETRI_FLOW=99, PETRI_PLACES=59, PETRI_TRANSITIONS=38} [2023-11-29 06:41:23,398 INFO L281 CegarLoopForPetriNet]: 60 programPoint places, -1 predicate places. [2023-11-29 06:41:23,398 INFO L495 AbstractCegarLoop]: Abstraction has has 59 places, 38 transitions, 99 flow [2023-11-29 06:41:23,399 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 29.0) internal successors, (174), 6 states have internal predecessors, (174), 0 states have call successors, (0), 0 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-29 06:41:23,399 INFO L200 CegarLoopForPetriNet]: Found error trace [2023-11-29 06:41:23,399 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-11-29 06:41:23,399 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable8 [2023-11-29 06:41:23,399 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-29 06:41:23,400 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-11-29 06:41:23,400 INFO L85 PathProgramCache]: Analyzing trace with hash -1265937870, now seen corresponding path program 1 times [2023-11-29 06:41:23,400 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-11-29 06:41:23,400 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [748243901] [2023-11-29 06:41:23,400 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-11-29 06:41:23,401 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-11-29 06:41:23,431 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 06:41:24,147 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-29 06:41:24,147 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-11-29 06:41:24,147 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [748243901] [2023-11-29 06:41:24,148 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [748243901] provided 1 perfect and 0 imperfect interpolant sequences [2023-11-29 06:41:24,148 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-11-29 06:41:24,149 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2023-11-29 06:41:24,149 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [92396366] [2023-11-29 06:41:24,149 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-11-29 06:41:24,150 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2023-11-29 06:41:24,150 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-11-29 06:41:24,151 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2023-11-29 06:41:24,151 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2023-11-29 06:41:24,155 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 29 out of 55 [2023-11-29 06:41:24,156 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 59 places, 38 transitions, 99 flow. Second operand has 6 states, 6 states have (on average 31.166666666666668) internal successors, (187), 6 states have internal predecessors, (187), 0 states have call successors, (0), 0 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-29 06:41:24,156 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2023-11-29 06:41:24,156 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 29 of 55 [2023-11-29 06:41:24,156 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2023-11-29 06:41:24,521 INFO L124 PetriNetUnfolderBase]: 458/919 cut-off events. [2023-11-29 06:41:24,522 INFO L125 PetriNetUnfolderBase]: For 166/174 co-relation queries the response was YES. [2023-11-29 06:41:24,523 INFO L83 FinitePrefix]: Finished finitePrefix Result has 1909 conditions, 919 events. 458/919 cut-off events. For 166/174 co-relation queries the response was YES. Maximal size of possible extension queue 89. Compared 6090 event pairs, 160 based on Foata normal form. 24/922 useless extension candidates. Maximal degree in co-relation 1893. Up to 575 conditions per place. [2023-11-29 06:41:24,528 INFO L140 encePairwiseOnDemand]: 47/55 looper letters, 27 selfloop transitions, 6 changer transitions 21/73 dead transitions. [2023-11-29 06:41:24,528 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 60 places, 73 transitions, 290 flow [2023-11-29 06:41:24,529 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2023-11-29 06:41:24,529 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 8 states. [2023-11-29 06:41:24,530 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 8 states to 8 states and 288 transitions. [2023-11-29 06:41:24,531 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.6545454545454545 [2023-11-29 06:41:24,531 INFO L72 ComplementDD]: Start complementDD. Operand 8 states and 288 transitions. [2023-11-29 06:41:24,531 INFO L73 IsDeterministic]: Start isDeterministic. Operand 8 states and 288 transitions. [2023-11-29 06:41:24,531 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2023-11-29 06:41:24,531 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 8 states and 288 transitions. [2023-11-29 06:41:24,532 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 9 states, 8 states have (on average 36.0) internal successors, (288), 8 states have internal predecessors, (288), 0 states have call successors, (0), 0 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-29 06:41:24,533 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 9 states, 9 states have (on average 55.0) internal successors, (495), 9 states have internal predecessors, (495), 0 states have call successors, (0), 0 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-29 06:41:24,534 INFO L81 ComplementDD]: Finished complementDD. Result has 9 states, 9 states have (on average 55.0) internal successors, (495), 9 states have internal predecessors, (495), 0 states have call successors, (0), 0 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-29 06:41:24,534 INFO L175 Difference]: Start difference. First operand has 59 places, 38 transitions, 99 flow. Second operand 8 states and 288 transitions. [2023-11-29 06:41:24,534 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 60 places, 73 transitions, 290 flow [2023-11-29 06:41:24,540 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 54 places, 73 transitions, 270 flow, removed 8 selfloop flow, removed 6 redundant places. [2023-11-29 06:41:24,541 INFO L231 Difference]: Finished difference. Result has 60 places, 43 transitions, 138 flow [2023-11-29 06:41:24,542 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=55, PETRI_DIFFERENCE_MINUEND_FLOW=87, PETRI_DIFFERENCE_MINUEND_PLACES=47, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=38, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=2, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=33, PETRI_DIFFERENCE_SUBTRAHEND_STATES=8, PETRI_FLOW=138, PETRI_PLACES=60, PETRI_TRANSITIONS=43} [2023-11-29 06:41:24,543 INFO L281 CegarLoopForPetriNet]: 60 programPoint places, 0 predicate places. [2023-11-29 06:41:24,543 INFO L495 AbstractCegarLoop]: Abstraction has has 60 places, 43 transitions, 138 flow [2023-11-29 06:41:24,543 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 31.166666666666668) internal successors, (187), 6 states have internal predecessors, (187), 0 states have call successors, (0), 0 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-29 06:41:24,543 INFO L200 CegarLoopForPetriNet]: Found error trace [2023-11-29 06:41:24,544 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-11-29 06:41:24,544 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable9 [2023-11-29 06:41:24,544 INFO L420 AbstractCegarLoop]: === Iteration 11 === Targeting ULTIMATE.startErr6ASSERT_VIOLATIONMEMORY_LEAK === [P2Err0ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 10 more)] === [2023-11-29 06:41:24,544 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-11-29 06:41:24,545 INFO L85 PathProgramCache]: Analyzing trace with hash -80259066, now seen corresponding path program 2 times [2023-11-29 06:41:24,545 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-11-29 06:41:24,545 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1946540764] [2023-11-29 06:41:24,545 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-11-29 06:41:24,545 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-11-29 06:41:24,572 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 06:41:25,049 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-29 06:41:25,049 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-11-29 06:41:25,049 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1946540764] [2023-11-29 06:41:25,050 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1946540764] provided 1 perfect and 0 imperfect interpolant sequences [2023-11-29 06:41:25,050 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-11-29 06:41:25,050 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2023-11-29 06:41:25,050 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1095242260] [2023-11-29 06:41:25,050 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-11-29 06:41:25,051 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2023-11-29 06:41:25,051 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-11-29 06:41:25,051 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2023-11-29 06:41:25,052 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=13, Invalid=29, Unknown=0, NotChecked=0, Total=42 [2023-11-29 06:41:25,058 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 29 out of 55 [2023-11-29 06:41:25,059 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 60 places, 43 transitions, 138 flow. Second operand has 7 states, 7 states have (on average 30.857142857142858) internal successors, (216), 7 states have internal predecessors, (216), 0 states have call successors, (0), 0 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-29 06:41:25,059 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2023-11-29 06:41:25,059 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 29 of 55 [2023-11-29 06:41:25,059 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2023-11-29 06:41:25,400 INFO L124 PetriNetUnfolderBase]: 443/904 cut-off events. [2023-11-29 06:41:25,400 INFO L125 PetriNetUnfolderBase]: For 596/602 co-relation queries the response was YES. [2023-11-29 06:41:25,402 INFO L83 FinitePrefix]: Finished finitePrefix Result has 2211 conditions, 904 events. 443/904 cut-off events. For 596/602 co-relation queries the response was YES. Maximal size of possible extension queue 87. Compared 5957 event pairs, 171 based on Foata normal form. 24/907 useless extension candidates. Maximal degree in co-relation 2193. Up to 548 conditions per place. [2023-11-29 06:41:25,407 INFO L140 encePairwiseOnDemand]: 48/55 looper letters, 28 selfloop transitions, 9 changer transitions 21/77 dead transitions. [2023-11-29 06:41:25,407 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 63 places, 77 transitions, 383 flow [2023-11-29 06:41:25,408 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2023-11-29 06:41:25,408 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 8 states. [2023-11-29 06:41:25,409 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 8 states to 8 states and 288 transitions. [2023-11-29 06:41:25,410 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.6545454545454545 [2023-11-29 06:41:25,410 INFO L72 ComplementDD]: Start complementDD. Operand 8 states and 288 transitions. [2023-11-29 06:41:25,410 INFO L73 IsDeterministic]: Start isDeterministic. Operand 8 states and 288 transitions. [2023-11-29 06:41:25,410 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2023-11-29 06:41:25,411 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 8 states and 288 transitions. [2023-11-29 06:41:25,412 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 9 states, 8 states have (on average 36.0) internal successors, (288), 8 states have internal predecessors, (288), 0 states have call successors, (0), 0 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-29 06:41:25,414 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 9 states, 9 states have (on average 55.0) internal successors, (495), 9 states have internal predecessors, (495), 0 states have call successors, (0), 0 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-29 06:41:25,414 INFO L81 ComplementDD]: Finished complementDD. Result has 9 states, 9 states have (on average 55.0) internal successors, (495), 9 states have internal predecessors, (495), 0 states have call successors, (0), 0 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-29 06:41:25,414 INFO L175 Difference]: Start difference. First operand has 60 places, 43 transitions, 138 flow. Second operand 8 states and 288 transitions. [2023-11-29 06:41:25,414 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 63 places, 77 transitions, 383 flow [2023-11-29 06:41:25,417 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 61 places, 77 transitions, 375 flow, removed 4 selfloop flow, removed 2 redundant places. [2023-11-29 06:41:25,419 INFO L231 Difference]: Finished difference. Result has 67 places, 47 transitions, 203 flow [2023-11-29 06:41:25,419 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=55, PETRI_DIFFERENCE_MINUEND_FLOW=134, PETRI_DIFFERENCE_MINUEND_PLACES=54, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=43, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=6, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=35, PETRI_DIFFERENCE_SUBTRAHEND_STATES=8, PETRI_FLOW=203, PETRI_PLACES=67, PETRI_TRANSITIONS=47} [2023-11-29 06:41:25,419 INFO L281 CegarLoopForPetriNet]: 60 programPoint places, 7 predicate places. [2023-11-29 06:41:25,420 INFO L495 AbstractCegarLoop]: Abstraction has has 67 places, 47 transitions, 203 flow [2023-11-29 06:41:25,420 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 7 states, 7 states have (on average 30.857142857142858) internal successors, (216), 7 states have internal predecessors, (216), 0 states have call successors, (0), 0 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-29 06:41:25,420 INFO L200 CegarLoopForPetriNet]: Found error trace [2023-11-29 06:41:25,420 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-11-29 06:41:25,420 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable10 [2023-11-29 06:41:25,420 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-29 06:41:25,421 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-11-29 06:41:25,421 INFO L85 PathProgramCache]: Analyzing trace with hash 188374945, now seen corresponding path program 1 times [2023-11-29 06:41:25,421 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-11-29 06:41:25,421 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [645065027] [2023-11-29 06:41:25,421 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-11-29 06:41:25,421 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-11-29 06:41:25,450 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 06:41:25,569 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-29 06:41:25,569 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-11-29 06:41:25,569 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [645065027] [2023-11-29 06:41:25,569 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [645065027] provided 1 perfect and 0 imperfect interpolant sequences [2023-11-29 06:41:25,570 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-11-29 06:41:25,570 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2023-11-29 06:41:25,570 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1427761455] [2023-11-29 06:41:25,570 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-11-29 06:41:25,570 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2023-11-29 06:41:25,571 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-11-29 06:41:25,571 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2023-11-29 06:41:25,572 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2023-11-29 06:41:25,577 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 27 out of 55 [2023-11-29 06:41:25,578 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 67 places, 47 transitions, 203 flow. Second operand has 4 states, 4 states have (on average 30.75) internal successors, (123), 4 states have internal predecessors, (123), 0 states have call successors, (0), 0 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-29 06:41:25,578 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2023-11-29 06:41:25,578 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 27 of 55 [2023-11-29 06:41:25,578 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2023-11-29 06:41:25,936 INFO L124 PetriNetUnfolderBase]: 1066/1797 cut-off events. [2023-11-29 06:41:25,936 INFO L125 PetriNetUnfolderBase]: For 2579/2592 co-relation queries the response was YES. [2023-11-29 06:41:25,941 INFO L83 FinitePrefix]: Finished finitePrefix Result has 4916 conditions, 1797 events. 1066/1797 cut-off events. For 2579/2592 co-relation queries the response was YES. Maximal size of possible extension queue 123. Compared 10574 event pairs, 104 based on Foata normal form. 84/1863 useless extension candidates. Maximal degree in co-relation 4892. Up to 1051 conditions per place. [2023-11-29 06:41:25,953 INFO L140 encePairwiseOnDemand]: 49/55 looper letters, 47 selfloop transitions, 5 changer transitions 0/72 dead transitions. [2023-11-29 06:41:25,953 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 66 places, 72 transitions, 422 flow [2023-11-29 06:41:25,954 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2023-11-29 06:41:25,954 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 4 states. [2023-11-29 06:41:25,955 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 153 transitions. [2023-11-29 06:41:25,955 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.6954545454545454 [2023-11-29 06:41:25,955 INFO L72 ComplementDD]: Start complementDD. Operand 4 states and 153 transitions. [2023-11-29 06:41:25,955 INFO L73 IsDeterministic]: Start isDeterministic. Operand 4 states and 153 transitions. [2023-11-29 06:41:25,956 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2023-11-29 06:41:25,956 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 4 states and 153 transitions. [2023-11-29 06:41:25,956 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 5 states, 4 states have (on average 38.25) internal successors, (153), 4 states have internal predecessors, (153), 0 states have call successors, (0), 0 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-29 06:41:25,957 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 5 states, 5 states have (on average 55.0) internal successors, (275), 5 states have internal predecessors, (275), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-29 06:41:25,958 INFO L81 ComplementDD]: Finished complementDD. Result has 5 states, 5 states have (on average 55.0) internal successors, (275), 5 states have internal predecessors, (275), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-29 06:41:25,958 INFO L175 Difference]: Start difference. First operand has 67 places, 47 transitions, 203 flow. Second operand 4 states and 153 transitions. [2023-11-29 06:41:25,958 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 66 places, 72 transitions, 422 flow [2023-11-29 06:41:25,965 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 62 places, 72 transitions, 388 flow, removed 17 selfloop flow, removed 4 redundant places. [2023-11-29 06:41:25,966 INFO L231 Difference]: Finished difference. Result has 64 places, 51 transitions, 219 flow [2023-11-29 06:41:25,967 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=55, PETRI_DIFFERENCE_MINUEND_FLOW=181, PETRI_DIFFERENCE_MINUEND_PLACES=59, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=47, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=1, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=42, PETRI_DIFFERENCE_SUBTRAHEND_STATES=4, PETRI_FLOW=219, PETRI_PLACES=64, PETRI_TRANSITIONS=51} [2023-11-29 06:41:25,967 INFO L281 CegarLoopForPetriNet]: 60 programPoint places, 4 predicate places. [2023-11-29 06:41:25,968 INFO L495 AbstractCegarLoop]: Abstraction has has 64 places, 51 transitions, 219 flow [2023-11-29 06:41:25,968 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 30.75) internal successors, (123), 4 states have internal predecessors, (123), 0 states have call successors, (0), 0 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-29 06:41:25,968 INFO L200 CegarLoopForPetriNet]: Found error trace [2023-11-29 06:41:25,968 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-29 06:41:25,968 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable11 [2023-11-29 06:41:25,969 INFO L420 AbstractCegarLoop]: === Iteration 13 === Targeting ULTIMATE.startErr6ASSERT_VIOLATIONMEMORY_LEAK === [P2Err0ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 10 more)] === [2023-11-29 06:41:25,969 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-11-29 06:41:25,969 INFO L85 PathProgramCache]: Analyzing trace with hash -14276601, now seen corresponding path program 1 times [2023-11-29 06:41:25,970 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-11-29 06:41:25,970 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1698962142] [2023-11-29 06:41:25,970 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-11-29 06:41:25,970 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-11-29 06:41:26,001 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 06:41:26,134 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-29 06:41:26,134 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-11-29 06:41:26,135 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1698962142] [2023-11-29 06:41:26,135 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1698962142] provided 1 perfect and 0 imperfect interpolant sequences [2023-11-29 06:41:26,135 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-11-29 06:41:26,136 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2023-11-29 06:41:26,136 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1050842603] [2023-11-29 06:41:26,136 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-11-29 06:41:26,137 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2023-11-29 06:41:26,137 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-11-29 06:41:26,138 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2023-11-29 06:41:26,138 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=8, Invalid=12, Unknown=0, NotChecked=0, Total=20 [2023-11-29 06:41:26,143 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 27 out of 55 [2023-11-29 06:41:26,144 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 64 places, 51 transitions, 219 flow. Second operand has 5 states, 5 states have (on average 30.2) internal successors, (151), 5 states have internal predecessors, (151), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-29 06:41:26,144 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2023-11-29 06:41:26,144 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 27 of 55 [2023-11-29 06:41:26,144 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2023-11-29 06:41:26,460 INFO L124 PetriNetUnfolderBase]: 818/1419 cut-off events. [2023-11-29 06:41:26,460 INFO L125 PetriNetUnfolderBase]: For 1164/1175 co-relation queries the response was YES. [2023-11-29 06:41:26,464 INFO L83 FinitePrefix]: Finished finitePrefix Result has 3949 conditions, 1419 events. 818/1419 cut-off events. For 1164/1175 co-relation queries the response was YES. Maximal size of possible extension queue 87. Compared 7851 event pairs, 52 based on Foata normal form. 74/1474 useless extension candidates. Maximal degree in co-relation 3925. Up to 565 conditions per place. [2023-11-29 06:41:26,473 INFO L140 encePairwiseOnDemand]: 49/55 looper letters, 52 selfloop transitions, 8 changer transitions 0/78 dead transitions. [2023-11-29 06:41:26,473 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 68 places, 78 transitions, 436 flow [2023-11-29 06:41:26,473 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2023-11-29 06:41:26,473 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 5 states. [2023-11-29 06:41:26,474 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 193 transitions. [2023-11-29 06:41:26,475 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.7018181818181818 [2023-11-29 06:41:26,475 INFO L72 ComplementDD]: Start complementDD. Operand 5 states and 193 transitions. [2023-11-29 06:41:26,475 INFO L73 IsDeterministic]: Start isDeterministic. Operand 5 states and 193 transitions. [2023-11-29 06:41:26,475 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2023-11-29 06:41:26,475 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 5 states and 193 transitions. [2023-11-29 06:41:26,476 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 6 states, 5 states have (on average 38.6) internal successors, (193), 5 states have internal predecessors, (193), 0 states have call successors, (0), 0 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-29 06:41:26,477 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 6 states, 6 states have (on average 55.0) internal successors, (330), 6 states have internal predecessors, (330), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-29 06:41:26,477 INFO L81 ComplementDD]: Finished complementDD. Result has 6 states, 6 states have (on average 55.0) internal successors, (330), 6 states have internal predecessors, (330), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-29 06:41:26,478 INFO L175 Difference]: Start difference. First operand has 64 places, 51 transitions, 219 flow. Second operand 5 states and 193 transitions. [2023-11-29 06:41:26,478 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 68 places, 78 transitions, 436 flow [2023-11-29 06:41:26,481 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 62 places, 78 transitions, 402 flow, removed 4 selfloop flow, removed 6 redundant places. [2023-11-29 06:41:26,483 INFO L231 Difference]: Finished difference. Result has 64 places, 50 transitions, 219 flow [2023-11-29 06:41:26,483 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=55, PETRI_DIFFERENCE_MINUEND_FLOW=165, PETRI_DIFFERENCE_MINUEND_PLACES=58, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=46, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=4, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=38, PETRI_DIFFERENCE_SUBTRAHEND_STATES=5, PETRI_FLOW=219, PETRI_PLACES=64, PETRI_TRANSITIONS=50} [2023-11-29 06:41:26,484 INFO L281 CegarLoopForPetriNet]: 60 programPoint places, 4 predicate places. [2023-11-29 06:41:26,484 INFO L495 AbstractCegarLoop]: Abstraction has has 64 places, 50 transitions, 219 flow [2023-11-29 06:41:26,484 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 30.2) internal successors, (151), 5 states have internal predecessors, (151), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-29 06:41:26,484 INFO L200 CegarLoopForPetriNet]: Found error trace [2023-11-29 06:41:26,485 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-11-29 06:41:26,485 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable12 [2023-11-29 06:41:26,485 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-29 06:41:26,485 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-11-29 06:41:26,485 INFO L85 PathProgramCache]: Analyzing trace with hash 2133761346, now seen corresponding path program 1 times [2023-11-29 06:41:26,486 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-11-29 06:41:26,486 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1480527708] [2023-11-29 06:41:26,486 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-11-29 06:41:26,486 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-11-29 06:41:26,522 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 06:41:26,709 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-29 06:41:26,710 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-11-29 06:41:26,710 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1480527708] [2023-11-29 06:41:26,710 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1480527708] provided 1 perfect and 0 imperfect interpolant sequences [2023-11-29 06:41:26,710 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-11-29 06:41:26,710 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2023-11-29 06:41:26,710 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1683631989] [2023-11-29 06:41:26,711 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-11-29 06:41:26,711 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2023-11-29 06:41:26,711 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-11-29 06:41:26,712 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2023-11-29 06:41:26,712 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=12, Invalid=18, Unknown=0, NotChecked=0, Total=30 [2023-11-29 06:41:26,718 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 27 out of 55 [2023-11-29 06:41:26,719 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 64 places, 50 transitions, 219 flow. Second operand has 6 states, 6 states have (on average 29.833333333333332) internal successors, (179), 6 states have internal predecessors, (179), 0 states have call successors, (0), 0 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-29 06:41:26,719 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2023-11-29 06:41:26,719 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 27 of 55 [2023-11-29 06:41:26,719 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2023-11-29 06:41:27,076 INFO L124 PetriNetUnfolderBase]: 586/1019 cut-off events. [2023-11-29 06:41:27,076 INFO L125 PetriNetUnfolderBase]: For 1652/1652 co-relation queries the response was YES. [2023-11-29 06:41:27,080 INFO L83 FinitePrefix]: Finished finitePrefix Result has 3184 conditions, 1019 events. 586/1019 cut-off events. For 1652/1652 co-relation queries the response was YES. Maximal size of possible extension queue 77. Compared 5324 event pairs, 50 based on Foata normal form. 36/1036 useless extension candidates. Maximal degree in co-relation 3161. Up to 392 conditions per place. [2023-11-29 06:41:27,085 INFO L140 encePairwiseOnDemand]: 49/55 looper letters, 48 selfloop transitions, 11 changer transitions 0/77 dead transitions. [2023-11-29 06:41:27,085 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 69 places, 77 transitions, 427 flow [2023-11-29 06:41:27,086 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2023-11-29 06:41:27,086 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 6 states. [2023-11-29 06:41:27,087 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6 states to 6 states and 219 transitions. [2023-11-29 06:41:27,087 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.6636363636363637 [2023-11-29 06:41:27,087 INFO L72 ComplementDD]: Start complementDD. Operand 6 states and 219 transitions. [2023-11-29 06:41:27,088 INFO L73 IsDeterministic]: Start isDeterministic. Operand 6 states and 219 transitions. [2023-11-29 06:41:27,088 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2023-11-29 06:41:27,088 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 6 states and 219 transitions. [2023-11-29 06:41:27,089 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 7 states, 6 states have (on average 36.5) internal successors, (219), 6 states have internal predecessors, (219), 0 states have call successors, (0), 0 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-29 06:41:27,090 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 7 states, 7 states have (on average 55.0) internal successors, (385), 7 states have internal predecessors, (385), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-29 06:41:27,091 INFO L81 ComplementDD]: Finished complementDD. Result has 7 states, 7 states have (on average 55.0) internal successors, (385), 7 states have internal predecessors, (385), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-29 06:41:27,091 INFO L175 Difference]: Start difference. First operand has 64 places, 50 transitions, 219 flow. Second operand 6 states and 219 transitions. [2023-11-29 06:41:27,091 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 69 places, 77 transitions, 427 flow [2023-11-29 06:41:27,094 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 64 places, 77 transitions, 390 flow, removed 14 selfloop flow, removed 5 redundant places. [2023-11-29 06:41:27,096 INFO L231 Difference]: Finished difference. Result has 66 places, 51 transitions, 235 flow [2023-11-29 06:41:27,096 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=55, PETRI_DIFFERENCE_MINUEND_FLOW=191, PETRI_DIFFERENCE_MINUEND_PLACES=59, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=50, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=10, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=39, PETRI_DIFFERENCE_SUBTRAHEND_STATES=6, PETRI_FLOW=235, PETRI_PLACES=66, PETRI_TRANSITIONS=51} [2023-11-29 06:41:27,097 INFO L281 CegarLoopForPetriNet]: 60 programPoint places, 6 predicate places. [2023-11-29 06:41:27,097 INFO L495 AbstractCegarLoop]: Abstraction has has 66 places, 51 transitions, 235 flow [2023-11-29 06:41:27,097 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 29.833333333333332) internal successors, (179), 6 states have internal predecessors, (179), 0 states have call successors, (0), 0 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-29 06:41:27,098 INFO L200 CegarLoopForPetriNet]: Found error trace [2023-11-29 06:41:27,098 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-11-29 06:41:27,098 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable13 [2023-11-29 06:41:27,098 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-29 06:41:27,098 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-11-29 06:41:27,099 INFO L85 PathProgramCache]: Analyzing trace with hash 257357857, now seen corresponding path program 1 times [2023-11-29 06:41:27,099 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-11-29 06:41:27,099 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [362335639] [2023-11-29 06:41:27,099 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-11-29 06:41:27,099 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-11-29 06:41:27,127 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 06:41:27,718 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-29 06:41:27,718 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-11-29 06:41:27,718 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [362335639] [2023-11-29 06:41:27,719 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [362335639] provided 1 perfect and 0 imperfect interpolant sequences [2023-11-29 06:41:27,719 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-11-29 06:41:27,719 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2023-11-29 06:41:27,719 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1897967826] [2023-11-29 06:41:27,719 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-11-29 06:41:27,720 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2023-11-29 06:41:27,720 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-11-29 06:41:27,720 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2023-11-29 06:41:27,720 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=12, Invalid=30, Unknown=0, NotChecked=0, Total=42 [2023-11-29 06:41:27,752 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 26 out of 55 [2023-11-29 06:41:27,753 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 66 places, 51 transitions, 235 flow. Second operand has 7 states, 7 states have (on average 28.714285714285715) internal successors, (201), 7 states have internal predecessors, (201), 0 states have call successors, (0), 0 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-29 06:41:27,753 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2023-11-29 06:41:27,753 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 26 of 55 [2023-11-29 06:41:27,753 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2023-11-29 06:41:28,416 INFO L124 PetriNetUnfolderBase]: 952/1900 cut-off events. [2023-11-29 06:41:28,416 INFO L125 PetriNetUnfolderBase]: For 2178/2837 co-relation queries the response was YES. [2023-11-29 06:41:28,424 INFO L83 FinitePrefix]: Finished finitePrefix Result has 4874 conditions, 1900 events. 952/1900 cut-off events. For 2178/2837 co-relation queries the response was YES. Maximal size of possible extension queue 170. Compared 12564 event pairs, 359 based on Foata normal form. 51/1794 useless extension candidates. Maximal degree in co-relation 4852. Up to 709 conditions per place. [2023-11-29 06:41:28,430 INFO L140 encePairwiseOnDemand]: 47/55 looper letters, 36 selfloop transitions, 4 changer transitions 32/99 dead transitions. [2023-11-29 06:41:28,430 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 73 places, 99 transitions, 529 flow [2023-11-29 06:41:28,431 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2023-11-29 06:41:28,431 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 8 states. [2023-11-29 06:41:28,432 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 8 states to 8 states and 276 transitions. [2023-11-29 06:41:28,432 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.6272727272727273 [2023-11-29 06:41:28,433 INFO L72 ComplementDD]: Start complementDD. Operand 8 states and 276 transitions. [2023-11-29 06:41:28,433 INFO L73 IsDeterministic]: Start isDeterministic. Operand 8 states and 276 transitions. [2023-11-29 06:41:28,433 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2023-11-29 06:41:28,433 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 8 states and 276 transitions. [2023-11-29 06:41:28,434 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 9 states, 8 states have (on average 34.5) internal successors, (276), 8 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-29 06:41:28,435 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 9 states, 9 states have (on average 55.0) internal successors, (495), 9 states have internal predecessors, (495), 0 states have call successors, (0), 0 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-29 06:41:28,436 INFO L81 ComplementDD]: Finished complementDD. Result has 9 states, 9 states have (on average 55.0) internal successors, (495), 9 states have internal predecessors, (495), 0 states have call successors, (0), 0 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-29 06:41:28,436 INFO L175 Difference]: Start difference. First operand has 66 places, 51 transitions, 235 flow. Second operand 8 states and 276 transitions. [2023-11-29 06:41:28,436 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 73 places, 99 transitions, 529 flow [2023-11-29 06:41:28,447 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 70 places, 99 transitions, 505 flow, removed 6 selfloop flow, removed 3 redundant places. [2023-11-29 06:41:28,449 INFO L231 Difference]: Finished difference. Result has 76 places, 53 transitions, 251 flow [2023-11-29 06:41:28,449 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=55, PETRI_DIFFERENCE_MINUEND_FLOW=211, PETRI_DIFFERENCE_MINUEND_PLACES=63, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=51, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=2, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=47, PETRI_DIFFERENCE_SUBTRAHEND_STATES=8, PETRI_FLOW=251, PETRI_PLACES=76, PETRI_TRANSITIONS=53} [2023-11-29 06:41:28,450 INFO L281 CegarLoopForPetriNet]: 60 programPoint places, 16 predicate places. [2023-11-29 06:41:28,450 INFO L495 AbstractCegarLoop]: Abstraction has has 76 places, 53 transitions, 251 flow [2023-11-29 06:41:28,450 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 7 states, 7 states have (on average 28.714285714285715) internal successors, (201), 7 states have internal predecessors, (201), 0 states have call successors, (0), 0 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-29 06:41:28,451 INFO L200 CegarLoopForPetriNet]: Found error trace [2023-11-29 06:41:28,451 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-11-29 06:41:28,451 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable14 [2023-11-29 06:41:28,451 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-29 06:41:28,451 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-11-29 06:41:28,452 INFO L85 PathProgramCache]: Analyzing trace with hash 1461388505, now seen corresponding path program 2 times [2023-11-29 06:41:28,452 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-11-29 06:41:28,452 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1106222813] [2023-11-29 06:41:28,452 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-11-29 06:41:28,452 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-11-29 06:41:28,487 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 06:41:29,015 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-29 06:41:29,016 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-11-29 06:41:29,016 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1106222813] [2023-11-29 06:41:29,016 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1106222813] provided 1 perfect and 0 imperfect interpolant sequences [2023-11-29 06:41:29,016 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-11-29 06:41:29,016 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2023-11-29 06:41:29,017 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1419917041] [2023-11-29 06:41:29,017 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-11-29 06:41:29,017 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2023-11-29 06:41:29,018 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-11-29 06:41:29,018 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2023-11-29 06:41:29,019 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=12, Invalid=30, Unknown=0, NotChecked=0, Total=42 [2023-11-29 06:41:29,049 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 26 out of 55 [2023-11-29 06:41:29,050 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 76 places, 53 transitions, 251 flow. Second operand has 7 states, 7 states have (on average 28.714285714285715) internal successors, (201), 7 states have internal predecessors, (201), 0 states have call successors, (0), 0 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-29 06:41:29,050 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2023-11-29 06:41:29,050 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 26 of 55 [2023-11-29 06:41:29,050 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2023-11-29 06:41:29,563 INFO L124 PetriNetUnfolderBase]: 763/1636 cut-off events. [2023-11-29 06:41:29,563 INFO L125 PetriNetUnfolderBase]: For 1557/1905 co-relation queries the response was YES. [2023-11-29 06:41:29,569 INFO L83 FinitePrefix]: Finished finitePrefix Result has 4365 conditions, 1636 events. 763/1636 cut-off events. For 1557/1905 co-relation queries the response was YES. Maximal size of possible extension queue 154. Compared 10894 event pairs, 248 based on Foata normal form. 39/1529 useless extension candidates. Maximal degree in co-relation 4337. Up to 661 conditions per place. [2023-11-29 06:41:29,573 INFO L140 encePairwiseOnDemand]: 47/55 looper letters, 24 selfloop transitions, 3 changer transitions 38/91 dead transitions. [2023-11-29 06:41:29,573 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 79 places, 91 transitions, 508 flow [2023-11-29 06:41:29,574 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2023-11-29 06:41:29,574 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 8 states. [2023-11-29 06:41:29,575 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 8 states to 8 states and 269 transitions. [2023-11-29 06:41:29,575 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.6113636363636363 [2023-11-29 06:41:29,576 INFO L72 ComplementDD]: Start complementDD. Operand 8 states and 269 transitions. [2023-11-29 06:41:29,576 INFO L73 IsDeterministic]: Start isDeterministic. Operand 8 states and 269 transitions. [2023-11-29 06:41:29,576 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2023-11-29 06:41:29,576 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 8 states and 269 transitions. [2023-11-29 06:41:29,577 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 9 states, 8 states have (on average 33.625) internal successors, (269), 8 states have internal predecessors, (269), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-29 06:41:29,579 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 9 states, 9 states have (on average 55.0) internal successors, (495), 9 states have internal predecessors, (495), 0 states have call successors, (0), 0 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-29 06:41:29,579 INFO L81 ComplementDD]: Finished complementDD. Result has 9 states, 9 states have (on average 55.0) internal successors, (495), 9 states have internal predecessors, (495), 0 states have call successors, (0), 0 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-29 06:41:29,579 INFO L175 Difference]: Start difference. First operand has 76 places, 53 transitions, 251 flow. Second operand 8 states and 269 transitions. [2023-11-29 06:41:29,579 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 79 places, 91 transitions, 508 flow [2023-11-29 06:41:29,589 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 76 places, 91 transitions, 496 flow, removed 6 selfloop flow, removed 3 redundant places. [2023-11-29 06:41:29,591 INFO L231 Difference]: Finished difference. Result has 80 places, 49 transitions, 234 flow [2023-11-29 06:41:29,591 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=55, PETRI_DIFFERENCE_MINUEND_FLOW=243, PETRI_DIFFERENCE_MINUEND_PLACES=69, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=53, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=3, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=50, PETRI_DIFFERENCE_SUBTRAHEND_STATES=8, PETRI_FLOW=234, PETRI_PLACES=80, PETRI_TRANSITIONS=49} [2023-11-29 06:41:29,591 INFO L281 CegarLoopForPetriNet]: 60 programPoint places, 20 predicate places. [2023-11-29 06:41:29,592 INFO L495 AbstractCegarLoop]: Abstraction has has 80 places, 49 transitions, 234 flow [2023-11-29 06:41:29,592 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 7 states, 7 states have (on average 28.714285714285715) internal successors, (201), 7 states have internal predecessors, (201), 0 states have call successors, (0), 0 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-29 06:41:29,592 INFO L200 CegarLoopForPetriNet]: Found error trace [2023-11-29 06:41:29,592 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-11-29 06:41:29,592 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable15 [2023-11-29 06:41:29,593 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-29 06:41:29,593 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-11-29 06:41:29,593 INFO L85 PathProgramCache]: Analyzing trace with hash -1222540197, now seen corresponding path program 3 times [2023-11-29 06:41:29,593 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-11-29 06:41:29,593 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1187999758] [2023-11-29 06:41:29,593 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-11-29 06:41:29,594 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-11-29 06:41:29,637 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2023-11-29 06:41:29,638 INFO L356 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2023-11-29 06:41:29,677 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2023-11-29 06:41:29,713 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2023-11-29 06:41:29,714 INFO L360 BasicCegarLoop]: Counterexample is feasible [2023-11-29 06:41:29,715 INFO L805 garLoopResultBuilder]: Registering result UNSAFE for location ULTIMATE.startErr6ASSERT_VIOLATIONMEMORY_LEAK (12 of 13 remaining) [2023-11-29 06:41:29,716 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location P2Err0ASSERT_VIOLATIONMEMORY_LEAK (11 of 13 remaining) [2023-11-29 06:41:29,717 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE (10 of 13 remaining) [2023-11-29 06:41:29,717 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE (9 of 13 remaining) [2023-11-29 06:41:29,717 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (8 of 13 remaining) [2023-11-29 06:41:29,717 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr3REQUIRES_VIOLATIONMEMORY_DEREFERENCE (7 of 13 remaining) [2023-11-29 06:41:29,717 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr4REQUIRES_VIOLATIONMEMORY_DEREFERENCE (6 of 13 remaining) [2023-11-29 06:41:29,717 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr5REQUIRES_VIOLATIONMEMORY_DEREFERENCE (5 of 13 remaining) [2023-11-29 06:41:29,718 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr7ASSERT_VIOLATIONMEMORY_LEAK (4 of 13 remaining) [2023-11-29 06:41:29,718 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (3 of 13 remaining) [2023-11-29 06:41:29,718 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (2 of 13 remaining) [2023-11-29 06:41:29,718 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr2INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (1 of 13 remaining) [2023-11-29 06:41:29,718 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location P2Err0ASSERT_VIOLATIONMEMORY_LEAK (0 of 13 remaining) [2023-11-29 06:41:29,718 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable16 [2023-11-29 06:41:29,719 INFO L445 BasicCegarLoop]: Path program histogram: [3, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-11-29 06:41:29,725 INFO L228 ceAbstractionStarter]: Analysis of concurrent program completed with 1 thread instances [2023-11-29 06:41:29,725 INFO L178 ceAbstractionStarter]: Computing trace abstraction results [2023-11-29 06:41:29,798 WARN L1572 BoogieBacktranslator]: Unfinished Backtranslation: IdentifierExpression #t~pre3 could not be translated [2023-11-29 06:41:29,800 WARN L1572 BoogieBacktranslator]: Unfinished Backtranslation: IdentifierExpression #t~pre5 could not be translated [2023-11-29 06:41:29,801 WARN L1572 BoogieBacktranslator]: Unfinished Backtranslation: IdentifierExpression #t~pre7 could not be translated [2023-11-29 06:41:29,817 WARN L1572 BoogieBacktranslator]: Unfinished Backtranslation: unknown boogie variable #t~nondet0 [2023-11-29 06:41:29,819 WARN L1572 BoogieBacktranslator]: Unfinished Backtranslation: unknown boogie variable #t~nondet0 [2023-11-29 06:41:29,833 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 29.11 06:41:29 BasicIcfg [2023-11-29 06:41:29,834 INFO L131 PluginConnector]: ------------------------ END TraceAbstraction---------------------------- [2023-11-29 06:41:29,834 INFO L112 PluginConnector]: ------------------------Witness Printer---------------------------- [2023-11-29 06:41:29,834 INFO L270 PluginConnector]: Initializing Witness Printer... [2023-11-29 06:41:29,834 INFO L274 PluginConnector]: Witness Printer initialized [2023-11-29 06:41:29,835 INFO L184 PluginConnector]: Executing the observer RCFGCatcher from plugin Witness Printer for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 29.11 06:41:17" (3/4) ... [2023-11-29 06:41:29,836 INFO L140 WitnessPrinter]: No result that supports witness generation found [2023-11-29 06:41:29,837 INFO L131 PluginConnector]: ------------------------ END Witness Printer---------------------------- [2023-11-29 06:41:29,838 INFO L158 Benchmark]: Toolchain (without parser) took 13788.31ms. Allocated memory was 165.7MB in the beginning and 346.0MB in the end (delta: 180.4MB). Free memory was 131.0MB in the beginning and 302.2MB in the end (delta: -171.3MB). Peak memory consumption was 10.8MB. Max. memory is 16.1GB. [2023-11-29 06:41:29,838 INFO L158 Benchmark]: CDTParser took 0.23ms. Allocated memory is still 165.7MB. Free memory is still 137.8MB. There was no memory consumed. Max. memory is 16.1GB. [2023-11-29 06:41:29,839 INFO L158 Benchmark]: CACSL2BoogieTranslator took 599.37ms. Allocated memory is still 165.7MB. Free memory was 131.0MB in the beginning and 107.2MB in the end (delta: 23.7MB). Peak memory consumption was 23.1MB. Max. memory is 16.1GB. [2023-11-29 06:41:29,839 INFO L158 Benchmark]: Boogie Procedure Inliner took 62.69ms. Allocated memory is still 165.7MB. Free memory was 107.2MB in the beginning and 104.5MB in the end (delta: 2.8MB). Peak memory consumption was 2.1MB. Max. memory is 16.1GB. [2023-11-29 06:41:29,839 INFO L158 Benchmark]: Boogie Preprocessor took 66.63ms. Allocated memory is still 165.7MB. Free memory was 104.5MB in the beginning and 101.0MB in the end (delta: 3.4MB). Peak memory consumption was 4.2MB. Max. memory is 16.1GB. [2023-11-29 06:41:29,840 INFO L158 Benchmark]: RCFGBuilder took 862.85ms. Allocated memory was 165.7MB in the beginning and 199.2MB in the end (delta: 33.6MB). Free memory was 101.0MB in the beginning and 164.7MB in the end (delta: -63.7MB). Peak memory consumption was 59.2MB. Max. memory is 16.1GB. [2023-11-29 06:41:29,840 INFO L158 Benchmark]: TraceAbstraction took 12185.00ms. Allocated memory was 199.2MB in the beginning and 346.0MB in the end (delta: 146.8MB). Free memory was 163.7MB in the beginning and 302.2MB in the end (delta: -138.6MB). Peak memory consumption was 205.4MB. Max. memory is 16.1GB. [2023-11-29 06:41:29,841 INFO L158 Benchmark]: Witness Printer took 3.22ms. Allocated memory is still 346.0MB. Free memory is still 302.2MB. There was no memory consumed. Max. memory is 16.1GB. [2023-11-29 06:41:29,843 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.23ms. Allocated memory is still 165.7MB. Free memory is still 137.8MB. There was no memory consumed. Max. memory is 16.1GB. * CACSL2BoogieTranslator took 599.37ms. Allocated memory is still 165.7MB. Free memory was 131.0MB in the beginning and 107.2MB in the end (delta: 23.7MB). Peak memory consumption was 23.1MB. Max. memory is 16.1GB. * Boogie Procedure Inliner took 62.69ms. Allocated memory is still 165.7MB. Free memory was 107.2MB in the beginning and 104.5MB in the end (delta: 2.8MB). Peak memory consumption was 2.1MB. Max. memory is 16.1GB. * Boogie Preprocessor took 66.63ms. Allocated memory is still 165.7MB. Free memory was 104.5MB in the beginning and 101.0MB in the end (delta: 3.4MB). Peak memory consumption was 4.2MB. Max. memory is 16.1GB. * RCFGBuilder took 862.85ms. Allocated memory was 165.7MB in the beginning and 199.2MB in the end (delta: 33.6MB). Free memory was 101.0MB in the beginning and 164.7MB in the end (delta: -63.7MB). Peak memory consumption was 59.2MB. Max. memory is 16.1GB. * TraceAbstraction took 12185.00ms. Allocated memory was 199.2MB in the beginning and 346.0MB in the end (delta: 146.8MB). Free memory was 163.7MB in the beginning and 302.2MB in the end (delta: -138.6MB). Peak memory consumption was 205.4MB. Max. memory is 16.1GB. * Witness Printer took 3.22ms. Allocated memory is still 346.0MB. Free memory is still 302.2MB. 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~pre3 could not be translated - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: IdentifierExpression #t~pre5 could not be translated - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: IdentifierExpression #t~pre7 could not be translated - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: 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_p2_EAX = 0; [L715] 0 int __unbuffered_p2_EBX = 0; [L717] 0 int a = 0; [L718] 0 _Bool main$tmp_guard0; [L719] 0 _Bool main$tmp_guard1; [L721] 0 int x = 0; [L723] 0 int y = 0; [L724] 0 _Bool y$flush_delayed; [L725] 0 int y$mem_tmp; [L726] 0 _Bool y$r_buff0_thd0; [L727] 0 _Bool y$r_buff0_thd1; [L728] 0 _Bool y$r_buff0_thd2; [L729] 0 _Bool y$r_buff0_thd3; [L730] 0 _Bool y$r_buff1_thd0; [L731] 0 _Bool y$r_buff1_thd1; [L732] 0 _Bool y$r_buff1_thd2; [L733] 0 _Bool y$r_buff1_thd3; [L734] 0 _Bool y$read_delayed; [L735] 0 int *y$read_delayed_var; [L736] 0 int y$w_buff0; [L737] 0 _Bool y$w_buff0_used; [L738] 0 int y$w_buff1; [L739] 0 _Bool y$w_buff1_used; [L741] 0 int z = 0; [L742] 0 _Bool weak$$choice0; [L743] 0 _Bool weak$$choice2; [L825] 0 pthread_t t1108; [L826] FCALL, FORK 0 pthread_create(&t1108, ((void *)0), P0, ((void *)0)) VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=0, __unbuffered_p2_EAX=0, __unbuffered_p2_EBX=0, a=0, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, t1108={5:0}, weak$$choice0=0, weak$$choice2=0, x=0, y$flush_delayed=0, y$mem_tmp=0, y$r_buff0_thd0=0, y$r_buff0_thd1=0, y$r_buff0_thd2=0, y$r_buff0_thd3=0, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$r_buff1_thd3=0, y$read_delayed=0, y$read_delayed_var={0:0}, y$w_buff0=0, y$w_buff0_used=0, y$w_buff1=0, y$w_buff1_used=0, y=0, z=0] [L827] 0 pthread_t t1109; [L828] FCALL, FORK 0 pthread_create(&t1109, ((void *)0), P1, ((void *)0)) VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=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, t1108={5:0}, t1109={6:0}, weak$$choice0=0, weak$$choice2=0, x=0, y$flush_delayed=0, y$mem_tmp=0, y$r_buff0_thd0=0, y$r_buff0_thd1=0, y$r_buff0_thd2=0, y$r_buff0_thd3=0, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$r_buff1_thd3=0, y$read_delayed=0, y$read_delayed_var={0:0}, y$w_buff0=0, y$w_buff0_used=0, y$w_buff1=0, y$w_buff1_used=0, y=0, z=0] [L829] 0 pthread_t t1110; [L830] FCALL, FORK 0 pthread_create(&t1110, ((void *)0), P2, ((void *)0)) VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=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, t1108={5:0}, t1109={6:0}, t1110={3:0}, weak$$choice0=0, weak$$choice2=0, x=0, y$flush_delayed=0, y$mem_tmp=0, y$r_buff0_thd0=0, y$r_buff0_thd1=0, y$r_buff0_thd2=0, y$r_buff0_thd3=0, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$r_buff1_thd3=0, y$read_delayed=0, y$read_delayed_var={0:0}, y$w_buff0=0, y$w_buff0_used=0, y$w_buff1=0, y$w_buff1_used=0, y=0, z=0] [L782] 3 y$w_buff1 = y$w_buff0 [L783] 3 y$w_buff0 = 2 [L784] 3 y$w_buff1_used = y$w_buff0_used [L785] 3 y$w_buff0_used = (_Bool)1 [L786] CALL 3 __VERIFIER_assert(!(y$w_buff1_used && y$w_buff0_used)) [L18] COND FALSE 3 !(!expression) [L786] RET 3 __VERIFIER_assert(!(y$w_buff1_used && y$w_buff0_used)) [L787] 3 y$r_buff1_thd0 = y$r_buff0_thd0 [L788] 3 y$r_buff1_thd1 = y$r_buff0_thd1 [L789] 3 y$r_buff1_thd2 = y$r_buff0_thd2 [L790] 3 y$r_buff1_thd3 = y$r_buff0_thd3 [L791] 3 y$r_buff0_thd3 = (_Bool)1 VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=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$flush_delayed=0, y$mem_tmp=0, y$r_buff0_thd0=0, y$r_buff0_thd1=0, y$r_buff0_thd2=0, y$r_buff0_thd3=1, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$r_buff1_thd3=0, y$read_delayed=0, y$read_delayed_var={0:0}, y$w_buff0=2, y$w_buff0_used=1, y$w_buff1=0, y$w_buff1_used=0, y=0, z=0] [L794] 3 z = 1 VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=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$flush_delayed=0, y$mem_tmp=0, y$r_buff0_thd0=0, y$r_buff0_thd1=0, y$r_buff0_thd2=0, y$r_buff0_thd3=1, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$r_buff1_thd3=0, y$read_delayed=0, y$read_delayed_var={0:0}, y$w_buff0=2, y$w_buff0_used=1, y$w_buff1=0, y$w_buff1_used=0, y=0, z=1] [L797] 3 __unbuffered_p2_EAX = z VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=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$$choice0=0, weak$$choice2=0, x=0, y$flush_delayed=0, y$mem_tmp=0, y$r_buff0_thd0=0, y$r_buff0_thd1=0, y$r_buff0_thd2=0, y$r_buff0_thd3=1, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$r_buff1_thd3=0, y$read_delayed=0, y$read_delayed_var={0:0}, y$w_buff0=2, y$w_buff0_used=1, y$w_buff1=0, y$w_buff1_used=0, y=0, z=1] [L800] 3 __unbuffered_p2_EBX = a VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=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$$choice0=0, weak$$choice2=0, x=0, y$flush_delayed=0, y$mem_tmp=0, y$r_buff0_thd0=0, y$r_buff0_thd1=0, y$r_buff0_thd2=0, y$r_buff0_thd3=1, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$r_buff1_thd3=0, y$read_delayed=0, y$read_delayed_var={0:0}, y$w_buff0=2, y$w_buff0_used=1, y$w_buff1=0, y$w_buff1_used=0, y=0, z=1] [L747] 1 a = 1 VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=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$$choice0=0, weak$$choice2=0, x=0, y$flush_delayed=0, y$mem_tmp=0, y$r_buff0_thd0=0, y$r_buff0_thd1=0, y$r_buff0_thd2=0, y$r_buff0_thd3=1, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$r_buff1_thd3=0, y$read_delayed=0, y$read_delayed_var={0:0}, y$w_buff0=2, y$w_buff0_used=1, y$w_buff1=0, y$w_buff1_used=0, y=0, z=1] [L750] 1 __unbuffered_p0_EAX = x VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=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$$choice0=0, weak$$choice2=0, x=0, y$flush_delayed=0, y$mem_tmp=0, y$r_buff0_thd0=0, y$r_buff0_thd1=0, y$r_buff0_thd2=0, y$r_buff0_thd3=1, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$r_buff1_thd3=0, y$read_delayed=0, y$read_delayed_var={0:0}, y$w_buff0=2, y$w_buff0_used=1, y$w_buff1=0, y$w_buff1_used=0, y=0, z=1] [L762] 2 x = 1 VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=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$$choice0=0, weak$$choice2=0, x=1, y$flush_delayed=0, y$mem_tmp=0, y$r_buff0_thd0=0, y$r_buff0_thd1=0, y$r_buff0_thd2=0, y$r_buff0_thd3=1, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$r_buff1_thd3=0, y$read_delayed=0, y$read_delayed_var={0:0}, y$w_buff0=2, y$w_buff0_used=1, y$w_buff1=0, y$w_buff1_used=0, y=0, z=1] [L765] 2 y = 1 VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=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$$choice0=0, weak$$choice2=0, x=1, y$flush_delayed=0, y$mem_tmp=0, y$r_buff0_thd0=0, y$r_buff0_thd1=0, y$r_buff0_thd2=0, y$r_buff0_thd3=1, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$r_buff1_thd3=0, y$read_delayed=0, y$read_delayed_var={0:0}, y$w_buff0=2, y$w_buff0_used=1, y$w_buff1=0, y$w_buff1_used=0, y=1, z=1] [L768] 2 y = y$w_buff0_used && y$r_buff0_thd2 ? y$w_buff0 : (y$w_buff1_used && y$r_buff1_thd2 ? y$w_buff1 : y) [L769] 2 y$w_buff0_used = y$w_buff0_used && y$r_buff0_thd2 ? (_Bool)0 : y$w_buff0_used [L770] 2 y$w_buff1_used = y$w_buff0_used && y$r_buff0_thd2 || y$w_buff1_used && y$r_buff1_thd2 ? (_Bool)0 : y$w_buff1_used [L771] 2 y$r_buff0_thd2 = y$w_buff0_used && y$r_buff0_thd2 ? (_Bool)0 : y$r_buff0_thd2 [L772] 2 y$r_buff1_thd2 = y$w_buff0_used && y$r_buff0_thd2 || y$w_buff1_used && y$r_buff1_thd2 ? (_Bool)0 : y$r_buff1_thd2 VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=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$$choice0=0, weak$$choice2=0, x=1, y$flush_delayed=0, y$mem_tmp=0, y$r_buff0_thd0=0, y$r_buff0_thd1=0, y$r_buff0_thd2=0, y$r_buff0_thd3=1, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$r_buff1_thd3=0, y$read_delayed=0, y$read_delayed_var={0:0}, y$w_buff0=2, y$w_buff0_used=1, y$w_buff1=0, y$w_buff1_used=0, y=1, z=1] [L755] 1 __unbuffered_cnt = __unbuffered_cnt + 1 VAL [__unbuffered_cnt=1, __unbuffered_p0_EAX=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$$choice0=0, weak$$choice2=0, x=1, y$flush_delayed=0, y$mem_tmp=0, y$r_buff0_thd0=0, y$r_buff0_thd1=0, y$r_buff0_thd2=0, y$r_buff0_thd3=1, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$r_buff1_thd3=0, y$read_delayed=0, y$read_delayed_var={0:0}, y$w_buff0=2, y$w_buff0_used=1, y$w_buff1=0, y$w_buff1_used=0, y=1, z=1] [L775] 2 __unbuffered_cnt = __unbuffered_cnt + 1 VAL [__unbuffered_cnt=2, __unbuffered_p0_EAX=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$$choice0=0, weak$$choice2=0, x=1, y$flush_delayed=0, y$mem_tmp=0, y$r_buff0_thd0=0, y$r_buff0_thd1=0, y$r_buff0_thd2=0, y$r_buff0_thd3=1, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$r_buff1_thd3=0, y$read_delayed=0, y$read_delayed_var={0:0}, y$w_buff0=2, y$w_buff0_used=1, y$w_buff1=0, y$w_buff1_used=0, y=1, z=1] [L803] 3 y = y$w_buff0_used && y$r_buff0_thd3 ? y$w_buff0 : (y$w_buff1_used && y$r_buff1_thd3 ? y$w_buff1 : y) [L804] 3 y$w_buff0_used = y$w_buff0_used && y$r_buff0_thd3 ? (_Bool)0 : y$w_buff0_used [L805] 3 y$w_buff1_used = y$w_buff0_used && y$r_buff0_thd3 || y$w_buff1_used && y$r_buff1_thd3 ? (_Bool)0 : y$w_buff1_used [L806] 3 y$r_buff0_thd3 = y$w_buff0_used && y$r_buff0_thd3 ? (_Bool)0 : y$r_buff0_thd3 [L807] 3 y$r_buff1_thd3 = y$w_buff0_used && y$r_buff0_thd3 || y$w_buff1_used && y$r_buff1_thd3 ? (_Bool)0 : y$r_buff1_thd3 VAL [__unbuffered_cnt=2, __unbuffered_p0_EAX=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$$choice0=0, weak$$choice2=0, x=1, y$flush_delayed=0, y$mem_tmp=0, y$r_buff0_thd0=0, y$r_buff0_thd1=0, y$r_buff0_thd2=0, y$r_buff0_thd3=1, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$r_buff1_thd3=0, y$read_delayed=0, y$read_delayed_var={0:0}, y$w_buff0=2, y$w_buff0_used=0, y$w_buff1=0, y$w_buff1_used=0, y=2, z=1] [L810] 3 __unbuffered_cnt = __unbuffered_cnt + 1 VAL [__unbuffered_cnt=3, __unbuffered_p0_EAX=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$$choice0=0, weak$$choice2=0, x=1, y$flush_delayed=0, y$mem_tmp=0, y$r_buff0_thd0=0, y$r_buff0_thd1=0, y$r_buff0_thd2=0, y$r_buff0_thd3=1, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$r_buff1_thd3=0, y$read_delayed=0, y$read_delayed_var={0:0}, y$w_buff0=2, y$w_buff0_used=0, y$w_buff1=0, y$w_buff1_used=0, y=2, z=1] [L832] 0 main$tmp_guard0 = __unbuffered_cnt == 3 VAL [__unbuffered_cnt=3, __unbuffered_p0_EAX=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, t1108={5:0}, t1109={6:0}, t1110={3:0}, weak$$choice0=0, weak$$choice2=0, x=1, y$flush_delayed=0, y$mem_tmp=0, y$r_buff0_thd0=0, y$r_buff0_thd1=0, y$r_buff0_thd2=0, y$r_buff0_thd3=1, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$r_buff1_thd3=0, y$read_delayed=0, y$read_delayed_var={0:0}, y$w_buff0=2, y$w_buff0_used=0, y$w_buff1=0, y$w_buff1_used=0, y=2, z=1] [L834] CALL 0 assume_abort_if_not(main$tmp_guard0) [L3] COND FALSE 0 !(!cond) [L834] RET 0 assume_abort_if_not(main$tmp_guard0) [L836] 0 y = y$w_buff0_used && y$r_buff0_thd0 ? y$w_buff0 : (y$w_buff1_used && y$r_buff1_thd0 ? y$w_buff1 : y) [L837] 0 y$w_buff0_used = y$w_buff0_used && y$r_buff0_thd0 ? (_Bool)0 : y$w_buff0_used [L838] 0 y$w_buff1_used = y$w_buff0_used && y$r_buff0_thd0 || y$w_buff1_used && y$r_buff1_thd0 ? (_Bool)0 : y$w_buff1_used [L839] 0 y$r_buff0_thd0 = y$w_buff0_used && y$r_buff0_thd0 ? (_Bool)0 : y$r_buff0_thd0 [L840] 0 y$r_buff1_thd0 = y$w_buff0_used && y$r_buff0_thd0 || y$w_buff1_used && y$r_buff1_thd0 ? (_Bool)0 : y$r_buff1_thd0 VAL [__unbuffered_cnt=3, __unbuffered_p0_EAX=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, t1108={5:0}, t1109={6:0}, t1110={3:0}, weak$$choice0=0, weak$$choice2=0, x=1, y$flush_delayed=0, y$mem_tmp=0, y$r_buff0_thd0=0, y$r_buff0_thd1=0, y$r_buff0_thd2=0, y$r_buff0_thd3=1, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$r_buff1_thd3=0, y$read_delayed=0, y$read_delayed_var={0:0}, y$w_buff0=2, y$w_buff0_used=0, y$w_buff1=0, y$w_buff1_used=0, y=2, z=1] [L843] 0 weak$$choice0 = __VERIFIER_nondet_bool() [L844] 0 weak$$choice2 = __VERIFIER_nondet_bool() [L845] 0 y$flush_delayed = weak$$choice2 [L846] 0 y$mem_tmp = y [L847] 0 y = !y$w_buff0_used || !y$r_buff0_thd0 && !y$w_buff1_used || !y$r_buff0_thd0 && !y$r_buff1_thd0 ? y : (y$w_buff0_used && y$r_buff0_thd0 ? y$w_buff0 : y$w_buff1) [L848] 0 y$w_buff0 = weak$$choice2 ? y$w_buff0 : (!y$w_buff0_used || !y$r_buff0_thd0 && !y$w_buff1_used || !y$r_buff0_thd0 && !y$r_buff1_thd0 ? y$w_buff0 : (y$w_buff0_used && y$r_buff0_thd0 ? y$w_buff0 : y$w_buff0)) [L849] 0 y$w_buff1 = weak$$choice2 ? y$w_buff1 : (!y$w_buff0_used || !y$r_buff0_thd0 && !y$w_buff1_used || !y$r_buff0_thd0 && !y$r_buff1_thd0 ? y$w_buff1 : (y$w_buff0_used && y$r_buff0_thd0 ? y$w_buff1 : y$w_buff1)) [L850] 0 y$w_buff0_used = weak$$choice2 ? y$w_buff0_used : (!y$w_buff0_used || !y$r_buff0_thd0 && !y$w_buff1_used || !y$r_buff0_thd0 && !y$r_buff1_thd0 ? y$w_buff0_used : (y$w_buff0_used && y$r_buff0_thd0 ? (_Bool)0 : y$w_buff0_used)) [L851] 0 y$w_buff1_used = weak$$choice2 ? y$w_buff1_used : (!y$w_buff0_used || !y$r_buff0_thd0 && !y$w_buff1_used || !y$r_buff0_thd0 && !y$r_buff1_thd0 ? y$w_buff1_used : (y$w_buff0_used && y$r_buff0_thd0 ? (_Bool)0 : (_Bool)0)) [L852] 0 y$r_buff0_thd0 = weak$$choice2 ? y$r_buff0_thd0 : (!y$w_buff0_used || !y$r_buff0_thd0 && !y$w_buff1_used || !y$r_buff0_thd0 && !y$r_buff1_thd0 ? y$r_buff0_thd0 : (y$w_buff0_used && y$r_buff0_thd0 ? (_Bool)0 : y$r_buff0_thd0)) [L853] 0 y$r_buff1_thd0 = weak$$choice2 ? y$r_buff1_thd0 : (!y$w_buff0_used || !y$r_buff0_thd0 && !y$w_buff1_used || !y$r_buff0_thd0 && !y$r_buff1_thd0 ? y$r_buff1_thd0 : (y$w_buff0_used && y$r_buff0_thd0 ? (_Bool)0 : (_Bool)0)) [L854] 0 main$tmp_guard1 = !(y == 2 && __unbuffered_p0_EAX == 0 && __unbuffered_p2_EAX == 1 && __unbuffered_p2_EBX == 0) [L855] 0 y = y$flush_delayed ? y$mem_tmp : y [L856] 0 y$flush_delayed = (_Bool)0 VAL [__unbuffered_cnt=3, __unbuffered_p0_EAX=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, t1108={5:0}, t1109={6:0}, t1110={3:0}, weak$$choice2=0, x=1, y$flush_delayed=0, y$mem_tmp=2, y$r_buff0_thd0=0, y$r_buff0_thd1=0, y$r_buff0_thd2=0, y$r_buff0_thd3=1, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$r_buff1_thd3=0, y$read_delayed=0, y$read_delayed_var={0:0}, y$w_buff0=2, y$w_buff0_used=0, y$w_buff1=0, y$w_buff1_used=0, y=2, z=1] [L858] 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=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$flush_delayed=0, y$mem_tmp=2, y$r_buff0_thd0=0, y$r_buff0_thd1=0, y$r_buff0_thd2=0, y$r_buff0_thd3=1, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$r_buff1_thd3=0, y$read_delayed=0, y$read_delayed_var={0:0}, y$w_buff0=2, y$w_buff0_used=0, y$w_buff1=0, y$w_buff1_used=0, y=2, z=1] [L17] 0 __assert_fail ("0", "mix042.opt.c", 8, __extension__ __PRETTY_FUNCTION__) VAL [__unbuffered_cnt=3, __unbuffered_p0_EAX=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$flush_delayed=0, y$mem_tmp=2, y$r_buff0_thd0=0, y$r_buff0_thd1=0, y$r_buff0_thd2=0, y$r_buff0_thd3=1, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$r_buff1_thd3=0, y$read_delayed=0, y$read_delayed_var={0:0}, y$w_buff0=2, y$w_buff0_used=0, y$w_buff1=0, y$w_buff1_used=0, y=2, z=1] - UnprovableResult [Line: 17]: Unable to prove that all allocated memory was freed Unable to prove that all allocated memory was freed Reason: Not analyzed. - UnprovableResult [Line: -1]: Unable to prove that pointer dereference always succeeds Unable to prove that pointer dereference always succeeds Reason: Not analyzed. - UnprovableResult [Line: -1]: Unable to prove that pointer dereference always succeeds Unable to prove that pointer dereference always succeeds Reason: Not analyzed. - UnprovableResult [Line: -1]: Unable to prove that pointer dereference always succeeds Unable to prove that pointer dereference always succeeds Reason: Not analyzed. - UnprovableResult [Line: -1]: Unable to prove that pointer dereference always succeeds Unable to prove that pointer dereference always succeeds Reason: Not analyzed. - UnprovableResult [Line: -1]: Unable to prove that pointer dereference always succeeds Unable to prove that pointer dereference always succeeds Reason: Not analyzed. - UnprovableResult [Line: -1]: Unable to prove that pointer dereference always succeeds Unable to prove that pointer dereference always succeeds Reason: Not analyzed. - UnprovableResult [Line: 823]: Unable to prove that all allocated memory was freed Unable to prove that all allocated memory was freed Reason: Not analyzed. - UnprovableResult [Line: 828]: 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: 830]: 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: 826]: Unable to prove that petrification did provide enough thread instances (tool internal message) Unable to prove that petrification did provide enough thread instances (tool internal message) Reason: Not analyzed. - StatisticsResult: Ultimate Automizer benchmark data with 1 thread instances CFG has 7 procedures, 81 locations, 13 error locations. Started 1 CEGAR loops. EmptinessCheckTime: 0.0s, RemoveRedundantFlowTime: 0.0s, RemoveRedundantFlowUnfoldingTime: 0.0s, BackfoldingTime: 0.0s, BackfoldingUnfoldingTime: 0.0s, FlowIncreaseByBackfolding: 0, BasicCegarLoop: OverallTime: 11.9s, OverallIterations: 17, TraceHistogramMax: 1, PathProgramHistogramMax: 3, EmptinessCheckTime: 0.0s, AutomataDifference: 6.4s, DeadEndRemovalTime: 0.0s, HoareAnnotationTime: 0.0s, InitialAbstractionConstructionTime: 0.1s, HoareTripleCheckerStatistics: 0 mSolverCounterUnknown, 671 SdHoareTripleChecker+Valid, 2.4s IncrementalHoareTripleChecker+Time, 0 mSdLazyCounter, 572 mSDsluCounter, 176 SdHoareTripleChecker+Invalid, 2.0s Time, 0 mProtectedAction, 0 SdHoareTripleChecker+Unchecked, 0 IncrementalHoareTripleChecker+Unchecked, 134 mSDsCounter, 42 IncrementalHoareTripleChecker+Valid, 0 mProtectedPredicate, 1532 IncrementalHoareTripleChecker+Invalid, 1574 SdHoareTripleChecker+Unknown, 0 mSolverCounterNotChecked, 42 mSolverCounterUnsat, 42 mSDtfsCounter, 1532 mSolverCounterSat, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Unknown, PredicateUnifierStatistics: 0 DeclaredPredicates, 85 GetRequests, 16 SyntacticMatches, 1 SemanticMatches, 68 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 29 ImplicationChecksByTransitivity, 0.9s Time, 0.0s BasicInterpolantAutomatonTime, BiggestAbstraction: size=251occurred in iteration=15, InterpolantAutomatonStates: 82, 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.3s SatisfiabilityAnalysisTime, 4.6s InterpolantComputationTime, 305 NumberOfCodeBlocks, 305 NumberOfCodeBlocksAsserted, 17 NumberOfCheckSat, 254 ConstructedInterpolants, 0 QuantifiedInterpolants, 1785 SizeOfPredicates, 0 NumberOfNonLiveVariables, 0 ConjunctsInSsa, 0 ConjunctsInUnsatCore, 16 InterpolantComputations, 16 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-29 06:41:29,873 INFO L540 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_f41a68e7-fafa-48a2-aca6-8783e0010a4f/bin/uautomizer-verify-BQ2R08f2Ya/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_f41a68e7-fafa-48a2-aca6-8783e0010a4f/bin/uautomizer-verify-BQ2R08f2Ya/data/config -Xmx15G -Xms4m -jar /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_f41a68e7-fafa-48a2-aca6-8783e0010a4f/bin/uautomizer-verify-BQ2R08f2Ya/plugins/org.eclipse.equinox.launcher_1.5.800.v20200727-1323.jar -data @noDefault -ultimatedata /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_f41a68e7-fafa-48a2-aca6-8783e0010a4f/bin/uautomizer-verify-BQ2R08f2Ya/data -tc /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_f41a68e7-fafa-48a2-aca6-8783e0010a4f/bin/uautomizer-verify-BQ2R08f2Ya/config/AutomizerMemDerefMemtrack.xml -i ../../sv-benchmarks/c/pthread-wmm/mix042.opt.i -s /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_f41a68e7-fafa-48a2-aca6-8783e0010a4f/bin/uautomizer-verify-BQ2R08f2Ya/config/svcomp-DerefFreeMemtrack-32bit-Automizer_Bitvector.epf --cacsl2boogietranslator.entry.function main --witnessprinter.witness.directory /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_f41a68e7-fafa-48a2-aca6-8783e0010a4f/bin/uautomizer-verify-BQ2R08f2Ya --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 94656be5559ee6994f8d95e82c06571dfbe5b53833c4e842ade3fa022ec89a57 --- Real Ultimate output --- This is Ultimate 0.2.4-dev-0e0057c [2023-11-29 06:41:32,269 INFO L188 SettingsManager]: Resetting all preferences to default values... [2023-11-29 06:41:32,365 INFO L114 SettingsManager]: Loading settings from /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_f41a68e7-fafa-48a2-aca6-8783e0010a4f/bin/uautomizer-verify-BQ2R08f2Ya/config/svcomp-DerefFreeMemtrack-32bit-Automizer_Bitvector.epf [2023-11-29 06:41:32,372 WARN L101 SettingsManager]: Preference file contains the following unknown settings: [2023-11-29 06:41:32,373 WARN L103 SettingsManager]: * de.uni_freiburg.informatik.ultimate.core.Log level for class [2023-11-29 06:41:32,404 INFO L130 SettingsManager]: Preferences different from defaults after loading the file: [2023-11-29 06:41:32,405 INFO L151 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2023-11-29 06:41:32,406 INFO L153 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2023-11-29 06:41:32,407 INFO L151 SettingsManager]: Preferences of Boogie Preprocessor differ from their defaults: [2023-11-29 06:41:32,407 INFO L153 SettingsManager]: * Use memory slicer=true [2023-11-29 06:41:32,408 INFO L151 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2023-11-29 06:41:32,409 INFO L153 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2023-11-29 06:41:32,410 INFO L151 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2023-11-29 06:41:32,411 INFO L153 SettingsManager]: * Create parallel compositions if possible=false [2023-11-29 06:41:32,412 INFO L153 SettingsManager]: * Use SBE=true [2023-11-29 06:41:32,413 INFO L151 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2023-11-29 06:41:32,413 INFO L153 SettingsManager]: * sizeof long=4 [2023-11-29 06:41:32,414 INFO L153 SettingsManager]: * Overapproximate operations on floating types=true [2023-11-29 06:41:32,415 INFO L153 SettingsManager]: * sizeof POINTER=4 [2023-11-29 06:41:32,416 INFO L153 SettingsManager]: * Check division by zero=IGNORE [2023-11-29 06:41:32,416 INFO L153 SettingsManager]: * Check for the main procedure if all allocated memory was freed=true [2023-11-29 06:41:32,417 INFO L153 SettingsManager]: * Bitprecise bitfields=true [2023-11-29 06:41:32,418 INFO L153 SettingsManager]: * SV-COMP memtrack compatibility mode=true [2023-11-29 06:41:32,418 INFO L153 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2023-11-29 06:41:32,419 INFO L153 SettingsManager]: * Adapt memory model on pointer casts if necessary=true [2023-11-29 06:41:32,419 INFO L153 SettingsManager]: * Use bitvectors instead of ints=true [2023-11-29 06:41:32,420 INFO L153 SettingsManager]: * Memory model=HoenickeLindenmann_4ByteResolution [2023-11-29 06:41:32,420 INFO L153 SettingsManager]: * Check unreachability of reach_error function=false [2023-11-29 06:41:32,421 INFO L153 SettingsManager]: * sizeof long double=12 [2023-11-29 06:41:32,421 INFO L153 SettingsManager]: * Use constant arrays=true [2023-11-29 06:41:32,422 INFO L151 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2023-11-29 06:41:32,422 INFO L153 SettingsManager]: * Size of a code block=SequenceOfStatements [2023-11-29 06:41:32,423 INFO L153 SettingsManager]: * Only consider context switches at boundaries of atomic blocks=true [2023-11-29 06:41:32,423 INFO L153 SettingsManager]: * SMT solver=External_DefaultMode [2023-11-29 06:41:32,423 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2023-11-29 06:41:32,424 INFO L151 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2023-11-29 06:41:32,424 INFO L153 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2023-11-29 06:41:32,424 INFO L153 SettingsManager]: * Trace refinement strategy=WOLF [2023-11-29 06:41:32,424 INFO L153 SettingsManager]: * Command for external solver=cvc4 --incremental --print-success --lang smt [2023-11-29 06:41:32,425 INFO L153 SettingsManager]: * Apply one-shot large block encoding in concurrent analysis=false [2023-11-29 06:41:32,425 INFO L153 SettingsManager]: * Automaton type used in concurrency analysis=PETRI_NET [2023-11-29 06:41:32,425 INFO L153 SettingsManager]: * Order on configurations for Petri net unfoldings=DBO [2023-11-29 06:41:32,426 INFO L153 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2023-11-29 06:41:32,426 INFO L153 SettingsManager]: * Logic for external solver=AUFBV [2023-11-29 06:41:32,426 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_f41a68e7-fafa-48a2-aca6-8783e0010a4f/bin/uautomizer-verify-BQ2R08f2Ya/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_f41a68e7-fafa-48a2-aca6-8783e0010a4f/bin/uautomizer-verify-BQ2R08f2Ya 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 -> 94656be5559ee6994f8d95e82c06571dfbe5b53833c4e842ade3fa022ec89a57 [2023-11-29 06:41:32,780 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2023-11-29 06:41:32,805 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2023-11-29 06:41:32,807 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2023-11-29 06:41:32,809 INFO L270 PluginConnector]: Initializing CDTParser... [2023-11-29 06:41:32,809 INFO L274 PluginConnector]: CDTParser initialized [2023-11-29 06:41:32,810 INFO L431 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_f41a68e7-fafa-48a2-aca6-8783e0010a4f/bin/uautomizer-verify-BQ2R08f2Ya/../../sv-benchmarks/c/pthread-wmm/mix042.opt.i [2023-11-29 06:41:36,251 INFO L533 CDTParser]: Created temporary CDT project at NULL [2023-11-29 06:41:36,576 INFO L384 CDTParser]: Found 1 translation units. [2023-11-29 06:41:36,577 INFO L180 CDTParser]: Scanning /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_f41a68e7-fafa-48a2-aca6-8783e0010a4f/sv-benchmarks/c/pthread-wmm/mix042.opt.i [2023-11-29 06:41:36,601 INFO L427 CDTParser]: About to delete temporary CDT project at /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_f41a68e7-fafa-48a2-aca6-8783e0010a4f/bin/uautomizer-verify-BQ2R08f2Ya/data/e76ba38e1/2d3f5ea39fd84daa875b3b443c1e316a/FLAG5b008e146 [2023-11-29 06:41:36,617 INFO L435 CDTParser]: Successfully deleted /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_f41a68e7-fafa-48a2-aca6-8783e0010a4f/bin/uautomizer-verify-BQ2R08f2Ya/data/e76ba38e1/2d3f5ea39fd84daa875b3b443c1e316a [2023-11-29 06:41:36,620 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2023-11-29 06:41:36,622 INFO L133 ToolchainWalker]: Walking toolchain with 6 elements. [2023-11-29 06:41:36,624 INFO L112 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2023-11-29 06:41:36,624 INFO L270 PluginConnector]: Initializing CACSL2BoogieTranslator... [2023-11-29 06:41:36,630 INFO L274 PluginConnector]: CACSL2BoogieTranslator initialized [2023-11-29 06:41:36,631 INFO L184 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 29.11 06:41:36" (1/1) ... [2023-11-29 06:41:36,632 INFO L204 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@17e2d57f and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 29.11 06:41:36, skipping insertion in model container [2023-11-29 06:41:36,632 INFO L184 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 29.11 06:41:36" (1/1) ... [2023-11-29 06:41:36,686 INFO L177 MainTranslator]: Built tables and reachable declarations [2023-11-29 06:41:37,088 INFO L209 PostProcessor]: Analyzing one entry point: main [2023-11-29 06:41:37,107 INFO L202 MainTranslator]: Completed pre-run [2023-11-29 06:41:37,181 INFO L209 PostProcessor]: Analyzing one entry point: main [2023-11-29 06:41:37,219 WARN L675 CHandler]: The function __VERIFIER_atomic_begin is called, but not defined or handled by StandardFunctionHandler. [2023-11-29 06:41:37,220 WARN L675 CHandler]: The function __VERIFIER_atomic_end is called, but not defined or handled by StandardFunctionHandler. [2023-11-29 06:41:37,225 INFO L206 MainTranslator]: Completed translation [2023-11-29 06:41:37,226 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 29.11 06:41:37 WrapperNode [2023-11-29 06:41:37,226 INFO L131 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2023-11-29 06:41:37,227 INFO L112 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2023-11-29 06:41:37,227 INFO L270 PluginConnector]: Initializing Boogie Procedure Inliner... [2023-11-29 06:41:37,227 INFO L274 PluginConnector]: Boogie Procedure Inliner initialized [2023-11-29 06:41:37,234 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 29.11 06:41:37" (1/1) ... [2023-11-29 06:41:37,256 INFO L184 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 29.11 06:41:37" (1/1) ... [2023-11-29 06:41:37,293 INFO L138 Inliner]: procedures = 179, calls = 59, calls flagged for inlining = 6, calls inlined = 7, statements flattened = 159 [2023-11-29 06:41:37,294 INFO L131 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2023-11-29 06:41:37,295 INFO L112 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2023-11-29 06:41:37,295 INFO L270 PluginConnector]: Initializing Boogie Preprocessor... [2023-11-29 06:41:37,296 INFO L274 PluginConnector]: Boogie Preprocessor initialized [2023-11-29 06:41:37,310 INFO L184 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 29.11 06:41:37" (1/1) ... [2023-11-29 06:41:37,311 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 29.11 06:41:37" (1/1) ... [2023-11-29 06:41:37,317 INFO L184 PluginConnector]: Executing the observer MemorySlicer from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 29.11 06:41:37" (1/1) ... [2023-11-29 06:41:37,340 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-29 06:41:37,340 INFO L184 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 29.11 06:41:37" (1/1) ... [2023-11-29 06:41:37,341 INFO L184 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 29.11 06:41:37" (1/1) ... [2023-11-29 06:41:37,355 INFO L184 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 29.11 06:41:37" (1/1) ... [2023-11-29 06:41:37,358 INFO L184 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 29.11 06:41:37" (1/1) ... [2023-11-29 06:41:37,362 INFO L184 PluginConnector]: Executing the observer LTLStepAnnotator from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 29.11 06:41:37" (1/1) ... [2023-11-29 06:41:37,365 INFO L184 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 29.11 06:41:37" (1/1) ... [2023-11-29 06:41:37,372 INFO L131 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2023-11-29 06:41:37,373 INFO L112 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2023-11-29 06:41:37,373 INFO L270 PluginConnector]: Initializing RCFGBuilder... [2023-11-29 06:41:37,373 INFO L274 PluginConnector]: RCFGBuilder initialized [2023-11-29 06:41:37,374 INFO L184 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 29.11 06:41:37" (1/1) ... [2023-11-29 06:41:37,382 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2023-11-29 06:41:37,395 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_f41a68e7-fafa-48a2-aca6-8783e0010a4f/bin/uautomizer-verify-BQ2R08f2Ya/z3 [2023-11-29 06:41:37,410 INFO L229 MonitoredProcess]: Starting monitored process 1 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_f41a68e7-fafa-48a2-aca6-8783e0010a4f/bin/uautomizer-verify-BQ2R08f2Ya/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 (exit command is (exit), workingDir is null) [2023-11-29 06:41:37,420 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_f41a68e7-fafa-48a2-aca6-8783e0010a4f/bin/uautomizer-verify-BQ2R08f2Ya/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 (1)] Waiting until timeout for monitored process [2023-11-29 06:41:37,456 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_atomic_begin [2023-11-29 06:41:37,457 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2023-11-29 06:41:37,457 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnStack [2023-11-29 06:41:37,457 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.dealloc [2023-11-29 06:41:37,457 INFO L130 BoogieDeclarations]: Found specification of procedure write~intINTTYPE4#0 [2023-11-29 06:41:37,457 INFO L130 BoogieDeclarations]: Found specification of procedure write~intINTTYPE4#1 [2023-11-29 06:41:37,457 INFO L130 BoogieDeclarations]: Found specification of procedure write~intINTTYPE4#2 [2023-11-29 06:41:37,458 INFO L130 BoogieDeclarations]: Found specification of procedure write~intINTTYPE4#3 [2023-11-29 06:41:37,458 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~intINTTYPE1#0 [2023-11-29 06:41:37,458 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~intINTTYPE1#1 [2023-11-29 06:41:37,459 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~intINTTYPE1#2 [2023-11-29 06:41:37,459 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~intINTTYPE1#3 [2023-11-29 06:41:37,459 INFO L130 BoogieDeclarations]: Found specification of procedure P0 [2023-11-29 06:41:37,460 INFO L138 BoogieDeclarations]: Found implementation of procedure P0 [2023-11-29 06:41:37,460 INFO L130 BoogieDeclarations]: Found specification of procedure P1 [2023-11-29 06:41:37,460 INFO L138 BoogieDeclarations]: Found implementation of procedure P1 [2023-11-29 06:41:37,461 INFO L130 BoogieDeclarations]: Found specification of procedure P2 [2023-11-29 06:41:37,461 INFO L138 BoogieDeclarations]: Found implementation of procedure P2 [2023-11-29 06:41:37,461 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_atomic_end [2023-11-29 06:41:37,461 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2023-11-29 06:41:37,462 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2023-11-29 06:41:37,464 WARN L213 CfgBuilder]: User set CodeBlockSize to SequenceOfStatements but program contains fork statements. Overwriting the user preferences and setting CodeBlockSize to OneNontrivialStatement [2023-11-29 06:41:37,662 INFO L241 CfgBuilder]: Building ICFG [2023-11-29 06:41:37,665 INFO L267 CfgBuilder]: Building CFG for each procedure with an implementation [2023-11-29 06:41:38,080 INFO L282 CfgBuilder]: Performing block encoding [2023-11-29 06:41:38,355 INFO L304 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2023-11-29 06:41:38,355 INFO L309 CfgBuilder]: Removed 0 assume(true) statements. [2023-11-29 06:41:38,356 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 29.11 06:41:38 BoogieIcfgContainer [2023-11-29 06:41:38,356 INFO L131 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2023-11-29 06:41:38,360 INFO L112 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2023-11-29 06:41:38,360 INFO L270 PluginConnector]: Initializing TraceAbstraction... [2023-11-29 06:41:38,364 INFO L274 PluginConnector]: TraceAbstraction initialized [2023-11-29 06:41:38,365 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 29.11 06:41:36" (1/3) ... [2023-11-29 06:41:38,365 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@6f27ec35 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 29.11 06:41:38, skipping insertion in model container [2023-11-29 06:41:38,366 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 29.11 06:41:37" (2/3) ... [2023-11-29 06:41:38,366 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@6f27ec35 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 29.11 06:41:38, skipping insertion in model container [2023-11-29 06:41:38,366 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 29.11 06:41:38" (3/3) ... [2023-11-29 06:41:38,368 INFO L112 eAbstractionObserver]: Analyzing ICFG mix042.opt.i [2023-11-29 06:41:38,394 INFO L203 ceAbstractionStarter]: Automizer settings: Hoare:false NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2023-11-29 06:41:38,394 INFO L162 ceAbstractionStarter]: Applying trace abstraction to program that has 9 error locations. [2023-11-29 06:41:38,394 INFO L514 ceAbstractionStarter]: Constructing petrified ICFG for 1 thread instances. [2023-11-29 06:41:38,474 INFO L144 ThreadInstanceAdder]: Constructed 0 joinOtherThreadTransitions. [2023-11-29 06:41:38,521 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 63 places, 55 transitions, 122 flow [2023-11-29 06:41:38,565 INFO L124 PetriNetUnfolderBase]: 2/52 cut-off events. [2023-11-29 06:41:38,565 INFO L125 PetriNetUnfolderBase]: For 0/0 co-relation queries the response was YES. [2023-11-29 06:41:38,570 INFO L83 FinitePrefix]: Finished finitePrefix Result has 62 conditions, 52 events. 2/52 cut-off events. For 0/0 co-relation queries the response was YES. Maximal size of possible extension queue 5. Compared 100 event pairs, 0 based on Foata normal form. 0/41 useless extension candidates. Maximal degree in co-relation 51. Up to 2 conditions per place. [2023-11-29 06:41:38,570 INFO L82 GeneralOperation]: Start removeDead. Operand has 63 places, 55 transitions, 122 flow [2023-11-29 06:41:38,575 INFO L88 GeneralOperation]: Finished RemoveDead, result has has 60 places, 52 transitions, 113 flow [2023-11-29 06:41:38,589 INFO L356 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2023-11-29 06:41:38,597 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;@4778e916, mLbeIndependenceSettings=[IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=false, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2023-11-29 06:41:38,598 INFO L358 AbstractCegarLoop]: Starting to check reachability of 13 error locations. [2023-11-29 06:41:38,602 INFO L185 PetriNetUnfolderBase]: Found word, exiting Unfolder. [2023-11-29 06:41:38,602 INFO L124 PetriNetUnfolderBase]: 0/2 cut-off events. [2023-11-29 06:41:38,602 INFO L125 PetriNetUnfolderBase]: For 0/0 co-relation queries the response was YES. [2023-11-29 06:41:38,603 INFO L200 CegarLoopForPetriNet]: Found error trace [2023-11-29 06:41:38,604 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1] [2023-11-29 06:41:38,604 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-29 06:41:38,611 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-11-29 06:41:38,611 INFO L85 PathProgramCache]: Analyzing trace with hash 12272, now seen corresponding path program 1 times [2023-11-29 06:41:38,627 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2023-11-29 06:41:38,627 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [1164048865] [2023-11-29 06:41:38,628 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-11-29 06:41:38,628 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-29 06:41:38,628 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_f41a68e7-fafa-48a2-aca6-8783e0010a4f/bin/uautomizer-verify-BQ2R08f2Ya/mathsat [2023-11-29 06:41:38,630 INFO L229 MonitoredProcess]: Starting monitored process 2 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_f41a68e7-fafa-48a2-aca6-8783e0010a4f/bin/uautomizer-verify-BQ2R08f2Ya/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-29 06:41:38,633 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_f41a68e7-fafa-48a2-aca6-8783e0010a4f/bin/uautomizer-verify-BQ2R08f2Ya/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-29 06:41:38,760 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 06:41:38,763 INFO L262 TraceCheckSpWp]: Trace formula consists of 52 conjuncts, 3 conjunts are in the unsatisfiable core [2023-11-29 06:41:38,769 INFO L285 TraceCheckSpWp]: Computing forward predicates... [2023-11-29 06:41:38,850 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-29 06:41:38,864 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-29 06:41:38,864 INFO L323 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2023-11-29 06:41:38,865 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2023-11-29 06:41:38,866 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [1164048865] [2023-11-29 06:41:38,866 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [1164048865] provided 1 perfect and 0 imperfect interpolant sequences [2023-11-29 06:41:38,867 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-11-29 06:41:38,867 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [1] imperfect sequences [] total 1 [2023-11-29 06:41:38,869 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1777565333] [2023-11-29 06:41:38,870 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-11-29 06:41:38,880 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2023-11-29 06:41:38,894 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2023-11-29 06:41:38,919 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2023-11-29 06:41:38,920 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2023-11-29 06:41:38,957 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 29 out of 55 [2023-11-29 06:41:38,960 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 60 places, 52 transitions, 113 flow. Second operand has 3 states, 3 states have (on average 29.666666666666668) internal successors, (89), 3 states have internal predecessors, (89), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-29 06:41:38,961 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2023-11-29 06:41:38,961 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 29 of 55 [2023-11-29 06:41:38,962 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2023-11-29 06:41:39,346 INFO L124 PetriNetUnfolderBase]: 518/1024 cut-off events. [2023-11-29 06:41:39,346 INFO L125 PetriNetUnfolderBase]: For 8/8 co-relation queries the response was YES. [2023-11-29 06:41:39,353 INFO L83 FinitePrefix]: Finished finitePrefix Result has 1853 conditions, 1024 events. 518/1024 cut-off events. For 8/8 co-relation queries the response was YES. Maximal size of possible extension queue 100. Compared 7390 event pairs, 400 based on Foata normal form. 60/981 useless extension candidates. Maximal degree in co-relation 1839. Up to 628 conditions per place. [2023-11-29 06:41:39,365 INFO L140 encePairwiseOnDemand]: 50/55 looper letters, 27 selfloop transitions, 2 changer transitions 0/55 dead transitions. [2023-11-29 06:41:39,365 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 60 places, 55 transitions, 177 flow [2023-11-29 06:41:39,367 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2023-11-29 06:41:39,370 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2023-11-29 06:41:39,379 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 119 transitions. [2023-11-29 06:41:39,382 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.7212121212121212 [2023-11-29 06:41:39,383 INFO L72 ComplementDD]: Start complementDD. Operand 3 states and 119 transitions. [2023-11-29 06:41:39,383 INFO L73 IsDeterministic]: Start isDeterministic. Operand 3 states and 119 transitions. [2023-11-29 06:41:39,385 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2023-11-29 06:41:39,388 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 3 states and 119 transitions. [2023-11-29 06:41:39,391 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 4 states, 3 states have (on average 39.666666666666664) internal successors, (119), 3 states have internal predecessors, (119), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-29 06:41:39,396 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 4 states, 4 states have (on average 55.0) internal successors, (220), 4 states have internal predecessors, (220), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-29 06:41:39,397 INFO L81 ComplementDD]: Finished complementDD. Result has 4 states, 4 states have (on average 55.0) internal successors, (220), 4 states have internal predecessors, (220), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-29 06:41:39,400 INFO L175 Difference]: Start difference. First operand has 60 places, 52 transitions, 113 flow. Second operand 3 states and 119 transitions. [2023-11-29 06:41:39,401 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 60 places, 55 transitions, 177 flow [2023-11-29 06:41:39,404 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 57 places, 55 transitions, 174 flow, removed 0 selfloop flow, removed 3 redundant places. [2023-11-29 06:41:39,423 INFO L231 Difference]: Finished difference. Result has 57 places, 48 transitions, 106 flow [2023-11-29 06:41:39,425 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=55, PETRI_DIFFERENCE_MINUEND_FLOW=102, PETRI_DIFFERENCE_MINUEND_PLACES=55, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=48, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=2, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=46, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=106, PETRI_PLACES=57, PETRI_TRANSITIONS=48} [2023-11-29 06:41:39,430 INFO L281 CegarLoopForPetriNet]: 60 programPoint places, -3 predicate places. [2023-11-29 06:41:39,430 INFO L495 AbstractCegarLoop]: Abstraction has has 57 places, 48 transitions, 106 flow [2023-11-29 06:41:39,431 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 29.666666666666668) internal successors, (89), 3 states have internal predecessors, (89), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-29 06:41:39,431 INFO L200 CegarLoopForPetriNet]: Found error trace [2023-11-29 06:41:39,431 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1] [2023-11-29 06:41:39,441 INFO L540 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_f41a68e7-fafa-48a2-aca6-8783e0010a4f/bin/uautomizer-verify-BQ2R08f2Ya/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-29 06:41:39,632 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 2 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_f41a68e7-fafa-48a2-aca6-8783e0010a4f/bin/uautomizer-verify-BQ2R08f2Ya/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-29 06:41:39,633 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-29 06:41:39,634 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-11-29 06:41:39,634 INFO L85 PathProgramCache]: Analyzing trace with hash 12273, now seen corresponding path program 1 times [2023-11-29 06:41:39,635 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2023-11-29 06:41:39,635 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [1728295196] [2023-11-29 06:41:39,635 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-11-29 06:41:39,636 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-29 06:41:39,636 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_f41a68e7-fafa-48a2-aca6-8783e0010a4f/bin/uautomizer-verify-BQ2R08f2Ya/mathsat [2023-11-29 06:41:39,638 INFO L229 MonitoredProcess]: Starting monitored process 3 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_f41a68e7-fafa-48a2-aca6-8783e0010a4f/bin/uautomizer-verify-BQ2R08f2Ya/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-29 06:41:39,639 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_f41a68e7-fafa-48a2-aca6-8783e0010a4f/bin/uautomizer-verify-BQ2R08f2Ya/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-29 06:41:39,772 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 06:41:39,774 INFO L262 TraceCheckSpWp]: Trace formula consists of 52 conjuncts, 4 conjunts are in the unsatisfiable core [2023-11-29 06:41:39,775 INFO L285 TraceCheckSpWp]: Computing forward predicates... [2023-11-29 06:41:39,787 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-29 06:41:39,803 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-29 06:41:39,803 INFO L323 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2023-11-29 06:41:39,803 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2023-11-29 06:41:39,804 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [1728295196] [2023-11-29 06:41:39,804 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [1728295196] provided 1 perfect and 0 imperfect interpolant sequences [2023-11-29 06:41:39,804 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-11-29 06:41:39,805 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [1] imperfect sequences [] total 1 [2023-11-29 06:41:39,805 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1111170933] [2023-11-29 06:41:39,805 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-11-29 06:41:39,807 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2023-11-29 06:41:39,807 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2023-11-29 06:41:39,808 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2023-11-29 06:41:39,808 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2023-11-29 06:41:39,855 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 30 out of 55 [2023-11-29 06:41:39,855 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 57 places, 48 transitions, 106 flow. Second operand has 3 states, 3 states have (on average 30.666666666666668) internal successors, (92), 3 states have internal predecessors, (92), 0 states have call successors, (0), 0 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-29 06:41:39,856 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2023-11-29 06:41:39,856 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 30 of 55 [2023-11-29 06:41:39,856 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2023-11-29 06:41:40,109 INFO L124 PetriNetUnfolderBase]: 518/1023 cut-off events. [2023-11-29 06:41:40,109 INFO L125 PetriNetUnfolderBase]: For 30/30 co-relation queries the response was YES. [2023-11-29 06:41:40,114 INFO L83 FinitePrefix]: Finished finitePrefix Result has 1880 conditions, 1023 events. 518/1023 cut-off events. For 30/30 co-relation queries the response was YES. Maximal size of possible extension queue 100. Compared 7405 event pairs, 400 based on Foata normal form. 1/921 useless extension candidates. Maximal degree in co-relation 1869. Up to 627 conditions per place. [2023-11-29 06:41:40,121 INFO L140 encePairwiseOnDemand]: 52/55 looper letters, 26 selfloop transitions, 2 changer transitions 0/54 dead transitions. [2023-11-29 06:41:40,121 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 58 places, 54 transitions, 174 flow [2023-11-29 06:41:40,122 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2023-11-29 06:41:40,122 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2023-11-29 06:41:40,124 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 119 transitions. [2023-11-29 06:41:40,125 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.7212121212121212 [2023-11-29 06:41:40,125 INFO L72 ComplementDD]: Start complementDD. Operand 3 states and 119 transitions. [2023-11-29 06:41:40,125 INFO L73 IsDeterministic]: Start isDeterministic. Operand 3 states and 119 transitions. [2023-11-29 06:41:40,126 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2023-11-29 06:41:40,126 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 3 states and 119 transitions. [2023-11-29 06:41:40,128 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 4 states, 3 states have (on average 39.666666666666664) internal successors, (119), 3 states have internal predecessors, (119), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-29 06:41:40,129 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 4 states, 4 states have (on average 55.0) internal successors, (220), 4 states have internal predecessors, (220), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-29 06:41:40,130 INFO L81 ComplementDD]: Finished complementDD. Result has 4 states, 4 states have (on average 55.0) internal successors, (220), 4 states have internal predecessors, (220), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-29 06:41:40,130 INFO L175 Difference]: Start difference. First operand has 57 places, 48 transitions, 106 flow. Second operand 3 states and 119 transitions. [2023-11-29 06:41:40,130 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 58 places, 54 transitions, 174 flow [2023-11-29 06:41:40,133 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 56 places, 54 transitions, 170 flow, removed 0 selfloop flow, removed 2 redundant places. [2023-11-29 06:41:40,135 INFO L231 Difference]: Finished difference. Result has 56 places, 47 transitions, 104 flow [2023-11-29 06:41:40,136 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=55, PETRI_DIFFERENCE_MINUEND_FLOW=100, PETRI_DIFFERENCE_MINUEND_PLACES=54, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=47, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=2, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=45, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=104, PETRI_PLACES=56, PETRI_TRANSITIONS=47} [2023-11-29 06:41:40,137 INFO L281 CegarLoopForPetriNet]: 60 programPoint places, -4 predicate places. [2023-11-29 06:41:40,137 INFO L495 AbstractCegarLoop]: Abstraction has has 56 places, 47 transitions, 104 flow [2023-11-29 06:41:40,137 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 30.666666666666668) internal successors, (92), 3 states have internal predecessors, (92), 0 states have call successors, (0), 0 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-29 06:41:40,137 INFO L200 CegarLoopForPetriNet]: Found error trace [2023-11-29 06:41:40,137 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1] [2023-11-29 06:41:40,140 INFO L552 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_f41a68e7-fafa-48a2-aca6-8783e0010a4f/bin/uautomizer-verify-BQ2R08f2Ya/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)] Ended with exit code 0 [2023-11-29 06:41:40,338 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 3 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_f41a68e7-fafa-48a2-aca6-8783e0010a4f/bin/uautomizer-verify-BQ2R08f2Ya/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-29 06:41:40,339 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-29 06:41:40,339 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-11-29 06:41:40,339 INFO L85 PathProgramCache]: Analyzing trace with hash 365971696, now seen corresponding path program 1 times [2023-11-29 06:41:40,340 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2023-11-29 06:41:40,341 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [863768218] [2023-11-29 06:41:40,341 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-11-29 06:41:40,341 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-29 06:41:40,341 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_f41a68e7-fafa-48a2-aca6-8783e0010a4f/bin/uautomizer-verify-BQ2R08f2Ya/mathsat [2023-11-29 06:41:40,343 INFO L229 MonitoredProcess]: Starting monitored process 4 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_f41a68e7-fafa-48a2-aca6-8783e0010a4f/bin/uautomizer-verify-BQ2R08f2Ya/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-29 06:41:40,344 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_f41a68e7-fafa-48a2-aca6-8783e0010a4f/bin/uautomizer-verify-BQ2R08f2Ya/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-29 06:41:40,448 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 06:41:40,450 INFO L262 TraceCheckSpWp]: Trace formula consists of 73 conjuncts, 3 conjunts are in the unsatisfiable core [2023-11-29 06:41:40,452 INFO L285 TraceCheckSpWp]: Computing forward predicates... [2023-11-29 06:41:40,459 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-29 06:41:40,466 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-11-29 06:41:40,467 INFO L323 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2023-11-29 06:41:40,467 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2023-11-29 06:41:40,467 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [863768218] [2023-11-29 06:41:40,467 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [863768218] provided 1 perfect and 0 imperfect interpolant sequences [2023-11-29 06:41:40,468 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-11-29 06:41:40,468 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2023-11-29 06:41:40,468 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [660277043] [2023-11-29 06:41:40,468 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-11-29 06:41:40,469 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2023-11-29 06:41:40,469 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2023-11-29 06:41:40,470 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2023-11-29 06:41:40,470 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2023-11-29 06:41:40,504 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 29 out of 55 [2023-11-29 06:41:40,504 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 56 places, 47 transitions, 104 flow. Second operand has 3 states, 3 states have (on average 30.333333333333332) internal successors, (91), 3 states have internal predecessors, (91), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-29 06:41:40,504 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2023-11-29 06:41:40,504 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 29 of 55 [2023-11-29 06:41:40,505 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2023-11-29 06:41:40,772 INFO L124 PetriNetUnfolderBase]: 519/1022 cut-off events. [2023-11-29 06:41:40,773 INFO L125 PetriNetUnfolderBase]: For 30/30 co-relation queries the response was YES. [2023-11-29 06:41:40,776 INFO L83 FinitePrefix]: Finished finitePrefix Result has 1882 conditions, 1022 events. 519/1022 cut-off events. For 30/30 co-relation queries the response was YES. Maximal size of possible extension queue 100. Compared 7261 event pairs, 318 based on Foata normal form. 0/923 useless extension candidates. Maximal degree in co-relation 1871. Up to 627 conditions per place. [2023-11-29 06:41:40,785 INFO L140 encePairwiseOnDemand]: 52/55 looper letters, 27 selfloop transitions, 2 changer transitions 0/53 dead transitions. [2023-11-29 06:41:40,785 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 57 places, 53 transitions, 174 flow [2023-11-29 06:41:40,786 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2023-11-29 06:41:40,786 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2023-11-29 06:41:40,787 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 117 transitions. [2023-11-29 06:41:40,788 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.7090909090909091 [2023-11-29 06:41:40,788 INFO L72 ComplementDD]: Start complementDD. Operand 3 states and 117 transitions. [2023-11-29 06:41:40,788 INFO L73 IsDeterministic]: Start isDeterministic. Operand 3 states and 117 transitions. [2023-11-29 06:41:40,789 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2023-11-29 06:41:40,789 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 3 states and 117 transitions. [2023-11-29 06:41:40,790 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 4 states, 3 states have (on average 39.0) internal successors, (117), 3 states have internal predecessors, (117), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-29 06:41:40,791 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 4 states, 4 states have (on average 55.0) internal successors, (220), 4 states have internal predecessors, (220), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-29 06:41:40,792 INFO L81 ComplementDD]: Finished complementDD. Result has 4 states, 4 states have (on average 55.0) internal successors, (220), 4 states have internal predecessors, (220), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-29 06:41:40,792 INFO L175 Difference]: Start difference. First operand has 56 places, 47 transitions, 104 flow. Second operand 3 states and 117 transitions. [2023-11-29 06:41:40,792 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 57 places, 53 transitions, 174 flow [2023-11-29 06:41:40,794 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 55 places, 53 transitions, 170 flow, removed 0 selfloop flow, removed 2 redundant places. [2023-11-29 06:41:40,796 INFO L231 Difference]: Finished difference. Result has 55 places, 46 transitions, 102 flow [2023-11-29 06:41:40,796 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=55, PETRI_DIFFERENCE_MINUEND_FLOW=98, PETRI_DIFFERENCE_MINUEND_PLACES=53, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=46, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=2, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=44, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=102, PETRI_PLACES=55, PETRI_TRANSITIONS=46} [2023-11-29 06:41:40,797 INFO L281 CegarLoopForPetriNet]: 60 programPoint places, -5 predicate places. [2023-11-29 06:41:40,797 INFO L495 AbstractCegarLoop]: Abstraction has has 55 places, 46 transitions, 102 flow [2023-11-29 06:41:40,798 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 30.333333333333332) internal successors, (91), 3 states have internal predecessors, (91), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-29 06:41:40,798 INFO L200 CegarLoopForPetriNet]: Found error trace [2023-11-29 06:41:40,798 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1] [2023-11-29 06:41:40,801 INFO L552 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_f41a68e7-fafa-48a2-aca6-8783e0010a4f/bin/uautomizer-verify-BQ2R08f2Ya/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (4)] Ended with exit code 0 [2023-11-29 06:41:40,998 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 4 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_f41a68e7-fafa-48a2-aca6-8783e0010a4f/bin/uautomizer-verify-BQ2R08f2Ya/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-29 06:41:40,999 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-29 06:41:41,000 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-11-29 06:41:41,000 INFO L85 PathProgramCache]: Analyzing trace with hash 365971697, now seen corresponding path program 1 times [2023-11-29 06:41:41,001 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2023-11-29 06:41:41,001 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [867904294] [2023-11-29 06:41:41,001 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-11-29 06:41:41,001 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-29 06:41:41,002 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_f41a68e7-fafa-48a2-aca6-8783e0010a4f/bin/uautomizer-verify-BQ2R08f2Ya/mathsat [2023-11-29 06:41:41,003 INFO L229 MonitoredProcess]: Starting monitored process 5 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_f41a68e7-fafa-48a2-aca6-8783e0010a4f/bin/uautomizer-verify-BQ2R08f2Ya/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-29 06:41:41,005 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_f41a68e7-fafa-48a2-aca6-8783e0010a4f/bin/uautomizer-verify-BQ2R08f2Ya/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (5)] Waiting until timeout for monitored process [2023-11-29 06:41:41,109 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 06:41:41,112 INFO L262 TraceCheckSpWp]: Trace formula consists of 73 conjuncts, 4 conjunts are in the unsatisfiable core [2023-11-29 06:41:41,113 INFO L285 TraceCheckSpWp]: Computing forward predicates... [2023-11-29 06:41:41,123 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-29 06:41:41,138 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-29 06:41:41,139 INFO L323 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2023-11-29 06:41:41,139 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2023-11-29 06:41:41,139 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [867904294] [2023-11-29 06:41:41,139 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [867904294] provided 1 perfect and 0 imperfect interpolant sequences [2023-11-29 06:41:41,139 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-11-29 06:41:41,140 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2023-11-29 06:41:41,140 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1067536538] [2023-11-29 06:41:41,140 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-11-29 06:41:41,140 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2023-11-29 06:41:41,141 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2023-11-29 06:41:41,141 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2023-11-29 06:41:41,141 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2023-11-29 06:41:41,171 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 30 out of 55 [2023-11-29 06:41:41,171 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 55 places, 46 transitions, 102 flow. Second operand has 3 states, 3 states have (on average 31.333333333333332) internal successors, (94), 3 states have internal predecessors, (94), 0 states have call successors, (0), 0 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-29 06:41:41,171 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2023-11-29 06:41:41,171 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 30 of 55 [2023-11-29 06:41:41,171 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2023-11-29 06:41:41,419 INFO L124 PetriNetUnfolderBase]: 518/1018 cut-off events. [2023-11-29 06:41:41,419 INFO L125 PetriNetUnfolderBase]: For 31/31 co-relation queries the response was YES. [2023-11-29 06:41:41,422 INFO L83 FinitePrefix]: Finished finitePrefix Result has 1876 conditions, 1018 events. 518/1018 cut-off events. For 31/31 co-relation queries the response was YES. Maximal size of possible extension queue 100. Compared 7341 event pairs, 399 based on Foata normal form. 2/922 useless extension candidates. Maximal degree in co-relation 1866. Up to 624 conditions per place. [2023-11-29 06:41:41,431 INFO L140 encePairwiseOnDemand]: 52/55 looper letters, 26 selfloop transitions, 2 changer transitions 0/52 dead transitions. [2023-11-29 06:41:41,431 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 56 places, 52 transitions, 170 flow [2023-11-29 06:41:41,432 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2023-11-29 06:41:41,432 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2023-11-29 06:41:41,433 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 119 transitions. [2023-11-29 06:41:41,433 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.7212121212121212 [2023-11-29 06:41:41,433 INFO L72 ComplementDD]: Start complementDD. Operand 3 states and 119 transitions. [2023-11-29 06:41:41,433 INFO L73 IsDeterministic]: Start isDeterministic. Operand 3 states and 119 transitions. [2023-11-29 06:41:41,434 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2023-11-29 06:41:41,434 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 3 states and 119 transitions. [2023-11-29 06:41:41,435 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 4 states, 3 states have (on average 39.666666666666664) internal successors, (119), 3 states have internal predecessors, (119), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-29 06:41:41,436 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 4 states, 4 states have (on average 55.0) internal successors, (220), 4 states have internal predecessors, (220), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-29 06:41:41,436 INFO L81 ComplementDD]: Finished complementDD. Result has 4 states, 4 states have (on average 55.0) internal successors, (220), 4 states have internal predecessors, (220), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-29 06:41:41,436 INFO L175 Difference]: Start difference. First operand has 55 places, 46 transitions, 102 flow. Second operand 3 states and 119 transitions. [2023-11-29 06:41:41,436 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 56 places, 52 transitions, 170 flow [2023-11-29 06:41:41,438 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 54 places, 52 transitions, 166 flow, removed 0 selfloop flow, removed 2 redundant places. [2023-11-29 06:41:41,440 INFO L231 Difference]: Finished difference. Result has 54 places, 45 transitions, 100 flow [2023-11-29 06:41:41,440 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=55, PETRI_DIFFERENCE_MINUEND_FLOW=96, PETRI_DIFFERENCE_MINUEND_PLACES=52, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=45, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=2, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=43, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=100, PETRI_PLACES=54, PETRI_TRANSITIONS=45} [2023-11-29 06:41:41,441 INFO L281 CegarLoopForPetriNet]: 60 programPoint places, -6 predicate places. [2023-11-29 06:41:41,441 INFO L495 AbstractCegarLoop]: Abstraction has has 54 places, 45 transitions, 100 flow [2023-11-29 06:41:41,442 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 31.333333333333332) internal successors, (94), 3 states have internal predecessors, (94), 0 states have call successors, (0), 0 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-29 06:41:41,442 INFO L200 CegarLoopForPetriNet]: Found error trace [2023-11-29 06:41:41,442 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1] [2023-11-29 06:41:41,446 INFO L540 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_f41a68e7-fafa-48a2-aca6-8783e0010a4f/bin/uautomizer-verify-BQ2R08f2Ya/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (5)] Forceful destruction successful, exit code 0 [2023-11-29 06:41:41,645 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 5 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_f41a68e7-fafa-48a2-aca6-8783e0010a4f/bin/uautomizer-verify-BQ2R08f2Ya/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-29 06:41:41,646 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-29 06:41:41,646 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-11-29 06:41:41,646 INFO L85 PathProgramCache]: Analyzing trace with hash 2036172807, now seen corresponding path program 1 times [2023-11-29 06:41:41,647 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2023-11-29 06:41:41,647 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [387871643] [2023-11-29 06:41:41,647 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-11-29 06:41:41,647 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-29 06:41:41,648 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_f41a68e7-fafa-48a2-aca6-8783e0010a4f/bin/uautomizer-verify-BQ2R08f2Ya/mathsat [2023-11-29 06:41:41,649 INFO L229 MonitoredProcess]: Starting monitored process 6 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_f41a68e7-fafa-48a2-aca6-8783e0010a4f/bin/uautomizer-verify-BQ2R08f2Ya/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-29 06:41:41,650 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_f41a68e7-fafa-48a2-aca6-8783e0010a4f/bin/uautomizer-verify-BQ2R08f2Ya/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 (6)] Waiting until timeout for monitored process [2023-11-29 06:41:41,749 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 06:41:41,751 INFO L262 TraceCheckSpWp]: Trace formula consists of 95 conjuncts, 3 conjunts are in the unsatisfiable core [2023-11-29 06:41:41,753 INFO L285 TraceCheckSpWp]: Computing forward predicates... [2023-11-29 06:41:41,760 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-29 06:41:41,766 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-29 06:41:41,767 INFO L323 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2023-11-29 06:41:41,767 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2023-11-29 06:41:41,767 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [387871643] [2023-11-29 06:41:41,767 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [387871643] provided 1 perfect and 0 imperfect interpolant sequences [2023-11-29 06:41:41,768 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-11-29 06:41:41,768 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2023-11-29 06:41:41,768 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1017550889] [2023-11-29 06:41:41,768 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-11-29 06:41:41,768 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2023-11-29 06:41:41,769 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2023-11-29 06:41:41,769 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2023-11-29 06:41:41,769 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2023-11-29 06:41:41,802 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 29 out of 55 [2023-11-29 06:41:41,803 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 54 places, 45 transitions, 100 flow. Second operand has 3 states, 3 states have (on average 31.0) internal successors, (93), 3 states have internal predecessors, (93), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-29 06:41:41,803 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2023-11-29 06:41:41,803 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 29 of 55 [2023-11-29 06:41:41,803 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2023-11-29 06:41:42,023 INFO L124 PetriNetUnfolderBase]: 525/1020 cut-off events. [2023-11-29 06:41:42,024 INFO L125 PetriNetUnfolderBase]: For 31/31 co-relation queries the response was YES. [2023-11-29 06:41:42,027 INFO L83 FinitePrefix]: Finished finitePrefix Result has 1891 conditions, 1020 events. 525/1020 cut-off events. For 31/31 co-relation queries the response was YES. Maximal size of possible extension queue 100. Compared 7338 event pairs, 218 based on Foata normal form. 0/936 useless extension candidates. Maximal degree in co-relation 1881. Up to 625 conditions per place. [2023-11-29 06:41:42,035 INFO L140 encePairwiseOnDemand]: 52/55 looper letters, 27 selfloop transitions, 2 changer transitions 0/51 dead transitions. [2023-11-29 06:41:42,035 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 55 places, 51 transitions, 170 flow [2023-11-29 06:41:42,036 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2023-11-29 06:41:42,036 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2023-11-29 06:41:42,037 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 117 transitions. [2023-11-29 06:41:42,037 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.7090909090909091 [2023-11-29 06:41:42,037 INFO L72 ComplementDD]: Start complementDD. Operand 3 states and 117 transitions. [2023-11-29 06:41:42,037 INFO L73 IsDeterministic]: Start isDeterministic. Operand 3 states and 117 transitions. [2023-11-29 06:41:42,038 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2023-11-29 06:41:42,038 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 3 states and 117 transitions. [2023-11-29 06:41:42,039 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 4 states, 3 states have (on average 39.0) internal successors, (117), 3 states have internal predecessors, (117), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-29 06:41:42,040 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 4 states, 4 states have (on average 55.0) internal successors, (220), 4 states have internal predecessors, (220), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-29 06:41:42,041 INFO L81 ComplementDD]: Finished complementDD. Result has 4 states, 4 states have (on average 55.0) internal successors, (220), 4 states have internal predecessors, (220), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-29 06:41:42,041 INFO L175 Difference]: Start difference. First operand has 54 places, 45 transitions, 100 flow. Second operand 3 states and 117 transitions. [2023-11-29 06:41:42,041 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 55 places, 51 transitions, 170 flow [2023-11-29 06:41:42,043 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 53 places, 51 transitions, 166 flow, removed 0 selfloop flow, removed 2 redundant places. [2023-11-29 06:41:42,044 INFO L231 Difference]: Finished difference. Result has 53 places, 44 transitions, 98 flow [2023-11-29 06:41:42,044 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=55, PETRI_DIFFERENCE_MINUEND_FLOW=94, PETRI_DIFFERENCE_MINUEND_PLACES=51, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=44, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=2, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=42, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=98, PETRI_PLACES=53, PETRI_TRANSITIONS=44} [2023-11-29 06:41:42,045 INFO L281 CegarLoopForPetriNet]: 60 programPoint places, -7 predicate places. [2023-11-29 06:41:42,045 INFO L495 AbstractCegarLoop]: Abstraction has has 53 places, 44 transitions, 98 flow [2023-11-29 06:41:42,046 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 31.0) internal successors, (93), 3 states have internal predecessors, (93), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-29 06:41:42,046 INFO L200 CegarLoopForPetriNet]: Found error trace [2023-11-29 06:41:42,046 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1] [2023-11-29 06:41:42,049 INFO L552 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_f41a68e7-fafa-48a2-aca6-8783e0010a4f/bin/uautomizer-verify-BQ2R08f2Ya/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 (6)] Ended with exit code 0 [2023-11-29 06:41:42,248 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 6 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_f41a68e7-fafa-48a2-aca6-8783e0010a4f/bin/uautomizer-verify-BQ2R08f2Ya/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-29 06:41:42,249 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-29 06:41:42,249 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-11-29 06:41:42,249 INFO L85 PathProgramCache]: Analyzing trace with hash 2036172808, now seen corresponding path program 1 times [2023-11-29 06:41:42,250 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2023-11-29 06:41:42,250 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [275776975] [2023-11-29 06:41:42,250 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-11-29 06:41:42,250 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-29 06:41:42,250 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_f41a68e7-fafa-48a2-aca6-8783e0010a4f/bin/uautomizer-verify-BQ2R08f2Ya/mathsat [2023-11-29 06:41:42,251 INFO L229 MonitoredProcess]: Starting monitored process 7 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_f41a68e7-fafa-48a2-aca6-8783e0010a4f/bin/uautomizer-verify-BQ2R08f2Ya/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-29 06:41:42,253 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_f41a68e7-fafa-48a2-aca6-8783e0010a4f/bin/uautomizer-verify-BQ2R08f2Ya/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 (7)] Waiting until timeout for monitored process [2023-11-29 06:41:42,348 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 06:41:42,351 INFO L262 TraceCheckSpWp]: Trace formula consists of 95 conjuncts, 4 conjunts are in the unsatisfiable core [2023-11-29 06:41:42,353 INFO L285 TraceCheckSpWp]: Computing forward predicates... [2023-11-29 06:41:42,363 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-29 06:41:42,376 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-29 06:41:42,377 INFO L323 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2023-11-29 06:41:42,377 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2023-11-29 06:41:42,377 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [275776975] [2023-11-29 06:41:42,377 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [275776975] provided 1 perfect and 0 imperfect interpolant sequences [2023-11-29 06:41:42,378 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-11-29 06:41:42,378 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2023-11-29 06:41:42,378 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [92859051] [2023-11-29 06:41:42,378 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-11-29 06:41:42,379 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2023-11-29 06:41:42,379 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2023-11-29 06:41:42,380 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2023-11-29 06:41:42,380 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2023-11-29 06:41:42,414 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 30 out of 55 [2023-11-29 06:41:42,414 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 53 places, 44 transitions, 98 flow. Second operand has 3 states, 3 states have (on average 32.0) internal successors, (96), 3 states have internal predecessors, (96), 0 states have call successors, (0), 0 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-29 06:41:42,415 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2023-11-29 06:41:42,415 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 30 of 55 [2023-11-29 06:41:42,415 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2023-11-29 06:41:42,627 INFO L124 PetriNetUnfolderBase]: 518/1007 cut-off events. [2023-11-29 06:41:42,627 INFO L125 PetriNetUnfolderBase]: For 34/34 co-relation queries the response was YES. [2023-11-29 06:41:42,629 INFO L83 FinitePrefix]: Finished finitePrefix Result has 1869 conditions, 1007 events. 518/1007 cut-off events. For 34/34 co-relation queries the response was YES. Maximal size of possible extension queue 100. Compared 7238 event pairs, 218 based on Foata normal form. 6/931 useless extension candidates. Maximal degree in co-relation 1859. Up to 612 conditions per place. [2023-11-29 06:41:42,636 INFO L140 encePairwiseOnDemand]: 52/55 looper letters, 26 selfloop transitions, 2 changer transitions 0/50 dead transitions. [2023-11-29 06:41:42,637 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 54 places, 50 transitions, 166 flow [2023-11-29 06:41:42,637 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2023-11-29 06:41:42,637 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2023-11-29 06:41:42,638 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 119 transitions. [2023-11-29 06:41:42,638 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.7212121212121212 [2023-11-29 06:41:42,639 INFO L72 ComplementDD]: Start complementDD. Operand 3 states and 119 transitions. [2023-11-29 06:41:42,639 INFO L73 IsDeterministic]: Start isDeterministic. Operand 3 states and 119 transitions. [2023-11-29 06:41:42,639 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2023-11-29 06:41:42,639 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 3 states and 119 transitions. [2023-11-29 06:41:42,640 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 4 states, 3 states have (on average 39.666666666666664) internal successors, (119), 3 states have internal predecessors, (119), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-29 06:41:42,641 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 4 states, 4 states have (on average 55.0) internal successors, (220), 4 states have internal predecessors, (220), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-29 06:41:42,642 INFO L81 ComplementDD]: Finished complementDD. Result has 4 states, 4 states have (on average 55.0) internal successors, (220), 4 states have internal predecessors, (220), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-29 06:41:42,642 INFO L175 Difference]: Start difference. First operand has 53 places, 44 transitions, 98 flow. Second operand 3 states and 119 transitions. [2023-11-29 06:41:42,642 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 54 places, 50 transitions, 166 flow [2023-11-29 06:41:42,644 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 52 places, 50 transitions, 162 flow, removed 0 selfloop flow, removed 2 redundant places. [2023-11-29 06:41:42,645 INFO L231 Difference]: Finished difference. Result has 52 places, 43 transitions, 96 flow [2023-11-29 06:41:42,646 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=55, PETRI_DIFFERENCE_MINUEND_FLOW=92, PETRI_DIFFERENCE_MINUEND_PLACES=50, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=43, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=2, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=41, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=96, PETRI_PLACES=52, PETRI_TRANSITIONS=43} [2023-11-29 06:41:42,647 INFO L281 CegarLoopForPetriNet]: 60 programPoint places, -8 predicate places. [2023-11-29 06:41:42,647 INFO L495 AbstractCegarLoop]: Abstraction has has 52 places, 43 transitions, 96 flow [2023-11-29 06:41:42,648 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 32.0) internal successors, (96), 3 states have internal predecessors, (96), 0 states have call successors, (0), 0 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-29 06:41:42,648 INFO L200 CegarLoopForPetriNet]: Found error trace [2023-11-29 06:41:42,648 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-11-29 06:41:42,651 INFO L552 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_f41a68e7-fafa-48a2-aca6-8783e0010a4f/bin/uautomizer-verify-BQ2R08f2Ya/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 (7)] Ended with exit code 0 [2023-11-29 06:41:42,851 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 7 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_f41a68e7-fafa-48a2-aca6-8783e0010a4f/bin/uautomizer-verify-BQ2R08f2Ya/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-29 06:41:42,852 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-29 06:41:42,852 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-11-29 06:41:42,852 INFO L85 PathProgramCache]: Analyzing trace with hash 1801351800, now seen corresponding path program 1 times [2023-11-29 06:41:42,853 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2023-11-29 06:41:42,853 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [360428752] [2023-11-29 06:41:42,853 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-11-29 06:41:42,853 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-29 06:41:42,853 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_f41a68e7-fafa-48a2-aca6-8783e0010a4f/bin/uautomizer-verify-BQ2R08f2Ya/mathsat [2023-11-29 06:41:42,855 INFO L229 MonitoredProcess]: Starting monitored process 8 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_f41a68e7-fafa-48a2-aca6-8783e0010a4f/bin/uautomizer-verify-BQ2R08f2Ya/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-29 06:41:42,856 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_f41a68e7-fafa-48a2-aca6-8783e0010a4f/bin/uautomizer-verify-BQ2R08f2Ya/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 (8)] Waiting until timeout for monitored process [2023-11-29 06:41:42,974 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 06:41:42,978 INFO L262 TraceCheckSpWp]: Trace formula consists of 116 conjuncts, 5 conjunts are in the unsatisfiable core [2023-11-29 06:41:42,980 INFO L285 TraceCheckSpWp]: Computing forward predicates... [2023-11-29 06:41:43,011 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-29 06:41:43,011 INFO L323 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2023-11-29 06:41:43,011 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2023-11-29 06:41:43,012 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [360428752] [2023-11-29 06:41:43,012 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [360428752] provided 1 perfect and 0 imperfect interpolant sequences [2023-11-29 06:41:43,012 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-11-29 06:41:43,012 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [1] imperfect sequences [] total 1 [2023-11-29 06:41:43,012 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1821499005] [2023-11-29 06:41:43,013 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-11-29 06:41:43,013 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2023-11-29 06:41:43,013 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2023-11-29 06:41:43,014 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2023-11-29 06:41:43,014 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2023-11-29 06:41:43,014 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 31 out of 55 [2023-11-29 06:41:43,015 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 52 places, 43 transitions, 96 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-29 06:41:43,015 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2023-11-29 06:41:43,015 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 31 of 55 [2023-11-29 06:41:43,015 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2023-11-29 06:41:43,195 INFO L124 PetriNetUnfolderBase]: 407/914 cut-off events. [2023-11-29 06:41:43,195 INFO L125 PetriNetUnfolderBase]: For 28/28 co-relation queries the response was YES. [2023-11-29 06:41:43,198 INFO L83 FinitePrefix]: Finished finitePrefix Result has 1605 conditions, 914 events. 407/914 cut-off events. For 28/28 co-relation queries the response was YES. Maximal size of possible extension queue 83. Compared 6451 event pairs, 74 based on Foata normal form. 0/901 useless extension candidates. Maximal degree in co-relation 1595. Up to 496 conditions per place. [2023-11-29 06:41:43,203 INFO L140 encePairwiseOnDemand]: 52/55 looper letters, 27 selfloop transitions, 2 changer transitions 2/53 dead transitions. [2023-11-29 06:41:43,203 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 53 places, 53 transitions, 180 flow [2023-11-29 06:41:43,204 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2023-11-29 06:41:43,204 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2023-11-29 06:41:43,204 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 125 transitions. [2023-11-29 06:41:43,205 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.7575757575757576 [2023-11-29 06:41:43,205 INFO L72 ComplementDD]: Start complementDD. Operand 3 states and 125 transitions. [2023-11-29 06:41:43,205 INFO L73 IsDeterministic]: Start isDeterministic. Operand 3 states and 125 transitions. [2023-11-29 06:41:43,205 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2023-11-29 06:41:43,205 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 3 states and 125 transitions. [2023-11-29 06:41:43,206 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 4 states, 3 states have (on average 41.666666666666664) internal successors, (125), 3 states have internal predecessors, (125), 0 states have call successors, (0), 0 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-29 06:41:43,207 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 4 states, 4 states have (on average 55.0) internal successors, (220), 4 states have internal predecessors, (220), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-29 06:41:43,207 INFO L81 ComplementDD]: Finished complementDD. Result has 4 states, 4 states have (on average 55.0) internal successors, (220), 4 states have internal predecessors, (220), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-29 06:41:43,208 INFO L175 Difference]: Start difference. First operand has 52 places, 43 transitions, 96 flow. Second operand 3 states and 125 transitions. [2023-11-29 06:41:43,208 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 53 places, 53 transitions, 180 flow [2023-11-29 06:41:43,209 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 51 places, 53 transitions, 174 flow, removed 0 selfloop flow, removed 2 redundant places. [2023-11-29 06:41:43,210 INFO L231 Difference]: Finished difference. Result has 51 places, 41 transitions, 92 flow [2023-11-29 06:41:43,210 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=55, PETRI_DIFFERENCE_MINUEND_FLOW=90, PETRI_DIFFERENCE_MINUEND_PLACES=49, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=42, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=2, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=40, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=92, PETRI_PLACES=51, PETRI_TRANSITIONS=41} [2023-11-29 06:41:43,211 INFO L281 CegarLoopForPetriNet]: 60 programPoint places, -9 predicate places. [2023-11-29 06:41:43,211 INFO L495 AbstractCegarLoop]: Abstraction has has 51 places, 41 transitions, 92 flow [2023-11-29 06:41:43,211 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-29 06:41:43,211 INFO L200 CegarLoopForPetriNet]: Found error trace [2023-11-29 06:41:43,212 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-29 06:41:43,215 INFO L552 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_f41a68e7-fafa-48a2-aca6-8783e0010a4f/bin/uautomizer-verify-BQ2R08f2Ya/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 (8)] Ended with exit code 0 [2023-11-29 06:41:43,412 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 8 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_f41a68e7-fafa-48a2-aca6-8783e0010a4f/bin/uautomizer-verify-BQ2R08f2Ya/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-29 06:41:43,412 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-29 06:41:43,413 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-11-29 06:41:43,413 INFO L85 PathProgramCache]: Analyzing trace with hash 222111568, now seen corresponding path program 1 times [2023-11-29 06:41:43,413 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2023-11-29 06:41:43,413 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [1300275404] [2023-11-29 06:41:43,414 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-11-29 06:41:43,414 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-29 06:41:43,414 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_f41a68e7-fafa-48a2-aca6-8783e0010a4f/bin/uautomizer-verify-BQ2R08f2Ya/mathsat [2023-11-29 06:41:43,415 INFO L229 MonitoredProcess]: Starting monitored process 9 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_f41a68e7-fafa-48a2-aca6-8783e0010a4f/bin/uautomizer-verify-BQ2R08f2Ya/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-29 06:41:43,417 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_f41a68e7-fafa-48a2-aca6-8783e0010a4f/bin/uautomizer-verify-BQ2R08f2Ya/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 (9)] Waiting until timeout for monitored process [2023-11-29 06:41:43,558 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 06:41:43,562 INFO L262 TraceCheckSpWp]: Trace formula consists of 134 conjuncts, 3 conjunts are in the unsatisfiable core [2023-11-29 06:41:43,564 INFO L285 TraceCheckSpWp]: Computing forward predicates... [2023-11-29 06:41:43,609 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-29 06:41:43,610 INFO L323 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2023-11-29 06:41:43,610 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2023-11-29 06:41:43,610 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [1300275404] [2023-11-29 06:41:43,611 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [1300275404] provided 1 perfect and 0 imperfect interpolant sequences [2023-11-29 06:41:43,611 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-11-29 06:41:43,611 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2023-11-29 06:41:43,611 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1383970737] [2023-11-29 06:41:43,612 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-11-29 06:41:43,612 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2023-11-29 06:41:43,612 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2023-11-29 06:41:43,613 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2023-11-29 06:41:43,613 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2023-11-29 06:41:43,623 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 27 out of 55 [2023-11-29 06:41:43,623 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 51 places, 41 transitions, 92 flow. Second operand has 4 states, 4 states have (on average 30.25) internal successors, (121), 4 states have internal predecessors, (121), 0 states have call successors, (0), 0 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-29 06:41:43,623 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2023-11-29 06:41:43,623 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 27 of 55 [2023-11-29 06:41:43,624 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2023-11-29 06:41:43,978 INFO L124 PetriNetUnfolderBase]: 1129/1953 cut-off events. [2023-11-29 06:41:43,979 INFO L125 PetriNetUnfolderBase]: For 106/106 co-relation queries the response was YES. [2023-11-29 06:41:43,983 INFO L83 FinitePrefix]: Finished finitePrefix Result has 3813 conditions, 1953 events. 1129/1953 cut-off events. For 106/106 co-relation queries the response was YES. Maximal size of possible extension queue 153. Compared 12487 event pairs, 94 based on Foata normal form. 60/1998 useless extension candidates. Maximal degree in co-relation 3802. Up to 1184 conditions per place. [2023-11-29 06:41:43,993 INFO L140 encePairwiseOnDemand]: 49/55 looper letters, 38 selfloop transitions, 5 changer transitions 1/62 dead transitions. [2023-11-29 06:41:43,994 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 53 places, 62 transitions, 230 flow [2023-11-29 06:41:43,994 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2023-11-29 06:41:43,994 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 4 states. [2023-11-29 06:41:43,995 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 154 transitions. [2023-11-29 06:41:43,995 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.7 [2023-11-29 06:41:43,995 INFO L72 ComplementDD]: Start complementDD. Operand 4 states and 154 transitions. [2023-11-29 06:41:43,995 INFO L73 IsDeterministic]: Start isDeterministic. Operand 4 states and 154 transitions. [2023-11-29 06:41:43,996 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2023-11-29 06:41:43,996 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 4 states and 154 transitions. [2023-11-29 06:41:43,996 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 5 states, 4 states have (on average 38.5) internal successors, (154), 4 states have internal predecessors, (154), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-29 06:41:43,997 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 5 states, 5 states have (on average 55.0) internal successors, (275), 5 states have internal predecessors, (275), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-29 06:41:43,998 INFO L81 ComplementDD]: Finished complementDD. Result has 5 states, 5 states have (on average 55.0) internal successors, (275), 5 states have internal predecessors, (275), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-29 06:41:43,998 INFO L175 Difference]: Start difference. First operand has 51 places, 41 transitions, 92 flow. Second operand 4 states and 154 transitions. [2023-11-29 06:41:43,998 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 53 places, 62 transitions, 230 flow [2023-11-29 06:41:43,998 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 51 places, 62 transitions, 222 flow, removed 0 selfloop flow, removed 2 redundant places. [2023-11-29 06:41:44,000 INFO L231 Difference]: Finished difference. Result has 53 places, 44 transitions, 122 flow [2023-11-29 06:41:44,000 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=55, PETRI_DIFFERENCE_MINUEND_FLOW=88, PETRI_DIFFERENCE_MINUEND_PLACES=48, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=41, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=2, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=36, PETRI_DIFFERENCE_SUBTRAHEND_STATES=4, PETRI_FLOW=122, PETRI_PLACES=53, PETRI_TRANSITIONS=44} [2023-11-29 06:41:44,001 INFO L281 CegarLoopForPetriNet]: 60 programPoint places, -7 predicate places. [2023-11-29 06:41:44,001 INFO L495 AbstractCegarLoop]: Abstraction has has 53 places, 44 transitions, 122 flow [2023-11-29 06:41:44,002 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 30.25) internal successors, (121), 4 states have internal predecessors, (121), 0 states have call successors, (0), 0 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-29 06:41:44,002 INFO L200 CegarLoopForPetriNet]: Found error trace [2023-11-29 06:41:44,002 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] [2023-11-29 06:41:44,005 INFO L552 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_f41a68e7-fafa-48a2-aca6-8783e0010a4f/bin/uautomizer-verify-BQ2R08f2Ya/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 (9)] Ended with exit code 0 [2023-11-29 06:41:44,204 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 9 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_f41a68e7-fafa-48a2-aca6-8783e0010a4f/bin/uautomizer-verify-BQ2R08f2Ya/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-29 06:41:44,205 INFO L420 AbstractCegarLoop]: === Iteration 9 === Targeting ULTIMATE.startErr7ASSERT_VIOLATIONMEMORY_LEAK === [P2Err0ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 10 more)] === [2023-11-29 06:41:44,205 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-11-29 06:41:44,206 INFO L85 PathProgramCache]: Analyzing trace with hash -2095417489, now seen corresponding path program 1 times [2023-11-29 06:41:44,206 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2023-11-29 06:41:44,206 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [1521455078] [2023-11-29 06:41:44,207 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-11-29 06:41:44,207 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-29 06:41:44,207 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_f41a68e7-fafa-48a2-aca6-8783e0010a4f/bin/uautomizer-verify-BQ2R08f2Ya/mathsat [2023-11-29 06:41:44,208 INFO L229 MonitoredProcess]: Starting monitored process 10 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_f41a68e7-fafa-48a2-aca6-8783e0010a4f/bin/uautomizer-verify-BQ2R08f2Ya/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-29 06:41:44,210 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_f41a68e7-fafa-48a2-aca6-8783e0010a4f/bin/uautomizer-verify-BQ2R08f2Ya/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 (10)] Waiting until timeout for monitored process [2023-11-29 06:41:44,337 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 06:41:44,343 INFO L262 TraceCheckSpWp]: Trace formula consists of 140 conjuncts, 4 conjunts are in the unsatisfiable core [2023-11-29 06:41:44,345 INFO L285 TraceCheckSpWp]: Computing forward predicates... [2023-11-29 06:41:44,414 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-29 06:41:44,415 INFO L323 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2023-11-29 06:41:44,415 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2023-11-29 06:41:44,415 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [1521455078] [2023-11-29 06:41:44,415 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [1521455078] provided 1 perfect and 0 imperfect interpolant sequences [2023-11-29 06:41:44,416 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-11-29 06:41:44,416 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2023-11-29 06:41:44,416 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [566498055] [2023-11-29 06:41:44,416 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-11-29 06:41:44,417 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2023-11-29 06:41:44,417 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2023-11-29 06:41:44,418 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2023-11-29 06:41:44,418 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2023-11-29 06:41:44,433 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 27 out of 55 [2023-11-29 06:41:44,434 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 53 places, 44 transitions, 122 flow. Second operand has 5 states, 5 states have (on average 29.8) internal successors, (149), 5 states have internal predecessors, (149), 0 states have call successors, (0), 0 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-29 06:41:44,434 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2023-11-29 06:41:44,434 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 27 of 55 [2023-11-29 06:41:44,434 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2023-11-29 06:41:44,751 INFO L124 PetriNetUnfolderBase]: 748/1324 cut-off events. [2023-11-29 06:41:44,752 INFO L125 PetriNetUnfolderBase]: For 339/339 co-relation queries the response was YES. [2023-11-29 06:41:44,754 INFO L83 FinitePrefix]: Finished finitePrefix Result has 2971 conditions, 1324 events. 748/1324 cut-off events. For 339/339 co-relation queries the response was YES. Maximal size of possible extension queue 92. Compared 7564 event pairs, 34 based on Foata normal form. 54/1365 useless extension candidates. Maximal degree in co-relation 2958. Up to 645 conditions per place. [2023-11-29 06:41:44,761 INFO L140 encePairwiseOnDemand]: 49/55 looper letters, 47 selfloop transitions, 8 changer transitions 1/74 dead transitions. [2023-11-29 06:41:44,761 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 57 places, 74 transitions, 315 flow [2023-11-29 06:41:44,762 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2023-11-29 06:41:44,762 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 5 states. [2023-11-29 06:41:44,763 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 193 transitions. [2023-11-29 06:41:44,763 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.7018181818181818 [2023-11-29 06:41:44,764 INFO L72 ComplementDD]: Start complementDD. Operand 5 states and 193 transitions. [2023-11-29 06:41:44,764 INFO L73 IsDeterministic]: Start isDeterministic. Operand 5 states and 193 transitions. [2023-11-29 06:41:44,764 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2023-11-29 06:41:44,764 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 5 states and 193 transitions. [2023-11-29 06:41:44,765 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 6 states, 5 states have (on average 38.6) internal successors, (193), 5 states have internal predecessors, (193), 0 states have call successors, (0), 0 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-29 06:41:44,767 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 6 states, 6 states have (on average 55.0) internal successors, (330), 6 states have internal predecessors, (330), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-29 06:41:44,767 INFO L81 ComplementDD]: Finished complementDD. Result has 6 states, 6 states have (on average 55.0) internal successors, (330), 6 states have internal predecessors, (330), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-29 06:41:44,767 INFO L175 Difference]: Start difference. First operand has 53 places, 44 transitions, 122 flow. Second operand 5 states and 193 transitions. [2023-11-29 06:41:44,768 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 57 places, 74 transitions, 315 flow [2023-11-29 06:41:44,770 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 55 places, 74 transitions, 305 flow, removed 1 selfloop flow, removed 2 redundant places. [2023-11-29 06:41:44,772 INFO L231 Difference]: Finished difference. Result has 57 places, 47 transitions, 162 flow [2023-11-29 06:41:44,772 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=55, PETRI_DIFFERENCE_MINUEND_FLOW=114, PETRI_DIFFERENCE_MINUEND_PLACES=51, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=44, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=5, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=36, PETRI_DIFFERENCE_SUBTRAHEND_STATES=5, PETRI_FLOW=162, PETRI_PLACES=57, PETRI_TRANSITIONS=47} [2023-11-29 06:41:44,773 INFO L281 CegarLoopForPetriNet]: 60 programPoint places, -3 predicate places. [2023-11-29 06:41:44,773 INFO L495 AbstractCegarLoop]: Abstraction has has 57 places, 47 transitions, 162 flow [2023-11-29 06:41:44,774 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 29.8) internal successors, (149), 5 states have internal predecessors, (149), 0 states have call successors, (0), 0 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-29 06:41:44,774 INFO L200 CegarLoopForPetriNet]: Found error trace [2023-11-29 06:41:44,774 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-29 06:41:44,777 INFO L552 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_f41a68e7-fafa-48a2-aca6-8783e0010a4f/bin/uautomizer-verify-BQ2R08f2Ya/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 (10)] Ended with exit code 0 [2023-11-29 06:41:44,976 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 10 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_f41a68e7-fafa-48a2-aca6-8783e0010a4f/bin/uautomizer-verify-BQ2R08f2Ya/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-29 06:41:44,977 INFO L420 AbstractCegarLoop]: === Iteration 10 === Targeting ULTIMATE.startErr7ASSERT_VIOLATIONMEMORY_LEAK === [P2Err0ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 10 more)] === [2023-11-29 06:41:44,977 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-11-29 06:41:44,977 INFO L85 PathProgramCache]: Analyzing trace with hash 1136827130, now seen corresponding path program 1 times [2023-11-29 06:41:44,978 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2023-11-29 06:41:44,978 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [1286541196] [2023-11-29 06:41:44,978 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-11-29 06:41:44,978 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-29 06:41:44,978 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_f41a68e7-fafa-48a2-aca6-8783e0010a4f/bin/uautomizer-verify-BQ2R08f2Ya/mathsat [2023-11-29 06:41:44,979 INFO L229 MonitoredProcess]: Starting monitored process 11 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_f41a68e7-fafa-48a2-aca6-8783e0010a4f/bin/uautomizer-verify-BQ2R08f2Ya/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-29 06:41:44,981 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_f41a68e7-fafa-48a2-aca6-8783e0010a4f/bin/uautomizer-verify-BQ2R08f2Ya/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 (11)] Waiting until timeout for monitored process [2023-11-29 06:41:45,111 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 06:41:45,116 INFO L262 TraceCheckSpWp]: Trace formula consists of 150 conjuncts, 5 conjunts are in the unsatisfiable core [2023-11-29 06:41:45,118 INFO L285 TraceCheckSpWp]: Computing forward predicates... [2023-11-29 06:41:45,201 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-29 06:41:45,201 INFO L323 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2023-11-29 06:41:45,201 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2023-11-29 06:41:45,201 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [1286541196] [2023-11-29 06:41:45,201 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [1286541196] provided 1 perfect and 0 imperfect interpolant sequences [2023-11-29 06:41:45,202 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-11-29 06:41:45,202 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2023-11-29 06:41:45,202 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1573637816] [2023-11-29 06:41:45,202 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-11-29 06:41:45,202 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2023-11-29 06:41:45,203 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2023-11-29 06:41:45,203 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2023-11-29 06:41:45,204 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2023-11-29 06:41:45,223 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 27 out of 55 [2023-11-29 06:41:45,223 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 57 places, 47 transitions, 162 flow. Second operand has 6 states, 6 states have (on average 29.666666666666668) internal successors, (178), 6 states have internal predecessors, (178), 0 states have call successors, (0), 0 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-29 06:41:45,224 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2023-11-29 06:41:45,224 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 27 of 55 [2023-11-29 06:41:45,224 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2023-11-29 06:41:45,534 INFO L124 PetriNetUnfolderBase]: 381/671 cut-off events. [2023-11-29 06:41:45,534 INFO L125 PetriNetUnfolderBase]: For 601/601 co-relation queries the response was YES. [2023-11-29 06:41:45,536 INFO L83 FinitePrefix]: Finished finitePrefix Result has 1749 conditions, 671 events. 381/671 cut-off events. For 601/601 co-relation queries the response was YES. Maximal size of possible extension queue 39. Compared 2905 event pairs, 23 based on Foata normal form. 32/691 useless extension candidates. Maximal degree in co-relation 1734. Up to 228 conditions per place. [2023-11-29 06:41:45,539 INFO L140 encePairwiseOnDemand]: 49/55 looper letters, 42 selfloop transitions, 11 changer transitions 1/72 dead transitions. [2023-11-29 06:41:45,539 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 62 places, 72 transitions, 330 flow [2023-11-29 06:41:45,540 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2023-11-29 06:41:45,540 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 6 states. [2023-11-29 06:41:45,541 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6 states to 6 states and 218 transitions. [2023-11-29 06:41:45,541 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.6606060606060606 [2023-11-29 06:41:45,541 INFO L72 ComplementDD]: Start complementDD. Operand 6 states and 218 transitions. [2023-11-29 06:41:45,541 INFO L73 IsDeterministic]: Start isDeterministic. Operand 6 states and 218 transitions. [2023-11-29 06:41:45,542 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2023-11-29 06:41:45,542 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 6 states and 218 transitions. [2023-11-29 06:41:45,542 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 7 states, 6 states have (on average 36.333333333333336) internal successors, (218), 6 states have internal predecessors, (218), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-29 06:41:45,543 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 7 states, 7 states have (on average 55.0) internal successors, (385), 7 states have internal predecessors, (385), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-29 06:41:45,544 INFO L81 ComplementDD]: Finished complementDD. Result has 7 states, 7 states have (on average 55.0) internal successors, (385), 7 states have internal predecessors, (385), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-29 06:41:45,544 INFO L175 Difference]: Start difference. First operand has 57 places, 47 transitions, 162 flow. Second operand 6 states and 218 transitions. [2023-11-29 06:41:45,544 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 62 places, 72 transitions, 330 flow [2023-11-29 06:41:45,547 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 58 places, 72 transitions, 305 flow, removed 4 selfloop flow, removed 4 redundant places. [2023-11-29 06:41:45,548 INFO L231 Difference]: Finished difference. Result has 60 places, 47 transitions, 176 flow [2023-11-29 06:41:45,549 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=55, PETRI_DIFFERENCE_MINUEND_FLOW=140, PETRI_DIFFERENCE_MINUEND_PLACES=53, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=47, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=11, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=36, PETRI_DIFFERENCE_SUBTRAHEND_STATES=6, PETRI_FLOW=176, PETRI_PLACES=60, PETRI_TRANSITIONS=47} [2023-11-29 06:41:45,549 INFO L281 CegarLoopForPetriNet]: 60 programPoint places, 0 predicate places. [2023-11-29 06:41:45,550 INFO L495 AbstractCegarLoop]: Abstraction has has 60 places, 47 transitions, 176 flow [2023-11-29 06:41:45,550 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 29.666666666666668) internal successors, (178), 6 states have internal predecessors, (178), 0 states have call successors, (0), 0 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-29 06:41:45,550 INFO L200 CegarLoopForPetriNet]: Found error trace [2023-11-29 06:41:45,550 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-11-29 06:41:45,554 INFO L552 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_f41a68e7-fafa-48a2-aca6-8783e0010a4f/bin/uautomizer-verify-BQ2R08f2Ya/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 (11)] Ended with exit code 0 [2023-11-29 06:41:45,751 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 11 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_f41a68e7-fafa-48a2-aca6-8783e0010a4f/bin/uautomizer-verify-BQ2R08f2Ya/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-29 06:41:45,751 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-29 06:41:45,752 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-11-29 06:41:45,752 INFO L85 PathProgramCache]: Analyzing trace with hash 994718206, now seen corresponding path program 1 times [2023-11-29 06:41:45,753 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2023-11-29 06:41:45,753 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [1914613710] [2023-11-29 06:41:45,753 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-11-29 06:41:45,753 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-29 06:41:45,754 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_f41a68e7-fafa-48a2-aca6-8783e0010a4f/bin/uautomizer-verify-BQ2R08f2Ya/mathsat [2023-11-29 06:41:45,755 INFO L229 MonitoredProcess]: Starting monitored process 12 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_f41a68e7-fafa-48a2-aca6-8783e0010a4f/bin/uautomizer-verify-BQ2R08f2Ya/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-29 06:41:45,757 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_f41a68e7-fafa-48a2-aca6-8783e0010a4f/bin/uautomizer-verify-BQ2R08f2Ya/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 (12)] Waiting until timeout for monitored process [2023-11-29 06:41:45,942 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 06:41:45,948 INFO L262 TraceCheckSpWp]: Trace formula consists of 173 conjuncts, 14 conjunts are in the unsatisfiable core [2023-11-29 06:41:45,951 INFO L285 TraceCheckSpWp]: Computing forward predicates... [2023-11-29 06:41:46,581 WARN L876 $PredicateComparison]: unable to prove that (exists ((|v_ULTIMATE.start_main_~#t1110~0#1.base_43| (_ BitVec 32)) (|v_ULTIMATE.start_main_~#t1108~0#1.base_47| (_ BitVec 32)) (|v_ULTIMATE.start_main_~#t1109~0#1.base_41| (_ BitVec 32))) (let ((.cse0 (store |c_ULTIMATE.start_main_old_#valid#1| |v_ULTIMATE.start_main_~#t1108~0#1.base_47| (_ bv1 1)))) (and (= (_ bv0 1) (select |c_ULTIMATE.start_main_old_#valid#1| |v_ULTIMATE.start_main_~#t1108~0#1.base_47|)) (= |c_#valid| (store (store (store |c_ULTIMATE.start_main_old_#valid#1| |v_ULTIMATE.start_main_~#t1108~0#1.base_47| (_ bv0 1)) |v_ULTIMATE.start_main_~#t1109~0#1.base_41| (_ bv0 1)) |v_ULTIMATE.start_main_~#t1110~0#1.base_43| (_ bv0 1))) (= (select .cse0 |v_ULTIMATE.start_main_~#t1109~0#1.base_41|) (_ bv0 1)) (= (select (store .cse0 |v_ULTIMATE.start_main_~#t1109~0#1.base_41| (_ bv1 1)) |v_ULTIMATE.start_main_~#t1110~0#1.base_43|) (_ bv0 1))))) is different from true [2023-11-29 06:41:46,582 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-29 06:41:46,583 INFO L323 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2023-11-29 06:41:46,583 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2023-11-29 06:41:46,583 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [1914613710] [2023-11-29 06:41:46,583 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [1914613710] provided 1 perfect and 0 imperfect interpolant sequences [2023-11-29 06:41:46,583 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-11-29 06:41:46,583 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2023-11-29 06:41:46,584 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1654423026] [2023-11-29 06:41:46,584 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-11-29 06:41:46,584 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2023-11-29 06:41:46,585 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2023-11-29 06:41:46,585 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2023-11-29 06:41:46,585 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=14, Unknown=1, NotChecked=6, Total=30 [2023-11-29 06:41:46,586 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 21 out of 55 [2023-11-29 06:41:46,586 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 60 places, 47 transitions, 176 flow. Second operand has 6 states, 6 states have (on average 24.166666666666668) internal successors, (145), 6 states have internal predecessors, (145), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-29 06:41:46,586 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2023-11-29 06:41:46,586 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 21 of 55 [2023-11-29 06:41:46,586 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2023-11-29 06:41:46,862 INFO L124 PetriNetUnfolderBase]: 206/448 cut-off events. [2023-11-29 06:41:46,863 INFO L125 PetriNetUnfolderBase]: For 129/135 co-relation queries the response was YES. [2023-11-29 06:41:46,864 INFO L83 FinitePrefix]: Finished finitePrefix Result has 956 conditions, 448 events. 206/448 cut-off events. For 129/135 co-relation queries the response was YES. Maximal size of possible extension queue 26. Compared 2079 event pairs, 48 based on Foata normal form. 8/416 useless extension candidates. Maximal degree in co-relation 939. Up to 290 conditions per place. [2023-11-29 06:41:46,866 INFO L140 encePairwiseOnDemand]: 47/55 looper letters, 26 selfloop transitions, 7 changer transitions 0/57 dead transitions. [2023-11-29 06:41:46,866 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 65 places, 57 transitions, 262 flow [2023-11-29 06:41:46,867 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2023-11-29 06:41:46,867 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 6 states. [2023-11-29 06:41:46,868 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6 states to 6 states and 160 transitions. [2023-11-29 06:41:46,869 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.48484848484848486 [2023-11-29 06:41:46,869 INFO L72 ComplementDD]: Start complementDD. Operand 6 states and 160 transitions. [2023-11-29 06:41:46,869 INFO L73 IsDeterministic]: Start isDeterministic. Operand 6 states and 160 transitions. [2023-11-29 06:41:46,869 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2023-11-29 06:41:46,869 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 6 states and 160 transitions. [2023-11-29 06:41:46,870 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 7 states, 6 states have (on average 26.666666666666668) internal successors, (160), 6 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-29 06:41:46,872 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 7 states, 7 states have (on average 55.0) internal successors, (385), 7 states have internal predecessors, (385), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-29 06:41:46,872 INFO L81 ComplementDD]: Finished complementDD. Result has 7 states, 7 states have (on average 55.0) internal successors, (385), 7 states have internal predecessors, (385), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-29 06:41:46,872 INFO L175 Difference]: Start difference. First operand has 60 places, 47 transitions, 176 flow. Second operand 6 states and 160 transitions. [2023-11-29 06:41:46,872 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 65 places, 57 transitions, 262 flow [2023-11-29 06:41:46,873 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 57 places, 57 transitions, 206 flow, removed 10 selfloop flow, removed 8 redundant places. [2023-11-29 06:41:46,874 INFO L231 Difference]: Finished difference. Result has 58 places, 50 transitions, 152 flow [2023-11-29 06:41:46,875 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=55, PETRI_DIFFERENCE_MINUEND_FLOW=120, PETRI_DIFFERENCE_MINUEND_PLACES=52, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=47, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=4, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=40, PETRI_DIFFERENCE_SUBTRAHEND_STATES=6, PETRI_FLOW=152, PETRI_PLACES=58, PETRI_TRANSITIONS=50} [2023-11-29 06:41:46,875 INFO L281 CegarLoopForPetriNet]: 60 programPoint places, -2 predicate places. [2023-11-29 06:41:46,875 INFO L495 AbstractCegarLoop]: Abstraction has has 58 places, 50 transitions, 152 flow [2023-11-29 06:41:46,875 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 24.166666666666668) internal successors, (145), 6 states have internal predecessors, (145), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-29 06:41:46,875 INFO L200 CegarLoopForPetriNet]: Found error trace [2023-11-29 06:41:46,876 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-11-29 06:41:46,879 INFO L552 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_f41a68e7-fafa-48a2-aca6-8783e0010a4f/bin/uautomizer-verify-BQ2R08f2Ya/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 (12)] Ended with exit code 0 [2023-11-29 06:41:47,076 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 12 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_f41a68e7-fafa-48a2-aca6-8783e0010a4f/bin/uautomizer-verify-BQ2R08f2Ya/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-29 06:41:47,076 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-29 06:41:47,077 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-11-29 06:41:47,077 INFO L85 PathProgramCache]: Analyzing trace with hash 1651235949, now seen corresponding path program 1 times [2023-11-29 06:41:47,077 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2023-11-29 06:41:47,077 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [2145220910] [2023-11-29 06:41:47,077 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-11-29 06:41:47,078 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-29 06:41:47,078 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_f41a68e7-fafa-48a2-aca6-8783e0010a4f/bin/uautomizer-verify-BQ2R08f2Ya/mathsat [2023-11-29 06:41:47,079 INFO L229 MonitoredProcess]: Starting monitored process 13 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_f41a68e7-fafa-48a2-aca6-8783e0010a4f/bin/uautomizer-verify-BQ2R08f2Ya/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-29 06:41:47,080 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_f41a68e7-fafa-48a2-aca6-8783e0010a4f/bin/uautomizer-verify-BQ2R08f2Ya/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 (13)] Waiting until timeout for monitored process [2023-11-29 06:41:47,203 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 06:41:47,208 INFO L262 TraceCheckSpWp]: Trace formula consists of 169 conjuncts, 6 conjunts are in the unsatisfiable core [2023-11-29 06:41:47,211 INFO L285 TraceCheckSpWp]: Computing forward predicates... [2023-11-29 06:41:47,322 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-29 06:41:47,322 INFO L323 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2023-11-29 06:41:47,322 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2023-11-29 06:41:47,322 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [2145220910] [2023-11-29 06:41:47,323 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [2145220910] provided 1 perfect and 0 imperfect interpolant sequences [2023-11-29 06:41:47,323 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-11-29 06:41:47,323 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2023-11-29 06:41:47,323 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [700031050] [2023-11-29 06:41:47,323 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-11-29 06:41:47,324 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2023-11-29 06:41:47,324 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2023-11-29 06:41:47,324 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2023-11-29 06:41:47,324 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2023-11-29 06:41:47,337 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 29 out of 55 [2023-11-29 06:41:47,337 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 58 places, 50 transitions, 152 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-29 06:41:47,338 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2023-11-29 06:41:47,338 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 29 of 55 [2023-11-29 06:41:47,338 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2023-11-29 06:41:47,685 INFO L124 PetriNetUnfolderBase]: 478/996 cut-off events. [2023-11-29 06:41:47,685 INFO L125 PetriNetUnfolderBase]: For 316/358 co-relation queries the response was YES. [2023-11-29 06:41:47,687 INFO L83 FinitePrefix]: Finished finitePrefix Result has 2297 conditions, 996 events. 478/996 cut-off events. For 316/358 co-relation queries the response was YES. Maximal size of possible extension queue 54. Compared 5361 event pairs, 135 based on Foata normal form. 8/960 useless extension candidates. Maximal degree in co-relation 2284. Up to 397 conditions per place. [2023-11-29 06:41:47,693 INFO L140 encePairwiseOnDemand]: 49/55 looper letters, 50 selfloop transitions, 5 changer transitions 0/81 dead transitions. [2023-11-29 06:41:47,693 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 63 places, 81 transitions, 366 flow [2023-11-29 06:41:47,694 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2023-11-29 06:41:47,694 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 6 states. [2023-11-29 06:41:47,695 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6 states to 6 states and 224 transitions. [2023-11-29 06:41:47,695 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.6787878787878788 [2023-11-29 06:41:47,695 INFO L72 ComplementDD]: Start complementDD. Operand 6 states and 224 transitions. [2023-11-29 06:41:47,695 INFO L73 IsDeterministic]: Start isDeterministic. Operand 6 states and 224 transitions. [2023-11-29 06:41:47,696 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2023-11-29 06:41:47,696 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 6 states and 224 transitions. [2023-11-29 06:41:47,697 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-29 06:41:47,698 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 7 states, 7 states have (on average 55.0) internal successors, (385), 7 states have internal predecessors, (385), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-29 06:41:47,699 INFO L81 ComplementDD]: Finished complementDD. Result has 7 states, 7 states have (on average 55.0) internal successors, (385), 7 states have internal predecessors, (385), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-29 06:41:47,699 INFO L175 Difference]: Start difference. First operand has 58 places, 50 transitions, 152 flow. Second operand 6 states and 224 transitions. [2023-11-29 06:41:47,699 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 63 places, 81 transitions, 366 flow [2023-11-29 06:41:47,701 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 59 places, 81 transitions, 348 flow, removed 0 selfloop flow, removed 4 redundant places. [2023-11-29 06:41:47,702 INFO L231 Difference]: Finished difference. Result has 63 places, 54 transitions, 181 flow [2023-11-29 06:41:47,703 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=55, PETRI_DIFFERENCE_MINUEND_FLOW=142, PETRI_DIFFERENCE_MINUEND_PLACES=54, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=50, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=1, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=45, PETRI_DIFFERENCE_SUBTRAHEND_STATES=6, PETRI_FLOW=181, PETRI_PLACES=63, PETRI_TRANSITIONS=54} [2023-11-29 06:41:47,703 INFO L281 CegarLoopForPetriNet]: 60 programPoint places, 3 predicate places. [2023-11-29 06:41:47,704 INFO L495 AbstractCegarLoop]: Abstraction has has 63 places, 54 transitions, 181 flow [2023-11-29 06:41:47,704 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-29 06:41:47,704 INFO L200 CegarLoopForPetriNet]: Found error trace [2023-11-29 06:41:47,705 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-11-29 06:41:47,708 INFO L552 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_f41a68e7-fafa-48a2-aca6-8783e0010a4f/bin/uautomizer-verify-BQ2R08f2Ya/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 (13)] Ended with exit code 0 [2023-11-29 06:41:47,908 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 13 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_f41a68e7-fafa-48a2-aca6-8783e0010a4f/bin/uautomizer-verify-BQ2R08f2Ya/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-29 06:41:47,908 INFO L420 AbstractCegarLoop]: === Iteration 13 === Targeting ULTIMATE.startErr6ASSERT_VIOLATIONMEMORY_LEAK === [P2Err0ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 10 more)] === [2023-11-29 06:41:47,908 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-11-29 06:41:47,909 INFO L85 PathProgramCache]: Analyzing trace with hash 180059181, now seen corresponding path program 2 times [2023-11-29 06:41:47,909 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2023-11-29 06:41:47,909 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [1297910073] [2023-11-29 06:41:47,909 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2023-11-29 06:41:47,909 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-29 06:41:47,910 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_f41a68e7-fafa-48a2-aca6-8783e0010a4f/bin/uautomizer-verify-BQ2R08f2Ya/mathsat [2023-11-29 06:41:47,911 INFO L229 MonitoredProcess]: Starting monitored process 14 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_f41a68e7-fafa-48a2-aca6-8783e0010a4f/bin/uautomizer-verify-BQ2R08f2Ya/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-29 06:41:47,912 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_f41a68e7-fafa-48a2-aca6-8783e0010a4f/bin/uautomizer-verify-BQ2R08f2Ya/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 (14)] Waiting until timeout for monitored process [2023-11-29 06:41:48,049 INFO L228 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 1 check-sat command(s) [2023-11-29 06:41:48,049 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2023-11-29 06:41:48,054 INFO L262 TraceCheckSpWp]: Trace formula consists of 169 conjuncts, 6 conjunts are in the unsatisfiable core [2023-11-29 06:41:48,056 INFO L285 TraceCheckSpWp]: Computing forward predicates... [2023-11-29 06:41:48,690 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-29 06:41:48,690 INFO L323 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2023-11-29 06:41:48,690 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2023-11-29 06:41:48,691 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [1297910073] [2023-11-29 06:41:48,691 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [1297910073] provided 1 perfect and 0 imperfect interpolant sequences [2023-11-29 06:41:48,691 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-11-29 06:41:48,691 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2023-11-29 06:41:48,691 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [400166994] [2023-11-29 06:41:48,692 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-11-29 06:41:48,692 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2023-11-29 06:41:48,692 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2023-11-29 06:41:48,693 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2023-11-29 06:41:48,693 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2023-11-29 06:41:48,704 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 29 out of 55 [2023-11-29 06:41:48,704 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 63 places, 54 transitions, 181 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-29 06:41:48,705 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2023-11-29 06:41:48,705 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 29 of 55 [2023-11-29 06:41:48,705 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2023-11-29 06:41:49,134 INFO L124 PetriNetUnfolderBase]: 936/1847 cut-off events. [2023-11-29 06:41:49,134 INFO L125 PetriNetUnfolderBase]: For 648/699 co-relation queries the response was YES. [2023-11-29 06:41:49,139 INFO L83 FinitePrefix]: Finished finitePrefix Result has 4474 conditions, 1847 events. 936/1847 cut-off events. For 648/699 co-relation queries the response was YES. Maximal size of possible extension queue 103. Compared 11086 event pairs, 273 based on Foata normal form. 8/1768 useless extension candidates. Maximal degree in co-relation 4458. Up to 721 conditions per place. [2023-11-29 06:41:49,149 INFO L140 encePairwiseOnDemand]: 49/55 looper letters, 53 selfloop transitions, 8 changer transitions 0/88 dead transitions. [2023-11-29 06:41:49,149 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 68 places, 88 transitions, 425 flow [2023-11-29 06:41:49,149 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2023-11-29 06:41:49,150 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 6 states. [2023-11-29 06:41:49,151 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6 states to 6 states and 224 transitions. [2023-11-29 06:41:49,151 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.6787878787878788 [2023-11-29 06:41:49,151 INFO L72 ComplementDD]: Start complementDD. Operand 6 states and 224 transitions. [2023-11-29 06:41:49,151 INFO L73 IsDeterministic]: Start isDeterministic. Operand 6 states and 224 transitions. [2023-11-29 06:41:49,152 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2023-11-29 06:41:49,152 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 6 states and 224 transitions. [2023-11-29 06:41:49,153 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-29 06:41:49,153 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 7 states, 7 states have (on average 55.0) internal successors, (385), 7 states have internal predecessors, (385), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-29 06:41:49,154 INFO L81 ComplementDD]: Finished complementDD. Result has 7 states, 7 states have (on average 55.0) internal successors, (385), 7 states have internal predecessors, (385), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-29 06:41:49,154 INFO L175 Difference]: Start difference. First operand has 63 places, 54 transitions, 181 flow. Second operand 6 states and 224 transitions. [2023-11-29 06:41:49,154 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 68 places, 88 transitions, 425 flow [2023-11-29 06:41:49,157 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 67 places, 88 transitions, 424 flow, removed 0 selfloop flow, removed 1 redundant places. [2023-11-29 06:41:49,158 INFO L231 Difference]: Finished difference. Result has 71 places, 61 transitions, 263 flow [2023-11-29 06:41:49,158 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=55, PETRI_DIFFERENCE_MINUEND_FLOW=180, PETRI_DIFFERENCE_MINUEND_PLACES=62, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=54, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=1, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=46, PETRI_DIFFERENCE_SUBTRAHEND_STATES=6, PETRI_FLOW=263, PETRI_PLACES=71, PETRI_TRANSITIONS=61} [2023-11-29 06:41:49,159 INFO L281 CegarLoopForPetriNet]: 60 programPoint places, 11 predicate places. [2023-11-29 06:41:49,160 INFO L495 AbstractCegarLoop]: Abstraction has has 71 places, 61 transitions, 263 flow [2023-11-29 06:41:49,160 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-29 06:41:49,160 INFO L200 CegarLoopForPetriNet]: Found error trace [2023-11-29 06:41:49,160 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-11-29 06:41:49,164 INFO L540 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_f41a68e7-fafa-48a2-aca6-8783e0010a4f/bin/uautomizer-verify-BQ2R08f2Ya/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 (14)] Forceful destruction successful, exit code 0 [2023-11-29 06:41:49,361 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 14 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_f41a68e7-fafa-48a2-aca6-8783e0010a4f/bin/uautomizer-verify-BQ2R08f2Ya/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-29 06:41:49,361 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-29 06:41:49,361 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-11-29 06:41:49,362 INFO L85 PathProgramCache]: Analyzing trace with hash -1696476293, now seen corresponding path program 3 times [2023-11-29 06:41:49,362 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2023-11-29 06:41:49,363 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [1877203521] [2023-11-29 06:41:49,363 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST2 [2023-11-29 06:41:49,363 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-29 06:41:49,363 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_f41a68e7-fafa-48a2-aca6-8783e0010a4f/bin/uautomizer-verify-BQ2R08f2Ya/mathsat [2023-11-29 06:41:49,364 INFO L229 MonitoredProcess]: Starting monitored process 15 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_f41a68e7-fafa-48a2-aca6-8783e0010a4f/bin/uautomizer-verify-BQ2R08f2Ya/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-29 06:41:49,366 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_f41a68e7-fafa-48a2-aca6-8783e0010a4f/bin/uautomizer-verify-BQ2R08f2Ya/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 (15)] Waiting until timeout for monitored process [2023-11-29 06:41:49,533 INFO L228 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued 1 check-sat command(s) [2023-11-29 06:41:49,533 INFO L229 tOrderPrioritization]: Conjunction of SSA is sat [2023-11-29 06:41:49,534 INFO L356 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2023-11-29 06:41:49,632 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2023-11-29 06:41:49,706 INFO L130 FreeRefinementEngine]: Strategy WOLF found a feasible trace [2023-11-29 06:41:49,706 INFO L360 BasicCegarLoop]: Counterexample is feasible [2023-11-29 06:41:49,708 INFO L805 garLoopResultBuilder]: Registering result UNSAFE for location ULTIMATE.startErr6ASSERT_VIOLATIONMEMORY_LEAK (12 of 13 remaining) [2023-11-29 06:41:49,710 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location P2Err0ASSERT_VIOLATIONMEMORY_LEAK (11 of 13 remaining) [2023-11-29 06:41:49,710 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE (10 of 13 remaining) [2023-11-29 06:41:49,710 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE (9 of 13 remaining) [2023-11-29 06:41:49,711 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (8 of 13 remaining) [2023-11-29 06:41:49,711 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr3REQUIRES_VIOLATIONMEMORY_DEREFERENCE (7 of 13 remaining) [2023-11-29 06:41:49,711 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr4REQUIRES_VIOLATIONMEMORY_DEREFERENCE (6 of 13 remaining) [2023-11-29 06:41:49,711 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr5REQUIRES_VIOLATIONMEMORY_DEREFERENCE (5 of 13 remaining) [2023-11-29 06:41:49,711 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr7ASSERT_VIOLATIONMEMORY_LEAK (4 of 13 remaining) [2023-11-29 06:41:49,712 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (3 of 13 remaining) [2023-11-29 06:41:49,712 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (2 of 13 remaining) [2023-11-29 06:41:49,712 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr2INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (1 of 13 remaining) [2023-11-29 06:41:49,712 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location P2Err0ASSERT_VIOLATIONMEMORY_LEAK (0 of 13 remaining) [2023-11-29 06:41:49,717 INFO L552 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_f41a68e7-fafa-48a2-aca6-8783e0010a4f/bin/uautomizer-verify-BQ2R08f2Ya/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 (15)] Ended with exit code 0 [2023-11-29 06:41:49,913 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 15 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_f41a68e7-fafa-48a2-aca6-8783e0010a4f/bin/uautomizer-verify-BQ2R08f2Ya/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-29 06:41:49,913 INFO L445 BasicCegarLoop]: Path program histogram: [3, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-11-29 06:41:49,919 INFO L228 ceAbstractionStarter]: Analysis of concurrent program completed with 1 thread instances [2023-11-29 06:41:49,919 INFO L178 ceAbstractionStarter]: Computing trace abstraction results [2023-11-29 06:41:49,997 WARN L1572 BoogieBacktranslator]: Unfinished Backtranslation: IdentifierExpression #t~pre3 could not be translated [2023-11-29 06:41:50,000 WARN L1572 BoogieBacktranslator]: Unfinished Backtranslation: IdentifierExpression #t~pre5 could not be translated [2023-11-29 06:41:50,001 WARN L1572 BoogieBacktranslator]: Unfinished Backtranslation: IdentifierExpression #t~pre7 could not be translated [2023-11-29 06:41:50,018 WARN L1572 BoogieBacktranslator]: Unfinished Backtranslation: unknown boogie variable #t~nondet0 [2023-11-29 06:41:50,019 WARN L1572 BoogieBacktranslator]: Unfinished Backtranslation: unknown boogie variable #t~nondet0 [2023-11-29 06:41:50,034 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 29.11 06:41:50 BasicIcfg [2023-11-29 06:41:50,034 INFO L131 PluginConnector]: ------------------------ END TraceAbstraction---------------------------- [2023-11-29 06:41:50,035 INFO L112 PluginConnector]: ------------------------Witness Printer---------------------------- [2023-11-29 06:41:50,035 INFO L270 PluginConnector]: Initializing Witness Printer... [2023-11-29 06:41:50,035 INFO L274 PluginConnector]: Witness Printer initialized [2023-11-29 06:41:50,036 INFO L184 PluginConnector]: Executing the observer RCFGCatcher from plugin Witness Printer for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 29.11 06:41:38" (3/4) ... [2023-11-29 06:41:50,038 INFO L140 WitnessPrinter]: No result that supports witness generation found [2023-11-29 06:41:50,039 INFO L131 PluginConnector]: ------------------------ END Witness Printer---------------------------- [2023-11-29 06:41:50,040 INFO L158 Benchmark]: Toolchain (without parser) took 13418.14ms. Allocated memory was 77.6MB in the beginning and 136.3MB in the end (delta: 58.7MB). Free memory was 52.7MB in the beginning and 45.4MB in the end (delta: 7.3MB). Peak memory consumption was 69.1MB. Max. memory is 16.1GB. [2023-11-29 06:41:50,040 INFO L158 Benchmark]: CDTParser took 0.33ms. Allocated memory is still 56.6MB. Free memory is still 33.0MB. There was no memory consumed. Max. memory is 16.1GB. [2023-11-29 06:41:50,040 INFO L158 Benchmark]: CACSL2BoogieTranslator took 602.43ms. Allocated memory is still 77.6MB. Free memory was 52.4MB in the beginning and 46.9MB in the end (delta: 5.5MB). Peak memory consumption was 19.2MB. Max. memory is 16.1GB. [2023-11-29 06:41:50,041 INFO L158 Benchmark]: Boogie Procedure Inliner took 67.60ms. Allocated memory is still 77.6MB. Free memory was 46.9MB in the beginning and 44.2MB in the end (delta: 2.7MB). Peak memory consumption was 2.1MB. Max. memory is 16.1GB. [2023-11-29 06:41:50,041 INFO L158 Benchmark]: Boogie Preprocessor took 76.88ms. Allocated memory is still 77.6MB. Free memory was 44.2MB in the beginning and 40.6MB in the end (delta: 3.6MB). Peak memory consumption was 4.2MB. Max. memory is 16.1GB. [2023-11-29 06:41:50,042 INFO L158 Benchmark]: RCFGBuilder took 983.48ms. Allocated memory was 77.6MB in the beginning and 94.4MB in the end (delta: 16.8MB). Free memory was 40.6MB in the beginning and 67.5MB in the end (delta: -26.9MB). Peak memory consumption was 15.6MB. Max. memory is 16.1GB. [2023-11-29 06:41:50,042 INFO L158 Benchmark]: TraceAbstraction took 11674.19ms. Allocated memory was 94.4MB in the beginning and 136.3MB in the end (delta: 41.9MB). Free memory was 66.9MB in the beginning and 45.4MB in the end (delta: 21.6MB). Peak memory consumption was 63.7MB. Max. memory is 16.1GB. [2023-11-29 06:41:50,043 INFO L158 Benchmark]: Witness Printer took 4.40ms. Allocated memory is still 136.3MB. Free memory is still 45.4MB. There was no memory consumed. Max. memory is 16.1GB. [2023-11-29 06:41:50,045 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.33ms. Allocated memory is still 56.6MB. Free memory is still 33.0MB. There was no memory consumed. Max. memory is 16.1GB. * CACSL2BoogieTranslator took 602.43ms. Allocated memory is still 77.6MB. Free memory was 52.4MB in the beginning and 46.9MB in the end (delta: 5.5MB). Peak memory consumption was 19.2MB. Max. memory is 16.1GB. * Boogie Procedure Inliner took 67.60ms. Allocated memory is still 77.6MB. Free memory was 46.9MB in the beginning and 44.2MB in the end (delta: 2.7MB). Peak memory consumption was 2.1MB. Max. memory is 16.1GB. * Boogie Preprocessor took 76.88ms. Allocated memory is still 77.6MB. Free memory was 44.2MB in the beginning and 40.6MB in the end (delta: 3.6MB). Peak memory consumption was 4.2MB. Max. memory is 16.1GB. * RCFGBuilder took 983.48ms. Allocated memory was 77.6MB in the beginning and 94.4MB in the end (delta: 16.8MB). Free memory was 40.6MB in the beginning and 67.5MB in the end (delta: -26.9MB). Peak memory consumption was 15.6MB. Max. memory is 16.1GB. * TraceAbstraction took 11674.19ms. Allocated memory was 94.4MB in the beginning and 136.3MB in the end (delta: 41.9MB). Free memory was 66.9MB in the beginning and 45.4MB in the end (delta: 21.6MB). Peak memory consumption was 63.7MB. Max. memory is 16.1GB. * Witness Printer took 4.40ms. Allocated memory is still 136.3MB. Free memory is still 45.4MB. 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~pre3 could not be translated - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: IdentifierExpression #t~pre5 could not be translated - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: IdentifierExpression #t~pre7 could not be translated - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: 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_p2_EAX = 0; [L715] 0 int __unbuffered_p2_EBX = 0; [L717] 0 int a = 0; [L718] 0 _Bool main$tmp_guard0; [L719] 0 _Bool main$tmp_guard1; [L721] 0 int x = 0; [L723] 0 int y = 0; [L724] 0 _Bool y$flush_delayed; [L725] 0 int y$mem_tmp; [L726] 0 _Bool y$r_buff0_thd0; [L727] 0 _Bool y$r_buff0_thd1; [L728] 0 _Bool y$r_buff0_thd2; [L729] 0 _Bool y$r_buff0_thd3; [L730] 0 _Bool y$r_buff1_thd0; [L731] 0 _Bool y$r_buff1_thd1; [L732] 0 _Bool y$r_buff1_thd2; [L733] 0 _Bool y$r_buff1_thd3; [L734] 0 _Bool y$read_delayed; [L735] 0 int *y$read_delayed_var; [L736] 0 int y$w_buff0; [L737] 0 _Bool y$w_buff0_used; [L738] 0 int y$w_buff1; [L739] 0 _Bool y$w_buff1_used; [L741] 0 int z = 0; [L742] 0 _Bool weak$$choice0; [L743] 0 _Bool weak$$choice2; [L825] 0 pthread_t t1108; [L826] FCALL, FORK 0 pthread_create(&t1108, ((void *)0), P0, ((void *)0)) VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=0, __unbuffered_p2_EAX=0, __unbuffered_p2_EBX=0, a=0, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, t1108={3:0}, weak$$choice0=0, weak$$choice2=0, x=0, y$flush_delayed=0, y$mem_tmp=0, y$r_buff0_thd0=0, y$r_buff0_thd1=0, y$r_buff0_thd2=0, y$r_buff0_thd3=0, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$r_buff1_thd3=0, y$read_delayed=0, y$read_delayed_var={0:0}, y$w_buff0=0, y$w_buff0_used=0, y$w_buff1=0, y$w_buff1_used=0, y=0, z=0] [L827] 0 pthread_t t1109; [L828] FCALL, FORK 0 pthread_create(&t1109, ((void *)0), P1, ((void *)0)) VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=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, t1108={3:0}, t1109={7:0}, weak$$choice0=0, weak$$choice2=0, x=0, y$flush_delayed=0, y$mem_tmp=0, y$r_buff0_thd0=0, y$r_buff0_thd1=0, y$r_buff0_thd2=0, y$r_buff0_thd3=0, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$r_buff1_thd3=0, y$read_delayed=0, y$read_delayed_var={0:0}, y$w_buff0=0, y$w_buff0_used=0, y$w_buff1=0, y$w_buff1_used=0, y=0, z=0] [L829] 0 pthread_t t1110; [L830] FCALL, FORK 0 pthread_create(&t1110, ((void *)0), P2, ((void *)0)) VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=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, t1108={3:0}, t1109={7:0}, t1110={6:0}, weak$$choice0=0, weak$$choice2=0, x=0, y$flush_delayed=0, y$mem_tmp=0, y$r_buff0_thd0=0, y$r_buff0_thd1=0, y$r_buff0_thd2=0, y$r_buff0_thd3=0, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$r_buff1_thd3=0, y$read_delayed=0, y$read_delayed_var={0:0}, y$w_buff0=0, y$w_buff0_used=0, y$w_buff1=0, y$w_buff1_used=0, y=0, z=0] [L782] 3 y$w_buff1 = y$w_buff0 [L783] 3 y$w_buff0 = 2 [L784] 3 y$w_buff1_used = y$w_buff0_used [L785] 3 y$w_buff0_used = (_Bool)1 [L786] CALL 3 __VERIFIER_assert(!(y$w_buff1_used && y$w_buff0_used)) [L18] COND FALSE 3 !(!expression) [L786] RET 3 __VERIFIER_assert(!(y$w_buff1_used && y$w_buff0_used)) [L787] 3 y$r_buff1_thd0 = y$r_buff0_thd0 [L788] 3 y$r_buff1_thd1 = y$r_buff0_thd1 [L789] 3 y$r_buff1_thd2 = y$r_buff0_thd2 [L790] 3 y$r_buff1_thd3 = y$r_buff0_thd3 [L791] 3 y$r_buff0_thd3 = (_Bool)1 VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=0, __unbuffered_p2_EAX=0, __unbuffered_p2_EBX=0, a=0, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=0, x=0, y$flush_delayed=0, y$mem_tmp=0, y$r_buff0_thd0=0, y$r_buff0_thd1=0, y$r_buff0_thd2=0, y$r_buff0_thd3=1, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$r_buff1_thd3=0, y$read_delayed=0, y$read_delayed_var={0:0}, y$w_buff0=2, y$w_buff0_used=1, y$w_buff1=0, y$w_buff1_used=0, y=0, z=0] [L794] 3 z = 1 VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=0, __unbuffered_p2_EAX=0, __unbuffered_p2_EBX=0, a=0, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=0, x=0, y$flush_delayed=0, y$mem_tmp=0, y$r_buff0_thd0=0, y$r_buff0_thd1=0, y$r_buff0_thd2=0, y$r_buff0_thd3=1, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$r_buff1_thd3=0, y$read_delayed=0, y$read_delayed_var={0:0}, y$w_buff0=2, y$w_buff0_used=1, y$w_buff1=0, y$w_buff1_used=0, y=0, z=1] [L797] 3 __unbuffered_p2_EAX = z VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=0, __unbuffered_p2_EAX=1, __unbuffered_p2_EBX=0, a=0, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=0, x=0, y$flush_delayed=0, y$mem_tmp=0, y$r_buff0_thd0=0, y$r_buff0_thd1=0, y$r_buff0_thd2=0, y$r_buff0_thd3=1, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$r_buff1_thd3=0, y$read_delayed=0, y$read_delayed_var={0:0}, y$w_buff0=2, y$w_buff0_used=1, y$w_buff1=0, y$w_buff1_used=0, y=0, z=1] [L800] 3 __unbuffered_p2_EBX = a VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=0, __unbuffered_p2_EAX=1, __unbuffered_p2_EBX=0, a=0, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=0, x=0, y$flush_delayed=0, y$mem_tmp=0, y$r_buff0_thd0=0, y$r_buff0_thd1=0, y$r_buff0_thd2=0, y$r_buff0_thd3=1, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$r_buff1_thd3=0, y$read_delayed=0, y$read_delayed_var={0:0}, y$w_buff0=2, y$w_buff0_used=1, y$w_buff1=0, y$w_buff1_used=0, y=0, z=1] [L747] 1 a = 1 VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=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$$choice0=0, weak$$choice2=0, x=0, y$flush_delayed=0, y$mem_tmp=0, y$r_buff0_thd0=0, y$r_buff0_thd1=0, y$r_buff0_thd2=0, y$r_buff0_thd3=1, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$r_buff1_thd3=0, y$read_delayed=0, y$read_delayed_var={0:0}, y$w_buff0=2, y$w_buff0_used=1, y$w_buff1=0, y$w_buff1_used=0, y=0, z=1] [L750] 1 __unbuffered_p0_EAX = x VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=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$$choice0=0, weak$$choice2=0, x=0, y$flush_delayed=0, y$mem_tmp=0, y$r_buff0_thd0=0, y$r_buff0_thd1=0, y$r_buff0_thd2=0, y$r_buff0_thd3=1, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$r_buff1_thd3=0, y$read_delayed=0, y$read_delayed_var={0:0}, y$w_buff0=2, y$w_buff0_used=1, y$w_buff1=0, y$w_buff1_used=0, y=0, z=1] [L762] 2 x = 1 VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=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$$choice0=0, weak$$choice2=0, x=1, y$flush_delayed=0, y$mem_tmp=0, y$r_buff0_thd0=0, y$r_buff0_thd1=0, y$r_buff0_thd2=0, y$r_buff0_thd3=1, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$r_buff1_thd3=0, y$read_delayed=0, y$read_delayed_var={0:0}, y$w_buff0=2, y$w_buff0_used=1, y$w_buff1=0, y$w_buff1_used=0, y=0, z=1] [L765] 2 y = 1 VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=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$$choice0=0, weak$$choice2=0, x=1, y$flush_delayed=0, y$mem_tmp=0, y$r_buff0_thd0=0, y$r_buff0_thd1=0, y$r_buff0_thd2=0, y$r_buff0_thd3=1, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$r_buff1_thd3=0, y$read_delayed=0, y$read_delayed_var={0:0}, y$w_buff0=2, y$w_buff0_used=1, y$w_buff1=0, y$w_buff1_used=0, y=1, z=1] [L768] 2 y = y$w_buff0_used && y$r_buff0_thd2 ? y$w_buff0 : (y$w_buff1_used && y$r_buff1_thd2 ? y$w_buff1 : y) [L769] 2 y$w_buff0_used = y$w_buff0_used && y$r_buff0_thd2 ? (_Bool)0 : y$w_buff0_used [L770] 2 y$w_buff1_used = y$w_buff0_used && y$r_buff0_thd2 || y$w_buff1_used && y$r_buff1_thd2 ? (_Bool)0 : y$w_buff1_used [L771] 2 y$r_buff0_thd2 = y$w_buff0_used && y$r_buff0_thd2 ? (_Bool)0 : y$r_buff0_thd2 [L772] 2 y$r_buff1_thd2 = y$w_buff0_used && y$r_buff0_thd2 || y$w_buff1_used && y$r_buff1_thd2 ? (_Bool)0 : y$r_buff1_thd2 VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=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$$choice0=0, weak$$choice2=0, x=1, y$flush_delayed=0, y$mem_tmp=0, y$r_buff0_thd0=0, y$r_buff0_thd1=0, y$r_buff0_thd2=0, y$r_buff0_thd3=1, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$r_buff1_thd3=0, y$read_delayed=0, y$read_delayed_var={0:0}, y$w_buff0=2, y$w_buff0_used=1, y$w_buff1=0, y$w_buff1_used=0, y=1, z=1] [L803] 3 y = y$w_buff0_used && y$r_buff0_thd3 ? y$w_buff0 : (y$w_buff1_used && y$r_buff1_thd3 ? y$w_buff1 : y) [L804] 3 y$w_buff0_used = y$w_buff0_used && y$r_buff0_thd3 ? (_Bool)0 : y$w_buff0_used [L805] 3 y$w_buff1_used = y$w_buff0_used && y$r_buff0_thd3 || y$w_buff1_used && y$r_buff1_thd3 ? (_Bool)0 : y$w_buff1_used [L806] 3 y$r_buff0_thd3 = y$w_buff0_used && y$r_buff0_thd3 ? (_Bool)0 : y$r_buff0_thd3 [L807] 3 y$r_buff1_thd3 = y$w_buff0_used && y$r_buff0_thd3 || y$w_buff1_used && y$r_buff1_thd3 ? (_Bool)0 : y$r_buff1_thd3 VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=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$$choice0=0, weak$$choice2=0, x=1, y$flush_delayed=0, y$mem_tmp=0, y$r_buff0_thd0=0, y$r_buff0_thd1=0, y$r_buff0_thd2=0, y$r_buff0_thd3=1, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$r_buff1_thd3=0, y$read_delayed=0, y$read_delayed_var={0:0}, y$w_buff0=2, y$w_buff0_used=0, y$w_buff1=0, y$w_buff1_used=0, y=2, z=1] [L755] 1 __unbuffered_cnt = __unbuffered_cnt + 1 VAL [__unbuffered_cnt=1, __unbuffered_p0_EAX=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$$choice0=0, weak$$choice2=0, x=1, y$flush_delayed=0, y$mem_tmp=0, y$r_buff0_thd0=0, y$r_buff0_thd1=0, y$r_buff0_thd2=0, y$r_buff0_thd3=1, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$r_buff1_thd3=0, y$read_delayed=0, y$read_delayed_var={0:0}, y$w_buff0=2, y$w_buff0_used=0, y$w_buff1=0, y$w_buff1_used=0, y=2, z=1] [L775] 2 __unbuffered_cnt = __unbuffered_cnt + 1 VAL [__unbuffered_cnt=2, __unbuffered_p0_EAX=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$$choice0=0, weak$$choice2=0, x=1, y$flush_delayed=0, y$mem_tmp=0, y$r_buff0_thd0=0, y$r_buff0_thd1=0, y$r_buff0_thd2=0, y$r_buff0_thd3=1, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$r_buff1_thd3=0, y$read_delayed=0, y$read_delayed_var={0:0}, y$w_buff0=2, y$w_buff0_used=0, y$w_buff1=0, y$w_buff1_used=0, y=2, z=1] [L810] 3 __unbuffered_cnt = __unbuffered_cnt + 1 VAL [__unbuffered_cnt=3, __unbuffered_p0_EAX=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$$choice0=0, weak$$choice2=0, x=1, y$flush_delayed=0, y$mem_tmp=0, y$r_buff0_thd0=0, y$r_buff0_thd1=0, y$r_buff0_thd2=0, y$r_buff0_thd3=1, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$r_buff1_thd3=0, y$read_delayed=0, y$read_delayed_var={0:0}, y$w_buff0=2, y$w_buff0_used=0, y$w_buff1=0, y$w_buff1_used=0, y=2, z=1] [L832] 0 main$tmp_guard0 = __unbuffered_cnt == 3 VAL [__unbuffered_cnt=3, __unbuffered_p0_EAX=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, t1108={3:0}, t1109={7:0}, t1110={6:0}, weak$$choice0=0, weak$$choice2=0, x=1, y$flush_delayed=0, y$mem_tmp=0, y$r_buff0_thd0=0, y$r_buff0_thd1=0, y$r_buff0_thd2=0, y$r_buff0_thd3=1, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$r_buff1_thd3=0, y$read_delayed=0, y$read_delayed_var={0:0}, y$w_buff0=2, y$w_buff0_used=0, y$w_buff1=0, y$w_buff1_used=0, y=2, z=1] [L834] CALL 0 assume_abort_if_not(main$tmp_guard0) [L3] COND FALSE 0 !(!cond) [L834] RET 0 assume_abort_if_not(main$tmp_guard0) [L836] 0 y = y$w_buff0_used && y$r_buff0_thd0 ? y$w_buff0 : (y$w_buff1_used && y$r_buff1_thd0 ? y$w_buff1 : y) [L837] 0 y$w_buff0_used = y$w_buff0_used && y$r_buff0_thd0 ? (_Bool)0 : y$w_buff0_used [L838] 0 y$w_buff1_used = y$w_buff0_used && y$r_buff0_thd0 || y$w_buff1_used && y$r_buff1_thd0 ? (_Bool)0 : y$w_buff1_used [L839] 0 y$r_buff0_thd0 = y$w_buff0_used && y$r_buff0_thd0 ? (_Bool)0 : y$r_buff0_thd0 [L840] 0 y$r_buff1_thd0 = y$w_buff0_used && y$r_buff0_thd0 || y$w_buff1_used && y$r_buff1_thd0 ? (_Bool)0 : y$r_buff1_thd0 VAL [__unbuffered_cnt=3, __unbuffered_p0_EAX=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, t1108={3:0}, t1109={7:0}, t1110={6:0}, weak$$choice0=0, weak$$choice2=0, x=1, y$flush_delayed=0, y$mem_tmp=0, y$r_buff0_thd0=0, y$r_buff0_thd1=0, y$r_buff0_thd2=0, y$r_buff0_thd3=1, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$r_buff1_thd3=0, y$read_delayed=0, y$read_delayed_var={0:0}, y$w_buff0=2, y$w_buff0_used=0, y$w_buff1=0, y$w_buff1_used=0, y=2, z=1] [L843] 0 weak$$choice0 = __VERIFIER_nondet_bool() [L844] 0 weak$$choice2 = __VERIFIER_nondet_bool() [L845] 0 y$flush_delayed = weak$$choice2 [L846] 0 y$mem_tmp = y [L847] 0 y = !y$w_buff0_used || !y$r_buff0_thd0 && !y$w_buff1_used || !y$r_buff0_thd0 && !y$r_buff1_thd0 ? y : (y$w_buff0_used && y$r_buff0_thd0 ? y$w_buff0 : y$w_buff1) [L848] 0 y$w_buff0 = weak$$choice2 ? y$w_buff0 : (!y$w_buff0_used || !y$r_buff0_thd0 && !y$w_buff1_used || !y$r_buff0_thd0 && !y$r_buff1_thd0 ? y$w_buff0 : (y$w_buff0_used && y$r_buff0_thd0 ? y$w_buff0 : y$w_buff0)) [L849] 0 y$w_buff1 = weak$$choice2 ? y$w_buff1 : (!y$w_buff0_used || !y$r_buff0_thd0 && !y$w_buff1_used || !y$r_buff0_thd0 && !y$r_buff1_thd0 ? y$w_buff1 : (y$w_buff0_used && y$r_buff0_thd0 ? y$w_buff1 : y$w_buff1)) [L850] 0 y$w_buff0_used = weak$$choice2 ? y$w_buff0_used : (!y$w_buff0_used || !y$r_buff0_thd0 && !y$w_buff1_used || !y$r_buff0_thd0 && !y$r_buff1_thd0 ? y$w_buff0_used : (y$w_buff0_used && y$r_buff0_thd0 ? (_Bool)0 : y$w_buff0_used)) [L851] 0 y$w_buff1_used = weak$$choice2 ? y$w_buff1_used : (!y$w_buff0_used || !y$r_buff0_thd0 && !y$w_buff1_used || !y$r_buff0_thd0 && !y$r_buff1_thd0 ? y$w_buff1_used : (y$w_buff0_used && y$r_buff0_thd0 ? (_Bool)0 : (_Bool)0)) [L852] 0 y$r_buff0_thd0 = weak$$choice2 ? y$r_buff0_thd0 : (!y$w_buff0_used || !y$r_buff0_thd0 && !y$w_buff1_used || !y$r_buff0_thd0 && !y$r_buff1_thd0 ? y$r_buff0_thd0 : (y$w_buff0_used && y$r_buff0_thd0 ? (_Bool)0 : y$r_buff0_thd0)) [L853] 0 y$r_buff1_thd0 = weak$$choice2 ? y$r_buff1_thd0 : (!y$w_buff0_used || !y$r_buff0_thd0 && !y$w_buff1_used || !y$r_buff0_thd0 && !y$r_buff1_thd0 ? y$r_buff1_thd0 : (y$w_buff0_used && y$r_buff0_thd0 ? (_Bool)0 : (_Bool)0)) [L854] 0 main$tmp_guard1 = !(y == 2 && __unbuffered_p0_EAX == 0 && __unbuffered_p2_EAX == 1 && __unbuffered_p2_EBX == 0) [L855] 0 y = y$flush_delayed ? y$mem_tmp : y [L856] 0 y$flush_delayed = (_Bool)0 VAL [__unbuffered_cnt=3, __unbuffered_p0_EAX=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, t1108={3:0}, t1109={7:0}, t1110={6:0}, weak$$choice2=0, x=1, y$flush_delayed=0, y$mem_tmp=2, y$r_buff0_thd0=0, y$r_buff0_thd1=0, y$r_buff0_thd2=0, y$r_buff0_thd3=1, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$r_buff1_thd3=0, y$read_delayed=0, y$read_delayed_var={0:0}, y$w_buff0=2, y$w_buff0_used=0, y$w_buff1=0, y$w_buff1_used=0, y=2, z=1] [L858] 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=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$flush_delayed=0, y$mem_tmp=2, y$r_buff0_thd0=0, y$r_buff0_thd1=0, y$r_buff0_thd2=0, y$r_buff0_thd3=1, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$r_buff1_thd3=0, y$read_delayed=0, y$read_delayed_var={0:0}, y$w_buff0=2, y$w_buff0_used=0, y$w_buff1=0, y$w_buff1_used=0, y=2, z=1] [L17] 0 __assert_fail ("0", "mix042.opt.c", 8, __extension__ __PRETTY_FUNCTION__) VAL [__unbuffered_cnt=3, __unbuffered_p0_EAX=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$flush_delayed=0, y$mem_tmp=2, y$r_buff0_thd0=0, y$r_buff0_thd1=0, y$r_buff0_thd2=0, y$r_buff0_thd3=1, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$r_buff1_thd3=0, y$read_delayed=0, y$read_delayed_var={0:0}, y$w_buff0=2, y$w_buff0_used=0, y$w_buff1=0, y$w_buff1_used=0, y=2, z=1] - UnprovableResult [Line: 17]: Unable to prove that all allocated memory was freed Unable to prove that all allocated memory was freed Reason: Not analyzed. - UnprovableResult [Line: -1]: Unable to prove that pointer dereference always succeeds Unable to prove that pointer dereference always succeeds Reason: Not analyzed. - UnprovableResult [Line: -1]: Unable to prove that pointer dereference always succeeds Unable to prove that pointer dereference always succeeds Reason: Not analyzed. - UnprovableResult [Line: -1]: Unable to prove that pointer dereference always succeeds Unable to prove that pointer dereference always succeeds Reason: Not analyzed. - UnprovableResult [Line: -1]: Unable to prove that pointer dereference always succeeds Unable to prove that pointer dereference always succeeds Reason: Not analyzed. - UnprovableResult [Line: -1]: Unable to prove that pointer dereference always succeeds Unable to prove that pointer dereference always succeeds Reason: Not analyzed. - UnprovableResult [Line: -1]: Unable to prove that pointer dereference always succeeds Unable to prove that pointer dereference always succeeds Reason: Not analyzed. - UnprovableResult [Line: 823]: Unable to prove that all allocated memory was freed Unable to prove that all allocated memory was freed Reason: Not analyzed. - UnprovableResult [Line: 826]: 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: 828]: 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: 830]: Unable to prove that petrification did provide enough thread instances (tool internal message) Unable to prove that petrification did provide enough thread instances (tool internal message) Reason: Not analyzed. - StatisticsResult: Ultimate Automizer benchmark data with 1 thread instances CFG has 7 procedures, 81 locations, 13 error locations. Started 1 CEGAR loops. EmptinessCheckTime: 0.0s, RemoveRedundantFlowTime: 0.0s, RemoveRedundantFlowUnfoldingTime: 0.0s, BackfoldingTime: 0.0s, BackfoldingUnfoldingTime: 0.0s, FlowIncreaseByBackfolding: 0, BasicCegarLoop: OverallTime: 11.4s, OverallIterations: 14, TraceHistogramMax: 1, PathProgramHistogramMax: 3, EmptinessCheckTime: 0.0s, AutomataDifference: 4.4s, DeadEndRemovalTime: 0.0s, HoareAnnotationTime: 0.0s, InitialAbstractionConstructionTime: 0.1s, HoareTripleCheckerStatistics: 0 mSolverCounterUnknown, 447 SdHoareTripleChecker+Valid, 1.9s IncrementalHoareTripleChecker+Time, 0 mSdLazyCounter, 361 mSDsluCounter, 69 SdHoareTripleChecker+Invalid, 1.6s Time, 0 mProtectedAction, 0 SdHoareTripleChecker+Unchecked, 53 IncrementalHoareTripleChecker+Unchecked, 36 mSDsCounter, 21 IncrementalHoareTripleChecker+Valid, 0 mProtectedPredicate, 1085 IncrementalHoareTripleChecker+Invalid, 1159 SdHoareTripleChecker+Unknown, 0 mSolverCounterNotChecked, 21 mSolverCounterUnsat, 33 mSDtfsCounter, 1085 mSolverCounterSat, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Unknown, PredicateUnifierStatistics: 0 DeclaredPredicates, 214 GetRequests, 174 SyntacticMatches, 0 SemanticMatches, 40 ConstructedPredicates, 1 IntricatePredicates, 0 DeprecatedPredicates, 4 ImplicationChecksByTransitivity, 0.3s Time, 0.0s BasicInterpolantAutomatonTime, BiggestAbstraction: size=263occurred in iteration=13, InterpolantAutomatonStates: 54, 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.3s SsaConstructionTime, 0.7s SatisfiabilityAnalysisTime, 1.9s InterpolantComputationTime, 250 NumberOfCodeBlocks, 250 NumberOfCodeBlocksAsserted, 14 NumberOfCheckSat, 202 ConstructedInterpolants, 1 QuantifiedInterpolants, 1456 SizeOfPredicates, 11 NumberOfNonLiveVariables, 1491 ConjunctsInSsa, 64 ConjunctsInUnsatCore, 13 InterpolantComputations, 13 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-29 06:41:50,070 INFO L540 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_f41a68e7-fafa-48a2-aca6-8783e0010a4f/bin/uautomizer-verify-BQ2R08f2Ya/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 Writing output log to file Ultimate.log Result: UNKNOWN: Overapproximated counterexample