./Ultimate.py --spec ../../sv-benchmarks/c/properties/valid-memsafety.prp --file ../../sv-benchmarks/c/pthread-wmm/mix056_power.oepc_pso.oepc_rmo.oepc.i --full-output --architecture 32bit -------------------------------------------------------------------------------- Checking for memory safety (deref-memtrack) Using default analysis Version 0e0057cc Calling Ultimate with: /usr/lib/jvm/java-1.11.0-openjdk-amd64/bin/java -Dosgi.configuration.area=/tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_2b2f975c-1851-4624-a769-b2c770989b69/bin/uautomizer-verify-BQ2R08f2Ya/data/config -Xmx15G -Xms4m -jar /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_2b2f975c-1851-4624-a769-b2c770989b69/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_2b2f975c-1851-4624-a769-b2c770989b69/bin/uautomizer-verify-BQ2R08f2Ya/data -tc /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_2b2f975c-1851-4624-a769-b2c770989b69/bin/uautomizer-verify-BQ2R08f2Ya/config/AutomizerMemDerefMemtrack.xml -i ../../sv-benchmarks/c/pthread-wmm/mix056_power.oepc_pso.oepc_rmo.oepc.i -s /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_2b2f975c-1851-4624-a769-b2c770989b69/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_2b2f975c-1851-4624-a769-b2c770989b69/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 40cdaf120a3550cc54773a608bdbc3a68dee1334013ab0b4984b9366bf820a3d --- Real Ultimate output --- This is Ultimate 0.2.4-dev-0e0057c [2023-11-28 23:55:40,753 INFO L188 SettingsManager]: Resetting all preferences to default values... [2023-11-28 23:55:40,812 INFO L114 SettingsManager]: Loading settings from /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_2b2f975c-1851-4624-a769-b2c770989b69/bin/uautomizer-verify-BQ2R08f2Ya/config/svcomp-DerefFreeMemtrack-32bit-Automizer_Default.epf [2023-11-28 23:55:40,817 WARN L101 SettingsManager]: Preference file contains the following unknown settings: [2023-11-28 23:55:40,818 WARN L103 SettingsManager]: * de.uni_freiburg.informatik.ultimate.core.Log level for class [2023-11-28 23:55:40,843 INFO L130 SettingsManager]: Preferences different from defaults after loading the file: [2023-11-28 23:55:40,844 INFO L151 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2023-11-28 23:55:40,844 INFO L153 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2023-11-28 23:55:40,845 INFO L151 SettingsManager]: Preferences of Boogie Preprocessor differ from their defaults: [2023-11-28 23:55:40,846 INFO L153 SettingsManager]: * Use memory slicer=true [2023-11-28 23:55:40,846 INFO L151 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2023-11-28 23:55:40,847 INFO L153 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2023-11-28 23:55:40,847 INFO L151 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2023-11-28 23:55:40,848 INFO L153 SettingsManager]: * Create parallel compositions if possible=false [2023-11-28 23:55:40,849 INFO L153 SettingsManager]: * Use SBE=true [2023-11-28 23:55:40,849 INFO L151 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2023-11-28 23:55:40,850 INFO L153 SettingsManager]: * sizeof long=4 [2023-11-28 23:55:40,850 INFO L153 SettingsManager]: * Overapproximate operations on floating types=true [2023-11-28 23:55:40,851 INFO L153 SettingsManager]: * sizeof POINTER=4 [2023-11-28 23:55:40,851 INFO L153 SettingsManager]: * Check division by zero=IGNORE [2023-11-28 23:55:40,852 INFO L153 SettingsManager]: * Check for the main procedure if all allocated memory was freed=true [2023-11-28 23:55:40,852 INFO L153 SettingsManager]: * Bitprecise bitfields=true [2023-11-28 23:55:40,853 INFO L153 SettingsManager]: * SV-COMP memtrack compatibility mode=true [2023-11-28 23:55:40,853 INFO L153 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2023-11-28 23:55:40,854 INFO L153 SettingsManager]: * Adapt memory model on pointer casts if necessary=true [2023-11-28 23:55:40,854 INFO L153 SettingsManager]: * Check unreachability of reach_error function=false [2023-11-28 23:55:40,855 INFO L153 SettingsManager]: * sizeof long double=12 [2023-11-28 23:55:40,855 INFO L153 SettingsManager]: * Use constant arrays=true [2023-11-28 23:55:40,856 INFO L151 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2023-11-28 23:55:40,856 INFO L153 SettingsManager]: * Size of a code block=SequenceOfStatements [2023-11-28 23:55:40,856 INFO L153 SettingsManager]: * Only consider context switches at boundaries of atomic blocks=true [2023-11-28 23:55:40,857 INFO L153 SettingsManager]: * SMT solver=External_DefaultMode [2023-11-28 23:55:40,857 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2023-11-28 23:55:40,857 INFO L151 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2023-11-28 23:55:40,858 INFO L153 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2023-11-28 23:55:40,858 INFO L153 SettingsManager]: * Trace refinement strategy=CAMEL [2023-11-28 23:55:40,858 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2023-11-28 23:55:40,858 INFO L153 SettingsManager]: * Apply one-shot large block encoding in concurrent analysis=false [2023-11-28 23:55:40,858 INFO L153 SettingsManager]: * Automaton type used in concurrency analysis=PETRI_NET [2023-11-28 23:55:40,858 INFO L153 SettingsManager]: * Order on configurations for Petri net unfoldings=DBO [2023-11-28 23:55:40,859 INFO L153 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2023-11-28 23:55:40,859 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_2b2f975c-1851-4624-a769-b2c770989b69/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_2b2f975c-1851-4624-a769-b2c770989b69/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 -> 40cdaf120a3550cc54773a608bdbc3a68dee1334013ab0b4984b9366bf820a3d [2023-11-28 23:55:41,074 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2023-11-28 23:55:41,094 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2023-11-28 23:55:41,097 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2023-11-28 23:55:41,098 INFO L270 PluginConnector]: Initializing CDTParser... [2023-11-28 23:55:41,098 INFO L274 PluginConnector]: CDTParser initialized [2023-11-28 23:55:41,099 INFO L431 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_2b2f975c-1851-4624-a769-b2c770989b69/bin/uautomizer-verify-BQ2R08f2Ya/../../sv-benchmarks/c/pthread-wmm/mix056_power.oepc_pso.oepc_rmo.oepc.i [2023-11-28 23:55:43,824 INFO L533 CDTParser]: Created temporary CDT project at NULL [2023-11-28 23:55:44,049 INFO L384 CDTParser]: Found 1 translation units. [2023-11-28 23:55:44,049 INFO L180 CDTParser]: Scanning /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_2b2f975c-1851-4624-a769-b2c770989b69/sv-benchmarks/c/pthread-wmm/mix056_power.oepc_pso.oepc_rmo.oepc.i [2023-11-28 23:55:44,065 INFO L427 CDTParser]: About to delete temporary CDT project at /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_2b2f975c-1851-4624-a769-b2c770989b69/bin/uautomizer-verify-BQ2R08f2Ya/data/e88dad0c3/1b8d29be5fb1440caa99b8e2c6855d27/FLAGc1ea448e6 [2023-11-28 23:55:44,080 INFO L435 CDTParser]: Successfully deleted /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_2b2f975c-1851-4624-a769-b2c770989b69/bin/uautomizer-verify-BQ2R08f2Ya/data/e88dad0c3/1b8d29be5fb1440caa99b8e2c6855d27 [2023-11-28 23:55:44,082 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2023-11-28 23:55:44,084 INFO L133 ToolchainWalker]: Walking toolchain with 6 elements. [2023-11-28 23:55:44,085 INFO L112 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2023-11-28 23:55:44,085 INFO L270 PluginConnector]: Initializing CACSL2BoogieTranslator... [2023-11-28 23:55:44,090 INFO L274 PluginConnector]: CACSL2BoogieTranslator initialized [2023-11-28 23:55:44,091 INFO L184 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 28.11 11:55:44" (1/1) ... [2023-11-28 23:55:44,092 INFO L204 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@699ef0bf and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 28.11 11:55:44, skipping insertion in model container [2023-11-28 23:55:44,092 INFO L184 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 28.11 11:55:44" (1/1) ... [2023-11-28 23:55:44,151 INFO L177 MainTranslator]: Built tables and reachable declarations [2023-11-28 23:55:44,468 INFO L209 PostProcessor]: Analyzing one entry point: main [2023-11-28 23:55:44,479 INFO L202 MainTranslator]: Completed pre-run [2023-11-28 23:55:44,537 INFO L209 PostProcessor]: Analyzing one entry point: main [2023-11-28 23:55:44,566 WARN L675 CHandler]: The function __VERIFIER_atomic_begin is called, but not defined or handled by StandardFunctionHandler. [2023-11-28 23:55:44,566 WARN L675 CHandler]: The function __VERIFIER_atomic_end is called, but not defined or handled by StandardFunctionHandler. [2023-11-28 23:55:44,572 INFO L206 MainTranslator]: Completed translation [2023-11-28 23:55:44,572 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 28.11 11:55:44 WrapperNode [2023-11-28 23:55:44,573 INFO L131 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2023-11-28 23:55:44,574 INFO L112 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2023-11-28 23:55:44,574 INFO L270 PluginConnector]: Initializing Boogie Procedure Inliner... [2023-11-28 23:55:44,574 INFO L274 PluginConnector]: Boogie Procedure Inliner initialized [2023-11-28 23:55:44,580 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 28.11 11:55:44" (1/1) ... [2023-11-28 23:55:44,597 INFO L184 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 28.11 11:55:44" (1/1) ... [2023-11-28 23:55:44,623 INFO L138 Inliner]: procedures = 176, calls = 55, calls flagged for inlining = 6, calls inlined = 7, statements flattened = 132 [2023-11-28 23:55:44,624 INFO L131 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2023-11-28 23:55:44,624 INFO L112 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2023-11-28 23:55:44,625 INFO L270 PluginConnector]: Initializing Boogie Preprocessor... [2023-11-28 23:55:44,625 INFO L274 PluginConnector]: Boogie Preprocessor initialized [2023-11-28 23:55:44,634 INFO L184 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 28.11 11:55:44" (1/1) ... [2023-11-28 23:55:44,635 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 28.11 11:55:44" (1/1) ... [2023-11-28 23:55:44,638 INFO L184 PluginConnector]: Executing the observer MemorySlicer from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 28.11 11:55:44" (1/1) ... [2023-11-28 23:55:44,657 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-28 23:55:44,658 INFO L184 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 28.11 11:55:44" (1/1) ... [2023-11-28 23:55:44,658 INFO L184 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 28.11 11:55:44" (1/1) ... [2023-11-28 23:55:44,668 INFO L184 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 28.11 11:55:44" (1/1) ... [2023-11-28 23:55:44,670 INFO L184 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 28.11 11:55:44" (1/1) ... [2023-11-28 23:55:44,673 INFO L184 PluginConnector]: Executing the observer LTLStepAnnotator from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 28.11 11:55:44" (1/1) ... [2023-11-28 23:55:44,675 INFO L184 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 28.11 11:55:44" (1/1) ... [2023-11-28 23:55:44,679 INFO L131 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2023-11-28 23:55:44,680 INFO L112 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2023-11-28 23:55:44,681 INFO L270 PluginConnector]: Initializing RCFGBuilder... [2023-11-28 23:55:44,681 INFO L274 PluginConnector]: RCFGBuilder initialized [2023-11-28 23:55:44,682 INFO L184 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 28.11 11:55:44" (1/1) ... [2023-11-28 23:55:44,687 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2023-11-28 23:55:44,696 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_2b2f975c-1851-4624-a769-b2c770989b69/bin/uautomizer-verify-BQ2R08f2Ya/z3 [2023-11-28 23:55:44,707 INFO L229 MonitoredProcess]: Starting monitored process 1 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_2b2f975c-1851-4624-a769-b2c770989b69/bin/uautomizer-verify-BQ2R08f2Ya/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 (exit command is (exit), workingDir is null) [2023-11-28 23:55:44,721 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_2b2f975c-1851-4624-a769-b2c770989b69/bin/uautomizer-verify-BQ2R08f2Ya/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 (1)] Waiting until timeout for monitored process [2023-11-28 23:55:44,746 INFO L130 BoogieDeclarations]: Found specification of procedure write~int#0 [2023-11-28 23:55:44,746 INFO L130 BoogieDeclarations]: Found specification of procedure write~int#1 [2023-11-28 23:55:44,747 INFO L130 BoogieDeclarations]: Found specification of procedure write~int#2 [2023-11-28 23:55:44,747 INFO L130 BoogieDeclarations]: Found specification of procedure write~int#3 [2023-11-28 23:55:44,747 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_atomic_begin [2023-11-28 23:55:44,747 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2023-11-28 23:55:44,747 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnStack [2023-11-28 23:55:44,748 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.dealloc [2023-11-28 23:55:44,748 INFO L130 BoogieDeclarations]: Found specification of procedure P0 [2023-11-28 23:55:44,748 INFO L138 BoogieDeclarations]: Found implementation of procedure P0 [2023-11-28 23:55:44,748 INFO L130 BoogieDeclarations]: Found specification of procedure P1 [2023-11-28 23:55:44,748 INFO L138 BoogieDeclarations]: Found implementation of procedure P1 [2023-11-28 23:55:44,749 INFO L130 BoogieDeclarations]: Found specification of procedure P2 [2023-11-28 23:55:44,749 INFO L138 BoogieDeclarations]: Found implementation of procedure P2 [2023-11-28 23:55:44,749 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#0 [2023-11-28 23:55:44,749 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#1 [2023-11-28 23:55:44,749 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#2 [2023-11-28 23:55:44,750 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#3 [2023-11-28 23:55:44,750 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_atomic_end [2023-11-28 23:55:44,750 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2023-11-28 23:55:44,750 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2023-11-28 23:55:44,752 WARN L213 CfgBuilder]: User set CodeBlockSize to SequenceOfStatements but program contains fork statements. Overwriting the user preferences and setting CodeBlockSize to OneNontrivialStatement [2023-11-28 23:55:44,896 INFO L241 CfgBuilder]: Building ICFG [2023-11-28 23:55:44,898 INFO L267 CfgBuilder]: Building CFG for each procedure with an implementation [2023-11-28 23:55:45,188 INFO L282 CfgBuilder]: Performing block encoding [2023-11-28 23:55:45,401 INFO L304 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2023-11-28 23:55:45,401 INFO L309 CfgBuilder]: Removed 0 assume(true) statements. [2023-11-28 23:55:45,402 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 28.11 11:55:45 BoogieIcfgContainer [2023-11-28 23:55:45,402 INFO L131 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2023-11-28 23:55:45,405 INFO L112 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2023-11-28 23:55:45,405 INFO L270 PluginConnector]: Initializing TraceAbstraction... [2023-11-28 23:55:45,408 INFO L274 PluginConnector]: TraceAbstraction initialized [2023-11-28 23:55:45,408 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 28.11 11:55:44" (1/3) ... [2023-11-28 23:55:45,409 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@d5ecd2a and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 28.11 11:55:45, skipping insertion in model container [2023-11-28 23:55:45,409 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 28.11 11:55:44" (2/3) ... [2023-11-28 23:55:45,409 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@d5ecd2a and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 28.11 11:55:45, skipping insertion in model container [2023-11-28 23:55:45,409 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 28.11 11:55:45" (3/3) ... [2023-11-28 23:55:45,411 INFO L112 eAbstractionObserver]: Analyzing ICFG mix056_power.oepc_pso.oepc_rmo.oepc.i [2023-11-28 23:55:45,430 INFO L203 ceAbstractionStarter]: Automizer settings: Hoare:false NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2023-11-28 23:55:45,430 INFO L162 ceAbstractionStarter]: Applying trace abstraction to program that has 9 error locations. [2023-11-28 23:55:45,430 INFO L514 ceAbstractionStarter]: Constructing petrified ICFG for 1 thread instances. [2023-11-28 23:55:45,478 INFO L144 ThreadInstanceAdder]: Constructed 0 joinOtherThreadTransitions. [2023-11-28 23:55:45,510 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 61 places, 53 transitions, 118 flow [2023-11-28 23:55:45,542 INFO L124 PetriNetUnfolderBase]: 2/50 cut-off events. [2023-11-28 23:55:45,542 INFO L125 PetriNetUnfolderBase]: For 0/0 co-relation queries the response was YES. [2023-11-28 23:55:45,546 INFO L83 FinitePrefix]: Finished finitePrefix Result has 60 conditions, 50 events. 2/50 cut-off events. For 0/0 co-relation queries the response was YES. Maximal size of possible extension queue 5. Compared 95 event pairs, 0 based on Foata normal form. 0/39 useless extension candidates. Maximal degree in co-relation 49. Up to 2 conditions per place. [2023-11-28 23:55:45,546 INFO L82 GeneralOperation]: Start removeDead. Operand has 61 places, 53 transitions, 118 flow [2023-11-28 23:55:45,550 INFO L88 GeneralOperation]: Finished RemoveDead, result has has 58 places, 50 transitions, 109 flow [2023-11-28 23:55:45,559 INFO L356 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2023-11-28 23:55:45,564 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;@560b15d7, mLbeIndependenceSettings=[IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=false, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2023-11-28 23:55:45,564 INFO L358 AbstractCegarLoop]: Starting to check reachability of 13 error locations. [2023-11-28 23:55:45,567 INFO L185 PetriNetUnfolderBase]: Found word, exiting Unfolder. [2023-11-28 23:55:45,567 INFO L124 PetriNetUnfolderBase]: 0/2 cut-off events. [2023-11-28 23:55:45,567 INFO L125 PetriNetUnfolderBase]: For 0/0 co-relation queries the response was YES. [2023-11-28 23:55:45,567 INFO L200 CegarLoopForPetriNet]: Found error trace [2023-11-28 23:55:45,568 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1] [2023-11-28 23:55:45,568 INFO L420 AbstractCegarLoop]: === Iteration 1 === Targeting ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [P0Err0ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 10 more)] === [2023-11-28 23:55:45,573 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-11-28 23:55:45,573 INFO L85 PathProgramCache]: Analyzing trace with hash 12279, now seen corresponding path program 1 times [2023-11-28 23:55:45,581 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-11-28 23:55:45,581 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2069541811] [2023-11-28 23:55:45,581 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-11-28 23:55:45,581 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-11-28 23:55:45,679 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-28 23:55:45,805 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-28 23:55:45,806 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-11-28 23:55:45,806 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2069541811] [2023-11-28 23:55:45,807 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2069541811] provided 1 perfect and 0 imperfect interpolant sequences [2023-11-28 23:55:45,807 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-11-28 23:55:45,807 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [1] imperfect sequences [] total 1 [2023-11-28 23:55:45,809 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [84996706] [2023-11-28 23:55:45,809 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-11-28 23:55:45,818 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2023-11-28 23:55:45,823 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-11-28 23:55:45,849 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2023-11-28 23:55:45,850 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2023-11-28 23:55:45,871 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 26 out of 53 [2023-11-28 23:55:45,873 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 58 places, 50 transitions, 109 flow. Second operand has 3 states, 3 states have (on average 26.666666666666668) internal successors, (80), 3 states have internal predecessors, (80), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-28 23:55:45,874 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2023-11-28 23:55:45,874 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 26 of 53 [2023-11-28 23:55:45,875 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2023-11-28 23:55:46,400 INFO L124 PetriNetUnfolderBase]: 1057/2068 cut-off events. [2023-11-28 23:55:46,401 INFO L125 PetriNetUnfolderBase]: For 20/20 co-relation queries the response was YES. [2023-11-28 23:55:46,409 INFO L83 FinitePrefix]: Finished finitePrefix Result has 3694 conditions, 2068 events. 1057/2068 cut-off events. For 20/20 co-relation queries the response was YES. Maximal size of possible extension queue 138. Compared 14153 event pairs, 791 based on Foata normal form. 120/1996 useless extension candidates. Maximal degree in co-relation 3680. Up to 1193 conditions per place. [2023-11-28 23:55:46,427 INFO L140 encePairwiseOnDemand]: 48/53 looper letters, 30 selfloop transitions, 2 changer transitions 0/55 dead transitions. [2023-11-28 23:55:46,427 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 58 places, 55 transitions, 183 flow [2023-11-28 23:55:46,428 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2023-11-28 23:55:46,431 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2023-11-28 23:55:46,438 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 113 transitions. [2023-11-28 23:55:46,440 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.710691823899371 [2023-11-28 23:55:46,441 INFO L72 ComplementDD]: Start complementDD. Operand 3 states and 113 transitions. [2023-11-28 23:55:46,442 INFO L73 IsDeterministic]: Start isDeterministic. Operand 3 states and 113 transitions. [2023-11-28 23:55:46,443 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2023-11-28 23:55:46,445 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 3 states and 113 transitions. [2023-11-28 23:55:46,448 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 4 states, 3 states have (on average 37.666666666666664) internal successors, (113), 3 states have internal predecessors, (113), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-28 23:55:46,452 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 4 states, 4 states have (on average 53.0) internal successors, (212), 4 states have internal predecessors, (212), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-28 23:55:46,452 INFO L81 ComplementDD]: Finished complementDD. Result has 4 states, 4 states have (on average 53.0) internal successors, (212), 4 states have internal predecessors, (212), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-28 23:55:46,454 INFO L175 Difference]: Start difference. First operand has 58 places, 50 transitions, 109 flow. Second operand 3 states and 113 transitions. [2023-11-28 23:55:46,455 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 58 places, 55 transitions, 183 flow [2023-11-28 23:55:46,458 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 55 places, 55 transitions, 180 flow, removed 0 selfloop flow, removed 3 redundant places. [2023-11-28 23:55:46,461 INFO L231 Difference]: Finished difference. Result has 55 places, 46 transitions, 102 flow [2023-11-28 23:55:46,463 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=53, 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-28 23:55:46,467 INFO L281 CegarLoopForPetriNet]: 58 programPoint places, -3 predicate places. [2023-11-28 23:55:46,468 INFO L495 AbstractCegarLoop]: Abstraction has has 55 places, 46 transitions, 102 flow [2023-11-28 23:55:46,468 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 26.666666666666668) internal successors, (80), 3 states have internal predecessors, (80), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-28 23:55:46,468 INFO L200 CegarLoopForPetriNet]: Found error trace [2023-11-28 23:55:46,468 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1] [2023-11-28 23:55:46,469 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable0 [2023-11-28 23:55:46,469 INFO L420 AbstractCegarLoop]: === Iteration 2 === Targeting ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [P0Err0ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 10 more)] === [2023-11-28 23:55:46,470 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-11-28 23:55:46,470 INFO L85 PathProgramCache]: Analyzing trace with hash 12280, now seen corresponding path program 1 times [2023-11-28 23:55:46,470 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-11-28 23:55:46,470 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1967897198] [2023-11-28 23:55:46,471 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-11-28 23:55:46,471 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-11-28 23:55:46,495 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-28 23:55:46,583 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-28 23:55:46,583 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-11-28 23:55:46,583 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1967897198] [2023-11-28 23:55:46,584 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1967897198] provided 1 perfect and 0 imperfect interpolant sequences [2023-11-28 23:55:46,584 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-11-28 23:55:46,584 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [1] imperfect sequences [] total 1 [2023-11-28 23:55:46,584 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1664585388] [2023-11-28 23:55:46,584 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-11-28 23:55:46,586 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2023-11-28 23:55:46,586 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-11-28 23:55:46,586 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2023-11-28 23:55:46,587 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2023-11-28 23:55:46,601 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 27 out of 53 [2023-11-28 23:55:46,601 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 55 places, 46 transitions, 102 flow. Second operand has 3 states, 3 states have (on average 27.666666666666668) internal successors, (83), 3 states have internal predecessors, (83), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-28 23:55:46,602 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2023-11-28 23:55:46,602 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 27 of 53 [2023-11-28 23:55:46,602 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2023-11-28 23:55:46,985 INFO L124 PetriNetUnfolderBase]: 1057/2067 cut-off events. [2023-11-28 23:55:46,985 INFO L125 PetriNetUnfolderBase]: For 60/60 co-relation queries the response was YES. [2023-11-28 23:55:46,989 INFO L83 FinitePrefix]: Finished finitePrefix Result has 3751 conditions, 2067 events. 1057/2067 cut-off events. For 60/60 co-relation queries the response was YES. Maximal size of possible extension queue 138. Compared 14190 event pairs, 791 based on Foata normal form. 1/1876 useless extension candidates. Maximal degree in co-relation 3740. Up to 1192 conditions per place. [2023-11-28 23:55:47,002 INFO L140 encePairwiseOnDemand]: 50/53 looper letters, 29 selfloop transitions, 2 changer transitions 0/54 dead transitions. [2023-11-28 23:55:47,002 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 56 places, 54 transitions, 180 flow [2023-11-28 23:55:47,003 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2023-11-28 23:55:47,003 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2023-11-28 23:55:47,004 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 113 transitions. [2023-11-28 23:55:47,004 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.710691823899371 [2023-11-28 23:55:47,004 INFO L72 ComplementDD]: Start complementDD. Operand 3 states and 113 transitions. [2023-11-28 23:55:47,004 INFO L73 IsDeterministic]: Start isDeterministic. Operand 3 states and 113 transitions. [2023-11-28 23:55:47,005 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2023-11-28 23:55:47,005 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 3 states and 113 transitions. [2023-11-28 23:55:47,006 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 4 states, 3 states have (on average 37.666666666666664) internal successors, (113), 3 states have internal predecessors, (113), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-28 23:55:47,007 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 4 states, 4 states have (on average 53.0) internal successors, (212), 4 states have internal predecessors, (212), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-28 23:55:47,007 INFO L81 ComplementDD]: Finished complementDD. Result has 4 states, 4 states have (on average 53.0) internal successors, (212), 4 states have internal predecessors, (212), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-28 23:55:47,008 INFO L175 Difference]: Start difference. First operand has 55 places, 46 transitions, 102 flow. Second operand 3 states and 113 transitions. [2023-11-28 23:55:47,008 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 56 places, 54 transitions, 180 flow [2023-11-28 23:55:47,012 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 54 places, 54 transitions, 176 flow, removed 0 selfloop flow, removed 2 redundant places. [2023-11-28 23:55:47,013 INFO L231 Difference]: Finished difference. Result has 54 places, 45 transitions, 100 flow [2023-11-28 23:55:47,013 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=53, 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-28 23:55:47,014 INFO L281 CegarLoopForPetriNet]: 58 programPoint places, -4 predicate places. [2023-11-28 23:55:47,014 INFO L495 AbstractCegarLoop]: Abstraction has has 54 places, 45 transitions, 100 flow [2023-11-28 23:55:47,015 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 27.666666666666668) internal successors, (83), 3 states have internal predecessors, (83), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-28 23:55:47,015 INFO L200 CegarLoopForPetriNet]: Found error trace [2023-11-28 23:55:47,015 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1] [2023-11-28 23:55:47,015 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1 [2023-11-28 23:55:47,015 INFO L420 AbstractCegarLoop]: === Iteration 3 === Targeting ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [P0Err0ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 10 more)] === [2023-11-28 23:55:47,016 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-11-28 23:55:47,016 INFO L85 PathProgramCache]: Analyzing trace with hash 366174643, now seen corresponding path program 1 times [2023-11-28 23:55:47,016 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-11-28 23:55:47,016 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [861718599] [2023-11-28 23:55:47,016 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-11-28 23:55:47,017 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-11-28 23:55:47,034 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-28 23:55:47,077 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-28 23:55:47,077 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-11-28 23:55:47,077 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [861718599] [2023-11-28 23:55:47,078 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [861718599] provided 1 perfect and 0 imperfect interpolant sequences [2023-11-28 23:55:47,078 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-11-28 23:55:47,078 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2023-11-28 23:55:47,078 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1636813235] [2023-11-28 23:55:47,078 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-11-28 23:55:47,079 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2023-11-28 23:55:47,079 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-11-28 23:55:47,079 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2023-11-28 23:55:47,079 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2023-11-28 23:55:47,094 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 26 out of 53 [2023-11-28 23:55:47,094 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 54 places, 45 transitions, 100 flow. Second operand has 3 states, 3 states have (on average 27.333333333333332) internal successors, (82), 3 states have internal predecessors, (82), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-28 23:55:47,094 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2023-11-28 23:55:47,094 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 26 of 53 [2023-11-28 23:55:47,094 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2023-11-28 23:55:47,439 INFO L124 PetriNetUnfolderBase]: 1061/2066 cut-off events. [2023-11-28 23:55:47,439 INFO L125 PetriNetUnfolderBase]: For 60/60 co-relation queries the response was YES. [2023-11-28 23:55:47,443 INFO L83 FinitePrefix]: Finished finitePrefix Result has 3759 conditions, 2066 events. 1061/2066 cut-off events. For 60/60 co-relation queries the response was YES. Maximal size of possible extension queue 138. Compared 14310 event pairs, 571 based on Foata normal form. 0/1886 useless extension candidates. Maximal degree in co-relation 3748. Up to 1195 conditions per place. [2023-11-28 23:55:47,456 INFO L140 encePairwiseOnDemand]: 50/53 looper letters, 30 selfloop transitions, 2 changer transitions 0/53 dead transitions. [2023-11-28 23:55:47,456 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 55 places, 53 transitions, 180 flow [2023-11-28 23:55:47,457 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2023-11-28 23:55:47,457 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2023-11-28 23:55:47,458 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 111 transitions. [2023-11-28 23:55:47,458 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.6981132075471698 [2023-11-28 23:55:47,458 INFO L72 ComplementDD]: Start complementDD. Operand 3 states and 111 transitions. [2023-11-28 23:55:47,459 INFO L73 IsDeterministic]: Start isDeterministic. Operand 3 states and 111 transitions. [2023-11-28 23:55:47,459 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2023-11-28 23:55:47,459 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 3 states and 111 transitions. [2023-11-28 23:55:47,460 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 4 states, 3 states have (on average 37.0) internal successors, (111), 3 states have internal predecessors, (111), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-28 23:55:47,461 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 4 states, 4 states have (on average 53.0) internal successors, (212), 4 states have internal predecessors, (212), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-28 23:55:47,461 INFO L81 ComplementDD]: Finished complementDD. Result has 4 states, 4 states have (on average 53.0) internal successors, (212), 4 states have internal predecessors, (212), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-28 23:55:47,461 INFO L175 Difference]: Start difference. First operand has 54 places, 45 transitions, 100 flow. Second operand 3 states and 111 transitions. [2023-11-28 23:55:47,461 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 55 places, 53 transitions, 180 flow [2023-11-28 23:55:47,465 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 53 places, 53 transitions, 176 flow, removed 0 selfloop flow, removed 2 redundant places. [2023-11-28 23:55:47,466 INFO L231 Difference]: Finished difference. Result has 53 places, 44 transitions, 98 flow [2023-11-28 23:55:47,467 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=53, 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-28 23:55:47,468 INFO L281 CegarLoopForPetriNet]: 58 programPoint places, -5 predicate places. [2023-11-28 23:55:47,468 INFO L495 AbstractCegarLoop]: Abstraction has has 53 places, 44 transitions, 98 flow [2023-11-28 23:55:47,468 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 27.333333333333332) internal successors, (82), 3 states have internal predecessors, (82), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-28 23:55:47,468 INFO L200 CegarLoopForPetriNet]: Found error trace [2023-11-28 23:55:47,468 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1] [2023-11-28 23:55:47,468 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2 [2023-11-28 23:55:47,469 INFO L420 AbstractCegarLoop]: === Iteration 4 === Targeting ULTIMATE.startErr3REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [P0Err0ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 10 more)] === [2023-11-28 23:55:47,469 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-11-28 23:55:47,469 INFO L85 PathProgramCache]: Analyzing trace with hash 366174644, now seen corresponding path program 1 times [2023-11-28 23:55:47,469 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-11-28 23:55:47,470 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1292237072] [2023-11-28 23:55:47,470 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-11-28 23:55:47,470 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-11-28 23:55:47,486 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-28 23:55:47,542 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-28 23:55:47,542 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-11-28 23:55:47,543 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1292237072] [2023-11-28 23:55:47,543 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1292237072] provided 1 perfect and 0 imperfect interpolant sequences [2023-11-28 23:55:47,543 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-11-28 23:55:47,543 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2023-11-28 23:55:47,543 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1156596274] [2023-11-28 23:55:47,544 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-11-28 23:55:47,544 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2023-11-28 23:55:47,544 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-11-28 23:55:47,545 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2023-11-28 23:55:47,545 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2023-11-28 23:55:47,558 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 27 out of 53 [2023-11-28 23:55:47,558 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 53 places, 44 transitions, 98 flow. Second operand has 3 states, 3 states have (on average 28.333333333333332) internal successors, (85), 3 states have internal predecessors, (85), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-28 23:55:47,558 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2023-11-28 23:55:47,558 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 27 of 53 [2023-11-28 23:55:47,558 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2023-11-28 23:55:47,899 INFO L124 PetriNetUnfolderBase]: 1057/2033 cut-off events. [2023-11-28 23:55:47,900 INFO L125 PetriNetUnfolderBase]: For 64/64 co-relation queries the response was YES. [2023-11-28 23:55:47,904 INFO L83 FinitePrefix]: Finished finitePrefix Result has 3721 conditions, 2033 events. 1057/2033 cut-off events. For 64/64 co-relation queries the response was YES. Maximal size of possible extension queue 137. Compared 14186 event pairs, 811 based on Foata normal form. 5/1864 useless extension candidates. Maximal degree in co-relation 3711. Up to 1186 conditions per place. [2023-11-28 23:55:47,916 INFO L140 encePairwiseOnDemand]: 50/53 looper letters, 29 selfloop transitions, 2 changer transitions 0/52 dead transitions. [2023-11-28 23:55:47,916 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 54 places, 52 transitions, 176 flow [2023-11-28 23:55:47,917 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2023-11-28 23:55:47,917 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2023-11-28 23:55:47,918 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 113 transitions. [2023-11-28 23:55:47,918 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.710691823899371 [2023-11-28 23:55:47,918 INFO L72 ComplementDD]: Start complementDD. Operand 3 states and 113 transitions. [2023-11-28 23:55:47,919 INFO L73 IsDeterministic]: Start isDeterministic. Operand 3 states and 113 transitions. [2023-11-28 23:55:47,919 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2023-11-28 23:55:47,919 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 3 states and 113 transitions. [2023-11-28 23:55:47,920 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 4 states, 3 states have (on average 37.666666666666664) internal successors, (113), 3 states have internal predecessors, (113), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-28 23:55:47,921 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 4 states, 4 states have (on average 53.0) internal successors, (212), 4 states have internal predecessors, (212), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-28 23:55:47,921 INFO L81 ComplementDD]: Finished complementDD. Result has 4 states, 4 states have (on average 53.0) internal successors, (212), 4 states have internal predecessors, (212), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-28 23:55:47,921 INFO L175 Difference]: Start difference. First operand has 53 places, 44 transitions, 98 flow. Second operand 3 states and 113 transitions. [2023-11-28 23:55:47,921 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 54 places, 52 transitions, 176 flow [2023-11-28 23:55:47,924 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 52 places, 52 transitions, 172 flow, removed 0 selfloop flow, removed 2 redundant places. [2023-11-28 23:55:47,925 INFO L231 Difference]: Finished difference. Result has 52 places, 43 transitions, 96 flow [2023-11-28 23:55:47,926 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=53, 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-28 23:55:47,927 INFO L281 CegarLoopForPetriNet]: 58 programPoint places, -6 predicate places. [2023-11-28 23:55:47,927 INFO L495 AbstractCegarLoop]: Abstraction has has 52 places, 43 transitions, 96 flow [2023-11-28 23:55:47,927 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 28.333333333333332) internal successors, (85), 3 states have internal predecessors, (85), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-28 23:55:47,927 INFO L200 CegarLoopForPetriNet]: Found error trace [2023-11-28 23:55:47,927 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1] [2023-11-28 23:55:47,927 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable3 [2023-11-28 23:55:47,928 INFO L420 AbstractCegarLoop]: === Iteration 5 === Targeting P0Err0ASSERT_VIOLATIONMEMORY_LEAK === [P0Err0ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 10 more)] === [2023-11-28 23:55:47,928 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-11-28 23:55:47,928 INFO L85 PathProgramCache]: Analyzing trace with hash 366175360, now seen corresponding path program 1 times [2023-11-28 23:55:47,928 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-11-28 23:55:47,929 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1785687049] [2023-11-28 23:55:47,929 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-11-28 23:55:47,929 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-11-28 23:55:47,944 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-28 23:55:48,018 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-28 23:55:48,019 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-11-28 23:55:48,019 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1785687049] [2023-11-28 23:55:48,019 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1785687049] provided 1 perfect and 0 imperfect interpolant sequences [2023-11-28 23:55:48,019 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-11-28 23:55:48,020 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [1] imperfect sequences [] total 1 [2023-11-28 23:55:48,020 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1244377146] [2023-11-28 23:55:48,020 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-11-28 23:55:48,020 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2023-11-28 23:55:48,021 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-11-28 23:55:48,021 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2023-11-28 23:55:48,021 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2023-11-28 23:55:48,021 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 28 out of 53 [2023-11-28 23:55:48,022 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 52 places, 43 transitions, 96 flow. Second operand has 3 states, 3 states have (on average 29.0) internal successors, (87), 3 states have internal predecessors, (87), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-28 23:55:48,022 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2023-11-28 23:55:48,022 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 28 of 53 [2023-11-28 23:55:48,022 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2023-11-28 23:55:48,286 INFO L124 PetriNetUnfolderBase]: 825/1466 cut-off events. [2023-11-28 23:55:48,286 INFO L125 PetriNetUnfolderBase]: For 51/51 co-relation queries the response was YES. [2023-11-28 23:55:48,289 INFO L83 FinitePrefix]: Finished finitePrefix Result has 2797 conditions, 1466 events. 825/1466 cut-off events. For 51/51 co-relation queries the response was YES. Maximal size of possible extension queue 99. Compared 8575 event pairs, 457 based on Foata normal form. 0/1449 useless extension candidates. Maximal degree in co-relation 2787. Up to 1009 conditions per place. [2023-11-28 23:55:48,297 INFO L140 encePairwiseOnDemand]: 50/53 looper letters, 33 selfloop transitions, 2 changer transitions 2/58 dead transitions. [2023-11-28 23:55:48,298 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 53 places, 58 transitions, 208 flow [2023-11-28 23:55:48,298 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2023-11-28 23:55:48,298 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2023-11-28 23:55:48,299 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 122 transitions. [2023-11-28 23:55:48,299 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.7672955974842768 [2023-11-28 23:55:48,299 INFO L72 ComplementDD]: Start complementDD. Operand 3 states and 122 transitions. [2023-11-28 23:55:48,300 INFO L73 IsDeterministic]: Start isDeterministic. Operand 3 states and 122 transitions. [2023-11-28 23:55:48,300 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2023-11-28 23:55:48,300 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 3 states and 122 transitions. [2023-11-28 23:55:48,301 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 4 states, 3 states have (on average 40.666666666666664) internal successors, (122), 3 states have internal predecessors, (122), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-28 23:55:48,301 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 4 states, 4 states have (on average 53.0) internal successors, (212), 4 states have internal predecessors, (212), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-28 23:55:48,302 INFO L81 ComplementDD]: Finished complementDD. Result has 4 states, 4 states have (on average 53.0) internal successors, (212), 4 states have internal predecessors, (212), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-28 23:55:48,302 INFO L175 Difference]: Start difference. First operand has 52 places, 43 transitions, 96 flow. Second operand 3 states and 122 transitions. [2023-11-28 23:55:48,302 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 53 places, 58 transitions, 208 flow [2023-11-28 23:55:48,303 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 51 places, 58 transitions, 200 flow, removed 0 selfloop flow, removed 2 redundant places. [2023-11-28 23:55:48,304 INFO L231 Difference]: Finished difference. Result has 51 places, 41 transitions, 92 flow [2023-11-28 23:55:48,304 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=53, 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-28 23:55:48,305 INFO L281 CegarLoopForPetriNet]: 58 programPoint places, -7 predicate places. [2023-11-28 23:55:48,305 INFO L495 AbstractCegarLoop]: Abstraction has has 51 places, 41 transitions, 92 flow [2023-11-28 23:55:48,306 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 29.0) internal successors, (87), 3 states have internal predecessors, (87), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-28 23:55:48,306 INFO L200 CegarLoopForPetriNet]: Found error trace [2023-11-28 23:55:48,306 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1] [2023-11-28 23:55:48,306 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable4 [2023-11-28 23:55:48,306 INFO L420 AbstractCegarLoop]: === Iteration 6 === Targeting ULTIMATE.startErr4REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [P0Err0ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 10 more)] === [2023-11-28 23:55:48,307 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-11-28 23:55:48,307 INFO L85 PathProgramCache]: Analyzing trace with hash -507774044, now seen corresponding path program 1 times [2023-11-28 23:55:48,307 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-11-28 23:55:48,307 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [97964017] [2023-11-28 23:55:48,307 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-11-28 23:55:48,307 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-11-28 23:55:48,321 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-28 23:55:48,354 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-28 23:55:48,354 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-11-28 23:55:48,354 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [97964017] [2023-11-28 23:55:48,354 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [97964017] provided 1 perfect and 0 imperfect interpolant sequences [2023-11-28 23:55:48,355 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-11-28 23:55:48,355 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2023-11-28 23:55:48,355 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1386176092] [2023-11-28 23:55:48,355 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-11-28 23:55:48,355 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2023-11-28 23:55:48,356 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-11-28 23:55:48,356 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2023-11-28 23:55:48,356 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2023-11-28 23:55:48,369 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 26 out of 53 [2023-11-28 23:55:48,370 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 51 places, 41 transitions, 92 flow. Second operand has 3 states, 3 states have (on average 28.0) internal successors, (84), 3 states have internal predecessors, (84), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-28 23:55:48,370 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2023-11-28 23:55:48,370 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 26 of 53 [2023-11-28 23:55:48,370 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2023-11-28 23:55:48,613 INFO L124 PetriNetUnfolderBase]: 738/1459 cut-off events. [2023-11-28 23:55:48,613 INFO L125 PetriNetUnfolderBase]: For 95/95 co-relation queries the response was YES. [2023-11-28 23:55:48,615 INFO L83 FinitePrefix]: Finished finitePrefix Result has 2711 conditions, 1459 events. 738/1459 cut-off events. For 95/95 co-relation queries the response was YES. Maximal size of possible extension queue 100. Compared 9484 event pairs, 428 based on Foata normal form. 0/1420 useless extension candidates. Maximal degree in co-relation 2700. Up to 934 conditions per place. [2023-11-28 23:55:48,624 INFO L140 encePairwiseOnDemand]: 50/53 looper letters, 27 selfloop transitions, 2 changer transitions 0/48 dead transitions. [2023-11-28 23:55:48,624 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 51 places, 48 transitions, 166 flow [2023-11-28 23:55:48,625 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2023-11-28 23:55:48,625 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2023-11-28 23:55:48,626 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 108 transitions. [2023-11-28 23:55:48,626 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.6792452830188679 [2023-11-28 23:55:48,626 INFO L72 ComplementDD]: Start complementDD. Operand 3 states and 108 transitions. [2023-11-28 23:55:48,626 INFO L73 IsDeterministic]: Start isDeterministic. Operand 3 states and 108 transitions. [2023-11-28 23:55:48,627 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2023-11-28 23:55:48,627 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 3 states and 108 transitions. [2023-11-28 23:55:48,627 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 4 states, 3 states have (on average 36.0) internal successors, (108), 3 states have internal predecessors, (108), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-28 23:55:48,628 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 4 states, 4 states have (on average 53.0) internal successors, (212), 4 states have internal predecessors, (212), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-28 23:55:48,629 INFO L81 ComplementDD]: Finished complementDD. Result has 4 states, 4 states have (on average 53.0) internal successors, (212), 4 states have internal predecessors, (212), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-28 23:55:48,629 INFO L175 Difference]: Start difference. First operand has 51 places, 41 transitions, 92 flow. Second operand 3 states and 108 transitions. [2023-11-28 23:55:48,629 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 51 places, 48 transitions, 166 flow [2023-11-28 23:55:48,630 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 49 places, 48 transitions, 160 flow, removed 0 selfloop flow, removed 2 redundant places. [2023-11-28 23:55:48,631 INFO L231 Difference]: Finished difference. Result has 49 places, 40 transitions, 90 flow [2023-11-28 23:55:48,631 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=53, PETRI_DIFFERENCE_MINUEND_FLOW=86, PETRI_DIFFERENCE_MINUEND_PLACES=47, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=40, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=2, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=38, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=90, PETRI_PLACES=49, PETRI_TRANSITIONS=40} [2023-11-28 23:55:48,632 INFO L281 CegarLoopForPetriNet]: 58 programPoint places, -9 predicate places. [2023-11-28 23:55:48,632 INFO L495 AbstractCegarLoop]: Abstraction has has 49 places, 40 transitions, 90 flow [2023-11-28 23:55:48,632 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 28.0) internal successors, (84), 3 states have internal predecessors, (84), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-28 23:55:48,633 INFO L200 CegarLoopForPetriNet]: Found error trace [2023-11-28 23:55:48,633 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1] [2023-11-28 23:55:48,633 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable5 [2023-11-28 23:55:48,633 INFO L420 AbstractCegarLoop]: === Iteration 7 === Targeting ULTIMATE.startErr5REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [P0Err0ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 10 more)] === [2023-11-28 23:55:48,633 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-11-28 23:55:48,634 INFO L85 PathProgramCache]: Analyzing trace with hash -507774043, now seen corresponding path program 1 times [2023-11-28 23:55:48,634 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-11-28 23:55:48,634 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1807461307] [2023-11-28 23:55:48,634 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-11-28 23:55:48,634 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-11-28 23:55:48,650 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-28 23:55:48,705 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-11-28 23:55:48,706 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-11-28 23:55:48,706 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1807461307] [2023-11-28 23:55:48,706 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1807461307] provided 1 perfect and 0 imperfect interpolant sequences [2023-11-28 23:55:48,706 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-11-28 23:55:48,706 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2023-11-28 23:55:48,707 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1993406998] [2023-11-28 23:55:48,707 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-11-28 23:55:48,707 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2023-11-28 23:55:48,707 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-11-28 23:55:48,708 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2023-11-28 23:55:48,708 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2023-11-28 23:55:48,720 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 27 out of 53 [2023-11-28 23:55:48,721 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 49 places, 40 transitions, 90 flow. Second operand has 3 states, 3 states have (on average 29.0) internal successors, (87), 3 states have internal predecessors, (87), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-28 23:55:48,721 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2023-11-28 23:55:48,721 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 27 of 53 [2023-11-28 23:55:48,721 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2023-11-28 23:55:48,962 INFO L124 PetriNetUnfolderBase]: 721/1430 cut-off events. [2023-11-28 23:55:48,962 INFO L125 PetriNetUnfolderBase]: For 56/56 co-relation queries the response was YES. [2023-11-28 23:55:48,964 INFO L83 FinitePrefix]: Finished finitePrefix Result has 2617 conditions, 1430 events. 721/1430 cut-off events. For 56/56 co-relation queries the response was YES. Maximal size of possible extension queue 100. Compared 9280 event pairs, 420 based on Foata normal form. 12/1415 useless extension candidates. Maximal degree in co-relation 2607. Up to 905 conditions per place. [2023-11-28 23:55:48,973 INFO L140 encePairwiseOnDemand]: 50/53 looper letters, 26 selfloop transitions, 2 changer transitions 0/47 dead transitions. [2023-11-28 23:55:48,973 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 50 places, 47 transitions, 160 flow [2023-11-28 23:55:48,973 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2023-11-28 23:55:48,973 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2023-11-28 23:55:48,974 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 110 transitions. [2023-11-28 23:55:48,974 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.6918238993710691 [2023-11-28 23:55:48,974 INFO L72 ComplementDD]: Start complementDD. Operand 3 states and 110 transitions. [2023-11-28 23:55:48,974 INFO L73 IsDeterministic]: Start isDeterministic. Operand 3 states and 110 transitions. [2023-11-28 23:55:48,975 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2023-11-28 23:55:48,975 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 3 states and 110 transitions. [2023-11-28 23:55:48,975 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 4 states, 3 states have (on average 36.666666666666664) internal successors, (110), 3 states have internal predecessors, (110), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-28 23:55:48,976 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 4 states, 4 states have (on average 53.0) internal successors, (212), 4 states have internal predecessors, (212), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-28 23:55:48,976 INFO L81 ComplementDD]: Finished complementDD. Result has 4 states, 4 states have (on average 53.0) internal successors, (212), 4 states have internal predecessors, (212), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-28 23:55:48,976 INFO L175 Difference]: Start difference. First operand has 49 places, 40 transitions, 90 flow. Second operand 3 states and 110 transitions. [2023-11-28 23:55:48,977 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 50 places, 47 transitions, 160 flow [2023-11-28 23:55:48,978 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 48 places, 47 transitions, 156 flow, removed 0 selfloop flow, removed 2 redundant places. [2023-11-28 23:55:48,979 INFO L231 Difference]: Finished difference. Result has 48 places, 39 transitions, 88 flow [2023-11-28 23:55:48,979 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=53, PETRI_DIFFERENCE_MINUEND_FLOW=84, PETRI_DIFFERENCE_MINUEND_PLACES=46, 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=3, PETRI_FLOW=88, PETRI_PLACES=48, PETRI_TRANSITIONS=39} [2023-11-28 23:55:48,980 INFO L281 CegarLoopForPetriNet]: 58 programPoint places, -10 predicate places. [2023-11-28 23:55:48,980 INFO L495 AbstractCegarLoop]: Abstraction has has 48 places, 39 transitions, 88 flow [2023-11-28 23:55:48,980 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 29.0) internal successors, (87), 3 states have internal predecessors, (87), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-28 23:55:48,980 INFO L200 CegarLoopForPetriNet]: Found error trace [2023-11-28 23:55:48,980 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-28 23:55:48,980 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable6 [2023-11-28 23:55:48,981 INFO L420 AbstractCegarLoop]: === Iteration 8 === Targeting ULTIMATE.startErr7ASSERT_VIOLATIONMEMORY_LEAK === [P0Err0ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 10 more)] === [2023-11-28 23:55:48,981 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-11-28 23:55:48,981 INFO L85 PathProgramCache]: Analyzing trace with hash 1981724751, now seen corresponding path program 1 times [2023-11-28 23:55:48,981 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-11-28 23:55:48,981 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [708133870] [2023-11-28 23:55:48,982 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-11-28 23:55:48,982 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-11-28 23:55:49,018 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-28 23:55:49,389 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-28 23:55:49,389 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-11-28 23:55:49,390 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [708133870] [2023-11-28 23:55:49,390 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [708133870] provided 1 perfect and 0 imperfect interpolant sequences [2023-11-28 23:55:49,390 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-11-28 23:55:49,390 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2023-11-28 23:55:49,390 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1209718080] [2023-11-28 23:55:49,390 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-11-28 23:55:49,391 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2023-11-28 23:55:49,391 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-11-28 23:55:49,391 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2023-11-28 23:55:49,392 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=12, Invalid=30, Unknown=0, NotChecked=0, Total=42 [2023-11-28 23:55:49,480 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 24 out of 53 [2023-11-28 23:55:49,480 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 48 places, 39 transitions, 88 flow. Second operand has 7 states, 7 states have (on average 25.857142857142858) internal successors, (181), 7 states have internal predecessors, (181), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-28 23:55:49,481 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2023-11-28 23:55:49,481 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 24 of 53 [2023-11-28 23:55:49,481 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2023-11-28 23:55:49,887 INFO L124 PetriNetUnfolderBase]: 724/1409 cut-off events. [2023-11-28 23:55:49,887 INFO L125 PetriNetUnfolderBase]: For 56/56 co-relation queries the response was YES. [2023-11-28 23:55:49,890 INFO L83 FinitePrefix]: Finished finitePrefix Result has 2603 conditions, 1409 events. 724/1409 cut-off events. For 56/56 co-relation queries the response was YES. Maximal size of possible extension queue 96. Compared 8975 event pairs, 192 based on Foata normal form. 48/1427 useless extension candidates. Maximal degree in co-relation 2593. Up to 905 conditions per place. [2023-11-28 23:55:49,898 INFO L140 encePairwiseOnDemand]: 48/53 looper letters, 25 selfloop transitions, 3 changer transitions 9/54 dead transitions. [2023-11-28 23:55:49,898 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 52 places, 54 transitions, 192 flow [2023-11-28 23:55:49,898 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2023-11-28 23:55:49,899 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 6 states. [2023-11-28 23:55:49,899 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6 states to 6 states and 182 transitions. [2023-11-28 23:55:49,900 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.5723270440251572 [2023-11-28 23:55:49,900 INFO L72 ComplementDD]: Start complementDD. Operand 6 states and 182 transitions. [2023-11-28 23:55:49,900 INFO L73 IsDeterministic]: Start isDeterministic. Operand 6 states and 182 transitions. [2023-11-28 23:55:49,900 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2023-11-28 23:55:49,900 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 6 states and 182 transitions. [2023-11-28 23:55:49,901 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 7 states, 6 states have (on average 30.333333333333332) internal successors, (182), 6 states have internal predecessors, (182), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-28 23:55:49,902 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 7 states, 7 states have (on average 53.0) internal successors, (371), 7 states have internal predecessors, (371), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-28 23:55:49,903 INFO L81 ComplementDD]: Finished complementDD. Result has 7 states, 7 states have (on average 53.0) internal successors, (371), 7 states have internal predecessors, (371), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-28 23:55:49,903 INFO L175 Difference]: Start difference. First operand has 48 places, 39 transitions, 88 flow. Second operand 6 states and 182 transitions. [2023-11-28 23:55:49,903 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 52 places, 54 transitions, 192 flow [2023-11-28 23:55:49,904 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 50 places, 54 transitions, 188 flow, removed 0 selfloop flow, removed 2 redundant places. [2023-11-28 23:55:49,905 INFO L231 Difference]: Finished difference. Result has 50 places, 37 transitions, 86 flow [2023-11-28 23:55:49,905 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=53, PETRI_DIFFERENCE_MINUEND_FLOW=82, PETRI_DIFFERENCE_MINUEND_PLACES=45, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=38, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=3, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=35, PETRI_DIFFERENCE_SUBTRAHEND_STATES=6, PETRI_FLOW=86, PETRI_PLACES=50, PETRI_TRANSITIONS=37} [2023-11-28 23:55:49,906 INFO L281 CegarLoopForPetriNet]: 58 programPoint places, -8 predicate places. [2023-11-28 23:55:49,906 INFO L495 AbstractCegarLoop]: Abstraction has has 50 places, 37 transitions, 86 flow [2023-11-28 23:55:49,907 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 7 states, 7 states have (on average 25.857142857142858) internal successors, (181), 7 states have internal predecessors, (181), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-28 23:55:49,907 INFO L200 CegarLoopForPetriNet]: Found error trace [2023-11-28 23:55:49,907 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-28 23:55:49,907 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable7 [2023-11-28 23:55:49,907 INFO L420 AbstractCegarLoop]: === Iteration 9 === Targeting ULTIMATE.startErr6ASSERT_VIOLATIONMEMORY_LEAK === [P0Err0ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 10 more)] === [2023-11-28 23:55:49,908 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-11-28 23:55:49,908 INFO L85 PathProgramCache]: Analyzing trace with hash 1981726094, now seen corresponding path program 1 times [2023-11-28 23:55:49,908 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-11-28 23:55:49,908 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [156875884] [2023-11-28 23:55:49,908 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-11-28 23:55:49,909 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-11-28 23:55:49,929 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-28 23:55:50,105 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-11-28 23:55:50,105 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-11-28 23:55:50,106 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [156875884] [2023-11-28 23:55:50,106 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [156875884] provided 1 perfect and 0 imperfect interpolant sequences [2023-11-28 23:55:50,106 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-11-28 23:55:50,106 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2023-11-28 23:55:50,106 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1073824218] [2023-11-28 23:55:50,106 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-11-28 23:55:50,107 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2023-11-28 23:55:50,107 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-11-28 23:55:50,107 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2023-11-28 23:55:50,108 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2023-11-28 23:55:50,119 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 22 out of 53 [2023-11-28 23:55:50,119 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 50 places, 37 transitions, 86 flow. Second operand has 5 states, 5 states have (on average 24.4) internal successors, (122), 5 states have internal predecessors, (122), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-28 23:55:50,120 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2023-11-28 23:55:50,120 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 22 of 53 [2023-11-28 23:55:50,120 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2023-11-28 23:55:51,157 INFO L124 PetriNetUnfolderBase]: 5113/8140 cut-off events. [2023-11-28 23:55:51,157 INFO L125 PetriNetUnfolderBase]: For 30/30 co-relation queries the response was YES. [2023-11-28 23:55:51,165 INFO L83 FinitePrefix]: Finished finitePrefix Result has 15737 conditions, 8140 events. 5113/8140 cut-off events. For 30/30 co-relation queries the response was YES. Maximal size of possible extension queue 461. Compared 55009 event pairs, 1114 based on Foata normal form. 0/7896 useless extension candidates. Maximal degree in co-relation 15726. Up to 2475 conditions per place. [2023-11-28 23:55:51,182 INFO L140 encePairwiseOnDemand]: 43/53 looper letters, 37 selfloop transitions, 6 changer transitions 79/134 dead transitions. [2023-11-28 23:55:51,183 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 56 places, 134 transitions, 528 flow [2023-11-28 23:55:51,183 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2023-11-28 23:55:51,183 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 9 states. [2023-11-28 23:55:51,184 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 9 states to 9 states and 322 transitions. [2023-11-28 23:55:51,184 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.6750524109014675 [2023-11-28 23:55:51,184 INFO L72 ComplementDD]: Start complementDD. Operand 9 states and 322 transitions. [2023-11-28 23:55:51,184 INFO L73 IsDeterministic]: Start isDeterministic. Operand 9 states and 322 transitions. [2023-11-28 23:55:51,185 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2023-11-28 23:55:51,185 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 9 states and 322 transitions. [2023-11-28 23:55:51,186 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 10 states, 9 states have (on average 35.77777777777778) internal successors, (322), 9 states have internal predecessors, (322), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-28 23:55:51,187 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 10 states, 10 states have (on average 53.0) internal successors, (530), 10 states have internal predecessors, (530), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-28 23:55:51,188 INFO L81 ComplementDD]: Finished complementDD. Result has 10 states, 10 states have (on average 53.0) internal successors, (530), 10 states have internal predecessors, (530), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-28 23:55:51,188 INFO L175 Difference]: Start difference. First operand has 50 places, 37 transitions, 86 flow. Second operand 9 states and 322 transitions. [2023-11-28 23:55:51,188 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 56 places, 134 transitions, 528 flow [2023-11-28 23:55:51,189 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 53 places, 134 transitions, 522 flow, removed 0 selfloop flow, removed 3 redundant places. [2023-11-28 23:55:51,191 INFO L231 Difference]: Finished difference. Result has 61 places, 41 transitions, 163 flow [2023-11-28 23:55:51,191 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=53, PETRI_DIFFERENCE_MINUEND_FLOW=81, PETRI_DIFFERENCE_MINUEND_PLACES=45, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=37, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=1, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=31, PETRI_DIFFERENCE_SUBTRAHEND_STATES=9, PETRI_FLOW=163, PETRI_PLACES=61, PETRI_TRANSITIONS=41} [2023-11-28 23:55:51,192 INFO L281 CegarLoopForPetriNet]: 58 programPoint places, 3 predicate places. [2023-11-28 23:55:51,192 INFO L495 AbstractCegarLoop]: Abstraction has has 61 places, 41 transitions, 163 flow [2023-11-28 23:55:51,192 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 24.4) internal successors, (122), 5 states have internal predecessors, (122), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-28 23:55:51,192 INFO L200 CegarLoopForPetriNet]: Found error trace [2023-11-28 23:55:51,193 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-11-28 23:55:51,193 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable8 [2023-11-28 23:55:51,193 INFO L420 AbstractCegarLoop]: === Iteration 10 === Targeting ULTIMATE.startErr6ASSERT_VIOLATIONMEMORY_LEAK === [P0Err0ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 10 more)] === [2023-11-28 23:55:51,193 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-11-28 23:55:51,193 INFO L85 PathProgramCache]: Analyzing trace with hash 697188525, now seen corresponding path program 1 times [2023-11-28 23:55:51,194 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-11-28 23:55:51,194 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1669517326] [2023-11-28 23:55:51,194 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-11-28 23:55:51,194 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-11-28 23:55:51,213 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-28 23:55:51,387 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-28 23:55:51,388 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-11-28 23:55:51,388 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1669517326] [2023-11-28 23:55:51,388 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1669517326] provided 1 perfect and 0 imperfect interpolant sequences [2023-11-28 23:55:51,388 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-11-28 23:55:51,388 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2023-11-28 23:55:51,389 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1927022091] [2023-11-28 23:55:51,389 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-11-28 23:55:51,389 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2023-11-28 23:55:51,389 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-11-28 23:55:51,390 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2023-11-28 23:55:51,390 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=10, Invalid=20, Unknown=0, NotChecked=0, Total=30 [2023-11-28 23:55:51,400 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 22 out of 53 [2023-11-28 23:55:51,400 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 61 places, 41 transitions, 163 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-28 23:55:51,400 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2023-11-28 23:55:51,400 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 22 of 53 [2023-11-28 23:55:51,400 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2023-11-28 23:55:52,355 INFO L124 PetriNetUnfolderBase]: 3717/6161 cut-off events. [2023-11-28 23:55:52,356 INFO L125 PetriNetUnfolderBase]: For 7577/7584 co-relation queries the response was YES. [2023-11-28 23:55:52,364 INFO L83 FinitePrefix]: Finished finitePrefix Result has 17272 conditions, 6161 events. 3717/6161 cut-off events. For 7577/7584 co-relation queries the response was YES. Maximal size of possible extension queue 350. Compared 41891 event pairs, 311 based on Foata normal form. 179/6329 useless extension candidates. Maximal degree in co-relation 17253. Up to 2309 conditions per place. [2023-11-28 23:55:52,379 INFO L140 encePairwiseOnDemand]: 44/53 looper letters, 45 selfloop transitions, 10 changer transitions 62/129 dead transitions. [2023-11-28 23:55:52,379 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 63 places, 129 transitions, 766 flow [2023-11-28 23:55:52,380 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2023-11-28 23:55:52,380 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 10 states. [2023-11-28 23:55:52,381 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 10 states to 10 states and 333 transitions. [2023-11-28 23:55:52,381 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.6283018867924528 [2023-11-28 23:55:52,382 INFO L72 ComplementDD]: Start complementDD. Operand 10 states and 333 transitions. [2023-11-28 23:55:52,382 INFO L73 IsDeterministic]: Start isDeterministic. Operand 10 states and 333 transitions. [2023-11-28 23:55:52,382 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2023-11-28 23:55:52,382 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 10 states and 333 transitions. [2023-11-28 23:55:52,383 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 11 states, 10 states have (on average 33.3) internal successors, (333), 10 states have internal predecessors, (333), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-28 23:55:52,385 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 11 states, 11 states have (on average 53.0) internal successors, (583), 11 states have internal predecessors, (583), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-28 23:55:52,385 INFO L81 ComplementDD]: Finished complementDD. Result has 11 states, 11 states have (on average 53.0) internal successors, (583), 11 states have internal predecessors, (583), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-28 23:55:52,385 INFO L175 Difference]: Start difference. First operand has 61 places, 41 transitions, 163 flow. Second operand 10 states and 333 transitions. [2023-11-28 23:55:52,386 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 63 places, 129 transitions, 766 flow [2023-11-28 23:55:52,418 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 59 places, 129 transitions, 678 flow, removed 20 selfloop flow, removed 4 redundant places. [2023-11-28 23:55:52,420 INFO L231 Difference]: Finished difference. Result has 68 places, 46 transitions, 231 flow [2023-11-28 23:55:52,420 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=53, PETRI_DIFFERENCE_MINUEND_FLOW=139, PETRI_DIFFERENCE_MINUEND_PLACES=50, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=41, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=5, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=33, PETRI_DIFFERENCE_SUBTRAHEND_STATES=10, PETRI_FLOW=231, PETRI_PLACES=68, PETRI_TRANSITIONS=46} [2023-11-28 23:55:52,421 INFO L281 CegarLoopForPetriNet]: 58 programPoint places, 10 predicate places. [2023-11-28 23:55:52,421 INFO L495 AbstractCegarLoop]: Abstraction has has 68 places, 46 transitions, 231 flow [2023-11-28 23:55:52,421 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-28 23:55:52,422 INFO L200 CegarLoopForPetriNet]: Found error trace [2023-11-28 23:55:52,422 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-11-28 23:55:52,422 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable9 [2023-11-28 23:55:52,422 INFO L420 AbstractCegarLoop]: === Iteration 11 === Targeting ULTIMATE.startErr6ASSERT_VIOLATIONMEMORY_LEAK === [P0Err0ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 10 more)] === [2023-11-28 23:55:52,422 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-11-28 23:55:52,423 INFO L85 PathProgramCache]: Analyzing trace with hash 1899018221, now seen corresponding path program 1 times [2023-11-28 23:55:52,423 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-11-28 23:55:52,423 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1155416043] [2023-11-28 23:55:52,423 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-11-28 23:55:52,423 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-11-28 23:55:52,441 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-28 23:55:52,598 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-28 23:55:52,598 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-11-28 23:55:52,598 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1155416043] [2023-11-28 23:55:52,599 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1155416043] provided 1 perfect and 0 imperfect interpolant sequences [2023-11-28 23:55:52,599 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-11-28 23:55:52,599 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2023-11-28 23:55:52,599 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1401363441] [2023-11-28 23:55:52,599 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-11-28 23:55:52,600 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2023-11-28 23:55:52,600 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-11-28 23:55:52,600 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2023-11-28 23:55:52,600 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=10, Invalid=20, Unknown=0, NotChecked=0, Total=30 [2023-11-28 23:55:52,609 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 22 out of 53 [2023-11-28 23:55:52,609 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 68 places, 46 transitions, 231 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-28 23:55:52,610 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2023-11-28 23:55:52,610 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 22 of 53 [2023-11-28 23:55:52,610 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2023-11-28 23:55:53,539 INFO L124 PetriNetUnfolderBase]: 3540/5818 cut-off events. [2023-11-28 23:55:53,540 INFO L125 PetriNetUnfolderBase]: For 15464/15469 co-relation queries the response was YES. [2023-11-28 23:55:53,550 INFO L83 FinitePrefix]: Finished finitePrefix Result has 18333 conditions, 5818 events. 3540/5818 cut-off events. For 15464/15469 co-relation queries the response was YES. Maximal size of possible extension queue 320. Compared 38401 event pairs, 566 based on Foata normal form. 166/5979 useless extension candidates. Maximal degree in co-relation 18307. Up to 2187 conditions per place. [2023-11-28 23:55:53,564 INFO L140 encePairwiseOnDemand]: 44/53 looper letters, 50 selfloop transitions, 14 changer transitions 60/136 dead transitions. [2023-11-28 23:55:53,564 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 71 places, 136 transitions, 899 flow [2023-11-28 23:55:53,565 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2023-11-28 23:55:53,565 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 10 states. [2023-11-28 23:55:53,566 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 10 states to 10 states and 340 transitions. [2023-11-28 23:55:53,567 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.6415094339622641 [2023-11-28 23:55:53,567 INFO L72 ComplementDD]: Start complementDD. Operand 10 states and 340 transitions. [2023-11-28 23:55:53,567 INFO L73 IsDeterministic]: Start isDeterministic. Operand 10 states and 340 transitions. [2023-11-28 23:55:53,568 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2023-11-28 23:55:53,568 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 10 states and 340 transitions. [2023-11-28 23:55:53,569 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 11 states, 10 states have (on average 34.0) internal successors, (340), 10 states have internal predecessors, (340), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-28 23:55:53,570 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 11 states, 11 states have (on average 53.0) internal successors, (583), 11 states have internal predecessors, (583), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-28 23:55:53,570 INFO L81 ComplementDD]: Finished complementDD. Result has 11 states, 11 states have (on average 53.0) internal successors, (583), 11 states have internal predecessors, (583), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-28 23:55:53,571 INFO L175 Difference]: Start difference. First operand has 68 places, 46 transitions, 231 flow. Second operand 10 states and 340 transitions. [2023-11-28 23:55:53,571 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 71 places, 136 transitions, 899 flow [2023-11-28 23:55:53,605 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 67 places, 136 transitions, 843 flow, removed 28 selfloop flow, removed 4 redundant places. [2023-11-28 23:55:53,607 INFO L231 Difference]: Finished difference. Result has 75 places, 51 transitions, 319 flow [2023-11-28 23:55:53,607 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=53, PETRI_DIFFERENCE_MINUEND_FLOW=213, PETRI_DIFFERENCE_MINUEND_PLACES=58, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=46, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=9, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=34, PETRI_DIFFERENCE_SUBTRAHEND_STATES=10, PETRI_FLOW=319, PETRI_PLACES=75, PETRI_TRANSITIONS=51} [2023-11-28 23:55:53,608 INFO L281 CegarLoopForPetriNet]: 58 programPoint places, 17 predicate places. [2023-11-28 23:55:53,608 INFO L495 AbstractCegarLoop]: Abstraction has has 75 places, 51 transitions, 319 flow [2023-11-28 23:55:53,608 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-28 23:55:53,608 INFO L200 CegarLoopForPetriNet]: Found error trace [2023-11-28 23:55:53,608 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-28 23:55:53,608 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable10 [2023-11-28 23:55:53,608 INFO L420 AbstractCegarLoop]: === Iteration 12 === Targeting ULTIMATE.startErr6ASSERT_VIOLATIONMEMORY_LEAK === [P0Err0ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 10 more)] === [2023-11-28 23:55:53,609 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-11-28 23:55:53,609 INFO L85 PathProgramCache]: Analyzing trace with hash -1659099332, now seen corresponding path program 1 times [2023-11-28 23:55:53,609 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-11-28 23:55:53,609 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [668074353] [2023-11-28 23:55:53,609 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-11-28 23:55:53,609 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-11-28 23:55:53,631 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-28 23:55:53,722 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-28 23:55:53,723 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-11-28 23:55:53,723 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [668074353] [2023-11-28 23:55:53,723 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [668074353] provided 1 perfect and 0 imperfect interpolant sequences [2023-11-28 23:55:53,723 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-11-28 23:55:53,723 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2023-11-28 23:55:53,723 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [778043630] [2023-11-28 23:55:53,723 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-11-28 23:55:53,724 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2023-11-28 23:55:53,724 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-11-28 23:55:53,725 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2023-11-28 23:55:53,725 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2023-11-28 23:55:53,728 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 24 out of 53 [2023-11-28 23:55:53,728 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 75 places, 51 transitions, 319 flow. Second operand has 4 states, 4 states have (on average 27.0) internal successors, (108), 4 states have internal predecessors, (108), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-28 23:55:53,728 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2023-11-28 23:55:53,729 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 24 of 53 [2023-11-28 23:55:53,729 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2023-11-28 23:55:54,510 INFO L124 PetriNetUnfolderBase]: 3882/6601 cut-off events. [2023-11-28 23:55:54,510 INFO L125 PetriNetUnfolderBase]: For 10176/10527 co-relation queries the response was YES. [2023-11-28 23:55:54,559 INFO L83 FinitePrefix]: Finished finitePrefix Result has 17396 conditions, 6601 events. 3882/6601 cut-off events. For 10176/10527 co-relation queries the response was YES. Maximal size of possible extension queue 310. Compared 44803 event pairs, 592 based on Foata normal form. 427/6898 useless extension candidates. Maximal degree in co-relation 17364. Up to 3481 conditions per place. [2023-11-28 23:55:54,574 INFO L140 encePairwiseOnDemand]: 47/53 looper letters, 46 selfloop transitions, 5 changer transitions 0/78 dead transitions. [2023-11-28 23:55:54,575 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 72 places, 78 transitions, 510 flow [2023-11-28 23:55:54,575 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2023-11-28 23:55:54,575 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 4 states. [2023-11-28 23:55:54,576 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 146 transitions. [2023-11-28 23:55:54,576 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.6886792452830188 [2023-11-28 23:55:54,576 INFO L72 ComplementDD]: Start complementDD. Operand 4 states and 146 transitions. [2023-11-28 23:55:54,576 INFO L73 IsDeterministic]: Start isDeterministic. Operand 4 states and 146 transitions. [2023-11-28 23:55:54,576 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2023-11-28 23:55:54,577 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 4 states and 146 transitions. [2023-11-28 23:55:54,577 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 5 states, 4 states have (on average 36.5) internal successors, (146), 4 states have internal predecessors, (146), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-28 23:55:54,578 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 5 states, 5 states have (on average 53.0) internal successors, (265), 5 states have internal predecessors, (265), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-28 23:55:54,578 INFO L81 ComplementDD]: Finished complementDD. Result has 5 states, 5 states have (on average 53.0) internal successors, (265), 5 states have internal predecessors, (265), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-28 23:55:54,578 INFO L175 Difference]: Start difference. First operand has 75 places, 51 transitions, 319 flow. Second operand 4 states and 146 transitions. [2023-11-28 23:55:54,578 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 72 places, 78 transitions, 510 flow [2023-11-28 23:55:54,597 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 64 places, 78 transitions, 484 flow, removed 13 selfloop flow, removed 8 redundant places. [2023-11-28 23:55:54,598 INFO L231 Difference]: Finished difference. Result has 66 places, 55 transitions, 331 flow [2023-11-28 23:55:54,598 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=53, PETRI_DIFFERENCE_MINUEND_FLOW=293, PETRI_DIFFERENCE_MINUEND_PLACES=61, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=51, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=1, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=46, PETRI_DIFFERENCE_SUBTRAHEND_STATES=4, PETRI_FLOW=331, PETRI_PLACES=66, PETRI_TRANSITIONS=55} [2023-11-28 23:55:54,599 INFO L281 CegarLoopForPetriNet]: 58 programPoint places, 8 predicate places. [2023-11-28 23:55:54,599 INFO L495 AbstractCegarLoop]: Abstraction has has 66 places, 55 transitions, 331 flow [2023-11-28 23:55:54,599 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 27.0) internal successors, (108), 4 states have internal predecessors, (108), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-28 23:55:54,599 INFO L200 CegarLoopForPetriNet]: Found error trace [2023-11-28 23:55:54,599 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-28 23:55:54,600 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable11 [2023-11-28 23:55:54,600 INFO L420 AbstractCegarLoop]: === Iteration 13 === Targeting ULTIMATE.startErr6ASSERT_VIOLATIONMEMORY_LEAK === [P0Err0ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 10 more)] === [2023-11-28 23:55:54,600 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-11-28 23:55:54,600 INFO L85 PathProgramCache]: Analyzing trace with hash 1090275988, now seen corresponding path program 1 times [2023-11-28 23:55:54,600 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-11-28 23:55:54,601 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [949734541] [2023-11-28 23:55:54,601 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-11-28 23:55:54,601 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-11-28 23:55:54,618 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-28 23:55:54,745 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-28 23:55:54,746 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-11-28 23:55:54,746 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [949734541] [2023-11-28 23:55:54,746 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [949734541] provided 1 perfect and 0 imperfect interpolant sequences [2023-11-28 23:55:54,746 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-11-28 23:55:54,746 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2023-11-28 23:55:54,746 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1101244481] [2023-11-28 23:55:54,747 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-11-28 23:55:54,747 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2023-11-28 23:55:54,747 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-11-28 23:55:54,748 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2023-11-28 23:55:54,748 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2023-11-28 23:55:54,755 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 24 out of 53 [2023-11-28 23:55:54,755 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 66 places, 55 transitions, 331 flow. Second operand has 5 states, 5 states have (on average 27.0) internal successors, (135), 5 states have internal predecessors, (135), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-28 23:55:54,756 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2023-11-28 23:55:54,756 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 24 of 53 [2023-11-28 23:55:54,756 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2023-11-28 23:55:55,697 INFO L124 PetriNetUnfolderBase]: 4413/7937 cut-off events. [2023-11-28 23:55:55,697 INFO L125 PetriNetUnfolderBase]: For 10965/11216 co-relation queries the response was YES. [2023-11-28 23:55:55,717 INFO L83 FinitePrefix]: Finished finitePrefix Result has 22337 conditions, 7937 events. 4413/7937 cut-off events. For 10965/11216 co-relation queries the response was YES. Maximal size of possible extension queue 481. Compared 62476 event pairs, 1876 based on Foata normal form. 331/7814 useless extension candidates. Maximal degree in co-relation 22309. Up to 3142 conditions per place. [2023-11-28 23:55:55,735 INFO L140 encePairwiseOnDemand]: 48/53 looper letters, 52 selfloop transitions, 13 changer transitions 20/109 dead transitions. [2023-11-28 23:55:55,735 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 72 places, 109 transitions, 731 flow [2023-11-28 23:55:55,736 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2023-11-28 23:55:55,736 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 7 states. [2023-11-28 23:55:55,737 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 7 states to 7 states and 242 transitions. [2023-11-28 23:55:55,737 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.6522911051212938 [2023-11-28 23:55:55,737 INFO L72 ComplementDD]: Start complementDD. Operand 7 states and 242 transitions. [2023-11-28 23:55:55,737 INFO L73 IsDeterministic]: Start isDeterministic. Operand 7 states and 242 transitions. [2023-11-28 23:55:55,737 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2023-11-28 23:55:55,737 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 7 states and 242 transitions. [2023-11-28 23:55:55,738 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 8 states, 7 states have (on average 34.57142857142857) internal successors, (242), 7 states have internal predecessors, (242), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-28 23:55:55,739 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 8 states, 8 states have (on average 53.0) internal successors, (424), 8 states have internal predecessors, (424), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-28 23:55:55,739 INFO L81 ComplementDD]: Finished complementDD. Result has 8 states, 8 states have (on average 53.0) internal successors, (424), 8 states have internal predecessors, (424), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-28 23:55:55,740 INFO L175 Difference]: Start difference. First operand has 66 places, 55 transitions, 331 flow. Second operand 7 states and 242 transitions. [2023-11-28 23:55:55,740 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 72 places, 109 transitions, 731 flow [2023-11-28 23:55:55,753 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 71 places, 109 transitions, 725 flow, removed 2 selfloop flow, removed 1 redundant places. [2023-11-28 23:55:55,755 INFO L231 Difference]: Finished difference. Result has 76 places, 60 transitions, 419 flow [2023-11-28 23:55:55,755 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=53, PETRI_DIFFERENCE_MINUEND_FLOW=325, PETRI_DIFFERENCE_MINUEND_PLACES=65, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=55, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=8, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=45, PETRI_DIFFERENCE_SUBTRAHEND_STATES=7, PETRI_FLOW=419, PETRI_PLACES=76, PETRI_TRANSITIONS=60} [2023-11-28 23:55:55,756 INFO L281 CegarLoopForPetriNet]: 58 programPoint places, 18 predicate places. [2023-11-28 23:55:55,756 INFO L495 AbstractCegarLoop]: Abstraction has has 76 places, 60 transitions, 419 flow [2023-11-28 23:55:55,756 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 27.0) internal successors, (135), 5 states have internal predecessors, (135), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-28 23:55:55,756 INFO L200 CegarLoopForPetriNet]: Found error trace [2023-11-28 23:55:55,756 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-28 23:55:55,757 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable12 [2023-11-28 23:55:55,757 INFO L420 AbstractCegarLoop]: === Iteration 14 === Targeting ULTIMATE.startErr6ASSERT_VIOLATIONMEMORY_LEAK === [P0Err0ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 10 more)] === [2023-11-28 23:55:55,757 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-11-28 23:55:55,757 INFO L85 PathProgramCache]: Analyzing trace with hash 1041585269, now seen corresponding path program 1 times [2023-11-28 23:55:55,757 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-11-28 23:55:55,757 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [915661967] [2023-11-28 23:55:55,757 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-11-28 23:55:55,757 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-11-28 23:55:55,788 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-28 23:55:55,891 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-28 23:55:55,891 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-11-28 23:55:55,891 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [915661967] [2023-11-28 23:55:55,891 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [915661967] provided 1 perfect and 0 imperfect interpolant sequences [2023-11-28 23:55:55,891 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-11-28 23:55:55,892 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2023-11-28 23:55:55,892 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [561625826] [2023-11-28 23:55:55,892 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-11-28 23:55:55,892 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2023-11-28 23:55:55,893 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-11-28 23:55:55,893 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2023-11-28 23:55:55,893 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=8, Invalid=12, Unknown=0, NotChecked=0, Total=20 [2023-11-28 23:55:55,898 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 24 out of 53 [2023-11-28 23:55:55,898 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 76 places, 60 transitions, 419 flow. Second operand has 5 states, 5 states have (on average 26.8) internal successors, (134), 5 states have internal predecessors, (134), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-28 23:55:55,898 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2023-11-28 23:55:55,898 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 24 of 53 [2023-11-28 23:55:55,898 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2023-11-28 23:55:56,780 INFO L124 PetriNetUnfolderBase]: 4295/7182 cut-off events. [2023-11-28 23:55:56,780 INFO L125 PetriNetUnfolderBase]: For 8788/9120 co-relation queries the response was YES. [2023-11-28 23:55:56,797 INFO L83 FinitePrefix]: Finished finitePrefix Result has 19998 conditions, 7182 events. 4295/7182 cut-off events. For 8788/9120 co-relation queries the response was YES. Maximal size of possible extension queue 352. Compared 48087 event pairs, 576 based on Foata normal form. 512/7530 useless extension candidates. Maximal degree in co-relation 19965. Up to 2153 conditions per place. [2023-11-28 23:55:56,809 INFO L140 encePairwiseOnDemand]: 47/53 looper letters, 59 selfloop transitions, 8 changer transitions 3/99 dead transitions. [2023-11-28 23:55:56,809 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 80 places, 99 transitions, 702 flow [2023-11-28 23:55:56,809 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2023-11-28 23:55:56,810 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 5 states. [2023-11-28 23:55:56,810 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 185 transitions. [2023-11-28 23:55:56,811 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.6981132075471698 [2023-11-28 23:55:56,811 INFO L72 ComplementDD]: Start complementDD. Operand 5 states and 185 transitions. [2023-11-28 23:55:56,811 INFO L73 IsDeterministic]: Start isDeterministic. Operand 5 states and 185 transitions. [2023-11-28 23:55:56,811 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2023-11-28 23:55:56,811 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 5 states and 185 transitions. [2023-11-28 23:55:56,812 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 6 states, 5 states have (on average 37.0) internal successors, (185), 5 states have internal predecessors, (185), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-28 23:55:56,813 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 6 states, 6 states have (on average 53.0) internal successors, (318), 6 states have internal predecessors, (318), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-28 23:55:56,814 INFO L81 ComplementDD]: Finished complementDD. Result has 6 states, 6 states have (on average 53.0) internal successors, (318), 6 states have internal predecessors, (318), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-28 23:55:56,814 INFO L175 Difference]: Start difference. First operand has 76 places, 60 transitions, 419 flow. Second operand 5 states and 185 transitions. [2023-11-28 23:55:56,814 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 80 places, 99 transitions, 702 flow [2023-11-28 23:55:56,841 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 79 places, 99 transitions, 676 flow, removed 9 selfloop flow, removed 1 redundant places. [2023-11-28 23:55:56,843 INFO L231 Difference]: Finished difference. Result has 81 places, 61 transitions, 421 flow [2023-11-28 23:55:56,844 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=53, PETRI_DIFFERENCE_MINUEND_FLOW=393, PETRI_DIFFERENCE_MINUEND_PLACES=75, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=60, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=4, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=52, PETRI_DIFFERENCE_SUBTRAHEND_STATES=5, PETRI_FLOW=421, PETRI_PLACES=81, PETRI_TRANSITIONS=61} [2023-11-28 23:55:56,844 INFO L281 CegarLoopForPetriNet]: 58 programPoint places, 23 predicate places. [2023-11-28 23:55:56,845 INFO L495 AbstractCegarLoop]: Abstraction has has 81 places, 61 transitions, 421 flow [2023-11-28 23:55:56,845 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 26.8) internal successors, (134), 5 states have internal predecessors, (134), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-28 23:55:56,845 INFO L200 CegarLoopForPetriNet]: Found error trace [2023-11-28 23:55:56,845 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-28 23:55:56,845 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable13 [2023-11-28 23:55:56,845 INFO L420 AbstractCegarLoop]: === Iteration 15 === Targeting ULTIMATE.startErr6ASSERT_VIOLATIONMEMORY_LEAK === [P0Err0ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 10 more)] === [2023-11-28 23:55:56,846 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-11-28 23:55:56,846 INFO L85 PathProgramCache]: Analyzing trace with hash -1867777942, now seen corresponding path program 1 times [2023-11-28 23:55:56,846 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-11-28 23:55:56,846 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1794991543] [2023-11-28 23:55:56,847 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-11-28 23:55:56,847 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-11-28 23:55:56,900 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-28 23:55:57,106 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-28 23:55:57,106 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-11-28 23:55:57,106 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1794991543] [2023-11-28 23:55:57,107 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1794991543] provided 1 perfect and 0 imperfect interpolant sequences [2023-11-28 23:55:57,107 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-11-28 23:55:57,107 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2023-11-28 23:55:57,107 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [673380581] [2023-11-28 23:55:57,107 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-11-28 23:55:57,108 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2023-11-28 23:55:57,108 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-11-28 23:55:57,108 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2023-11-28 23:55:57,109 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=12, Invalid=18, Unknown=0, NotChecked=0, Total=30 [2023-11-28 23:55:57,118 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 24 out of 53 [2023-11-28 23:55:57,119 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 81 places, 61 transitions, 421 flow. Second operand has 6 states, 6 states have (on average 26.833333333333332) internal successors, (161), 6 states have internal predecessors, (161), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-28 23:55:57,119 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2023-11-28 23:55:57,119 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 24 of 53 [2023-11-28 23:55:57,119 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2023-11-28 23:55:57,853 INFO L124 PetriNetUnfolderBase]: 3363/5530 cut-off events. [2023-11-28 23:55:57,853 INFO L125 PetriNetUnfolderBase]: For 9814/10102 co-relation queries the response was YES. [2023-11-28 23:55:57,864 INFO L83 FinitePrefix]: Finished finitePrefix Result has 17295 conditions, 5530 events. 3363/5530 cut-off events. For 9814/10102 co-relation queries the response was YES. Maximal size of possible extension queue 338. Compared 35907 event pairs, 510 based on Foata normal form. 276/5642 useless extension candidates. Maximal degree in co-relation 17259. Up to 2012 conditions per place. [2023-11-28 23:55:57,868 INFO L140 encePairwiseOnDemand]: 47/53 looper letters, 49 selfloop transitions, 11 changer transitions 9/91 dead transitions. [2023-11-28 23:55:57,868 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 83 places, 91 transitions, 640 flow [2023-11-28 23:55:57,869 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2023-11-28 23:55:57,869 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 6 states. [2023-11-28 23:55:57,869 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6 states to 6 states and 206 transitions. [2023-11-28 23:55:57,870 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.6477987421383647 [2023-11-28 23:55:57,870 INFO L72 ComplementDD]: Start complementDD. Operand 6 states and 206 transitions. [2023-11-28 23:55:57,870 INFO L73 IsDeterministic]: Start isDeterministic. Operand 6 states and 206 transitions. [2023-11-28 23:55:57,870 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2023-11-28 23:55:57,870 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 6 states and 206 transitions. [2023-11-28 23:55:57,871 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 7 states, 6 states have (on average 34.333333333333336) internal successors, (206), 6 states have internal predecessors, (206), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-28 23:55:57,872 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 7 states, 7 states have (on average 53.0) internal successors, (371), 7 states have internal predecessors, (371), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-28 23:55:57,872 INFO L81 ComplementDD]: Finished complementDD. Result has 7 states, 7 states have (on average 53.0) internal successors, (371), 7 states have internal predecessors, (371), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-28 23:55:57,872 INFO L175 Difference]: Start difference. First operand has 81 places, 61 transitions, 421 flow. Second operand 6 states and 206 transitions. [2023-11-28 23:55:57,872 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 83 places, 91 transitions, 640 flow [2023-11-28 23:55:57,879 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 76 places, 91 transitions, 603 flow, removed 15 selfloop flow, removed 7 redundant places. [2023-11-28 23:55:57,880 INFO L231 Difference]: Finished difference. Result has 78 places, 54 transitions, 355 flow [2023-11-28 23:55:57,880 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=53, PETRI_DIFFERENCE_MINUEND_FLOW=373, PETRI_DIFFERENCE_MINUEND_PLACES=71, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=60, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=11, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=49, PETRI_DIFFERENCE_SUBTRAHEND_STATES=6, PETRI_FLOW=355, PETRI_PLACES=78, PETRI_TRANSITIONS=54} [2023-11-28 23:55:57,881 INFO L281 CegarLoopForPetriNet]: 58 programPoint places, 20 predicate places. [2023-11-28 23:55:57,881 INFO L495 AbstractCegarLoop]: Abstraction has has 78 places, 54 transitions, 355 flow [2023-11-28 23:55:57,881 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 26.833333333333332) internal successors, (161), 6 states have internal predecessors, (161), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-28 23:55:57,881 INFO L200 CegarLoopForPetriNet]: Found error trace [2023-11-28 23:55:57,881 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] [2023-11-28 23:55:57,881 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable14 [2023-11-28 23:55:57,881 INFO L420 AbstractCegarLoop]: === Iteration 16 === Targeting ULTIMATE.startErr6ASSERT_VIOLATIONMEMORY_LEAK === [P0Err0ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 10 more)] === [2023-11-28 23:55:57,882 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-11-28 23:55:57,882 INFO L85 PathProgramCache]: Analyzing trace with hash 1561410469, now seen corresponding path program 1 times [2023-11-28 23:55:57,882 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-11-28 23:55:57,882 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1387742494] [2023-11-28 23:55:57,882 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-11-28 23:55:57,882 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-11-28 23:55:57,916 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-28 23:55:58,547 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-28 23:55:58,547 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-11-28 23:55:58,548 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1387742494] [2023-11-28 23:55:58,548 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1387742494] provided 1 perfect and 0 imperfect interpolant sequences [2023-11-28 23:55:58,549 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-11-28 23:55:58,549 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2023-11-28 23:55:58,549 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [65769910] [2023-11-28 23:55:58,549 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-11-28 23:55:58,550 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 9 states [2023-11-28 23:55:58,550 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-11-28 23:55:58,550 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2023-11-28 23:55:58,551 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=16, Invalid=56, Unknown=0, NotChecked=0, Total=72 [2023-11-28 23:55:58,557 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 26 out of 53 [2023-11-28 23:55:58,558 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 78 places, 54 transitions, 355 flow. Second operand has 9 states, 9 states have (on average 27.88888888888889) internal successors, (251), 9 states have internal predecessors, (251), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-28 23:55:58,558 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2023-11-28 23:55:58,558 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 26 of 53 [2023-11-28 23:55:58,558 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2023-11-28 23:55:59,156 INFO L124 PetriNetUnfolderBase]: 1582/3197 cut-off events. [2023-11-28 23:55:59,156 INFO L125 PetriNetUnfolderBase]: For 5761/6260 co-relation queries the response was YES. [2023-11-28 23:55:59,165 INFO L83 FinitePrefix]: Finished finitePrefix Result has 9354 conditions, 3197 events. 1582/3197 cut-off events. For 5761/6260 co-relation queries the response was YES. Maximal size of possible extension queue 310. Compared 24540 event pairs, 462 based on Foata normal form. 81/2951 useless extension candidates. Maximal degree in co-relation 9321. Up to 942 conditions per place. [2023-11-28 23:55:59,167 INFO L140 encePairwiseOnDemand]: 44/53 looper letters, 31 selfloop transitions, 5 changer transitions 35/104 dead transitions. [2023-11-28 23:55:59,167 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 85 places, 104 transitions, 667 flow [2023-11-28 23:55:59,168 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2023-11-28 23:55:59,168 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 9 states. [2023-11-28 23:55:59,169 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 9 states to 9 states and 303 transitions. [2023-11-28 23:55:59,169 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.6352201257861635 [2023-11-28 23:55:59,169 INFO L72 ComplementDD]: Start complementDD. Operand 9 states and 303 transitions. [2023-11-28 23:55:59,169 INFO L73 IsDeterministic]: Start isDeterministic. Operand 9 states and 303 transitions. [2023-11-28 23:55:59,169 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2023-11-28 23:55:59,169 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 9 states and 303 transitions. [2023-11-28 23:55:59,170 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 10 states, 9 states have (on average 33.666666666666664) internal successors, (303), 9 states have internal predecessors, (303), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-28 23:55:59,171 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 10 states, 10 states have (on average 53.0) internal successors, (530), 10 states have internal predecessors, (530), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-28 23:55:59,171 INFO L81 ComplementDD]: Finished complementDD. Result has 10 states, 10 states have (on average 53.0) internal successors, (530), 10 states have internal predecessors, (530), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-28 23:55:59,172 INFO L175 Difference]: Start difference. First operand has 78 places, 54 transitions, 355 flow. Second operand 9 states and 303 transitions. [2023-11-28 23:55:59,172 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 85 places, 104 transitions, 667 flow [2023-11-28 23:55:59,204 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 71 places, 104 transitions, 551 flow, removed 26 selfloop flow, removed 14 redundant places. [2023-11-28 23:55:59,206 INFO L231 Difference]: Finished difference. Result has 77 places, 55 transitions, 294 flow [2023-11-28 23:55:59,206 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=53, PETRI_DIFFERENCE_MINUEND_FLOW=263, PETRI_DIFFERENCE_MINUEND_PLACES=63, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=54, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=4, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=49, PETRI_DIFFERENCE_SUBTRAHEND_STATES=9, PETRI_FLOW=294, PETRI_PLACES=77, PETRI_TRANSITIONS=55} [2023-11-28 23:55:59,206 INFO L281 CegarLoopForPetriNet]: 58 programPoint places, 19 predicate places. [2023-11-28 23:55:59,206 INFO L495 AbstractCegarLoop]: Abstraction has has 77 places, 55 transitions, 294 flow [2023-11-28 23:55:59,206 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 9 states, 9 states have (on average 27.88888888888889) internal successors, (251), 9 states have internal predecessors, (251), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-28 23:55:59,207 INFO L200 CegarLoopForPetriNet]: Found error trace [2023-11-28 23:55:59,207 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] [2023-11-28 23:55:59,207 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable15 [2023-11-28 23:55:59,207 INFO L420 AbstractCegarLoop]: === Iteration 17 === Targeting ULTIMATE.startErr6ASSERT_VIOLATIONMEMORY_LEAK === [P0Err0ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 10 more)] === [2023-11-28 23:55:59,207 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-11-28 23:55:59,207 INFO L85 PathProgramCache]: Analyzing trace with hash -898597727, now seen corresponding path program 2 times [2023-11-28 23:55:59,207 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-11-28 23:55:59,207 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [564248184] [2023-11-28 23:55:59,208 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-11-28 23:55:59,208 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-11-28 23:55:59,275 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2023-11-28 23:55:59,275 INFO L356 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2023-11-28 23:55:59,318 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2023-11-28 23:55:59,351 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2023-11-28 23:55:59,351 INFO L360 BasicCegarLoop]: Counterexample is feasible [2023-11-28 23:55:59,352 INFO L805 garLoopResultBuilder]: Registering result UNSAFE for location ULTIMATE.startErr6ASSERT_VIOLATIONMEMORY_LEAK (12 of 13 remaining) [2023-11-28 23:55:59,353 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location P0Err0ASSERT_VIOLATIONMEMORY_LEAK (11 of 13 remaining) [2023-11-28 23:55:59,354 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE (10 of 13 remaining) [2023-11-28 23:55:59,354 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE (9 of 13 remaining) [2023-11-28 23:55:59,354 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (8 of 13 remaining) [2023-11-28 23:55:59,354 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr3REQUIRES_VIOLATIONMEMORY_DEREFERENCE (7 of 13 remaining) [2023-11-28 23:55:59,354 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr4REQUIRES_VIOLATIONMEMORY_DEREFERENCE (6 of 13 remaining) [2023-11-28 23:55:59,355 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr5REQUIRES_VIOLATIONMEMORY_DEREFERENCE (5 of 13 remaining) [2023-11-28 23:55:59,355 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr7ASSERT_VIOLATIONMEMORY_LEAK (4 of 13 remaining) [2023-11-28 23:55:59,355 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (3 of 13 remaining) [2023-11-28 23:55:59,355 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (2 of 13 remaining) [2023-11-28 23:55:59,355 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr2INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (1 of 13 remaining) [2023-11-28 23:55:59,355 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location P0Err0ASSERT_VIOLATIONMEMORY_LEAK (0 of 13 remaining) [2023-11-28 23:55:59,356 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable16 [2023-11-28 23:55:59,356 INFO L445 BasicCegarLoop]: Path program histogram: [2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-11-28 23:55:59,362 INFO L228 ceAbstractionStarter]: Analysis of concurrent program completed with 1 thread instances [2023-11-28 23:55:59,362 INFO L178 ceAbstractionStarter]: Computing trace abstraction results [2023-11-28 23:55:59,409 WARN L1572 BoogieBacktranslator]: Unfinished Backtranslation: IdentifierExpression #t~pre5 could not be translated [2023-11-28 23:55:59,413 WARN L1572 BoogieBacktranslator]: Unfinished Backtranslation: IdentifierExpression #t~pre7 could not be translated [2023-11-28 23:55:59,413 WARN L1572 BoogieBacktranslator]: Unfinished Backtranslation: IdentifierExpression #t~pre9 could not be translated [2023-11-28 23:55:59,424 WARN L1572 BoogieBacktranslator]: Unfinished Backtranslation: unknown boogie variable #t~nondet0 [2023-11-28 23:55:59,425 WARN L1572 BoogieBacktranslator]: Unfinished Backtranslation: unknown boogie variable #t~nondet0 [2023-11-28 23:55:59,437 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 28.11 11:55:59 BasicIcfg [2023-11-28 23:55:59,437 INFO L131 PluginConnector]: ------------------------ END TraceAbstraction---------------------------- [2023-11-28 23:55:59,438 INFO L112 PluginConnector]: ------------------------Witness Printer---------------------------- [2023-11-28 23:55:59,438 INFO L270 PluginConnector]: Initializing Witness Printer... [2023-11-28 23:55:59,438 INFO L274 PluginConnector]: Witness Printer initialized [2023-11-28 23:55:59,438 INFO L184 PluginConnector]: Executing the observer RCFGCatcher from plugin Witness Printer for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 28.11 11:55:45" (3/4) ... [2023-11-28 23:55:59,440 INFO L140 WitnessPrinter]: No result that supports witness generation found [2023-11-28 23:55:59,441 INFO L131 PluginConnector]: ------------------------ END Witness Printer---------------------------- [2023-11-28 23:55:59,442 INFO L158 Benchmark]: Toolchain (without parser) took 15358.14ms. Allocated memory was 169.9MB in the beginning and 786.4MB in the end (delta: 616.6MB). Free memory was 131.0MB in the beginning and 537.0MB in the end (delta: -406.0MB). Peak memory consumption was 211.8MB. Max. memory is 16.1GB. [2023-11-28 23:55:59,442 INFO L158 Benchmark]: CDTParser took 0.14ms. Allocated memory is still 169.9MB. Free memory is still 142.5MB. There was no memory consumed. Max. memory is 16.1GB. [2023-11-28 23:55:59,442 INFO L158 Benchmark]: CACSL2BoogieTranslator took 488.26ms. Allocated memory is still 169.9MB. Free memory was 130.4MB in the beginning and 107.3MB in the end (delta: 23.1MB). Peak memory consumption was 23.1MB. Max. memory is 16.1GB. [2023-11-28 23:55:59,443 INFO L158 Benchmark]: Boogie Procedure Inliner took 50.12ms. Allocated memory is still 169.9MB. Free memory was 107.3MB in the beginning and 104.4MB in the end (delta: 3.0MB). Peak memory consumption was 4.2MB. Max. memory is 16.1GB. [2023-11-28 23:55:59,443 INFO L158 Benchmark]: Boogie Preprocessor took 55.26ms. Allocated memory is still 169.9MB. Free memory was 104.4MB in the beginning and 101.0MB in the end (delta: 3.3MB). Peak memory consumption was 2.1MB. Max. memory is 16.1GB. [2023-11-28 23:55:59,443 INFO L158 Benchmark]: RCFGBuilder took 721.52ms. Allocated memory is still 169.9MB. Free memory was 101.0MB in the beginning and 132.2MB in the end (delta: -31.2MB). Peak memory consumption was 51.5MB. Max. memory is 16.1GB. [2023-11-28 23:55:59,444 INFO L158 Benchmark]: TraceAbstraction took 14032.72ms. Allocated memory was 169.9MB in the beginning and 786.4MB in the end (delta: 616.6MB). Free memory was 131.3MB in the beginning and 537.0MB in the end (delta: -405.8MB). Peak memory consumption was 210.6MB. Max. memory is 16.1GB. [2023-11-28 23:55:59,444 INFO L158 Benchmark]: Witness Printer took 3.32ms. Allocated memory is still 786.4MB. Free memory is still 537.0MB. There was no memory consumed. Max. memory is 16.1GB. [2023-11-28 23:55:59,446 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.14ms. Allocated memory is still 169.9MB. Free memory is still 142.5MB. There was no memory consumed. Max. memory is 16.1GB. * CACSL2BoogieTranslator took 488.26ms. Allocated memory is still 169.9MB. Free memory was 130.4MB in the beginning and 107.3MB in the end (delta: 23.1MB). Peak memory consumption was 23.1MB. Max. memory is 16.1GB. * Boogie Procedure Inliner took 50.12ms. Allocated memory is still 169.9MB. Free memory was 107.3MB in the beginning and 104.4MB in the end (delta: 3.0MB). Peak memory consumption was 4.2MB. Max. memory is 16.1GB. * Boogie Preprocessor took 55.26ms. Allocated memory is still 169.9MB. Free memory was 104.4MB in the beginning and 101.0MB in the end (delta: 3.3MB). Peak memory consumption was 2.1MB. Max. memory is 16.1GB. * RCFGBuilder took 721.52ms. Allocated memory is still 169.9MB. Free memory was 101.0MB in the beginning and 132.2MB in the end (delta: -31.2MB). Peak memory consumption was 51.5MB. Max. memory is 16.1GB. * TraceAbstraction took 14032.72ms. Allocated memory was 169.9MB in the beginning and 786.4MB in the end (delta: 616.6MB). Free memory was 131.3MB in the beginning and 537.0MB in the end (delta: -405.8MB). Peak memory consumption was 210.6MB. Max. memory is 16.1GB. * Witness Printer took 3.32ms. Allocated memory is still 786.4MB. Free memory is still 537.0MB. There was no memory consumed. Max. memory is 16.1GB. * Results from de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator: - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: IdentifierExpression #t~pre5 could not be translated - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: IdentifierExpression #t~pre7 could not be translated - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: IdentifierExpression #t~pre9 could not be translated - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: unknown boogie variable #t~nondet0 - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: unknown boogie variable #t~nondet0 - GenericResult: Unfinished Backtranslation The program execution was not completely translated back. * Results from de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: - UnprovableResult [Line: 17]: Unable to prove that all allocated memory was freed Unable to prove that all allocated memory was freed Reason: overapproximation of memtrack at line 17. Possible FailurePath: [L709] 0 int __unbuffered_cnt = 0; [L711] 0 int __unbuffered_p2_EAX = 0; [L712] 0 _Bool main$tmp_guard0; [L713] 0 _Bool main$tmp_guard1; [L715] 0 int x = 0; [L717] 0 int y = 0; [L719] 0 int z = 0; [L720] 0 _Bool z$flush_delayed; [L721] 0 int z$mem_tmp; [L722] 0 _Bool z$r_buff0_thd0; [L723] 0 _Bool z$r_buff0_thd1; [L724] 0 _Bool z$r_buff0_thd2; [L725] 0 _Bool z$r_buff0_thd3; [L726] 0 _Bool z$r_buff1_thd0; [L727] 0 _Bool z$r_buff1_thd1; [L728] 0 _Bool z$r_buff1_thd2; [L729] 0 _Bool z$r_buff1_thd3; [L730] 0 _Bool z$read_delayed; [L731] 0 int *z$read_delayed_var; [L732] 0 int z$w_buff0; [L733] 0 _Bool z$w_buff0_used; [L734] 0 int z$w_buff1; [L735] 0 _Bool z$w_buff1_used; [L736] 0 _Bool weak$$choice0; [L737] 0 _Bool weak$$choice2; [L831] 0 pthread_t t1489; [L832] FCALL, FORK 0 pthread_create(&t1489, ((void *)0), P0, ((void *)0)) VAL [__unbuffered_cnt=0, __unbuffered_p2_EAX=0, main$tmp_guard0=0, main$tmp_guard1=0, t1489={5:0}, weak$$choice0=0, weak$$choice2=0, x=0, y=0, z$flush_delayed=0, z$mem_tmp=0, z$r_buff0_thd0=0, z$r_buff0_thd1=0, z$r_buff0_thd2=0, z$r_buff0_thd3=0, z$r_buff1_thd0=0, z$r_buff1_thd1=0, z$r_buff1_thd2=0, z$r_buff1_thd3=0, z$read_delayed=0, z$read_delayed_var={0:0}, z$w_buff0=0, z$w_buff0_used=0, z$w_buff1=0, z$w_buff1_used=0, z=0] [L833] 0 pthread_t t1490; [L834] FCALL, FORK 0 pthread_create(&t1490, ((void *)0), P1, ((void *)0)) VAL [__unbuffered_cnt=0, __unbuffered_p2_EAX=0, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, t1489={5:0}, t1490={6:0}, weak$$choice0=0, weak$$choice2=0, x=0, y=0, z$flush_delayed=0, z$mem_tmp=0, z$r_buff0_thd0=0, z$r_buff0_thd1=0, z$r_buff0_thd2=0, z$r_buff0_thd3=0, z$r_buff1_thd0=0, z$r_buff1_thd1=0, z$r_buff1_thd2=0, z$r_buff1_thd3=0, z$read_delayed=0, z$read_delayed_var={0:0}, z$w_buff0=0, z$w_buff0_used=0, z$w_buff1=0, z$w_buff1_used=0, z=0] [L835] 0 pthread_t t1491; [L836] FCALL, FORK 0 pthread_create(&t1491, ((void *)0), P2, ((void *)0)) VAL [__unbuffered_cnt=0, __unbuffered_p2_EAX=0, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, t1489={5:0}, t1490={6:0}, t1491={3:0}, weak$$choice0=0, weak$$choice2=0, x=0, y=0, z$flush_delayed=0, z$mem_tmp=0, z$r_buff0_thd0=0, z$r_buff0_thd1=0, z$r_buff0_thd2=0, z$r_buff0_thd3=0, z$r_buff1_thd0=0, z$r_buff1_thd1=0, z$r_buff1_thd2=0, z$r_buff1_thd3=0, z$read_delayed=0, z$read_delayed_var={0:0}, z$w_buff0=0, z$w_buff0_used=0, z$w_buff1=0, z$w_buff1_used=0, z=0] [L741] 1 z$w_buff1 = z$w_buff0 [L742] 1 z$w_buff0 = 1 [L743] 1 z$w_buff1_used = z$w_buff0_used [L744] 1 z$w_buff0_used = (_Bool)1 [L745] CALL 1 __VERIFIER_assert(!(z$w_buff1_used && z$w_buff0_used)) [L18] COND FALSE 1 !(!expression) [L745] RET 1 __VERIFIER_assert(!(z$w_buff1_used && z$w_buff0_used)) [L746] 1 z$r_buff1_thd0 = z$r_buff0_thd0 [L747] 1 z$r_buff1_thd1 = z$r_buff0_thd1 [L748] 1 z$r_buff1_thd2 = z$r_buff0_thd2 [L749] 1 z$r_buff1_thd3 = z$r_buff0_thd3 [L750] 1 z$r_buff0_thd1 = (_Bool)1 VAL [__unbuffered_cnt=0, __unbuffered_p2_EAX=0, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=0, x=0, y=0, z$flush_delayed=0, z$mem_tmp=0, z$r_buff0_thd0=0, z$r_buff0_thd1=1, z$r_buff0_thd2=0, z$r_buff0_thd3=0, z$r_buff1_thd0=0, z$r_buff1_thd1=0, z$r_buff1_thd2=0, z$r_buff1_thd3=0, z$read_delayed=0, z$read_delayed_var={0:0}, z$w_buff0=1, z$w_buff0_used=1, z$w_buff1=0, z$w_buff1_used=0, z=0] [L753] 1 x = 1 VAL [__unbuffered_cnt=0, __unbuffered_p2_EAX=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=0, z$flush_delayed=0, z$mem_tmp=0, z$r_buff0_thd0=0, z$r_buff0_thd1=1, z$r_buff0_thd2=0, z$r_buff0_thd3=0, z$r_buff1_thd0=0, z$r_buff1_thd1=0, z$r_buff1_thd2=0, z$r_buff1_thd3=0, z$read_delayed=0, z$read_delayed_var={0:0}, z$w_buff0=1, z$w_buff0_used=1, z$w_buff1=0, z$w_buff1_used=0, z=0] [L770] 2 x = 2 VAL [__unbuffered_cnt=0, __unbuffered_p2_EAX=0, arg={0:0}, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=0, x=2, y=0, z$flush_delayed=0, z$mem_tmp=0, z$r_buff0_thd0=0, z$r_buff0_thd1=1, z$r_buff0_thd2=0, z$r_buff0_thd3=0, z$r_buff1_thd0=0, z$r_buff1_thd1=0, z$r_buff1_thd2=0, z$r_buff1_thd3=0, z$read_delayed=0, z$read_delayed_var={0:0}, z$w_buff0=1, z$w_buff0_used=1, z$w_buff1=0, z$w_buff1_used=0, z=0] [L773] 2 y = 1 VAL [__unbuffered_cnt=0, __unbuffered_p2_EAX=0, arg={0:0}, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=0, x=2, y=1, z$flush_delayed=0, z$mem_tmp=0, z$r_buff0_thd0=0, z$r_buff0_thd1=1, z$r_buff0_thd2=0, z$r_buff0_thd3=0, z$r_buff1_thd0=0, z$r_buff1_thd1=0, z$r_buff1_thd2=0, z$r_buff1_thd3=0, z$read_delayed=0, z$read_delayed_var={0:0}, z$w_buff0=1, z$w_buff0_used=1, z$w_buff1=0, z$w_buff1_used=0, z=0] [L776] 2 z = z$w_buff0_used && z$r_buff0_thd2 ? z$w_buff0 : (z$w_buff1_used && z$r_buff1_thd2 ? z$w_buff1 : z) [L777] 2 z$w_buff0_used = z$w_buff0_used && z$r_buff0_thd2 ? (_Bool)0 : z$w_buff0_used [L778] 2 z$w_buff1_used = z$w_buff0_used && z$r_buff0_thd2 || z$w_buff1_used && z$r_buff1_thd2 ? (_Bool)0 : z$w_buff1_used [L779] 2 z$r_buff0_thd2 = z$w_buff0_used && z$r_buff0_thd2 ? (_Bool)0 : z$r_buff0_thd2 [L780] 2 z$r_buff1_thd2 = z$w_buff0_used && z$r_buff0_thd2 || z$w_buff1_used && z$r_buff1_thd2 ? (_Bool)0 : z$r_buff1_thd2 VAL [__unbuffered_cnt=0, __unbuffered_p2_EAX=0, arg={0:0}, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=0, x=2, y=1, z$flush_delayed=0, z$mem_tmp=0, z$r_buff0_thd0=0, z$r_buff0_thd1=1, z$r_buff0_thd2=0, z$r_buff0_thd3=0, z$r_buff1_thd0=0, z$r_buff1_thd1=0, z$r_buff1_thd2=0, z$r_buff1_thd3=0, z$read_delayed=0, z$read_delayed_var={0:0}, z$w_buff0=1, z$w_buff0_used=1, z$w_buff1=0, z$w_buff1_used=0, z=0] [L790] 3 y = 2 VAL [__unbuffered_cnt=0, __unbuffered_p2_EAX=0, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=0, x=2, y=2, z$flush_delayed=0, z$mem_tmp=0, z$r_buff0_thd0=0, z$r_buff0_thd1=1, z$r_buff0_thd2=0, z$r_buff0_thd3=0, z$r_buff1_thd0=0, z$r_buff1_thd1=0, z$r_buff1_thd2=0, z$r_buff1_thd3=0, z$read_delayed=0, z$read_delayed_var={0:0}, z$w_buff0=1, z$w_buff0_used=1, z$w_buff1=0, z$w_buff1_used=0, z=0] [L793] 3 weak$$choice0 = __VERIFIER_nondet_bool() [L794] 3 weak$$choice2 = __VERIFIER_nondet_bool() [L795] 3 z$flush_delayed = weak$$choice2 [L796] 3 z$mem_tmp = z [L797] 3 z = !z$w_buff0_used || !z$r_buff0_thd3 && !z$w_buff1_used || !z$r_buff0_thd3 && !z$r_buff1_thd3 ? z : (z$w_buff0_used && z$r_buff0_thd3 ? z$w_buff0 : z$w_buff1) [L798] 3 z$w_buff0 = weak$$choice2 ? z$w_buff0 : (!z$w_buff0_used || !z$r_buff0_thd3 && !z$w_buff1_used || !z$r_buff0_thd3 && !z$r_buff1_thd3 ? z$w_buff0 : (z$w_buff0_used && z$r_buff0_thd3 ? z$w_buff0 : z$w_buff0)) [L799] 3 z$w_buff1 = weak$$choice2 ? z$w_buff1 : (!z$w_buff0_used || !z$r_buff0_thd3 && !z$w_buff1_used || !z$r_buff0_thd3 && !z$r_buff1_thd3 ? z$w_buff1 : (z$w_buff0_used && z$r_buff0_thd3 ? z$w_buff1 : z$w_buff1)) [L800] 3 z$w_buff0_used = weak$$choice2 ? z$w_buff0_used : (!z$w_buff0_used || !z$r_buff0_thd3 && !z$w_buff1_used || !z$r_buff0_thd3 && !z$r_buff1_thd3 ? z$w_buff0_used : (z$w_buff0_used && z$r_buff0_thd3 ? (_Bool)0 : z$w_buff0_used)) [L801] 3 z$w_buff1_used = weak$$choice2 ? z$w_buff1_used : (!z$w_buff0_used || !z$r_buff0_thd3 && !z$w_buff1_used || !z$r_buff0_thd3 && !z$r_buff1_thd3 ? z$w_buff1_used : (z$w_buff0_used && z$r_buff0_thd3 ? (_Bool)0 : (_Bool)0)) [L802] 3 z$r_buff0_thd3 = weak$$choice2 ? z$r_buff0_thd3 : (!z$w_buff0_used || !z$r_buff0_thd3 && !z$w_buff1_used || !z$r_buff0_thd3 && !z$r_buff1_thd3 ? z$r_buff0_thd3 : (z$w_buff0_used && z$r_buff0_thd3 ? (_Bool)0 : z$r_buff0_thd3)) [L803] 3 z$r_buff1_thd3 = weak$$choice2 ? z$r_buff1_thd3 : (!z$w_buff0_used || !z$r_buff0_thd3 && !z$w_buff1_used || !z$r_buff0_thd3 && !z$r_buff1_thd3 ? z$r_buff1_thd3 : (z$w_buff0_used && z$r_buff0_thd3 ? (_Bool)0 : (_Bool)0)) [L804] 3 __unbuffered_p2_EAX = z [L805] 3 z = z$flush_delayed ? z$mem_tmp : z [L806] 3 z$flush_delayed = (_Bool)0 VAL [__unbuffered_cnt=0, __unbuffered_p2_EAX=0, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice2=0, x=2, y=2, z$flush_delayed=0, z$mem_tmp=0, z$r_buff0_thd0=0, z$r_buff0_thd1=1, z$r_buff0_thd2=0, z$r_buff0_thd3=0, z$r_buff1_thd0=0, z$r_buff1_thd1=0, z$r_buff1_thd2=0, z$r_buff1_thd3=0, z$read_delayed=0, z$read_delayed_var={0:0}, z$w_buff0=1, z$w_buff0_used=1, z$w_buff1=0, z$w_buff1_used=0, z=0] [L809] 3 z = z$w_buff0_used && z$r_buff0_thd3 ? z$w_buff0 : (z$w_buff1_used && z$r_buff1_thd3 ? z$w_buff1 : z) [L810] 3 z$w_buff0_used = z$w_buff0_used && z$r_buff0_thd3 ? (_Bool)0 : z$w_buff0_used [L811] 3 z$w_buff1_used = z$w_buff0_used && z$r_buff0_thd3 || z$w_buff1_used && z$r_buff1_thd3 ? (_Bool)0 : z$w_buff1_used [L812] 3 z$r_buff0_thd3 = z$w_buff0_used && z$r_buff0_thd3 ? (_Bool)0 : z$r_buff0_thd3 [L813] 3 z$r_buff1_thd3 = z$w_buff0_used && z$r_buff0_thd3 || z$w_buff1_used && z$r_buff1_thd3 ? (_Bool)0 : z$r_buff1_thd3 VAL [__unbuffered_cnt=0, __unbuffered_p2_EAX=0, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice2=0, x=2, y=2, z$flush_delayed=0, z$mem_tmp=0, z$r_buff0_thd0=0, z$r_buff0_thd1=1, z$r_buff0_thd2=0, z$r_buff0_thd3=0, z$r_buff1_thd0=0, z$r_buff1_thd1=0, z$r_buff1_thd2=0, z$r_buff1_thd3=0, z$read_delayed=0, z$read_delayed_var={0:0}, z$w_buff0=1, z$w_buff0_used=1, z$w_buff1=0, z$w_buff1_used=0, z=0] [L756] 1 z = z$w_buff0_used && z$r_buff0_thd1 ? z$w_buff0 : (z$w_buff1_used && z$r_buff1_thd1 ? z$w_buff1 : z) [L757] 1 z$w_buff0_used = z$w_buff0_used && z$r_buff0_thd1 ? (_Bool)0 : z$w_buff0_used [L758] 1 z$w_buff1_used = z$w_buff0_used && z$r_buff0_thd1 || z$w_buff1_used && z$r_buff1_thd1 ? (_Bool)0 : z$w_buff1_used [L759] 1 z$r_buff0_thd1 = z$w_buff0_used && z$r_buff0_thd1 ? (_Bool)0 : z$r_buff0_thd1 [L760] 1 z$r_buff1_thd1 = z$w_buff0_used && z$r_buff0_thd1 || z$w_buff1_used && z$r_buff1_thd1 ? (_Bool)0 : z$r_buff1_thd1 VAL [__unbuffered_cnt=0, __unbuffered_p2_EAX=0, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice2=0, x=2, y=2, z$flush_delayed=0, z$mem_tmp=0, z$r_buff0_thd0=0, z$r_buff0_thd1=1, z$r_buff0_thd2=0, z$r_buff0_thd3=0, z$r_buff1_thd0=0, z$r_buff1_thd1=0, z$r_buff1_thd2=0, z$r_buff1_thd3=0, z$read_delayed=0, z$read_delayed_var={0:0}, z$w_buff0=1, z$w_buff0_used=0, z$w_buff1=0, z$w_buff1_used=0, z=1] [L763] 1 __unbuffered_cnt = __unbuffered_cnt + 1 VAL [__unbuffered_cnt=1, __unbuffered_p2_EAX=0, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice2=0, x=2, y=2, z$flush_delayed=0, z$mem_tmp=0, z$r_buff0_thd0=0, z$r_buff0_thd1=1, z$r_buff0_thd2=0, z$r_buff0_thd3=0, z$r_buff1_thd0=0, z$r_buff1_thd1=0, z$r_buff1_thd2=0, z$r_buff1_thd3=0, z$read_delayed=0, z$read_delayed_var={0:0}, z$w_buff0=1, z$w_buff0_used=0, z$w_buff1=0, z$w_buff1_used=0, z=1] [L783] 2 __unbuffered_cnt = __unbuffered_cnt + 1 VAL [__unbuffered_cnt=2, __unbuffered_p2_EAX=0, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice2=0, x=2, y=2, z$flush_delayed=0, z$mem_tmp=0, z$r_buff0_thd0=0, z$r_buff0_thd1=1, z$r_buff0_thd2=0, z$r_buff0_thd3=0, z$r_buff1_thd0=0, z$r_buff1_thd1=0, z$r_buff1_thd2=0, z$r_buff1_thd3=0, z$read_delayed=0, z$read_delayed_var={0:0}, z$w_buff0=1, z$w_buff0_used=0, z$w_buff1=0, z$w_buff1_used=0, z=1] [L816] 3 __unbuffered_cnt = __unbuffered_cnt + 1 VAL [__unbuffered_cnt=3, __unbuffered_p2_EAX=0, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice2=0, x=2, y=2, z$flush_delayed=0, z$mem_tmp=0, z$r_buff0_thd0=0, z$r_buff0_thd1=1, z$r_buff0_thd2=0, z$r_buff0_thd3=0, z$r_buff1_thd0=0, z$r_buff1_thd1=0, z$r_buff1_thd2=0, z$r_buff1_thd3=0, z$read_delayed=0, z$read_delayed_var={0:0}, z$w_buff0=1, z$w_buff0_used=0, z$w_buff1=0, z$w_buff1_used=0, z=1] [L838] 0 main$tmp_guard0 = __unbuffered_cnt == 3 VAL [__unbuffered_cnt=3, __unbuffered_p2_EAX=0, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, main$tmp_guard0=1, main$tmp_guard1=0, t1489={5:0}, t1490={6:0}, t1491={3:0}, weak$$choice2=0, x=2, y=2, z$flush_delayed=0, z$mem_tmp=0, z$r_buff0_thd0=0, z$r_buff0_thd1=1, z$r_buff0_thd2=0, z$r_buff0_thd3=0, z$r_buff1_thd0=0, z$r_buff1_thd1=0, z$r_buff1_thd2=0, z$r_buff1_thd3=0, z$read_delayed=0, z$read_delayed_var={0:0}, z$w_buff0=1, z$w_buff0_used=0, z$w_buff1=0, z$w_buff1_used=0, z=1] [L840] CALL 0 assume_abort_if_not(main$tmp_guard0) [L3] COND FALSE 0 !(!cond) [L840] RET 0 assume_abort_if_not(main$tmp_guard0) [L842] 0 z = z$w_buff0_used && z$r_buff0_thd0 ? z$w_buff0 : (z$w_buff1_used && z$r_buff1_thd0 ? z$w_buff1 : z) [L843] 0 z$w_buff0_used = z$w_buff0_used && z$r_buff0_thd0 ? (_Bool)0 : z$w_buff0_used [L844] 0 z$w_buff1_used = z$w_buff0_used && z$r_buff0_thd0 || z$w_buff1_used && z$r_buff1_thd0 ? (_Bool)0 : z$w_buff1_used [L845] 0 z$r_buff0_thd0 = z$w_buff0_used && z$r_buff0_thd0 ? (_Bool)0 : z$r_buff0_thd0 [L846] 0 z$r_buff1_thd0 = z$w_buff0_used && z$r_buff0_thd0 || z$w_buff1_used && z$r_buff1_thd0 ? (_Bool)0 : z$r_buff1_thd0 VAL [__unbuffered_cnt=3, __unbuffered_p2_EAX=0, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, main$tmp_guard0=1, main$tmp_guard1=0, t1489={5:0}, t1490={6:0}, t1491={3:0}, weak$$choice2=0, x=2, y=2, z$flush_delayed=0, z$mem_tmp=0, z$r_buff0_thd0=0, z$r_buff0_thd1=1, z$r_buff0_thd2=0, z$r_buff0_thd3=0, z$r_buff1_thd0=0, z$r_buff1_thd1=0, z$r_buff1_thd2=0, z$r_buff1_thd3=0, z$read_delayed=0, z$read_delayed_var={0:0}, z$w_buff0=1, z$w_buff0_used=0, z$w_buff1=0, z$w_buff1_used=0, z=1] [L849] 0 main$tmp_guard1 = !(x == 2 && y == 2 && __unbuffered_p2_EAX == 0) VAL [__unbuffered_cnt=3, __unbuffered_p2_EAX=0, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, main$tmp_guard0=1, main$tmp_guard1=0, t1489={5:0}, t1490={6:0}, t1491={3:0}, weak$$choice2=0, x=2, y=2, z$flush_delayed=0, z$mem_tmp=0, z$r_buff0_thd0=0, z$r_buff0_thd1=1, z$r_buff0_thd2=0, z$r_buff0_thd3=0, z$r_buff1_thd0=0, z$r_buff1_thd1=0, z$r_buff1_thd2=0, z$r_buff1_thd3=0, z$read_delayed=0, z$read_delayed_var={0:0}, z$w_buff0=1, z$w_buff0_used=0, z$w_buff1=0, z$w_buff1_used=0, z=1] [L851] CALL 0 __VERIFIER_assert(main$tmp_guard1) [L18] COND TRUE 0 !expression [L18] CALL 0 reach_error() [L17] COND FALSE 0 !(0) VAL [__unbuffered_cnt=3, __unbuffered_p2_EAX=0, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, main$tmp_guard0=1, main$tmp_guard1=0, weak$$choice2=0, x=2, y=2, z$flush_delayed=0, z$mem_tmp=0, z$r_buff0_thd0=0, z$r_buff0_thd1=1, z$r_buff0_thd2=0, z$r_buff0_thd3=0, z$r_buff1_thd0=0, z$r_buff1_thd1=0, z$r_buff1_thd2=0, z$r_buff1_thd3=0, z$read_delayed=0, z$read_delayed_var={0:0}, z$w_buff0=1, z$w_buff0_used=0, z$w_buff1=0, z$w_buff1_used=0, z=1] [L17] 0 __assert_fail ("0", "mix056_power.oepc_pso.oepc_rmo.oepc.c", 8, __extension__ __PRETTY_FUNCTION__) VAL [__unbuffered_cnt=3, __unbuffered_p2_EAX=0, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, main$tmp_guard0=1, main$tmp_guard1=0, weak$$choice2=0, x=2, y=2, z$flush_delayed=0, z$mem_tmp=0, z$r_buff0_thd0=0, z$r_buff0_thd1=1, z$r_buff0_thd2=0, z$r_buff0_thd3=0, z$r_buff1_thd0=0, z$r_buff1_thd1=0, z$r_buff1_thd2=0, z$r_buff1_thd3=0, z$read_delayed=0, z$read_delayed_var={0:0}, z$w_buff0=1, z$w_buff0_used=0, z$w_buff1=0, z$w_buff1_used=0, z=1] - UnprovableResult [Line: 17]: Unable to prove that all allocated memory was freed Unable to prove that all allocated memory was freed Reason: Not analyzed. - UnprovableResult [Line: -1]: Unable to prove that pointer dereference always succeeds Unable to prove that pointer dereference always succeeds Reason: Not analyzed. - UnprovableResult [Line: -1]: Unable to prove that pointer dereference always succeeds Unable to prove that pointer dereference always succeeds Reason: Not analyzed. - UnprovableResult [Line: -1]: Unable to prove that pointer dereference always succeeds Unable to prove that pointer dereference always succeeds Reason: Not analyzed. - UnprovableResult [Line: -1]: Unable to prove that pointer dereference always succeeds Unable to prove that pointer dereference always succeeds Reason: Not analyzed. - UnprovableResult [Line: -1]: Unable to prove that pointer dereference always succeeds Unable to prove that pointer dereference always succeeds Reason: Not analyzed. - UnprovableResult [Line: -1]: Unable to prove that pointer dereference always succeeds Unable to prove that pointer dereference always succeeds Reason: Not analyzed. - UnprovableResult [Line: 829]: Unable to prove that all allocated memory was freed Unable to prove that all allocated memory was freed Reason: Not analyzed. - UnprovableResult [Line: 832]: 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: 836]: 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: 834]: 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, 77 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: 13.8s, OverallIterations: 17, TraceHistogramMax: 1, PathProgramHistogramMax: 2, EmptinessCheckTime: 0.0s, AutomataDifference: 10.6s, DeadEndRemovalTime: 0.0s, HoareAnnotationTime: 0.0s, InitialAbstractionConstructionTime: 0.0s, HoareTripleCheckerStatistics: 0 mSolverCounterUnknown, 793 SdHoareTripleChecker+Valid, 2.2s IncrementalHoareTripleChecker+Time, 0 mSdLazyCounter, 681 mSDsluCounter, 170 SdHoareTripleChecker+Invalid, 1.9s Time, 0 mProtectedAction, 0 SdHoareTripleChecker+Unchecked, 0 IncrementalHoareTripleChecker+Unchecked, 111 mSDsCounter, 52 IncrementalHoareTripleChecker+Valid, 0 mProtectedPredicate, 1845 IncrementalHoareTripleChecker+Invalid, 1897 SdHoareTripleChecker+Unknown, 0 mSolverCounterNotChecked, 52 mSolverCounterUnsat, 59 mSDtfsCounter, 1845 mSolverCounterSat, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Unknown, PredicateUnifierStatistics: 0 DeclaredPredicates, 82 GetRequests, 14 SyntacticMatches, 0 SemanticMatches, 68 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 41 ImplicationChecksByTransitivity, 0.5s Time, 0.0s BasicInterpolantAutomatonTime, BiggestAbstraction: size=421occurred in iteration=14, InterpolantAutomatonStates: 87, traceCheckStatistics: No data available, InterpolantConsolidationStatistics: No data available, PathInvariantsStatistics: No data available, 0/0 InterpolantCoveringCapability, TotalInterpolationStatistics: No data available, 0.0s DumpTime, AutomataMinimizationStatistics: No data available, HoareAnnotationStatistics: No data available, RefinementEngineStatistics: TRACE_CHECK: 0.0s SsaConstructionTime, 0.3s SatisfiabilityAnalysisTime, 2.5s InterpolantComputationTime, 277 NumberOfCodeBlocks, 277 NumberOfCodeBlocksAsserted, 17 NumberOfCheckSat, 228 ConstructedInterpolants, 0 QuantifiedInterpolants, 1379 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-28 23:55:59,467 INFO L540 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_2b2f975c-1851-4624-a769-b2c770989b69/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-1.11.0-openjdk-amd64/bin/java -Dosgi.configuration.area=/tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_2b2f975c-1851-4624-a769-b2c770989b69/bin/uautomizer-verify-BQ2R08f2Ya/data/config -Xmx15G -Xms4m -jar /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_2b2f975c-1851-4624-a769-b2c770989b69/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_2b2f975c-1851-4624-a769-b2c770989b69/bin/uautomizer-verify-BQ2R08f2Ya/data -tc /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_2b2f975c-1851-4624-a769-b2c770989b69/bin/uautomizer-verify-BQ2R08f2Ya/config/AutomizerMemDerefMemtrack.xml -i ../../sv-benchmarks/c/pthread-wmm/mix056_power.oepc_pso.oepc_rmo.oepc.i -s /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_2b2f975c-1851-4624-a769-b2c770989b69/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_2b2f975c-1851-4624-a769-b2c770989b69/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 40cdaf120a3550cc54773a608bdbc3a68dee1334013ab0b4984b9366bf820a3d --- Real Ultimate output --- This is Ultimate 0.2.4-dev-0e0057c [2023-11-28 23:56:01,383 INFO L188 SettingsManager]: Resetting all preferences to default values... [2023-11-28 23:56:01,451 INFO L114 SettingsManager]: Loading settings from /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_2b2f975c-1851-4624-a769-b2c770989b69/bin/uautomizer-verify-BQ2R08f2Ya/config/svcomp-DerefFreeMemtrack-32bit-Automizer_Bitvector.epf [2023-11-28 23:56:01,457 WARN L101 SettingsManager]: Preference file contains the following unknown settings: [2023-11-28 23:56:01,463 WARN L103 SettingsManager]: * de.uni_freiburg.informatik.ultimate.core.Log level for class [2023-11-28 23:56:01,490 INFO L130 SettingsManager]: Preferences different from defaults after loading the file: [2023-11-28 23:56:01,491 INFO L151 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2023-11-28 23:56:01,492 INFO L153 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2023-11-28 23:56:01,493 INFO L151 SettingsManager]: Preferences of Boogie Preprocessor differ from their defaults: [2023-11-28 23:56:01,493 INFO L153 SettingsManager]: * Use memory slicer=true [2023-11-28 23:56:01,494 INFO L151 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2023-11-28 23:56:01,494 INFO L153 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2023-11-28 23:56:01,495 INFO L151 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2023-11-28 23:56:01,496 INFO L153 SettingsManager]: * Create parallel compositions if possible=false [2023-11-28 23:56:01,496 INFO L153 SettingsManager]: * Use SBE=true [2023-11-28 23:56:01,497 INFO L151 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2023-11-28 23:56:01,497 INFO L153 SettingsManager]: * sizeof long=4 [2023-11-28 23:56:01,498 INFO L153 SettingsManager]: * Overapproximate operations on floating types=true [2023-11-28 23:56:01,498 INFO L153 SettingsManager]: * sizeof POINTER=4 [2023-11-28 23:56:01,499 INFO L153 SettingsManager]: * Check division by zero=IGNORE [2023-11-28 23:56:01,499 INFO L153 SettingsManager]: * Check for the main procedure if all allocated memory was freed=true [2023-11-28 23:56:01,500 INFO L153 SettingsManager]: * Bitprecise bitfields=true [2023-11-28 23:56:01,500 INFO L153 SettingsManager]: * SV-COMP memtrack compatibility mode=true [2023-11-28 23:56:01,501 INFO L153 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2023-11-28 23:56:01,501 INFO L153 SettingsManager]: * Adapt memory model on pointer casts if necessary=true [2023-11-28 23:56:01,501 INFO L153 SettingsManager]: * Use bitvectors instead of ints=true [2023-11-28 23:56:01,502 INFO L153 SettingsManager]: * Memory model=HoenickeLindenmann_4ByteResolution [2023-11-28 23:56:01,502 INFO L153 SettingsManager]: * Check unreachability of reach_error function=false [2023-11-28 23:56:01,502 INFO L153 SettingsManager]: * sizeof long double=12 [2023-11-28 23:56:01,503 INFO L153 SettingsManager]: * Use constant arrays=true [2023-11-28 23:56:01,503 INFO L151 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2023-11-28 23:56:01,504 INFO L153 SettingsManager]: * Size of a code block=SequenceOfStatements [2023-11-28 23:56:01,504 INFO L153 SettingsManager]: * Only consider context switches at boundaries of atomic blocks=true [2023-11-28 23:56:01,504 INFO L153 SettingsManager]: * SMT solver=External_DefaultMode [2023-11-28 23:56:01,505 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2023-11-28 23:56:01,505 INFO L151 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2023-11-28 23:56:01,505 INFO L153 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2023-11-28 23:56:01,505 INFO L153 SettingsManager]: * Trace refinement strategy=WOLF [2023-11-28 23:56:01,506 INFO L153 SettingsManager]: * Command for external solver=cvc4 --incremental --print-success --lang smt [2023-11-28 23:56:01,506 INFO L153 SettingsManager]: * Apply one-shot large block encoding in concurrent analysis=false [2023-11-28 23:56:01,506 INFO L153 SettingsManager]: * Automaton type used in concurrency analysis=PETRI_NET [2023-11-28 23:56:01,506 INFO L153 SettingsManager]: * Order on configurations for Petri net unfoldings=DBO [2023-11-28 23:56:01,507 INFO L153 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2023-11-28 23:56:01,507 INFO L153 SettingsManager]: * Logic for external solver=AUFBV [2023-11-28 23:56:01,507 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_2b2f975c-1851-4624-a769-b2c770989b69/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_2b2f975c-1851-4624-a769-b2c770989b69/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 -> 40cdaf120a3550cc54773a608bdbc3a68dee1334013ab0b4984b9366bf820a3d [2023-11-28 23:56:01,789 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2023-11-28 23:56:01,809 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2023-11-28 23:56:01,812 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2023-11-28 23:56:01,813 INFO L270 PluginConnector]: Initializing CDTParser... [2023-11-28 23:56:01,813 INFO L274 PluginConnector]: CDTParser initialized [2023-11-28 23:56:01,815 INFO L431 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_2b2f975c-1851-4624-a769-b2c770989b69/bin/uautomizer-verify-BQ2R08f2Ya/../../sv-benchmarks/c/pthread-wmm/mix056_power.oepc_pso.oepc_rmo.oepc.i [2023-11-28 23:56:04,608 INFO L533 CDTParser]: Created temporary CDT project at NULL [2023-11-28 23:56:04,836 INFO L384 CDTParser]: Found 1 translation units. [2023-11-28 23:56:04,836 INFO L180 CDTParser]: Scanning /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_2b2f975c-1851-4624-a769-b2c770989b69/sv-benchmarks/c/pthread-wmm/mix056_power.oepc_pso.oepc_rmo.oepc.i [2023-11-28 23:56:04,853 INFO L427 CDTParser]: About to delete temporary CDT project at /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_2b2f975c-1851-4624-a769-b2c770989b69/bin/uautomizer-verify-BQ2R08f2Ya/data/ea57772a2/cb349fda37a841b1b56048d1be5cc2cc/FLAG38c063bd9 [2023-11-28 23:56:04,868 INFO L435 CDTParser]: Successfully deleted /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_2b2f975c-1851-4624-a769-b2c770989b69/bin/uautomizer-verify-BQ2R08f2Ya/data/ea57772a2/cb349fda37a841b1b56048d1be5cc2cc [2023-11-28 23:56:04,871 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2023-11-28 23:56:04,872 INFO L133 ToolchainWalker]: Walking toolchain with 6 elements. [2023-11-28 23:56:04,874 INFO L112 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2023-11-28 23:56:04,874 INFO L270 PluginConnector]: Initializing CACSL2BoogieTranslator... [2023-11-28 23:56:04,879 INFO L274 PluginConnector]: CACSL2BoogieTranslator initialized [2023-11-28 23:56:04,880 INFO L184 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 28.11 11:56:04" (1/1) ... [2023-11-28 23:56:04,880 INFO L204 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@51d07e70 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 28.11 11:56:04, skipping insertion in model container [2023-11-28 23:56:04,881 INFO L184 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 28.11 11:56:04" (1/1) ... [2023-11-28 23:56:04,938 INFO L177 MainTranslator]: Built tables and reachable declarations [2023-11-28 23:56:05,283 INFO L209 PostProcessor]: Analyzing one entry point: main [2023-11-28 23:56:05,297 INFO L202 MainTranslator]: Completed pre-run [2023-11-28 23:56:05,346 INFO L209 PostProcessor]: Analyzing one entry point: main [2023-11-28 23:56:05,382 WARN L675 CHandler]: The function __VERIFIER_atomic_begin is called, but not defined or handled by StandardFunctionHandler. [2023-11-28 23:56:05,382 WARN L675 CHandler]: The function __VERIFIER_atomic_end is called, but not defined or handled by StandardFunctionHandler. [2023-11-28 23:56:05,389 INFO L206 MainTranslator]: Completed translation [2023-11-28 23:56:05,390 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 28.11 11:56:05 WrapperNode [2023-11-28 23:56:05,390 INFO L131 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2023-11-28 23:56:05,391 INFO L112 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2023-11-28 23:56:05,391 INFO L270 PluginConnector]: Initializing Boogie Procedure Inliner... [2023-11-28 23:56:05,391 INFO L274 PluginConnector]: Boogie Procedure Inliner initialized [2023-11-28 23:56:05,399 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 28.11 11:56:05" (1/1) ... [2023-11-28 23:56:05,418 INFO L184 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 28.11 11:56:05" (1/1) ... [2023-11-28 23:56:05,443 INFO L138 Inliner]: procedures = 179, calls = 55, calls flagged for inlining = 6, calls inlined = 7, statements flattened = 133 [2023-11-28 23:56:05,443 INFO L131 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2023-11-28 23:56:05,444 INFO L112 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2023-11-28 23:56:05,444 INFO L270 PluginConnector]: Initializing Boogie Preprocessor... [2023-11-28 23:56:05,444 INFO L274 PluginConnector]: Boogie Preprocessor initialized [2023-11-28 23:56:05,455 INFO L184 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 28.11 11:56:05" (1/1) ... [2023-11-28 23:56:05,455 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 28.11 11:56:05" (1/1) ... [2023-11-28 23:56:05,460 INFO L184 PluginConnector]: Executing the observer MemorySlicer from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 28.11 11:56:05" (1/1) ... [2023-11-28 23:56:05,477 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-28 23:56:05,477 INFO L184 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 28.11 11:56:05" (1/1) ... [2023-11-28 23:56:05,478 INFO L184 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 28.11 11:56:05" (1/1) ... [2023-11-28 23:56:05,487 INFO L184 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 28.11 11:56:05" (1/1) ... [2023-11-28 23:56:05,489 INFO L184 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 28.11 11:56:05" (1/1) ... [2023-11-28 23:56:05,492 INFO L184 PluginConnector]: Executing the observer LTLStepAnnotator from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 28.11 11:56:05" (1/1) ... [2023-11-28 23:56:05,495 INFO L184 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 28.11 11:56:05" (1/1) ... [2023-11-28 23:56:05,499 INFO L131 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2023-11-28 23:56:05,500 INFO L112 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2023-11-28 23:56:05,500 INFO L270 PluginConnector]: Initializing RCFGBuilder... [2023-11-28 23:56:05,501 INFO L274 PluginConnector]: RCFGBuilder initialized [2023-11-28 23:56:05,501 INFO L184 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 28.11 11:56:05" (1/1) ... [2023-11-28 23:56:05,507 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2023-11-28 23:56:05,518 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_2b2f975c-1851-4624-a769-b2c770989b69/bin/uautomizer-verify-BQ2R08f2Ya/z3 [2023-11-28 23:56:05,542 INFO L229 MonitoredProcess]: Starting monitored process 1 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_2b2f975c-1851-4624-a769-b2c770989b69/bin/uautomizer-verify-BQ2R08f2Ya/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 (exit command is (exit), workingDir is null) [2023-11-28 23:56:05,552 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_2b2f975c-1851-4624-a769-b2c770989b69/bin/uautomizer-verify-BQ2R08f2Ya/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 (1)] Waiting until timeout for monitored process [2023-11-28 23:56:05,583 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_atomic_begin [2023-11-28 23:56:05,584 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2023-11-28 23:56:05,584 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnStack [2023-11-28 23:56:05,584 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.dealloc [2023-11-28 23:56:05,584 INFO L130 BoogieDeclarations]: Found specification of procedure write~intINTTYPE4#0 [2023-11-28 23:56:05,584 INFO L130 BoogieDeclarations]: Found specification of procedure write~intINTTYPE4#1 [2023-11-28 23:56:05,584 INFO L130 BoogieDeclarations]: Found specification of procedure write~intINTTYPE4#2 [2023-11-28 23:56:05,584 INFO L130 BoogieDeclarations]: Found specification of procedure write~intINTTYPE4#3 [2023-11-28 23:56:05,585 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~intINTTYPE1#0 [2023-11-28 23:56:05,585 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~intINTTYPE1#1 [2023-11-28 23:56:05,585 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~intINTTYPE1#2 [2023-11-28 23:56:05,585 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~intINTTYPE1#3 [2023-11-28 23:56:05,585 INFO L130 BoogieDeclarations]: Found specification of procedure P0 [2023-11-28 23:56:05,586 INFO L138 BoogieDeclarations]: Found implementation of procedure P0 [2023-11-28 23:56:05,586 INFO L130 BoogieDeclarations]: Found specification of procedure P1 [2023-11-28 23:56:05,586 INFO L138 BoogieDeclarations]: Found implementation of procedure P1 [2023-11-28 23:56:05,586 INFO L130 BoogieDeclarations]: Found specification of procedure P2 [2023-11-28 23:56:05,586 INFO L138 BoogieDeclarations]: Found implementation of procedure P2 [2023-11-28 23:56:05,587 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_atomic_end [2023-11-28 23:56:05,587 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2023-11-28 23:56:05,587 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2023-11-28 23:56:05,589 WARN L213 CfgBuilder]: User set CodeBlockSize to SequenceOfStatements but program contains fork statements. Overwriting the user preferences and setting CodeBlockSize to OneNontrivialStatement [2023-11-28 23:56:05,738 INFO L241 CfgBuilder]: Building ICFG [2023-11-28 23:56:05,740 INFO L267 CfgBuilder]: Building CFG for each procedure with an implementation [2023-11-28 23:56:06,057 INFO L282 CfgBuilder]: Performing block encoding [2023-11-28 23:56:06,278 INFO L304 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2023-11-28 23:56:06,279 INFO L309 CfgBuilder]: Removed 0 assume(true) statements. [2023-11-28 23:56:06,279 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 28.11 11:56:06 BoogieIcfgContainer [2023-11-28 23:56:06,279 INFO L131 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2023-11-28 23:56:06,282 INFO L112 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2023-11-28 23:56:06,282 INFO L270 PluginConnector]: Initializing TraceAbstraction... [2023-11-28 23:56:06,285 INFO L274 PluginConnector]: TraceAbstraction initialized [2023-11-28 23:56:06,286 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 28.11 11:56:04" (1/3) ... [2023-11-28 23:56:06,286 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@347020ea and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 28.11 11:56:06, skipping insertion in model container [2023-11-28 23:56:06,287 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 28.11 11:56:05" (2/3) ... [2023-11-28 23:56:06,287 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@347020ea and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 28.11 11:56:06, skipping insertion in model container [2023-11-28 23:56:06,287 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 28.11 11:56:06" (3/3) ... [2023-11-28 23:56:06,289 INFO L112 eAbstractionObserver]: Analyzing ICFG mix056_power.oepc_pso.oepc_rmo.oepc.i [2023-11-28 23:56:06,309 INFO L203 ceAbstractionStarter]: Automizer settings: Hoare:false NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2023-11-28 23:56:06,309 INFO L162 ceAbstractionStarter]: Applying trace abstraction to program that has 9 error locations. [2023-11-28 23:56:06,310 INFO L514 ceAbstractionStarter]: Constructing petrified ICFG for 1 thread instances. [2023-11-28 23:56:06,373 INFO L144 ThreadInstanceAdder]: Constructed 0 joinOtherThreadTransitions. [2023-11-28 23:56:06,408 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 61 places, 53 transitions, 118 flow [2023-11-28 23:56:06,438 INFO L124 PetriNetUnfolderBase]: 2/50 cut-off events. [2023-11-28 23:56:06,439 INFO L125 PetriNetUnfolderBase]: For 0/0 co-relation queries the response was YES. [2023-11-28 23:56:06,442 INFO L83 FinitePrefix]: Finished finitePrefix Result has 60 conditions, 50 events. 2/50 cut-off events. For 0/0 co-relation queries the response was YES. Maximal size of possible extension queue 5. Compared 95 event pairs, 0 based on Foata normal form. 0/39 useless extension candidates. Maximal degree in co-relation 49. Up to 2 conditions per place. [2023-11-28 23:56:06,442 INFO L82 GeneralOperation]: Start removeDead. Operand has 61 places, 53 transitions, 118 flow [2023-11-28 23:56:06,446 INFO L88 GeneralOperation]: Finished RemoveDead, result has has 58 places, 50 transitions, 109 flow [2023-11-28 23:56:06,457 INFO L356 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2023-11-28 23:56:06,463 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;@43e3549, mLbeIndependenceSettings=[IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=false, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2023-11-28 23:56:06,464 INFO L358 AbstractCegarLoop]: Starting to check reachability of 13 error locations. [2023-11-28 23:56:06,467 INFO L185 PetriNetUnfolderBase]: Found word, exiting Unfolder. [2023-11-28 23:56:06,467 INFO L124 PetriNetUnfolderBase]: 0/2 cut-off events. [2023-11-28 23:56:06,467 INFO L125 PetriNetUnfolderBase]: For 0/0 co-relation queries the response was YES. [2023-11-28 23:56:06,467 INFO L200 CegarLoopForPetriNet]: Found error trace [2023-11-28 23:56:06,468 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1] [2023-11-28 23:56:06,468 INFO L420 AbstractCegarLoop]: === Iteration 1 === Targeting ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [P0Err0ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 10 more)] === [2023-11-28 23:56:06,473 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-11-28 23:56:06,473 INFO L85 PathProgramCache]: Analyzing trace with hash 12343, now seen corresponding path program 1 times [2023-11-28 23:56:06,486 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2023-11-28 23:56:06,486 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [498453879] [2023-11-28 23:56:06,487 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-11-28 23:56:06,487 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-28 23:56:06,487 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_2b2f975c-1851-4624-a769-b2c770989b69/bin/uautomizer-verify-BQ2R08f2Ya/mathsat [2023-11-28 23:56:06,488 INFO L229 MonitoredProcess]: Starting monitored process 2 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_2b2f975c-1851-4624-a769-b2c770989b69/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-28 23:56:06,495 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_2b2f975c-1851-4624-a769-b2c770989b69/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-28 23:56:06,597 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-28 23:56:06,600 INFO L262 TraceCheckSpWp]: Trace formula consists of 49 conjuncts, 3 conjunts are in the unsatisfiable core [2023-11-28 23:56:06,604 INFO L285 TraceCheckSpWp]: Computing forward predicates... [2023-11-28 23:56:06,698 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-28 23:56:06,711 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-28 23:56:06,711 INFO L323 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2023-11-28 23:56:06,712 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2023-11-28 23:56:06,712 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [498453879] [2023-11-28 23:56:06,713 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [498453879] provided 1 perfect and 0 imperfect interpolant sequences [2023-11-28 23:56:06,713 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-11-28 23:56:06,714 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [1] imperfect sequences [] total 1 [2023-11-28 23:56:06,715 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1487497356] [2023-11-28 23:56:06,717 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-11-28 23:56:06,724 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2023-11-28 23:56:06,729 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2023-11-28 23:56:06,754 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2023-11-28 23:56:06,754 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2023-11-28 23:56:06,787 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 26 out of 53 [2023-11-28 23:56:06,789 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 58 places, 50 transitions, 109 flow. Second operand has 3 states, 3 states have (on average 26.666666666666668) internal successors, (80), 3 states have internal predecessors, (80), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-28 23:56:06,790 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2023-11-28 23:56:06,790 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 26 of 53 [2023-11-28 23:56:06,791 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2023-11-28 23:56:07,364 INFO L124 PetriNetUnfolderBase]: 1057/2068 cut-off events. [2023-11-28 23:56:07,364 INFO L125 PetriNetUnfolderBase]: For 20/20 co-relation queries the response was YES. [2023-11-28 23:56:07,372 INFO L83 FinitePrefix]: Finished finitePrefix Result has 3694 conditions, 2068 events. 1057/2068 cut-off events. For 20/20 co-relation queries the response was YES. Maximal size of possible extension queue 138. Compared 14174 event pairs, 791 based on Foata normal form. 120/1996 useless extension candidates. Maximal degree in co-relation 3680. Up to 1193 conditions per place. [2023-11-28 23:56:07,389 INFO L140 encePairwiseOnDemand]: 48/53 looper letters, 30 selfloop transitions, 2 changer transitions 0/55 dead transitions. [2023-11-28 23:56:07,389 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 58 places, 55 transitions, 183 flow [2023-11-28 23:56:07,390 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2023-11-28 23:56:07,393 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2023-11-28 23:56:07,400 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 113 transitions. [2023-11-28 23:56:07,401 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.710691823899371 [2023-11-28 23:56:07,402 INFO L72 ComplementDD]: Start complementDD. Operand 3 states and 113 transitions. [2023-11-28 23:56:07,403 INFO L73 IsDeterministic]: Start isDeterministic. Operand 3 states and 113 transitions. [2023-11-28 23:56:07,404 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2023-11-28 23:56:07,406 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 3 states and 113 transitions. [2023-11-28 23:56:07,409 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 4 states, 3 states have (on average 37.666666666666664) internal successors, (113), 3 states have internal predecessors, (113), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-28 23:56:07,412 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 4 states, 4 states have (on average 53.0) internal successors, (212), 4 states have internal predecessors, (212), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-28 23:56:07,413 INFO L81 ComplementDD]: Finished complementDD. Result has 4 states, 4 states have (on average 53.0) internal successors, (212), 4 states have internal predecessors, (212), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-28 23:56:07,415 INFO L175 Difference]: Start difference. First operand has 58 places, 50 transitions, 109 flow. Second operand 3 states and 113 transitions. [2023-11-28 23:56:07,416 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 58 places, 55 transitions, 183 flow [2023-11-28 23:56:07,419 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 55 places, 55 transitions, 180 flow, removed 0 selfloop flow, removed 3 redundant places. [2023-11-28 23:56:07,422 INFO L231 Difference]: Finished difference. Result has 55 places, 46 transitions, 102 flow [2023-11-28 23:56:07,424 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=53, 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-28 23:56:07,428 INFO L281 CegarLoopForPetriNet]: 58 programPoint places, -3 predicate places. [2023-11-28 23:56:07,428 INFO L495 AbstractCegarLoop]: Abstraction has has 55 places, 46 transitions, 102 flow [2023-11-28 23:56:07,428 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 26.666666666666668) internal successors, (80), 3 states have internal predecessors, (80), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-28 23:56:07,428 INFO L200 CegarLoopForPetriNet]: Found error trace [2023-11-28 23:56:07,429 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1] [2023-11-28 23:56:07,432 INFO L540 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_2b2f975c-1851-4624-a769-b2c770989b69/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-28 23:56:07,629 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 2 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_2b2f975c-1851-4624-a769-b2c770989b69/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-28 23:56:07,630 INFO L420 AbstractCegarLoop]: === Iteration 2 === Targeting ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [P0Err0ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 10 more)] === [2023-11-28 23:56:07,630 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-11-28 23:56:07,630 INFO L85 PathProgramCache]: Analyzing trace with hash 12344, now seen corresponding path program 1 times [2023-11-28 23:56:07,631 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2023-11-28 23:56:07,631 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [367115976] [2023-11-28 23:56:07,631 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-11-28 23:56:07,631 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-28 23:56:07,638 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_2b2f975c-1851-4624-a769-b2c770989b69/bin/uautomizer-verify-BQ2R08f2Ya/mathsat [2023-11-28 23:56:07,640 INFO L229 MonitoredProcess]: Starting monitored process 3 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_2b2f975c-1851-4624-a769-b2c770989b69/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-28 23:56:07,641 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_2b2f975c-1851-4624-a769-b2c770989b69/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-28 23:56:07,730 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-28 23:56:07,732 INFO L262 TraceCheckSpWp]: Trace formula consists of 49 conjuncts, 4 conjunts are in the unsatisfiable core [2023-11-28 23:56:07,733 INFO L285 TraceCheckSpWp]: Computing forward predicates... [2023-11-28 23:56:07,743 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-28 23:56:07,753 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-28 23:56:07,754 INFO L323 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2023-11-28 23:56:07,754 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2023-11-28 23:56:07,754 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [367115976] [2023-11-28 23:56:07,754 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [367115976] provided 1 perfect and 0 imperfect interpolant sequences [2023-11-28 23:56:07,755 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-11-28 23:56:07,755 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [1] imperfect sequences [] total 1 [2023-11-28 23:56:07,755 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [930653173] [2023-11-28 23:56:07,755 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-11-28 23:56:07,756 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2023-11-28 23:56:07,757 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2023-11-28 23:56:07,757 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2023-11-28 23:56:07,757 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2023-11-28 23:56:07,788 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 27 out of 53 [2023-11-28 23:56:07,789 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 55 places, 46 transitions, 102 flow. Second operand has 3 states, 3 states have (on average 27.666666666666668) internal successors, (83), 3 states have internal predecessors, (83), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-28 23:56:07,789 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2023-11-28 23:56:07,789 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 27 of 53 [2023-11-28 23:56:07,789 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2023-11-28 23:56:08,184 INFO L124 PetriNetUnfolderBase]: 1057/2067 cut-off events. [2023-11-28 23:56:08,185 INFO L125 PetriNetUnfolderBase]: For 60/60 co-relation queries the response was YES. [2023-11-28 23:56:08,189 INFO L83 FinitePrefix]: Finished finitePrefix Result has 3751 conditions, 2067 events. 1057/2067 cut-off events. For 60/60 co-relation queries the response was YES. Maximal size of possible extension queue 138. Compared 14181 event pairs, 791 based on Foata normal form. 1/1876 useless extension candidates. Maximal degree in co-relation 3740. Up to 1192 conditions per place. [2023-11-28 23:56:08,204 INFO L140 encePairwiseOnDemand]: 50/53 looper letters, 29 selfloop transitions, 2 changer transitions 0/54 dead transitions. [2023-11-28 23:56:08,204 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 56 places, 54 transitions, 180 flow [2023-11-28 23:56:08,205 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2023-11-28 23:56:08,205 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2023-11-28 23:56:08,206 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 113 transitions. [2023-11-28 23:56:08,207 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.710691823899371 [2023-11-28 23:56:08,207 INFO L72 ComplementDD]: Start complementDD. Operand 3 states and 113 transitions. [2023-11-28 23:56:08,207 INFO L73 IsDeterministic]: Start isDeterministic. Operand 3 states and 113 transitions. [2023-11-28 23:56:08,208 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2023-11-28 23:56:08,208 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 3 states and 113 transitions. [2023-11-28 23:56:08,209 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 4 states, 3 states have (on average 37.666666666666664) internal successors, (113), 3 states have internal predecessors, (113), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-28 23:56:08,211 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 4 states, 4 states have (on average 53.0) internal successors, (212), 4 states have internal predecessors, (212), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-28 23:56:08,211 INFO L81 ComplementDD]: Finished complementDD. Result has 4 states, 4 states have (on average 53.0) internal successors, (212), 4 states have internal predecessors, (212), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-28 23:56:08,211 INFO L175 Difference]: Start difference. First operand has 55 places, 46 transitions, 102 flow. Second operand 3 states and 113 transitions. [2023-11-28 23:56:08,211 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 56 places, 54 transitions, 180 flow [2023-11-28 23:56:08,215 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 54 places, 54 transitions, 176 flow, removed 0 selfloop flow, removed 2 redundant places. [2023-11-28 23:56:08,217 INFO L231 Difference]: Finished difference. Result has 54 places, 45 transitions, 100 flow [2023-11-28 23:56:08,217 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=53, 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-28 23:56:08,218 INFO L281 CegarLoopForPetriNet]: 58 programPoint places, -4 predicate places. [2023-11-28 23:56:08,218 INFO L495 AbstractCegarLoop]: Abstraction has has 54 places, 45 transitions, 100 flow [2023-11-28 23:56:08,219 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 27.666666666666668) internal successors, (83), 3 states have internal predecessors, (83), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-28 23:56:08,219 INFO L200 CegarLoopForPetriNet]: Found error trace [2023-11-28 23:56:08,219 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1] [2023-11-28 23:56:08,221 INFO L552 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_2b2f975c-1851-4624-a769-b2c770989b69/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-28 23:56:08,419 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 3 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_2b2f975c-1851-4624-a769-b2c770989b69/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-28 23:56:08,420 INFO L420 AbstractCegarLoop]: === Iteration 3 === Targeting ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [P0Err0ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 10 more)] === [2023-11-28 23:56:08,420 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-11-28 23:56:08,421 INFO L85 PathProgramCache]: Analyzing trace with hash 368083253, now seen corresponding path program 1 times [2023-11-28 23:56:08,421 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2023-11-28 23:56:08,421 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [1283977365] [2023-11-28 23:56:08,422 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-11-28 23:56:08,422 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-28 23:56:08,422 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_2b2f975c-1851-4624-a769-b2c770989b69/bin/uautomizer-verify-BQ2R08f2Ya/mathsat [2023-11-28 23:56:08,423 INFO L229 MonitoredProcess]: Starting monitored process 4 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_2b2f975c-1851-4624-a769-b2c770989b69/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-28 23:56:08,424 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_2b2f975c-1851-4624-a769-b2c770989b69/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-28 23:56:08,520 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-28 23:56:08,522 INFO L262 TraceCheckSpWp]: Trace formula consists of 70 conjuncts, 3 conjunts are in the unsatisfiable core [2023-11-28 23:56:08,524 INFO L285 TraceCheckSpWp]: Computing forward predicates... [2023-11-28 23:56:08,529 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-28 23:56:08,535 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-28 23:56:08,535 INFO L323 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2023-11-28 23:56:08,535 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2023-11-28 23:56:08,536 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [1283977365] [2023-11-28 23:56:08,536 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [1283977365] provided 1 perfect and 0 imperfect interpolant sequences [2023-11-28 23:56:08,536 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-11-28 23:56:08,536 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2023-11-28 23:56:08,536 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [995190576] [2023-11-28 23:56:08,537 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-11-28 23:56:08,537 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2023-11-28 23:56:08,537 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2023-11-28 23:56:08,538 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2023-11-28 23:56:08,538 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2023-11-28 23:56:08,564 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 26 out of 53 [2023-11-28 23:56:08,565 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 54 places, 45 transitions, 100 flow. Second operand has 3 states, 3 states have (on average 27.333333333333332) internal successors, (82), 3 states have internal predecessors, (82), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-28 23:56:08,565 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2023-11-28 23:56:08,565 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 26 of 53 [2023-11-28 23:56:08,565 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2023-11-28 23:56:08,960 INFO L124 PetriNetUnfolderBase]: 1061/2066 cut-off events. [2023-11-28 23:56:08,960 INFO L125 PetriNetUnfolderBase]: For 60/60 co-relation queries the response was YES. [2023-11-28 23:56:08,965 INFO L83 FinitePrefix]: Finished finitePrefix Result has 3759 conditions, 2066 events. 1061/2066 cut-off events. For 60/60 co-relation queries the response was YES. Maximal size of possible extension queue 138. Compared 14335 event pairs, 571 based on Foata normal form. 0/1886 useless extension candidates. Maximal degree in co-relation 3748. Up to 1195 conditions per place. [2023-11-28 23:56:08,976 INFO L140 encePairwiseOnDemand]: 50/53 looper letters, 30 selfloop transitions, 2 changer transitions 0/53 dead transitions. [2023-11-28 23:56:08,977 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 55 places, 53 transitions, 180 flow [2023-11-28 23:56:08,977 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2023-11-28 23:56:08,977 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2023-11-28 23:56:08,978 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 111 transitions. [2023-11-28 23:56:08,979 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.6981132075471698 [2023-11-28 23:56:08,979 INFO L72 ComplementDD]: Start complementDD. Operand 3 states and 111 transitions. [2023-11-28 23:56:08,979 INFO L73 IsDeterministic]: Start isDeterministic. Operand 3 states and 111 transitions. [2023-11-28 23:56:08,980 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2023-11-28 23:56:08,980 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 3 states and 111 transitions. [2023-11-28 23:56:08,980 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 4 states, 3 states have (on average 37.0) internal successors, (111), 3 states have internal predecessors, (111), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-28 23:56:08,981 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 4 states, 4 states have (on average 53.0) internal successors, (212), 4 states have internal predecessors, (212), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-28 23:56:08,982 INFO L81 ComplementDD]: Finished complementDD. Result has 4 states, 4 states have (on average 53.0) internal successors, (212), 4 states have internal predecessors, (212), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-28 23:56:08,982 INFO L175 Difference]: Start difference. First operand has 54 places, 45 transitions, 100 flow. Second operand 3 states and 111 transitions. [2023-11-28 23:56:08,982 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 55 places, 53 transitions, 180 flow [2023-11-28 23:56:08,985 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 53 places, 53 transitions, 176 flow, removed 0 selfloop flow, removed 2 redundant places. [2023-11-28 23:56:08,987 INFO L231 Difference]: Finished difference. Result has 53 places, 44 transitions, 98 flow [2023-11-28 23:56:08,987 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=53, 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-28 23:56:08,988 INFO L281 CegarLoopForPetriNet]: 58 programPoint places, -5 predicate places. [2023-11-28 23:56:08,988 INFO L495 AbstractCegarLoop]: Abstraction has has 53 places, 44 transitions, 98 flow [2023-11-28 23:56:08,988 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 27.333333333333332) internal successors, (82), 3 states have internal predecessors, (82), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-28 23:56:08,988 INFO L200 CegarLoopForPetriNet]: Found error trace [2023-11-28 23:56:08,989 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1] [2023-11-28 23:56:08,991 INFO L552 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_2b2f975c-1851-4624-a769-b2c770989b69/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-28 23:56:09,189 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 4 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_2b2f975c-1851-4624-a769-b2c770989b69/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-28 23:56:09,189 INFO L420 AbstractCegarLoop]: === Iteration 4 === Targeting ULTIMATE.startErr3REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [P0Err0ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 10 more)] === [2023-11-28 23:56:09,190 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-11-28 23:56:09,190 INFO L85 PathProgramCache]: Analyzing trace with hash 368083254, now seen corresponding path program 1 times [2023-11-28 23:56:09,191 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2023-11-28 23:56:09,191 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [667602140] [2023-11-28 23:56:09,191 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-11-28 23:56:09,191 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-28 23:56:09,191 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_2b2f975c-1851-4624-a769-b2c770989b69/bin/uautomizer-verify-BQ2R08f2Ya/mathsat [2023-11-28 23:56:09,192 INFO L229 MonitoredProcess]: Starting monitored process 5 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_2b2f975c-1851-4624-a769-b2c770989b69/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-28 23:56:09,195 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_2b2f975c-1851-4624-a769-b2c770989b69/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-28 23:56:09,270 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-28 23:56:09,272 INFO L262 TraceCheckSpWp]: Trace formula consists of 70 conjuncts, 4 conjunts are in the unsatisfiable core [2023-11-28 23:56:09,273 INFO L285 TraceCheckSpWp]: Computing forward predicates... [2023-11-28 23:56:09,282 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-28 23:56:09,294 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-28 23:56:09,294 INFO L323 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2023-11-28 23:56:09,294 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2023-11-28 23:56:09,294 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [667602140] [2023-11-28 23:56:09,295 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [667602140] provided 1 perfect and 0 imperfect interpolant sequences [2023-11-28 23:56:09,295 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-11-28 23:56:09,295 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2023-11-28 23:56:09,295 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1157473814] [2023-11-28 23:56:09,295 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-11-28 23:56:09,296 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2023-11-28 23:56:09,296 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2023-11-28 23:56:09,296 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2023-11-28 23:56:09,296 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2023-11-28 23:56:09,325 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 27 out of 53 [2023-11-28 23:56:09,325 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 53 places, 44 transitions, 98 flow. Second operand has 3 states, 3 states have (on average 28.333333333333332) internal successors, (85), 3 states have internal predecessors, (85), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-28 23:56:09,325 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2023-11-28 23:56:09,325 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 27 of 53 [2023-11-28 23:56:09,326 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2023-11-28 23:56:09,735 INFO L124 PetriNetUnfolderBase]: 1057/2033 cut-off events. [2023-11-28 23:56:09,735 INFO L125 PetriNetUnfolderBase]: For 64/64 co-relation queries the response was YES. [2023-11-28 23:56:09,740 INFO L83 FinitePrefix]: Finished finitePrefix Result has 3721 conditions, 2033 events. 1057/2033 cut-off events. For 64/64 co-relation queries the response was YES. Maximal size of possible extension queue 137. Compared 14197 event pairs, 811 based on Foata normal form. 5/1864 useless extension candidates. Maximal degree in co-relation 3711. Up to 1186 conditions per place. [2023-11-28 23:56:09,752 INFO L140 encePairwiseOnDemand]: 50/53 looper letters, 29 selfloop transitions, 2 changer transitions 0/52 dead transitions. [2023-11-28 23:56:09,752 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 54 places, 52 transitions, 176 flow [2023-11-28 23:56:09,752 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2023-11-28 23:56:09,753 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2023-11-28 23:56:09,753 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 113 transitions. [2023-11-28 23:56:09,754 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.710691823899371 [2023-11-28 23:56:09,754 INFO L72 ComplementDD]: Start complementDD. Operand 3 states and 113 transitions. [2023-11-28 23:56:09,754 INFO L73 IsDeterministic]: Start isDeterministic. Operand 3 states and 113 transitions. [2023-11-28 23:56:09,754 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2023-11-28 23:56:09,754 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 3 states and 113 transitions. [2023-11-28 23:56:09,755 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 4 states, 3 states have (on average 37.666666666666664) internal successors, (113), 3 states have internal predecessors, (113), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-28 23:56:09,756 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 4 states, 4 states have (on average 53.0) internal successors, (212), 4 states have internal predecessors, (212), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-28 23:56:09,757 INFO L81 ComplementDD]: Finished complementDD. Result has 4 states, 4 states have (on average 53.0) internal successors, (212), 4 states have internal predecessors, (212), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-28 23:56:09,757 INFO L175 Difference]: Start difference. First operand has 53 places, 44 transitions, 98 flow. Second operand 3 states and 113 transitions. [2023-11-28 23:56:09,757 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 54 places, 52 transitions, 176 flow [2023-11-28 23:56:09,760 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 52 places, 52 transitions, 172 flow, removed 0 selfloop flow, removed 2 redundant places. [2023-11-28 23:56:09,761 INFO L231 Difference]: Finished difference. Result has 52 places, 43 transitions, 96 flow [2023-11-28 23:56:09,761 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=53, 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-28 23:56:09,762 INFO L281 CegarLoopForPetriNet]: 58 programPoint places, -6 predicate places. [2023-11-28 23:56:09,762 INFO L495 AbstractCegarLoop]: Abstraction has has 52 places, 43 transitions, 96 flow [2023-11-28 23:56:09,763 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 28.333333333333332) internal successors, (85), 3 states have internal predecessors, (85), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-28 23:56:09,763 INFO L200 CegarLoopForPetriNet]: Found error trace [2023-11-28 23:56:09,763 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1] [2023-11-28 23:56:09,765 INFO L552 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_2b2f975c-1851-4624-a769-b2c770989b69/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)] Ended with exit code 0 [2023-11-28 23:56:09,963 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 5 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_2b2f975c-1851-4624-a769-b2c770989b69/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-28 23:56:09,964 INFO L420 AbstractCegarLoop]: === Iteration 5 === Targeting P0Err0ASSERT_VIOLATIONMEMORY_LEAK === [P0Err0ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 10 more)] === [2023-11-28 23:56:09,964 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-11-28 23:56:09,964 INFO L85 PathProgramCache]: Analyzing trace with hash 368083970, now seen corresponding path program 1 times [2023-11-28 23:56:09,964 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2023-11-28 23:56:09,965 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [2061385081] [2023-11-28 23:56:09,965 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-11-28 23:56:09,965 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-28 23:56:09,965 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_2b2f975c-1851-4624-a769-b2c770989b69/bin/uautomizer-verify-BQ2R08f2Ya/mathsat [2023-11-28 23:56:09,966 INFO L229 MonitoredProcess]: Starting monitored process 6 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_2b2f975c-1851-4624-a769-b2c770989b69/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-28 23:56:09,967 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_2b2f975c-1851-4624-a769-b2c770989b69/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-28 23:56:10,036 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-28 23:56:10,037 INFO L262 TraceCheckSpWp]: Trace formula consists of 68 conjuncts, 5 conjunts are in the unsatisfiable core [2023-11-28 23:56:10,038 INFO L285 TraceCheckSpWp]: Computing forward predicates... [2023-11-28 23:56:10,047 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-28 23:56:10,048 INFO L323 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2023-11-28 23:56:10,048 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2023-11-28 23:56:10,048 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [2061385081] [2023-11-28 23:56:10,049 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [2061385081] provided 1 perfect and 0 imperfect interpolant sequences [2023-11-28 23:56:10,049 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-11-28 23:56:10,049 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [1] imperfect sequences [] total 1 [2023-11-28 23:56:10,049 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1303359712] [2023-11-28 23:56:10,049 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-11-28 23:56:10,050 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2023-11-28 23:56:10,050 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2023-11-28 23:56:10,050 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2023-11-28 23:56:10,051 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2023-11-28 23:56:10,051 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 28 out of 53 [2023-11-28 23:56:10,051 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 52 places, 43 transitions, 96 flow. Second operand has 3 states, 3 states have (on average 29.0) internal successors, (87), 3 states have internal predecessors, (87), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-28 23:56:10,052 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2023-11-28 23:56:10,052 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 28 of 53 [2023-11-28 23:56:10,052 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2023-11-28 23:56:10,296 INFO L124 PetriNetUnfolderBase]: 825/1547 cut-off events. [2023-11-28 23:56:10,297 INFO L125 PetriNetUnfolderBase]: For 51/51 co-relation queries the response was YES. [2023-11-28 23:56:10,299 INFO L83 FinitePrefix]: Finished finitePrefix Result has 2878 conditions, 1547 events. 825/1547 cut-off events. For 51/51 co-relation queries the response was YES. Maximal size of possible extension queue 106. Compared 10056 event pairs, 129 based on Foata normal form. 0/1530 useless extension candidates. Maximal degree in co-relation 2868. Up to 1009 conditions per place. [2023-11-28 23:56:10,306 INFO L140 encePairwiseOnDemand]: 50/53 looper letters, 33 selfloop transitions, 2 changer transitions 2/58 dead transitions. [2023-11-28 23:56:10,306 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 53 places, 58 transitions, 208 flow [2023-11-28 23:56:10,306 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2023-11-28 23:56:10,307 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2023-11-28 23:56:10,307 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 122 transitions. [2023-11-28 23:56:10,308 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.7672955974842768 [2023-11-28 23:56:10,308 INFO L72 ComplementDD]: Start complementDD. Operand 3 states and 122 transitions. [2023-11-28 23:56:10,308 INFO L73 IsDeterministic]: Start isDeterministic. Operand 3 states and 122 transitions. [2023-11-28 23:56:10,308 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2023-11-28 23:56:10,309 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 3 states and 122 transitions. [2023-11-28 23:56:10,309 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 4 states, 3 states have (on average 40.666666666666664) internal successors, (122), 3 states have internal predecessors, (122), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-28 23:56:10,310 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 4 states, 4 states have (on average 53.0) internal successors, (212), 4 states have internal predecessors, (212), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-28 23:56:10,311 INFO L81 ComplementDD]: Finished complementDD. Result has 4 states, 4 states have (on average 53.0) internal successors, (212), 4 states have internal predecessors, (212), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-28 23:56:10,311 INFO L175 Difference]: Start difference. First operand has 52 places, 43 transitions, 96 flow. Second operand 3 states and 122 transitions. [2023-11-28 23:56:10,311 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 53 places, 58 transitions, 208 flow [2023-11-28 23:56:10,312 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 51 places, 58 transitions, 200 flow, removed 0 selfloop flow, removed 2 redundant places. [2023-11-28 23:56:10,314 INFO L231 Difference]: Finished difference. Result has 51 places, 41 transitions, 92 flow [2023-11-28 23:56:10,314 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=53, 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-28 23:56:10,315 INFO L281 CegarLoopForPetriNet]: 58 programPoint places, -7 predicate places. [2023-11-28 23:56:10,315 INFO L495 AbstractCegarLoop]: Abstraction has has 51 places, 41 transitions, 92 flow [2023-11-28 23:56:10,315 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 29.0) internal successors, (87), 3 states have internal predecessors, (87), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-28 23:56:10,315 INFO L200 CegarLoopForPetriNet]: Found error trace [2023-11-28 23:56:10,316 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1] [2023-11-28 23:56:10,318 INFO L552 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_2b2f975c-1851-4624-a769-b2c770989b69/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-28 23:56:10,517 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 6 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_2b2f975c-1851-4624-a769-b2c770989b69/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-28 23:56:10,518 INFO L420 AbstractCegarLoop]: === Iteration 6 === Targeting ULTIMATE.startErr4REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [P0Err0ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 10 more)] === [2023-11-28 23:56:10,518 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-11-28 23:56:10,518 INFO L85 PathProgramCache]: Analyzing trace with hash 517053604, now seen corresponding path program 1 times [2023-11-28 23:56:10,518 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2023-11-28 23:56:10,519 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [470382617] [2023-11-28 23:56:10,519 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-11-28 23:56:10,519 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-28 23:56:10,519 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_2b2f975c-1851-4624-a769-b2c770989b69/bin/uautomizer-verify-BQ2R08f2Ya/mathsat [2023-11-28 23:56:10,520 INFO L229 MonitoredProcess]: Starting monitored process 7 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_2b2f975c-1851-4624-a769-b2c770989b69/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-28 23:56:10,521 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_2b2f975c-1851-4624-a769-b2c770989b69/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-28 23:56:10,585 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-28 23:56:10,587 INFO L262 TraceCheckSpWp]: Trace formula consists of 92 conjuncts, 3 conjunts are in the unsatisfiable core [2023-11-28 23:56:10,589 INFO L285 TraceCheckSpWp]: Computing forward predicates... [2023-11-28 23:56:10,594 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-28 23:56:10,599 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-28 23:56:10,600 INFO L323 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2023-11-28 23:56:10,600 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2023-11-28 23:56:10,600 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [470382617] [2023-11-28 23:56:10,601 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [470382617] provided 1 perfect and 0 imperfect interpolant sequences [2023-11-28 23:56:10,601 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-11-28 23:56:10,601 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2023-11-28 23:56:10,601 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2112146236] [2023-11-28 23:56:10,601 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-11-28 23:56:10,602 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2023-11-28 23:56:10,602 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2023-11-28 23:56:10,602 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2023-11-28 23:56:10,603 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2023-11-28 23:56:10,627 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 26 out of 53 [2023-11-28 23:56:10,628 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 51 places, 41 transitions, 92 flow. Second operand has 3 states, 3 states have (on average 28.0) internal successors, (84), 3 states have internal predecessors, (84), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-28 23:56:10,628 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2023-11-28 23:56:10,628 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 26 of 53 [2023-11-28 23:56:10,628 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2023-11-28 23:56:10,829 INFO L124 PetriNetUnfolderBase]: 738/1459 cut-off events. [2023-11-28 23:56:10,829 INFO L125 PetriNetUnfolderBase]: For 95/95 co-relation queries the response was YES. [2023-11-28 23:56:10,831 INFO L83 FinitePrefix]: Finished finitePrefix Result has 2711 conditions, 1459 events. 738/1459 cut-off events. For 95/95 co-relation queries the response was YES. Maximal size of possible extension queue 100. Compared 9454 event pairs, 428 based on Foata normal form. 0/1420 useless extension candidates. Maximal degree in co-relation 2700. Up to 934 conditions per place. [2023-11-28 23:56:10,838 INFO L140 encePairwiseOnDemand]: 50/53 looper letters, 27 selfloop transitions, 2 changer transitions 0/48 dead transitions. [2023-11-28 23:56:10,838 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 51 places, 48 transitions, 166 flow [2023-11-28 23:56:10,838 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2023-11-28 23:56:10,838 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2023-11-28 23:56:10,839 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 108 transitions. [2023-11-28 23:56:10,839 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.6792452830188679 [2023-11-28 23:56:10,839 INFO L72 ComplementDD]: Start complementDD. Operand 3 states and 108 transitions. [2023-11-28 23:56:10,840 INFO L73 IsDeterministic]: Start isDeterministic. Operand 3 states and 108 transitions. [2023-11-28 23:56:10,840 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2023-11-28 23:56:10,840 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 3 states and 108 transitions. [2023-11-28 23:56:10,841 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 4 states, 3 states have (on average 36.0) internal successors, (108), 3 states have internal predecessors, (108), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-28 23:56:10,842 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 4 states, 4 states have (on average 53.0) internal successors, (212), 4 states have internal predecessors, (212), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-28 23:56:10,842 INFO L81 ComplementDD]: Finished complementDD. Result has 4 states, 4 states have (on average 53.0) internal successors, (212), 4 states have internal predecessors, (212), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-28 23:56:10,842 INFO L175 Difference]: Start difference. First operand has 51 places, 41 transitions, 92 flow. Second operand 3 states and 108 transitions. [2023-11-28 23:56:10,842 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 51 places, 48 transitions, 166 flow [2023-11-28 23:56:10,843 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 49 places, 48 transitions, 160 flow, removed 0 selfloop flow, removed 2 redundant places. [2023-11-28 23:56:10,844 INFO L231 Difference]: Finished difference. Result has 49 places, 40 transitions, 90 flow [2023-11-28 23:56:10,845 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=53, PETRI_DIFFERENCE_MINUEND_FLOW=86, PETRI_DIFFERENCE_MINUEND_PLACES=47, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=40, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=2, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=38, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=90, PETRI_PLACES=49, PETRI_TRANSITIONS=40} [2023-11-28 23:56:10,845 INFO L281 CegarLoopForPetriNet]: 58 programPoint places, -9 predicate places. [2023-11-28 23:56:10,846 INFO L495 AbstractCegarLoop]: Abstraction has has 49 places, 40 transitions, 90 flow [2023-11-28 23:56:10,846 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 28.0) internal successors, (84), 3 states have internal predecessors, (84), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-28 23:56:10,846 INFO L200 CegarLoopForPetriNet]: Found error trace [2023-11-28 23:56:10,846 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1] [2023-11-28 23:56:10,849 INFO L552 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_2b2f975c-1851-4624-a769-b2c770989b69/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-28 23:56:11,049 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 7 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_2b2f975c-1851-4624-a769-b2c770989b69/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-28 23:56:11,049 INFO L420 AbstractCegarLoop]: === Iteration 7 === Targeting ULTIMATE.startErr5REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [P0Err0ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 10 more)] === [2023-11-28 23:56:11,050 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-11-28 23:56:11,050 INFO L85 PathProgramCache]: Analyzing trace with hash 517053605, now seen corresponding path program 1 times [2023-11-28 23:56:11,050 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2023-11-28 23:56:11,051 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [1214185609] [2023-11-28 23:56:11,051 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-11-28 23:56:11,051 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-28 23:56:11,051 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_2b2f975c-1851-4624-a769-b2c770989b69/bin/uautomizer-verify-BQ2R08f2Ya/mathsat [2023-11-28 23:56:11,052 INFO L229 MonitoredProcess]: Starting monitored process 8 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_2b2f975c-1851-4624-a769-b2c770989b69/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-28 23:56:11,053 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_2b2f975c-1851-4624-a769-b2c770989b69/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-28 23:56:11,135 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-28 23:56:11,137 INFO L262 TraceCheckSpWp]: Trace formula consists of 92 conjuncts, 4 conjunts are in the unsatisfiable core [2023-11-28 23:56:11,138 INFO L285 TraceCheckSpWp]: Computing forward predicates... [2023-11-28 23:56:11,147 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-28 23:56:11,157 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-28 23:56:11,157 INFO L323 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2023-11-28 23:56:11,157 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2023-11-28 23:56:11,157 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [1214185609] [2023-11-28 23:56:11,158 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [1214185609] provided 1 perfect and 0 imperfect interpolant sequences [2023-11-28 23:56:11,158 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-11-28 23:56:11,158 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2023-11-28 23:56:11,158 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1693028871] [2023-11-28 23:56:11,158 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-11-28 23:56:11,158 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2023-11-28 23:56:11,159 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2023-11-28 23:56:11,159 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2023-11-28 23:56:11,159 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2023-11-28 23:56:11,193 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 27 out of 53 [2023-11-28 23:56:11,193 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 49 places, 40 transitions, 90 flow. Second operand has 3 states, 3 states have (on average 29.0) internal successors, (87), 3 states have internal predecessors, (87), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-28 23:56:11,193 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2023-11-28 23:56:11,193 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 27 of 53 [2023-11-28 23:56:11,193 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2023-11-28 23:56:11,424 INFO L124 PetriNetUnfolderBase]: 721/1450 cut-off events. [2023-11-28 23:56:11,424 INFO L125 PetriNetUnfolderBase]: For 56/56 co-relation queries the response was YES. [2023-11-28 23:56:11,428 INFO L83 FinitePrefix]: Finished finitePrefix Result has 2637 conditions, 1450 events. 721/1450 cut-off events. For 56/56 co-relation queries the response was YES. Maximal size of possible extension queue 100. Compared 9502 event pairs, 260 based on Foata normal form. 12/1431 useless extension candidates. Maximal degree in co-relation 2627. Up to 905 conditions per place. [2023-11-28 23:56:11,438 INFO L140 encePairwiseOnDemand]: 50/53 looper letters, 26 selfloop transitions, 2 changer transitions 0/47 dead transitions. [2023-11-28 23:56:11,438 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 50 places, 47 transitions, 160 flow [2023-11-28 23:56:11,438 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2023-11-28 23:56:11,439 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2023-11-28 23:56:11,439 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 110 transitions. [2023-11-28 23:56:11,440 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.6918238993710691 [2023-11-28 23:56:11,440 INFO L72 ComplementDD]: Start complementDD. Operand 3 states and 110 transitions. [2023-11-28 23:56:11,440 INFO L73 IsDeterministic]: Start isDeterministic. Operand 3 states and 110 transitions. [2023-11-28 23:56:11,440 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2023-11-28 23:56:11,440 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 3 states and 110 transitions. [2023-11-28 23:56:11,441 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 4 states, 3 states have (on average 36.666666666666664) internal successors, (110), 3 states have internal predecessors, (110), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-28 23:56:11,442 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 4 states, 4 states have (on average 53.0) internal successors, (212), 4 states have internal predecessors, (212), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-28 23:56:11,442 INFO L81 ComplementDD]: Finished complementDD. Result has 4 states, 4 states have (on average 53.0) internal successors, (212), 4 states have internal predecessors, (212), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-28 23:56:11,442 INFO L175 Difference]: Start difference. First operand has 49 places, 40 transitions, 90 flow. Second operand 3 states and 110 transitions. [2023-11-28 23:56:11,442 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 50 places, 47 transitions, 160 flow [2023-11-28 23:56:11,444 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 48 places, 47 transitions, 156 flow, removed 0 selfloop flow, removed 2 redundant places. [2023-11-28 23:56:11,445 INFO L231 Difference]: Finished difference. Result has 48 places, 39 transitions, 88 flow [2023-11-28 23:56:11,445 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=53, PETRI_DIFFERENCE_MINUEND_FLOW=84, PETRI_DIFFERENCE_MINUEND_PLACES=46, 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=3, PETRI_FLOW=88, PETRI_PLACES=48, PETRI_TRANSITIONS=39} [2023-11-28 23:56:11,446 INFO L281 CegarLoopForPetriNet]: 58 programPoint places, -10 predicate places. [2023-11-28 23:56:11,446 INFO L495 AbstractCegarLoop]: Abstraction has has 48 places, 39 transitions, 88 flow [2023-11-28 23:56:11,446 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 29.0) internal successors, (87), 3 states have internal predecessors, (87), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-28 23:56:11,446 INFO L200 CegarLoopForPetriNet]: Found error trace [2023-11-28 23:56:11,447 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-28 23:56:11,449 INFO L552 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_2b2f975c-1851-4624-a769-b2c770989b69/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-28 23:56:11,647 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 8 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_2b2f975c-1851-4624-a769-b2c770989b69/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-28 23:56:11,647 INFO L420 AbstractCegarLoop]: === Iteration 8 === Targeting ULTIMATE.startErr7ASSERT_VIOLATIONMEMORY_LEAK === [P0Err0ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 10 more)] === [2023-11-28 23:56:11,648 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-11-28 23:56:11,648 INFO L85 PathProgramCache]: Analyzing trace with hash 1066433167, now seen corresponding path program 1 times [2023-11-28 23:56:11,648 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2023-11-28 23:56:11,648 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [310612136] [2023-11-28 23:56:11,649 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-11-28 23:56:11,649 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-28 23:56:11,649 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_2b2f975c-1851-4624-a769-b2c770989b69/bin/uautomizer-verify-BQ2R08f2Ya/mathsat [2023-11-28 23:56:11,650 INFO L229 MonitoredProcess]: Starting monitored process 9 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_2b2f975c-1851-4624-a769-b2c770989b69/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-28 23:56:11,651 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_2b2f975c-1851-4624-a769-b2c770989b69/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-28 23:56:11,740 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-28 23:56:11,743 INFO L262 TraceCheckSpWp]: Trace formula consists of 122 conjuncts, 3 conjunts are in the unsatisfiable core [2023-11-28 23:56:11,745 INFO L285 TraceCheckSpWp]: Computing forward predicates... [2023-11-28 23:56:11,784 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-28 23:56:11,784 INFO L323 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2023-11-28 23:56:11,784 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2023-11-28 23:56:11,784 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [310612136] [2023-11-28 23:56:11,784 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [310612136] provided 1 perfect and 0 imperfect interpolant sequences [2023-11-28 23:56:11,785 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-11-28 23:56:11,785 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2023-11-28 23:56:11,785 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1286338368] [2023-11-28 23:56:11,785 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-11-28 23:56:11,786 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2023-11-28 23:56:11,786 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2023-11-28 23:56:11,787 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2023-11-28 23:56:11,787 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2023-11-28 23:56:11,794 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 24 out of 53 [2023-11-28 23:56:11,795 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 48 places, 39 transitions, 88 flow. Second operand has 4 states, 4 states have (on average 27.0) internal successors, (108), 4 states have internal predecessors, (108), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-28 23:56:11,795 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2023-11-28 23:56:11,795 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 24 of 53 [2023-11-28 23:56:11,795 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2023-11-28 23:56:12,138 INFO L124 PetriNetUnfolderBase]: 1680/2966 cut-off events. [2023-11-28 23:56:12,138 INFO L125 PetriNetUnfolderBase]: For 99/99 co-relation queries the response was YES. [2023-11-28 23:56:12,142 INFO L83 FinitePrefix]: Finished finitePrefix Result has 5646 conditions, 2966 events. 1680/2966 cut-off events. For 99/99 co-relation queries the response was YES. Maximal size of possible extension queue 177. Compared 19216 event pairs, 188 based on Foata normal form. 100/3043 useless extension candidates. Maximal degree in co-relation 5636. Up to 1579 conditions per place. [2023-11-28 23:56:12,155 INFO L140 encePairwiseOnDemand]: 47/53 looper letters, 43 selfloop transitions, 5 changer transitions 1/64 dead transitions. [2023-11-28 23:56:12,155 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 51 places, 64 transitions, 242 flow [2023-11-28 23:56:12,155 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2023-11-28 23:56:12,155 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 4 states. [2023-11-28 23:56:12,156 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 147 transitions. [2023-11-28 23:56:12,156 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.6933962264150944 [2023-11-28 23:56:12,156 INFO L72 ComplementDD]: Start complementDD. Operand 4 states and 147 transitions. [2023-11-28 23:56:12,156 INFO L73 IsDeterministic]: Start isDeterministic. Operand 4 states and 147 transitions. [2023-11-28 23:56:12,157 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2023-11-28 23:56:12,157 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 4 states and 147 transitions. [2023-11-28 23:56:12,157 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 5 states, 4 states have (on average 36.75) internal successors, (147), 4 states have internal predecessors, (147), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-28 23:56:12,158 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 5 states, 5 states have (on average 53.0) internal successors, (265), 5 states have internal predecessors, (265), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-28 23:56:12,159 INFO L81 ComplementDD]: Finished complementDD. Result has 5 states, 5 states have (on average 53.0) internal successors, (265), 5 states have internal predecessors, (265), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-28 23:56:12,159 INFO L175 Difference]: Start difference. First operand has 48 places, 39 transitions, 88 flow. Second operand 4 states and 147 transitions. [2023-11-28 23:56:12,159 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 51 places, 64 transitions, 242 flow [2023-11-28 23:56:12,162 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 49 places, 64 transitions, 236 flow, removed 0 selfloop flow, removed 2 redundant places. [2023-11-28 23:56:12,163 INFO L231 Difference]: Finished difference. Result has 51 places, 42 transitions, 118 flow [2023-11-28 23:56:12,163 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=53, PETRI_DIFFERENCE_MINUEND_FLOW=84, PETRI_DIFFERENCE_MINUEND_PLACES=46, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=39, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=2, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=34, PETRI_DIFFERENCE_SUBTRAHEND_STATES=4, PETRI_FLOW=118, PETRI_PLACES=51, PETRI_TRANSITIONS=42} [2023-11-28 23:56:12,164 INFO L281 CegarLoopForPetriNet]: 58 programPoint places, -7 predicate places. [2023-11-28 23:56:12,164 INFO L495 AbstractCegarLoop]: Abstraction has has 51 places, 42 transitions, 118 flow [2023-11-28 23:56:12,164 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 27.0) internal successors, (108), 4 states have internal predecessors, (108), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-28 23:56:12,164 INFO L200 CegarLoopForPetriNet]: Found error trace [2023-11-28 23:56:12,165 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-28 23:56:12,168 INFO L552 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_2b2f975c-1851-4624-a769-b2c770989b69/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-28 23:56:12,368 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 9 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_2b2f975c-1851-4624-a769-b2c770989b69/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-28 23:56:12,369 INFO L420 AbstractCegarLoop]: === Iteration 9 === Targeting ULTIMATE.startErr7ASSERT_VIOLATIONMEMORY_LEAK === [P0Err0ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 10 more)] === [2023-11-28 23:56:12,369 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-11-28 23:56:12,369 INFO L85 PathProgramCache]: Analyzing trace with hash -1076392456, now seen corresponding path program 1 times [2023-11-28 23:56:12,370 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2023-11-28 23:56:12,370 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [1614995028] [2023-11-28 23:56:12,370 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-11-28 23:56:12,370 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-28 23:56:12,370 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_2b2f975c-1851-4624-a769-b2c770989b69/bin/uautomizer-verify-BQ2R08f2Ya/mathsat [2023-11-28 23:56:12,371 INFO L229 MonitoredProcess]: Starting monitored process 10 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_2b2f975c-1851-4624-a769-b2c770989b69/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-28 23:56:12,372 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_2b2f975c-1851-4624-a769-b2c770989b69/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-28 23:56:12,476 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-28 23:56:12,480 INFO L262 TraceCheckSpWp]: Trace formula consists of 143 conjuncts, 4 conjunts are in the unsatisfiable core [2023-11-28 23:56:12,482 INFO L285 TraceCheckSpWp]: Computing forward predicates... [2023-11-28 23:56:12,535 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-28 23:56:12,535 INFO L323 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2023-11-28 23:56:12,535 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2023-11-28 23:56:12,536 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [1614995028] [2023-11-28 23:56:12,536 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [1614995028] provided 1 perfect and 0 imperfect interpolant sequences [2023-11-28 23:56:12,536 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-11-28 23:56:12,536 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2023-11-28 23:56:12,536 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [52677749] [2023-11-28 23:56:12,536 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-11-28 23:56:12,537 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2023-11-28 23:56:12,537 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2023-11-28 23:56:12,537 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2023-11-28 23:56:12,538 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2023-11-28 23:56:12,549 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 24 out of 53 [2023-11-28 23:56:12,549 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 51 places, 42 transitions, 118 flow. Second operand has 5 states, 5 states have (on average 27.0) internal successors, (135), 5 states have internal predecessors, (135), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-28 23:56:12,550 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2023-11-28 23:56:12,550 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 24 of 53 [2023-11-28 23:56:12,550 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2023-11-28 23:56:12,853 INFO L124 PetriNetUnfolderBase]: 1038/1844 cut-off events. [2023-11-28 23:56:12,853 INFO L125 PetriNetUnfolderBase]: For 417/417 co-relation queries the response was YES. [2023-11-28 23:56:12,857 INFO L83 FinitePrefix]: Finished finitePrefix Result has 4077 conditions, 1844 events. 1038/1844 cut-off events. For 417/417 co-relation queries the response was YES. Maximal size of possible extension queue 82. Compared 10444 event pairs, 100 based on Foata normal form. 82/1904 useless extension candidates. Maximal degree in co-relation 4064. Up to 697 conditions per place. [2023-11-28 23:56:12,865 INFO L140 encePairwiseOnDemand]: 47/53 looper letters, 54 selfloop transitions, 8 changer transitions 1/78 dead transitions. [2023-11-28 23:56:12,865 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 55 places, 78 transitions, 337 flow [2023-11-28 23:56:12,865 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2023-11-28 23:56:12,865 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 5 states. [2023-11-28 23:56:12,866 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 185 transitions. [2023-11-28 23:56:12,866 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.6981132075471698 [2023-11-28 23:56:12,866 INFO L72 ComplementDD]: Start complementDD. Operand 5 states and 185 transitions. [2023-11-28 23:56:12,866 INFO L73 IsDeterministic]: Start isDeterministic. Operand 5 states and 185 transitions. [2023-11-28 23:56:12,867 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2023-11-28 23:56:12,867 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 5 states and 185 transitions. [2023-11-28 23:56:12,868 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 6 states, 5 states have (on average 37.0) internal successors, (185), 5 states have internal predecessors, (185), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-28 23:56:12,868 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 6 states, 6 states have (on average 53.0) internal successors, (318), 6 states have internal predecessors, (318), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-28 23:56:12,869 INFO L81 ComplementDD]: Finished complementDD. Result has 6 states, 6 states have (on average 53.0) internal successors, (318), 6 states have internal predecessors, (318), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-28 23:56:12,869 INFO L175 Difference]: Start difference. First operand has 51 places, 42 transitions, 118 flow. Second operand 5 states and 185 transitions. [2023-11-28 23:56:12,869 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 55 places, 78 transitions, 337 flow [2023-11-28 23:56:12,870 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 53 places, 78 transitions, 327 flow, removed 1 selfloop flow, removed 2 redundant places. [2023-11-28 23:56:12,871 INFO L231 Difference]: Finished difference. Result has 55 places, 45 transitions, 158 flow [2023-11-28 23:56:12,871 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=53, PETRI_DIFFERENCE_MINUEND_FLOW=110, PETRI_DIFFERENCE_MINUEND_PLACES=49, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=42, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=5, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=34, PETRI_DIFFERENCE_SUBTRAHEND_STATES=5, PETRI_FLOW=158, PETRI_PLACES=55, PETRI_TRANSITIONS=45} [2023-11-28 23:56:12,872 INFO L281 CegarLoopForPetriNet]: 58 programPoint places, -3 predicate places. [2023-11-28 23:56:12,872 INFO L495 AbstractCegarLoop]: Abstraction has has 55 places, 45 transitions, 158 flow [2023-11-28 23:56:12,872 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 27.0) internal successors, (135), 5 states have internal predecessors, (135), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-28 23:56:12,872 INFO L200 CegarLoopForPetriNet]: Found error trace [2023-11-28 23:56:12,872 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-28 23:56:12,875 INFO L540 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_2b2f975c-1851-4624-a769-b2c770989b69/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)] Forceful destruction successful, exit code 0 [2023-11-28 23:56:13,073 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 10 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_2b2f975c-1851-4624-a769-b2c770989b69/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-28 23:56:13,073 INFO L420 AbstractCegarLoop]: === Iteration 10 === Targeting ULTIMATE.startErr7ASSERT_VIOLATIONMEMORY_LEAK === [P0Err0ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 10 more)] === [2023-11-28 23:56:13,073 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-11-28 23:56:13,073 INFO L85 PathProgramCache]: Analyzing trace with hash -1175413868, now seen corresponding path program 1 times [2023-11-28 23:56:13,074 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2023-11-28 23:56:13,074 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [245757641] [2023-11-28 23:56:13,074 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-11-28 23:56:13,074 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-28 23:56:13,074 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_2b2f975c-1851-4624-a769-b2c770989b69/bin/uautomizer-verify-BQ2R08f2Ya/mathsat [2023-11-28 23:56:13,075 INFO L229 MonitoredProcess]: Starting monitored process 11 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_2b2f975c-1851-4624-a769-b2c770989b69/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-28 23:56:13,076 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_2b2f975c-1851-4624-a769-b2c770989b69/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-28 23:56:13,165 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-28 23:56:13,168 INFO L262 TraceCheckSpWp]: Trace formula consists of 153 conjuncts, 5 conjunts are in the unsatisfiable core [2023-11-28 23:56:13,170 INFO L285 TraceCheckSpWp]: Computing forward predicates... [2023-11-28 23:56:13,228 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-28 23:56:13,228 INFO L323 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2023-11-28 23:56:13,229 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2023-11-28 23:56:13,229 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [245757641] [2023-11-28 23:56:13,229 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [245757641] provided 1 perfect and 0 imperfect interpolant sequences [2023-11-28 23:56:13,229 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-11-28 23:56:13,229 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2023-11-28 23:56:13,230 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1524083558] [2023-11-28 23:56:13,230 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-11-28 23:56:13,230 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2023-11-28 23:56:13,230 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2023-11-28 23:56:13,231 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2023-11-28 23:56:13,231 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2023-11-28 23:56:13,239 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 24 out of 53 [2023-11-28 23:56:13,239 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 55 places, 45 transitions, 158 flow. Second operand has 6 states, 6 states have (on average 26.833333333333332) internal successors, (161), 6 states have internal predecessors, (161), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-28 23:56:13,239 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2023-11-28 23:56:13,239 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 24 of 53 [2023-11-28 23:56:13,239 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2023-11-28 23:56:13,543 INFO L124 PetriNetUnfolderBase]: 581/993 cut-off events. [2023-11-28 23:56:13,543 INFO L125 PetriNetUnfolderBase]: For 756/756 co-relation queries the response was YES. [2023-11-28 23:56:13,546 INFO L83 FinitePrefix]: Finished finitePrefix Result has 2527 conditions, 993 events. 581/993 cut-off events. For 756/756 co-relation queries the response was YES. Maximal size of possible extension queue 53. Compared 4567 event pairs, 83 based on Foata normal form. 40/1011 useless extension candidates. Maximal degree in co-relation 2512. Up to 308 conditions per place. [2023-11-28 23:56:13,550 INFO L140 encePairwiseOnDemand]: 47/53 looper letters, 47 selfloop transitions, 11 changer transitions 1/74 dead transitions. [2023-11-28 23:56:13,550 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 60 places, 74 transitions, 344 flow [2023-11-28 23:56:13,551 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2023-11-28 23:56:13,551 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 6 states. [2023-11-28 23:56:13,551 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6 states to 6 states and 205 transitions. [2023-11-28 23:56:13,552 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.6446540880503144 [2023-11-28 23:56:13,552 INFO L72 ComplementDD]: Start complementDD. Operand 6 states and 205 transitions. [2023-11-28 23:56:13,552 INFO L73 IsDeterministic]: Start isDeterministic. Operand 6 states and 205 transitions. [2023-11-28 23:56:13,552 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2023-11-28 23:56:13,552 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 6 states and 205 transitions. [2023-11-28 23:56:13,553 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 7 states, 6 states have (on average 34.166666666666664) internal successors, (205), 6 states have internal predecessors, (205), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-28 23:56:13,554 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 7 states, 7 states have (on average 53.0) internal successors, (371), 7 states have internal predecessors, (371), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-28 23:56:13,554 INFO L81 ComplementDD]: Finished complementDD. Result has 7 states, 7 states have (on average 53.0) internal successors, (371), 7 states have internal predecessors, (371), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-28 23:56:13,554 INFO L175 Difference]: Start difference. First operand has 55 places, 45 transitions, 158 flow. Second operand 6 states and 205 transitions. [2023-11-28 23:56:13,554 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 60 places, 74 transitions, 344 flow [2023-11-28 23:56:13,559 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 56 places, 74 transitions, 319 flow, removed 4 selfloop flow, removed 4 redundant places. [2023-11-28 23:56:13,560 INFO L231 Difference]: Finished difference. Result has 58 places, 45 transitions, 172 flow [2023-11-28 23:56:13,560 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=53, PETRI_DIFFERENCE_MINUEND_FLOW=136, PETRI_DIFFERENCE_MINUEND_PLACES=51, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=45, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=11, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=34, PETRI_DIFFERENCE_SUBTRAHEND_STATES=6, PETRI_FLOW=172, PETRI_PLACES=58, PETRI_TRANSITIONS=45} [2023-11-28 23:56:13,561 INFO L281 CegarLoopForPetriNet]: 58 programPoint places, 0 predicate places. [2023-11-28 23:56:13,561 INFO L495 AbstractCegarLoop]: Abstraction has has 58 places, 45 transitions, 172 flow [2023-11-28 23:56:13,562 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 26.833333333333332) internal successors, (161), 6 states have internal predecessors, (161), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-28 23:56:13,562 INFO L200 CegarLoopForPetriNet]: Found error trace [2023-11-28 23:56:13,562 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] [2023-11-28 23:56:13,565 INFO L552 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_2b2f975c-1851-4624-a769-b2c770989b69/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-28 23:56:13,764 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 11 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_2b2f975c-1851-4624-a769-b2c770989b69/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-28 23:56:13,764 INFO L420 AbstractCegarLoop]: === Iteration 11 === Targeting ULTIMATE.startErr7ASSERT_VIOLATIONMEMORY_LEAK === [P0Err0ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 10 more)] === [2023-11-28 23:56:13,765 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-11-28 23:56:13,765 INFO L85 PathProgramCache]: Analyzing trace with hash 770781800, now seen corresponding path program 1 times [2023-11-28 23:56:13,765 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2023-11-28 23:56:13,765 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [2146784001] [2023-11-28 23:56:13,765 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-11-28 23:56:13,766 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-28 23:56:13,766 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_2b2f975c-1851-4624-a769-b2c770989b69/bin/uautomizer-verify-BQ2R08f2Ya/mathsat [2023-11-28 23:56:13,767 INFO L229 MonitoredProcess]: Starting monitored process 12 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_2b2f975c-1851-4624-a769-b2c770989b69/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-28 23:56:13,767 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_2b2f975c-1851-4624-a769-b2c770989b69/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-28 23:56:13,920 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-28 23:56:13,924 INFO L262 TraceCheckSpWp]: Trace formula consists of 172 conjuncts, 14 conjunts are in the unsatisfiable core [2023-11-28 23:56:13,927 INFO L285 TraceCheckSpWp]: Computing forward predicates... [2023-11-28 23:56:14,399 WARN L876 $PredicateComparison]: unable to prove that (exists ((|v_ULTIMATE.start_main_~#t1491~0#1.base_45| (_ BitVec 32)) (|v_ULTIMATE.start_main_~#t1489~0#1.base_57| (_ BitVec 32)) (|v_ULTIMATE.start_main_~#t1490~0#1.base_53| (_ BitVec 32))) (let ((.cse0 (store |c_ULTIMATE.start_main_old_#valid#1| |v_ULTIMATE.start_main_~#t1489~0#1.base_57| (_ bv1 1)))) (and (= (store (store (store |c_ULTIMATE.start_main_old_#valid#1| |v_ULTIMATE.start_main_~#t1489~0#1.base_57| (_ bv0 1)) |v_ULTIMATE.start_main_~#t1490~0#1.base_53| (_ bv0 1)) |v_ULTIMATE.start_main_~#t1491~0#1.base_45| (_ bv0 1)) |c_#valid|) (= (_ bv0 1) (select .cse0 |v_ULTIMATE.start_main_~#t1490~0#1.base_53|)) (= (select |c_ULTIMATE.start_main_old_#valid#1| |v_ULTIMATE.start_main_~#t1489~0#1.base_57|) (_ bv0 1)) (= (_ bv0 1) (select (store .cse0 |v_ULTIMATE.start_main_~#t1490~0#1.base_53| (_ bv1 1)) |v_ULTIMATE.start_main_~#t1491~0#1.base_45|))))) is different from true [2023-11-28 23:56:14,400 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-28 23:56:14,400 INFO L323 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2023-11-28 23:56:14,401 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2023-11-28 23:56:14,401 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [2146784001] [2023-11-28 23:56:14,401 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [2146784001] provided 1 perfect and 0 imperfect interpolant sequences [2023-11-28 23:56:14,401 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-11-28 23:56:14,401 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2023-11-28 23:56:14,402 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1985035335] [2023-11-28 23:56:14,402 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-11-28 23:56:14,402 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2023-11-28 23:56:14,402 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2023-11-28 23:56:14,403 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2023-11-28 23:56:14,403 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=14, Unknown=1, NotChecked=6, Total=30 [2023-11-28 23:56:14,403 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 18 out of 53 [2023-11-28 23:56:14,404 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 58 places, 45 transitions, 172 flow. Second operand has 6 states, 6 states have (on average 21.333333333333332) internal successors, (128), 6 states have internal predecessors, (128), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-28 23:56:14,404 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2023-11-28 23:56:14,404 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 18 of 53 [2023-11-28 23:56:14,404 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2023-11-28 23:56:14,661 INFO L124 PetriNetUnfolderBase]: 339/690 cut-off events. [2023-11-28 23:56:14,661 INFO L125 PetriNetUnfolderBase]: For 261/273 co-relation queries the response was YES. [2023-11-28 23:56:14,663 INFO L83 FinitePrefix]: Finished finitePrefix Result has 1537 conditions, 690 events. 339/690 cut-off events. For 261/273 co-relation queries the response was YES. Maximal size of possible extension queue 40. Compared 3370 event pairs, 74 based on Foata normal form. 8/662 useless extension candidates. Maximal degree in co-relation 1520. Up to 458 conditions per place. [2023-11-28 23:56:14,665 INFO L140 encePairwiseOnDemand]: 45/53 looper letters, 31 selfloop transitions, 7 changer transitions 0/59 dead transitions. [2023-11-28 23:56:14,666 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 63 places, 59 transitions, 276 flow [2023-11-28 23:56:14,666 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2023-11-28 23:56:14,666 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 6 states. [2023-11-28 23:56:14,667 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6 states to 6 states and 147 transitions. [2023-11-28 23:56:14,667 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.46226415094339623 [2023-11-28 23:56:14,667 INFO L72 ComplementDD]: Start complementDD. Operand 6 states and 147 transitions. [2023-11-28 23:56:14,667 INFO L73 IsDeterministic]: Start isDeterministic. Operand 6 states and 147 transitions. [2023-11-28 23:56:14,668 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2023-11-28 23:56:14,668 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 6 states and 147 transitions. [2023-11-28 23:56:14,668 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 7 states, 6 states have (on average 24.5) internal successors, (147), 6 states have internal predecessors, (147), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-28 23:56:14,669 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 7 states, 7 states have (on average 53.0) internal successors, (371), 7 states have internal predecessors, (371), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-28 23:56:14,669 INFO L81 ComplementDD]: Finished complementDD. Result has 7 states, 7 states have (on average 53.0) internal successors, (371), 7 states have internal predecessors, (371), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-28 23:56:14,669 INFO L175 Difference]: Start difference. First operand has 58 places, 45 transitions, 172 flow. Second operand 6 states and 147 transitions. [2023-11-28 23:56:14,669 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 63 places, 59 transitions, 276 flow [2023-11-28 23:56:14,671 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 55 places, 59 transitions, 220 flow, removed 10 selfloop flow, removed 8 redundant places. [2023-11-28 23:56:14,672 INFO L231 Difference]: Finished difference. Result has 56 places, 48 transitions, 148 flow [2023-11-28 23:56:14,672 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=53, PETRI_DIFFERENCE_MINUEND_FLOW=116, PETRI_DIFFERENCE_MINUEND_PLACES=50, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=45, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=4, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=38, PETRI_DIFFERENCE_SUBTRAHEND_STATES=6, PETRI_FLOW=148, PETRI_PLACES=56, PETRI_TRANSITIONS=48} [2023-11-28 23:56:14,672 INFO L281 CegarLoopForPetriNet]: 58 programPoint places, -2 predicate places. [2023-11-28 23:56:14,672 INFO L495 AbstractCegarLoop]: Abstraction has has 56 places, 48 transitions, 148 flow [2023-11-28 23:56:14,673 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 21.333333333333332) internal successors, (128), 6 states have internal predecessors, (128), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-28 23:56:14,673 INFO L200 CegarLoopForPetriNet]: Found error trace [2023-11-28 23:56:14,673 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] [2023-11-28 23:56:14,676 INFO L552 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_2b2f975c-1851-4624-a769-b2c770989b69/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-28 23:56:14,873 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 12 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_2b2f975c-1851-4624-a769-b2c770989b69/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-28 23:56:14,873 INFO L420 AbstractCegarLoop]: === Iteration 12 === Targeting ULTIMATE.startErr6ASSERT_VIOLATIONMEMORY_LEAK === [P0Err0ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 10 more)] === [2023-11-28 23:56:14,874 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-11-28 23:56:14,874 INFO L85 PathProgramCache]: Analyzing trace with hash -1199556569, now seen corresponding path program 1 times [2023-11-28 23:56:14,874 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2023-11-28 23:56:14,874 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [1802978173] [2023-11-28 23:56:14,874 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-11-28 23:56:14,874 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-28 23:56:14,874 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_2b2f975c-1851-4624-a769-b2c770989b69/bin/uautomizer-verify-BQ2R08f2Ya/mathsat [2023-11-28 23:56:14,875 INFO L229 MonitoredProcess]: Starting monitored process 13 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_2b2f975c-1851-4624-a769-b2c770989b69/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-28 23:56:14,876 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_2b2f975c-1851-4624-a769-b2c770989b69/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-28 23:56:14,985 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-28 23:56:14,990 INFO L262 TraceCheckSpWp]: Trace formula consists of 168 conjuncts, 14 conjunts are in the unsatisfiable core [2023-11-28 23:56:14,992 INFO L285 TraceCheckSpWp]: Computing forward predicates... [2023-11-28 23:56:15,353 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-28 23:56:15,353 INFO L323 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2023-11-28 23:56:15,353 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2023-11-28 23:56:15,354 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [1802978173] [2023-11-28 23:56:15,354 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [1802978173] provided 1 perfect and 0 imperfect interpolant sequences [2023-11-28 23:56:15,354 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-11-28 23:56:15,354 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2023-11-28 23:56:15,354 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [402616270] [2023-11-28 23:56:15,354 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-11-28 23:56:15,354 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 9 states [2023-11-28 23:56:15,355 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2023-11-28 23:56:15,355 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2023-11-28 23:56:15,355 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=18, Invalid=54, Unknown=0, NotChecked=0, Total=72 [2023-11-28 23:56:15,363 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 27 out of 53 [2023-11-28 23:56:15,364 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 56 places, 48 transitions, 148 flow. Second operand has 9 states, 9 states have (on average 28.88888888888889) internal successors, (260), 9 states have internal predecessors, (260), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-28 23:56:15,364 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2023-11-28 23:56:15,364 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 27 of 53 [2023-11-28 23:56:15,364 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2023-11-28 23:56:15,815 INFO L124 PetriNetUnfolderBase]: 499/976 cut-off events. [2023-11-28 23:56:15,815 INFO L125 PetriNetUnfolderBase]: For 319/355 co-relation queries the response was YES. [2023-11-28 23:56:15,817 INFO L83 FinitePrefix]: Finished finitePrefix Result has 2322 conditions, 976 events. 499/976 cut-off events. For 319/355 co-relation queries the response was YES. Maximal size of possible extension queue 61. Compared 5070 event pairs, 94 based on Foata normal form. 8/942 useless extension candidates. Maximal degree in co-relation 2309. Up to 373 conditions per place. [2023-11-28 23:56:15,820 INFO L140 encePairwiseOnDemand]: 44/53 looper letters, 59 selfloop transitions, 9 changer transitions 0/92 dead transitions. [2023-11-28 23:56:15,820 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 64 places, 92 transitions, 434 flow [2023-11-28 23:56:15,821 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2023-11-28 23:56:15,821 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 9 states. [2023-11-28 23:56:15,822 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 9 states to 9 states and 306 transitions. [2023-11-28 23:56:15,822 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.6415094339622641 [2023-11-28 23:56:15,822 INFO L72 ComplementDD]: Start complementDD. Operand 9 states and 306 transitions. [2023-11-28 23:56:15,822 INFO L73 IsDeterministic]: Start isDeterministic. Operand 9 states and 306 transitions. [2023-11-28 23:56:15,823 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2023-11-28 23:56:15,823 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 9 states and 306 transitions. [2023-11-28 23:56:15,824 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 10 states, 9 states have (on average 34.0) internal successors, (306), 9 states have internal predecessors, (306), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-28 23:56:15,825 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 10 states, 10 states have (on average 53.0) internal successors, (530), 10 states have internal predecessors, (530), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-28 23:56:15,826 INFO L81 ComplementDD]: Finished complementDD. Result has 10 states, 10 states have (on average 53.0) internal successors, (530), 10 states have internal predecessors, (530), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-28 23:56:15,826 INFO L175 Difference]: Start difference. First operand has 56 places, 48 transitions, 148 flow. Second operand 9 states and 306 transitions. [2023-11-28 23:56:15,826 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 64 places, 92 transitions, 434 flow [2023-11-28 23:56:15,828 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 60 places, 92 transitions, 412 flow, removed 0 selfloop flow, removed 4 redundant places. [2023-11-28 23:56:15,829 INFO L231 Difference]: Finished difference. Result has 64 places, 53 transitions, 188 flow [2023-11-28 23:56:15,830 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=53, PETRI_DIFFERENCE_MINUEND_FLOW=138, PETRI_DIFFERENCE_MINUEND_PLACES=52, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=48, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=4, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=40, PETRI_DIFFERENCE_SUBTRAHEND_STATES=9, PETRI_FLOW=188, PETRI_PLACES=64, PETRI_TRANSITIONS=53} [2023-11-28 23:56:15,830 INFO L281 CegarLoopForPetriNet]: 58 programPoint places, 6 predicate places. [2023-11-28 23:56:15,830 INFO L495 AbstractCegarLoop]: Abstraction has has 64 places, 53 transitions, 188 flow [2023-11-28 23:56:15,831 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 9 states, 9 states have (on average 28.88888888888889) internal successors, (260), 9 states have internal predecessors, (260), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-28 23:56:15,831 INFO L200 CegarLoopForPetriNet]: Found error trace [2023-11-28 23:56:15,831 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] [2023-11-28 23:56:15,834 INFO L552 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_2b2f975c-1851-4624-a769-b2c770989b69/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-28 23:56:16,032 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 13 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_2b2f975c-1851-4624-a769-b2c770989b69/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-28 23:56:16,033 INFO L420 AbstractCegarLoop]: === Iteration 13 === Targeting ULTIMATE.startErr6ASSERT_VIOLATIONMEMORY_LEAK === [P0Err0ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 10 more)] === [2023-11-28 23:56:16,033 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-11-28 23:56:16,033 INFO L85 PathProgramCache]: Analyzing trace with hash 1555197121, now seen corresponding path program 2 times [2023-11-28 23:56:16,033 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2023-11-28 23:56:16,033 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [626146529] [2023-11-28 23:56:16,034 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2023-11-28 23:56:16,034 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-28 23:56:16,034 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_2b2f975c-1851-4624-a769-b2c770989b69/bin/uautomizer-verify-BQ2R08f2Ya/mathsat [2023-11-28 23:56:16,035 INFO L229 MonitoredProcess]: Starting monitored process 14 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_2b2f975c-1851-4624-a769-b2c770989b69/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-28 23:56:16,035 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_2b2f975c-1851-4624-a769-b2c770989b69/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-28 23:56:16,130 INFO L228 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 1 check-sat command(s) [2023-11-28 23:56:16,130 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2023-11-28 23:56:16,134 INFO L262 TraceCheckSpWp]: Trace formula consists of 168 conjuncts, 5 conjunts are in the unsatisfiable core [2023-11-28 23:56:16,136 INFO L285 TraceCheckSpWp]: Computing forward predicates... [2023-11-28 23:56:16,169 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-28 23:56:16,169 INFO L323 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2023-11-28 23:56:16,169 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2023-11-28 23:56:16,170 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [626146529] [2023-11-28 23:56:16,170 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [626146529] provided 1 perfect and 0 imperfect interpolant sequences [2023-11-28 23:56:16,170 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-11-28 23:56:16,170 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2023-11-28 23:56:16,170 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2063423819] [2023-11-28 23:56:16,170 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-11-28 23:56:16,170 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2023-11-28 23:56:16,171 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2023-11-28 23:56:16,171 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2023-11-28 23:56:16,171 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2023-11-28 23:56:16,183 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 25 out of 53 [2023-11-28 23:56:16,183 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 64 places, 53 transitions, 188 flow. Second operand has 5 states, 5 states have (on average 28.8) internal successors, (144), 5 states have internal predecessors, (144), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-28 23:56:16,183 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2023-11-28 23:56:16,183 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 25 of 53 [2023-11-28 23:56:16,183 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2023-11-28 23:56:16,546 INFO L124 PetriNetUnfolderBase]: 1095/2083 cut-off events. [2023-11-28 23:56:16,546 INFO L125 PetriNetUnfolderBase]: For 971/1031 co-relation queries the response was YES. [2023-11-28 23:56:16,552 INFO L83 FinitePrefix]: Finished finitePrefix Result has 5297 conditions, 2083 events. 1095/2083 cut-off events. For 971/1031 co-relation queries the response was YES. Maximal size of possible extension queue 124. Compared 12562 event pairs, 471 based on Foata normal form. 12/1996 useless extension candidates. Maximal degree in co-relation 5280. Up to 905 conditions per place. [2023-11-28 23:56:16,560 INFO L140 encePairwiseOnDemand]: 47/53 looper letters, 55 selfloop transitions, 8 changer transitions 0/85 dead transitions. [2023-11-28 23:56:16,561 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 68 places, 85 transitions, 442 flow [2023-11-28 23:56:16,561 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2023-11-28 23:56:16,561 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 5 states. [2023-11-28 23:56:16,562 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 173 transitions. [2023-11-28 23:56:16,562 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.6528301886792452 [2023-11-28 23:56:16,562 INFO L72 ComplementDD]: Start complementDD. Operand 5 states and 173 transitions. [2023-11-28 23:56:16,562 INFO L73 IsDeterministic]: Start isDeterministic. Operand 5 states and 173 transitions. [2023-11-28 23:56:16,563 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2023-11-28 23:56:16,563 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 5 states and 173 transitions. [2023-11-28 23:56:16,563 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 6 states, 5 states have (on average 34.6) internal successors, (173), 5 states have internal predecessors, (173), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-28 23:56:16,564 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 6 states, 6 states have (on average 53.0) internal successors, (318), 6 states have internal predecessors, (318), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-28 23:56:16,565 INFO L81 ComplementDD]: Finished complementDD. Result has 6 states, 6 states have (on average 53.0) internal successors, (318), 6 states have internal predecessors, (318), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-28 23:56:16,565 INFO L175 Difference]: Start difference. First operand has 64 places, 53 transitions, 188 flow. Second operand 5 states and 173 transitions. [2023-11-28 23:56:16,565 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 68 places, 85 transitions, 442 flow [2023-11-28 23:56:16,569 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 65 places, 85 transitions, 434 flow, removed 0 selfloop flow, removed 3 redundant places. [2023-11-28 23:56:16,570 INFO L231 Difference]: Finished difference. Result has 68 places, 60 transitions, 264 flow [2023-11-28 23:56:16,571 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=53, PETRI_DIFFERENCE_MINUEND_FLOW=182, PETRI_DIFFERENCE_MINUEND_PLACES=61, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=53, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=1, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=45, PETRI_DIFFERENCE_SUBTRAHEND_STATES=5, PETRI_FLOW=264, PETRI_PLACES=68, PETRI_TRANSITIONS=60} [2023-11-28 23:56:16,571 INFO L281 CegarLoopForPetriNet]: 58 programPoint places, 10 predicate places. [2023-11-28 23:56:16,571 INFO L495 AbstractCegarLoop]: Abstraction has has 68 places, 60 transitions, 264 flow [2023-11-28 23:56:16,572 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 28.8) internal successors, (144), 5 states have internal predecessors, (144), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-28 23:56:16,572 INFO L200 CegarLoopForPetriNet]: Found error trace [2023-11-28 23:56:16,572 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] [2023-11-28 23:56:16,575 INFO L552 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_2b2f975c-1851-4624-a769-b2c770989b69/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)] Ended with exit code 0 [2023-11-28 23:56:16,772 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 14 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_2b2f975c-1851-4624-a769-b2c770989b69/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-28 23:56:16,772 INFO L420 AbstractCegarLoop]: === Iteration 14 === Targeting ULTIMATE.startErr6ASSERT_VIOLATIONMEMORY_LEAK === [P0Err0ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 10 more)] === [2023-11-28 23:56:16,773 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-11-28 23:56:16,773 INFO L85 PathProgramCache]: Analyzing trace with hash 1640208645, now seen corresponding path program 3 times [2023-11-28 23:56:16,773 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2023-11-28 23:56:16,773 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [956759864] [2023-11-28 23:56:16,773 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST2 [2023-11-28 23:56:16,774 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-28 23:56:16,774 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_2b2f975c-1851-4624-a769-b2c770989b69/bin/uautomizer-verify-BQ2R08f2Ya/mathsat [2023-11-28 23:56:16,775 INFO L229 MonitoredProcess]: Starting monitored process 15 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_2b2f975c-1851-4624-a769-b2c770989b69/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-28 23:56:16,776 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_2b2f975c-1851-4624-a769-b2c770989b69/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-28 23:56:16,881 INFO L228 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued 1 check-sat command(s) [2023-11-28 23:56:16,881 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2023-11-28 23:56:16,885 INFO L262 TraceCheckSpWp]: Trace formula consists of 168 conjuncts, 5 conjunts are in the unsatisfiable core [2023-11-28 23:56:16,886 INFO L285 TraceCheckSpWp]: Computing forward predicates... [2023-11-28 23:56:16,917 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-28 23:56:16,918 INFO L323 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2023-11-28 23:56:16,918 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2023-11-28 23:56:16,918 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [956759864] [2023-11-28 23:56:16,918 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [956759864] provided 1 perfect and 0 imperfect interpolant sequences [2023-11-28 23:56:16,918 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-11-28 23:56:16,918 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2023-11-28 23:56:16,919 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1624752481] [2023-11-28 23:56:16,919 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-11-28 23:56:16,919 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2023-11-28 23:56:16,919 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2023-11-28 23:56:16,920 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2023-11-28 23:56:16,920 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2023-11-28 23:56:16,931 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 25 out of 53 [2023-11-28 23:56:16,931 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 68 places, 60 transitions, 264 flow. Second operand has 5 states, 5 states have (on average 28.8) internal successors, (144), 5 states have internal predecessors, (144), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-28 23:56:16,931 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2023-11-28 23:56:16,931 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 25 of 53 [2023-11-28 23:56:16,931 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2023-11-28 23:56:17,420 INFO L124 PetriNetUnfolderBase]: 2020/3736 cut-off events. [2023-11-28 23:56:17,420 INFO L125 PetriNetUnfolderBase]: For 2213/2285 co-relation queries the response was YES. [2023-11-28 23:56:17,433 INFO L83 FinitePrefix]: Finished finitePrefix Result has 9873 conditions, 3736 events. 2020/3736 cut-off events. For 2213/2285 co-relation queries the response was YES. Maximal size of possible extension queue 247. Compared 24771 event pairs, 726 based on Foata normal form. 8/3604 useless extension candidates. Maximal degree in co-relation 9854. Up to 1520 conditions per place. [2023-11-28 23:56:17,447 INFO L140 encePairwiseOnDemand]: 47/53 looper letters, 60 selfloop transitions, 14 changer transitions 0/97 dead transitions. [2023-11-28 23:56:17,447 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 72 places, 97 transitions, 604 flow [2023-11-28 23:56:17,448 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2023-11-28 23:56:17,448 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 5 states. [2023-11-28 23:56:17,449 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 172 transitions. [2023-11-28 23:56:17,449 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.6490566037735849 [2023-11-28 23:56:17,449 INFO L72 ComplementDD]: Start complementDD. Operand 5 states and 172 transitions. [2023-11-28 23:56:17,449 INFO L73 IsDeterministic]: Start isDeterministic. Operand 5 states and 172 transitions. [2023-11-28 23:56:17,449 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2023-11-28 23:56:17,450 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 5 states and 172 transitions. [2023-11-28 23:56:17,450 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 6 states, 5 states have (on average 34.4) internal successors, (172), 5 states have internal predecessors, (172), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-28 23:56:17,451 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 6 states, 6 states have (on average 53.0) internal successors, (318), 6 states have internal predecessors, (318), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-28 23:56:17,451 INFO L81 ComplementDD]: Finished complementDD. Result has 6 states, 6 states have (on average 53.0) internal successors, (318), 6 states have internal predecessors, (318), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-28 23:56:17,451 INFO L175 Difference]: Start difference. First operand has 68 places, 60 transitions, 264 flow. Second operand 5 states and 172 transitions. [2023-11-28 23:56:17,451 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 72 places, 97 transitions, 604 flow [2023-11-28 23:56:17,460 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 71 places, 97 transitions, 602 flow, removed 0 selfloop flow, removed 1 redundant places. [2023-11-28 23:56:17,462 INFO L231 Difference]: Finished difference. Result has 74 places, 73 transitions, 450 flow [2023-11-28 23:56:17,462 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=53, PETRI_DIFFERENCE_MINUEND_FLOW=262, PETRI_DIFFERENCE_MINUEND_PLACES=67, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=60, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=1, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=46, PETRI_DIFFERENCE_SUBTRAHEND_STATES=5, PETRI_FLOW=450, PETRI_PLACES=74, PETRI_TRANSITIONS=73} [2023-11-28 23:56:17,462 INFO L281 CegarLoopForPetriNet]: 58 programPoint places, 16 predicate places. [2023-11-28 23:56:17,463 INFO L495 AbstractCegarLoop]: Abstraction has has 74 places, 73 transitions, 450 flow [2023-11-28 23:56:17,463 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 28.8) internal successors, (144), 5 states have internal predecessors, (144), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-28 23:56:17,463 INFO L200 CegarLoopForPetriNet]: Found error trace [2023-11-28 23:56:17,463 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] [2023-11-28 23:56:17,466 INFO L552 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_2b2f975c-1851-4624-a769-b2c770989b69/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-28 23:56:17,664 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 15 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_2b2f975c-1851-4624-a769-b2c770989b69/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-28 23:56:17,665 INFO L420 AbstractCegarLoop]: === Iteration 15 === Targeting ULTIMATE.startErr6ASSERT_VIOLATIONMEMORY_LEAK === [P0Err0ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 10 more)] === [2023-11-28 23:56:17,665 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-11-28 23:56:17,665 INFO L85 PathProgramCache]: Analyzing trace with hash 1098456649, now seen corresponding path program 4 times [2023-11-28 23:56:17,665 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2023-11-28 23:56:17,665 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [201818523] [2023-11-28 23:56:17,665 INFO L93 rtionOrderModulation]: Changing assertion order to TERMS_WITH_SMALL_CONSTANTS_FIRST [2023-11-28 23:56:17,666 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-28 23:56:17,666 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_2b2f975c-1851-4624-a769-b2c770989b69/bin/uautomizer-verify-BQ2R08f2Ya/mathsat [2023-11-28 23:56:17,666 INFO L229 MonitoredProcess]: Starting monitored process 16 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_2b2f975c-1851-4624-a769-b2c770989b69/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-28 23:56:17,667 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_2b2f975c-1851-4624-a769-b2c770989b69/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 (16)] Waiting until timeout for monitored process [2023-11-28 23:56:17,804 INFO L228 tOrderPrioritization]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 0 check-sat command(s) [2023-11-28 23:56:17,804 INFO L229 tOrderPrioritization]: Conjunction of SSA is sat [2023-11-28 23:56:17,804 INFO L356 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2023-11-28 23:56:17,894 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2023-11-28 23:56:17,957 INFO L130 FreeRefinementEngine]: Strategy WOLF found a feasible trace [2023-11-28 23:56:17,957 INFO L360 BasicCegarLoop]: Counterexample is feasible [2023-11-28 23:56:17,958 INFO L805 garLoopResultBuilder]: Registering result UNSAFE for location ULTIMATE.startErr6ASSERT_VIOLATIONMEMORY_LEAK (12 of 13 remaining) [2023-11-28 23:56:17,960 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location P0Err0ASSERT_VIOLATIONMEMORY_LEAK (11 of 13 remaining) [2023-11-28 23:56:17,960 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE (10 of 13 remaining) [2023-11-28 23:56:17,960 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE (9 of 13 remaining) [2023-11-28 23:56:17,960 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (8 of 13 remaining) [2023-11-28 23:56:17,960 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr3REQUIRES_VIOLATIONMEMORY_DEREFERENCE (7 of 13 remaining) [2023-11-28 23:56:17,960 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr4REQUIRES_VIOLATIONMEMORY_DEREFERENCE (6 of 13 remaining) [2023-11-28 23:56:17,960 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr5REQUIRES_VIOLATIONMEMORY_DEREFERENCE (5 of 13 remaining) [2023-11-28 23:56:17,961 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr7ASSERT_VIOLATIONMEMORY_LEAK (4 of 13 remaining) [2023-11-28 23:56:17,961 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (3 of 13 remaining) [2023-11-28 23:56:17,961 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (2 of 13 remaining) [2023-11-28 23:56:17,961 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr2INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (1 of 13 remaining) [2023-11-28 23:56:17,961 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location P0Err0ASSERT_VIOLATIONMEMORY_LEAK (0 of 13 remaining) [2023-11-28 23:56:17,965 INFO L552 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_2b2f975c-1851-4624-a769-b2c770989b69/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 (16)] Ended with exit code 0 [2023-11-28 23:56:18,161 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 16 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_2b2f975c-1851-4624-a769-b2c770989b69/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-28 23:56:18,162 INFO L445 BasicCegarLoop]: Path program histogram: [4, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-11-28 23:56:18,167 INFO L228 ceAbstractionStarter]: Analysis of concurrent program completed with 1 thread instances [2023-11-28 23:56:18,167 INFO L178 ceAbstractionStarter]: Computing trace abstraction results [2023-11-28 23:56:18,217 WARN L1572 BoogieBacktranslator]: Unfinished Backtranslation: IdentifierExpression #t~pre5 could not be translated [2023-11-28 23:56:18,220 WARN L1572 BoogieBacktranslator]: Unfinished Backtranslation: IdentifierExpression #t~pre7 could not be translated [2023-11-28 23:56:18,221 WARN L1572 BoogieBacktranslator]: Unfinished Backtranslation: IdentifierExpression #t~pre9 could not be translated [2023-11-28 23:56:18,232 WARN L1572 BoogieBacktranslator]: Unfinished Backtranslation: unknown boogie variable #t~nondet0 [2023-11-28 23:56:18,233 WARN L1572 BoogieBacktranslator]: Unfinished Backtranslation: unknown boogie variable #t~nondet0 [2023-11-28 23:56:18,245 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 28.11 11:56:18 BasicIcfg [2023-11-28 23:56:18,245 INFO L131 PluginConnector]: ------------------------ END TraceAbstraction---------------------------- [2023-11-28 23:56:18,245 INFO L112 PluginConnector]: ------------------------Witness Printer---------------------------- [2023-11-28 23:56:18,245 INFO L270 PluginConnector]: Initializing Witness Printer... [2023-11-28 23:56:18,246 INFO L274 PluginConnector]: Witness Printer initialized [2023-11-28 23:56:18,246 INFO L184 PluginConnector]: Executing the observer RCFGCatcher from plugin Witness Printer for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 28.11 11:56:06" (3/4) ... [2023-11-28 23:56:18,247 INFO L140 WitnessPrinter]: No result that supports witness generation found [2023-11-28 23:56:18,248 INFO L131 PluginConnector]: ------------------------ END Witness Printer---------------------------- [2023-11-28 23:56:18,248 INFO L158 Benchmark]: Toolchain (without parser) took 13376.23ms. Allocated memory was 77.6MB in the beginning and 339.7MB in the end (delta: 262.1MB). Free memory was 48.9MB in the beginning and 165.9MB in the end (delta: -117.0MB). Peak memory consumption was 146.0MB. Max. memory is 16.1GB. [2023-11-28 23:56:18,249 INFO L158 Benchmark]: CDTParser took 0.26ms. Allocated memory is still 56.6MB. Free memory is still 33.5MB. There was no memory consumed. Max. memory is 16.1GB. [2023-11-28 23:56:18,249 INFO L158 Benchmark]: CACSL2BoogieTranslator took 516.51ms. Allocated memory is still 77.6MB. Free memory was 48.7MB in the beginning and 42.3MB in the end (delta: 6.4MB). Peak memory consumption was 12.6MB. Max. memory is 16.1GB. [2023-11-28 23:56:18,249 INFO L158 Benchmark]: Boogie Procedure Inliner took 52.23ms. Allocated memory is still 77.6MB. Free memory was 42.3MB in the beginning and 39.8MB in the end (delta: 2.6MB). Peak memory consumption was 2.1MB. Max. memory is 16.1GB. [2023-11-28 23:56:18,250 INFO L158 Benchmark]: Boogie Preprocessor took 55.45ms. Allocated memory is still 77.6MB. Free memory was 39.8MB in the beginning and 36.2MB in the end (delta: 3.6MB). Peak memory consumption was 4.2MB. Max. memory is 16.1GB. [2023-11-28 23:56:18,250 INFO L158 Benchmark]: RCFGBuilder took 779.37ms. Allocated memory was 77.6MB in the beginning and 94.4MB in the end (delta: 16.8MB). Free memory was 36.2MB in the beginning and 68.2MB in the end (delta: -32.0MB). Peak memory consumption was 14.8MB. Max. memory is 16.1GB. [2023-11-28 23:56:18,251 INFO L158 Benchmark]: TraceAbstraction took 11962.98ms. Allocated memory was 94.4MB in the beginning and 339.7MB in the end (delta: 245.4MB). Free memory was 67.6MB in the beginning and 165.9MB in the end (delta: -98.3MB). Peak memory consumption was 147.1MB. Max. memory is 16.1GB. [2023-11-28 23:56:18,251 INFO L158 Benchmark]: Witness Printer took 2.62ms. Allocated memory is still 339.7MB. Free memory is still 165.9MB. There was no memory consumed. Max. memory is 16.1GB. [2023-11-28 23:56:18,252 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.26ms. Allocated memory is still 56.6MB. Free memory is still 33.5MB. There was no memory consumed. Max. memory is 16.1GB. * CACSL2BoogieTranslator took 516.51ms. Allocated memory is still 77.6MB. Free memory was 48.7MB in the beginning and 42.3MB in the end (delta: 6.4MB). Peak memory consumption was 12.6MB. Max. memory is 16.1GB. * Boogie Procedure Inliner took 52.23ms. Allocated memory is still 77.6MB. Free memory was 42.3MB in the beginning and 39.8MB in the end (delta: 2.6MB). Peak memory consumption was 2.1MB. Max. memory is 16.1GB. * Boogie Preprocessor took 55.45ms. Allocated memory is still 77.6MB. Free memory was 39.8MB in the beginning and 36.2MB in the end (delta: 3.6MB). Peak memory consumption was 4.2MB. Max. memory is 16.1GB. * RCFGBuilder took 779.37ms. Allocated memory was 77.6MB in the beginning and 94.4MB in the end (delta: 16.8MB). Free memory was 36.2MB in the beginning and 68.2MB in the end (delta: -32.0MB). Peak memory consumption was 14.8MB. Max. memory is 16.1GB. * TraceAbstraction took 11962.98ms. Allocated memory was 94.4MB in the beginning and 339.7MB in the end (delta: 245.4MB). Free memory was 67.6MB in the beginning and 165.9MB in the end (delta: -98.3MB). Peak memory consumption was 147.1MB. Max. memory is 16.1GB. * Witness Printer took 2.62ms. Allocated memory is still 339.7MB. Free memory is still 165.9MB. There was no memory consumed. Max. memory is 16.1GB. * Results from de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator: - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: IdentifierExpression #t~pre5 could not be translated - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: IdentifierExpression #t~pre7 could not be translated - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: IdentifierExpression #t~pre9 could not be translated - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: unknown boogie variable #t~nondet0 - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: unknown boogie variable #t~nondet0 - GenericResult: Unfinished Backtranslation The program execution was not completely translated back. * Results from de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: - UnprovableResult [Line: 17]: Unable to prove that all allocated memory was freed Unable to prove that all allocated memory was freed Reason: overapproximation of memtrack at line 17. Possible FailurePath: [L709] 0 int __unbuffered_cnt = 0; [L711] 0 int __unbuffered_p2_EAX = 0; [L712] 0 _Bool main$tmp_guard0; [L713] 0 _Bool main$tmp_guard1; [L715] 0 int x = 0; [L717] 0 int y = 0; [L719] 0 int z = 0; [L720] 0 _Bool z$flush_delayed; [L721] 0 int z$mem_tmp; [L722] 0 _Bool z$r_buff0_thd0; [L723] 0 _Bool z$r_buff0_thd1; [L724] 0 _Bool z$r_buff0_thd2; [L725] 0 _Bool z$r_buff0_thd3; [L726] 0 _Bool z$r_buff1_thd0; [L727] 0 _Bool z$r_buff1_thd1; [L728] 0 _Bool z$r_buff1_thd2; [L729] 0 _Bool z$r_buff1_thd3; [L730] 0 _Bool z$read_delayed; [L731] 0 int *z$read_delayed_var; [L732] 0 int z$w_buff0; [L733] 0 _Bool z$w_buff0_used; [L734] 0 int z$w_buff1; [L735] 0 _Bool z$w_buff1_used; [L736] 0 _Bool weak$$choice0; [L737] 0 _Bool weak$$choice2; [L831] 0 pthread_t t1489; [L832] FCALL, FORK 0 pthread_create(&t1489, ((void *)0), P0, ((void *)0)) VAL [__unbuffered_cnt=0, __unbuffered_p2_EAX=0, main$tmp_guard0=0, main$tmp_guard1=0, t1489={3:0}, weak$$choice0=0, weak$$choice2=0, x=0, y=0, z$flush_delayed=0, z$mem_tmp=0, z$r_buff0_thd0=0, z$r_buff0_thd1=0, z$r_buff0_thd2=0, z$r_buff0_thd3=0, z$r_buff1_thd0=0, z$r_buff1_thd1=0, z$r_buff1_thd2=0, z$r_buff1_thd3=0, z$read_delayed=0, z$read_delayed_var={0:0}, z$w_buff0=0, z$w_buff0_used=0, z$w_buff1=0, z$w_buff1_used=0, z=0] [L741] 1 z$w_buff1 = z$w_buff0 [L742] 1 z$w_buff0 = 1 [L743] 1 z$w_buff1_used = z$w_buff0_used [L744] 1 z$w_buff0_used = (_Bool)1 [L745] CALL 1 __VERIFIER_assert(!(z$w_buff1_used && z$w_buff0_used)) [L18] COND FALSE 1 !(!expression) [L745] RET 1 __VERIFIER_assert(!(z$w_buff1_used && z$w_buff0_used)) [L746] 1 z$r_buff1_thd0 = z$r_buff0_thd0 [L747] 1 z$r_buff1_thd1 = z$r_buff0_thd1 [L748] 1 z$r_buff1_thd2 = z$r_buff0_thd2 [L749] 1 z$r_buff1_thd3 = z$r_buff0_thd3 [L750] 1 z$r_buff0_thd1 = (_Bool)1 VAL [__unbuffered_cnt=0, __unbuffered_p2_EAX=0, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=0, x=0, y=0, z$flush_delayed=0, z$mem_tmp=0, z$r_buff0_thd0=0, z$r_buff0_thd1=1, z$r_buff0_thd2=0, z$r_buff0_thd3=0, z$r_buff1_thd0=0, z$r_buff1_thd1=0, z$r_buff1_thd2=0, z$r_buff1_thd3=0, z$read_delayed=0, z$read_delayed_var={0:0}, z$w_buff0=1, z$w_buff0_used=1, z$w_buff1=0, z$w_buff1_used=0, z=0] [L833] 0 pthread_t t1490; [L834] FCALL, FORK 0 pthread_create(&t1490, ((void *)0), P1, ((void *)0)) VAL [__unbuffered_cnt=0, __unbuffered_p2_EAX=0, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, t1489={3:0}, t1490={6:0}, weak$$choice0=0, weak$$choice2=0, x=0, y=0, z$flush_delayed=0, z$mem_tmp=0, z$r_buff0_thd0=0, z$r_buff0_thd1=1, z$r_buff0_thd2=0, z$r_buff0_thd3=0, z$r_buff1_thd0=0, z$r_buff1_thd1=0, z$r_buff1_thd2=0, z$r_buff1_thd3=0, z$read_delayed=0, z$read_delayed_var={0:0}, z$w_buff0=1, z$w_buff0_used=1, z$w_buff1=0, z$w_buff1_used=0, z=0] [L835] 0 pthread_t t1491; [L836] FCALL, FORK 0 pthread_create(&t1491, ((void *)0), P2, ((void *)0)) VAL [__unbuffered_cnt=0, __unbuffered_p2_EAX=0, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, t1489={3:0}, t1490={6:0}, t1491={7:0}, weak$$choice0=0, weak$$choice2=0, x=0, y=0, z$flush_delayed=0, z$mem_tmp=0, z$r_buff0_thd0=0, z$r_buff0_thd1=1, z$r_buff0_thd2=0, z$r_buff0_thd3=0, z$r_buff1_thd0=0, z$r_buff1_thd1=0, z$r_buff1_thd2=0, z$r_buff1_thd3=0, z$read_delayed=0, z$read_delayed_var={0:0}, z$w_buff0=1, z$w_buff0_used=1, z$w_buff1=0, z$w_buff1_used=0, z=0] [L753] 1 x = 1 VAL [__unbuffered_cnt=0, __unbuffered_p2_EAX=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=0, z$flush_delayed=0, z$mem_tmp=0, z$r_buff0_thd0=0, z$r_buff0_thd1=1, z$r_buff0_thd2=0, z$r_buff0_thd3=0, z$r_buff1_thd0=0, z$r_buff1_thd1=0, z$r_buff1_thd2=0, z$r_buff1_thd3=0, z$read_delayed=0, z$read_delayed_var={0:0}, z$w_buff0=1, z$w_buff0_used=1, z$w_buff1=0, z$w_buff1_used=0, z=0] [L770] 2 x = 2 VAL [__unbuffered_cnt=0, __unbuffered_p2_EAX=0, arg={0:0}, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=0, x=2, y=0, z$flush_delayed=0, z$mem_tmp=0, z$r_buff0_thd0=0, z$r_buff0_thd1=1, z$r_buff0_thd2=0, z$r_buff0_thd3=0, z$r_buff1_thd0=0, z$r_buff1_thd1=0, z$r_buff1_thd2=0, z$r_buff1_thd3=0, z$read_delayed=0, z$read_delayed_var={0:0}, z$w_buff0=1, z$w_buff0_used=1, z$w_buff1=0, z$w_buff1_used=0, z=0] [L773] 2 y = 1 VAL [__unbuffered_cnt=0, __unbuffered_p2_EAX=0, arg={0:0}, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=0, x=2, y=1, z$flush_delayed=0, z$mem_tmp=0, z$r_buff0_thd0=0, z$r_buff0_thd1=1, z$r_buff0_thd2=0, z$r_buff0_thd3=0, z$r_buff1_thd0=0, z$r_buff1_thd1=0, z$r_buff1_thd2=0, z$r_buff1_thd3=0, z$read_delayed=0, z$read_delayed_var={0:0}, z$w_buff0=1, z$w_buff0_used=1, z$w_buff1=0, z$w_buff1_used=0, z=0] [L776] 2 z = z$w_buff0_used && z$r_buff0_thd2 ? z$w_buff0 : (z$w_buff1_used && z$r_buff1_thd2 ? z$w_buff1 : z) [L777] 2 z$w_buff0_used = z$w_buff0_used && z$r_buff0_thd2 ? (_Bool)0 : z$w_buff0_used [L778] 2 z$w_buff1_used = z$w_buff0_used && z$r_buff0_thd2 || z$w_buff1_used && z$r_buff1_thd2 ? (_Bool)0 : z$w_buff1_used [L779] 2 z$r_buff0_thd2 = z$w_buff0_used && z$r_buff0_thd2 ? (_Bool)0 : z$r_buff0_thd2 [L780] 2 z$r_buff1_thd2 = z$w_buff0_used && z$r_buff0_thd2 || z$w_buff1_used && z$r_buff1_thd2 ? (_Bool)0 : z$r_buff1_thd2 VAL [__unbuffered_cnt=0, __unbuffered_p2_EAX=0, arg={0:0}, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=0, x=2, y=1, z$flush_delayed=0, z$mem_tmp=0, z$r_buff0_thd0=0, z$r_buff0_thd1=1, z$r_buff0_thd2=0, z$r_buff0_thd3=0, z$r_buff1_thd0=0, z$r_buff1_thd1=0, z$r_buff1_thd2=0, z$r_buff1_thd3=0, z$read_delayed=0, z$read_delayed_var={0:0}, z$w_buff0=1, z$w_buff0_used=1, z$w_buff1=0, z$w_buff1_used=0, z=0] [L790] 3 y = 2 VAL [__unbuffered_cnt=0, __unbuffered_p2_EAX=0, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=0, x=2, y=2, z$flush_delayed=0, z$mem_tmp=0, z$r_buff0_thd0=0, z$r_buff0_thd1=1, z$r_buff0_thd2=0, z$r_buff0_thd3=0, z$r_buff1_thd0=0, z$r_buff1_thd1=0, z$r_buff1_thd2=0, z$r_buff1_thd3=0, z$read_delayed=0, z$read_delayed_var={0:0}, z$w_buff0=1, z$w_buff0_used=1, z$w_buff1=0, z$w_buff1_used=0, z=0] [L793] 3 weak$$choice0 = __VERIFIER_nondet_bool() [L794] 3 weak$$choice2 = __VERIFIER_nondet_bool() [L795] 3 z$flush_delayed = weak$$choice2 [L796] 3 z$mem_tmp = z [L797] 3 z = !z$w_buff0_used || !z$r_buff0_thd3 && !z$w_buff1_used || !z$r_buff0_thd3 && !z$r_buff1_thd3 ? z : (z$w_buff0_used && z$r_buff0_thd3 ? z$w_buff0 : z$w_buff1) [L798] 3 z$w_buff0 = weak$$choice2 ? z$w_buff0 : (!z$w_buff0_used || !z$r_buff0_thd3 && !z$w_buff1_used || !z$r_buff0_thd3 && !z$r_buff1_thd3 ? z$w_buff0 : (z$w_buff0_used && z$r_buff0_thd3 ? z$w_buff0 : z$w_buff0)) [L799] 3 z$w_buff1 = weak$$choice2 ? z$w_buff1 : (!z$w_buff0_used || !z$r_buff0_thd3 && !z$w_buff1_used || !z$r_buff0_thd3 && !z$r_buff1_thd3 ? z$w_buff1 : (z$w_buff0_used && z$r_buff0_thd3 ? z$w_buff1 : z$w_buff1)) [L800] 3 z$w_buff0_used = weak$$choice2 ? z$w_buff0_used : (!z$w_buff0_used || !z$r_buff0_thd3 && !z$w_buff1_used || !z$r_buff0_thd3 && !z$r_buff1_thd3 ? z$w_buff0_used : (z$w_buff0_used && z$r_buff0_thd3 ? (_Bool)0 : z$w_buff0_used)) [L801] 3 z$w_buff1_used = weak$$choice2 ? z$w_buff1_used : (!z$w_buff0_used || !z$r_buff0_thd3 && !z$w_buff1_used || !z$r_buff0_thd3 && !z$r_buff1_thd3 ? z$w_buff1_used : (z$w_buff0_used && z$r_buff0_thd3 ? (_Bool)0 : (_Bool)0)) [L802] 3 z$r_buff0_thd3 = weak$$choice2 ? z$r_buff0_thd3 : (!z$w_buff0_used || !z$r_buff0_thd3 && !z$w_buff1_used || !z$r_buff0_thd3 && !z$r_buff1_thd3 ? z$r_buff0_thd3 : (z$w_buff0_used && z$r_buff0_thd3 ? (_Bool)0 : z$r_buff0_thd3)) [L803] 3 z$r_buff1_thd3 = weak$$choice2 ? z$r_buff1_thd3 : (!z$w_buff0_used || !z$r_buff0_thd3 && !z$w_buff1_used || !z$r_buff0_thd3 && !z$r_buff1_thd3 ? z$r_buff1_thd3 : (z$w_buff0_used && z$r_buff0_thd3 ? (_Bool)0 : (_Bool)0)) [L804] 3 __unbuffered_p2_EAX = z [L805] 3 z = z$flush_delayed ? z$mem_tmp : z [L806] 3 z$flush_delayed = (_Bool)0 VAL [__unbuffered_cnt=0, __unbuffered_p2_EAX=0, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice2=0, x=2, y=2, z$flush_delayed=0, z$mem_tmp=0, z$r_buff0_thd0=0, z$r_buff0_thd1=1, z$r_buff0_thd2=0, z$r_buff0_thd3=0, z$r_buff1_thd0=0, z$r_buff1_thd1=0, z$r_buff1_thd2=0, z$r_buff1_thd3=0, z$read_delayed=0, z$read_delayed_var={0:0}, z$w_buff0=1, z$w_buff0_used=1, z$w_buff1=0, z$w_buff1_used=0, z=0] [L756] 1 z = z$w_buff0_used && z$r_buff0_thd1 ? z$w_buff0 : (z$w_buff1_used && z$r_buff1_thd1 ? z$w_buff1 : z) [L757] 1 z$w_buff0_used = z$w_buff0_used && z$r_buff0_thd1 ? (_Bool)0 : z$w_buff0_used [L758] 1 z$w_buff1_used = z$w_buff0_used && z$r_buff0_thd1 || z$w_buff1_used && z$r_buff1_thd1 ? (_Bool)0 : z$w_buff1_used [L759] 1 z$r_buff0_thd1 = z$w_buff0_used && z$r_buff0_thd1 ? (_Bool)0 : z$r_buff0_thd1 [L760] 1 z$r_buff1_thd1 = z$w_buff0_used && z$r_buff0_thd1 || z$w_buff1_used && z$r_buff1_thd1 ? (_Bool)0 : z$r_buff1_thd1 VAL [__unbuffered_cnt=0, __unbuffered_p2_EAX=0, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice2=0, x=2, y=2, z$flush_delayed=0, z$mem_tmp=0, z$r_buff0_thd0=0, z$r_buff0_thd1=1, z$r_buff0_thd2=0, z$r_buff0_thd3=0, z$r_buff1_thd0=0, z$r_buff1_thd1=0, z$r_buff1_thd2=0, z$r_buff1_thd3=0, z$read_delayed=0, z$read_delayed_var={0:0}, z$w_buff0=1, z$w_buff0_used=0, z$w_buff1=0, z$w_buff1_used=0, z=1] [L763] 1 __unbuffered_cnt = __unbuffered_cnt + 1 VAL [__unbuffered_cnt=1, __unbuffered_p2_EAX=0, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice2=0, x=2, y=2, z$flush_delayed=0, z$mem_tmp=0, z$r_buff0_thd0=0, z$r_buff0_thd1=1, z$r_buff0_thd2=0, z$r_buff0_thd3=0, z$r_buff1_thd0=0, z$r_buff1_thd1=0, z$r_buff1_thd2=0, z$r_buff1_thd3=0, z$read_delayed=0, z$read_delayed_var={0:0}, z$w_buff0=1, z$w_buff0_used=0, z$w_buff1=0, z$w_buff1_used=0, z=1] [L783] 2 __unbuffered_cnt = __unbuffered_cnt + 1 VAL [__unbuffered_cnt=2, __unbuffered_p2_EAX=0, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice2=0, x=2, y=2, z$flush_delayed=0, z$mem_tmp=0, z$r_buff0_thd0=0, z$r_buff0_thd1=1, z$r_buff0_thd2=0, z$r_buff0_thd3=0, z$r_buff1_thd0=0, z$r_buff1_thd1=0, z$r_buff1_thd2=0, z$r_buff1_thd3=0, z$read_delayed=0, z$read_delayed_var={0:0}, z$w_buff0=1, z$w_buff0_used=0, z$w_buff1=0, z$w_buff1_used=0, z=1] [L809] 3 z = z$w_buff0_used && z$r_buff0_thd3 ? z$w_buff0 : (z$w_buff1_used && z$r_buff1_thd3 ? z$w_buff1 : z) [L810] 3 z$w_buff0_used = z$w_buff0_used && z$r_buff0_thd3 ? (_Bool)0 : z$w_buff0_used [L811] 3 z$w_buff1_used = z$w_buff0_used && z$r_buff0_thd3 || z$w_buff1_used && z$r_buff1_thd3 ? (_Bool)0 : z$w_buff1_used [L812] 3 z$r_buff0_thd3 = z$w_buff0_used && z$r_buff0_thd3 ? (_Bool)0 : z$r_buff0_thd3 [L813] 3 z$r_buff1_thd3 = z$w_buff0_used && z$r_buff0_thd3 || z$w_buff1_used && z$r_buff1_thd3 ? (_Bool)0 : z$r_buff1_thd3 VAL [__unbuffered_cnt=2, __unbuffered_p2_EAX=0, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice2=0, x=2, y=2, z$flush_delayed=0, z$mem_tmp=0, z$r_buff0_thd0=0, z$r_buff0_thd1=1, z$r_buff0_thd2=0, z$r_buff0_thd3=0, z$r_buff1_thd0=0, z$r_buff1_thd1=0, z$r_buff1_thd2=0, z$r_buff1_thd3=0, z$read_delayed=0, z$read_delayed_var={0:0}, z$w_buff0=1, z$w_buff0_used=0, z$w_buff1=0, z$w_buff1_used=0, z=1] [L816] 3 __unbuffered_cnt = __unbuffered_cnt + 1 VAL [__unbuffered_cnt=3, __unbuffered_p2_EAX=0, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice2=0, x=2, y=2, z$flush_delayed=0, z$mem_tmp=0, z$r_buff0_thd0=0, z$r_buff0_thd1=1, z$r_buff0_thd2=0, z$r_buff0_thd3=0, z$r_buff1_thd0=0, z$r_buff1_thd1=0, z$r_buff1_thd2=0, z$r_buff1_thd3=0, z$read_delayed=0, z$read_delayed_var={0:0}, z$w_buff0=1, z$w_buff0_used=0, z$w_buff1=0, z$w_buff1_used=0, z=1] [L838] 0 main$tmp_guard0 = __unbuffered_cnt == 3 VAL [__unbuffered_cnt=3, __unbuffered_p2_EAX=0, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, main$tmp_guard0=1, main$tmp_guard1=0, t1489={3:0}, t1490={6:0}, t1491={7:0}, weak$$choice2=0, x=2, y=2, z$flush_delayed=0, z$mem_tmp=0, z$r_buff0_thd0=0, z$r_buff0_thd1=1, z$r_buff0_thd2=0, z$r_buff0_thd3=0, z$r_buff1_thd0=0, z$r_buff1_thd1=0, z$r_buff1_thd2=0, z$r_buff1_thd3=0, z$read_delayed=0, z$read_delayed_var={0:0}, z$w_buff0=1, z$w_buff0_used=0, z$w_buff1=0, z$w_buff1_used=0, z=1] [L840] CALL 0 assume_abort_if_not(main$tmp_guard0) [L3] COND FALSE 0 !(!cond) [L840] RET 0 assume_abort_if_not(main$tmp_guard0) [L842] 0 z = z$w_buff0_used && z$r_buff0_thd0 ? z$w_buff0 : (z$w_buff1_used && z$r_buff1_thd0 ? z$w_buff1 : z) [L843] 0 z$w_buff0_used = z$w_buff0_used && z$r_buff0_thd0 ? (_Bool)0 : z$w_buff0_used [L844] 0 z$w_buff1_used = z$w_buff0_used && z$r_buff0_thd0 || z$w_buff1_used && z$r_buff1_thd0 ? (_Bool)0 : z$w_buff1_used [L845] 0 z$r_buff0_thd0 = z$w_buff0_used && z$r_buff0_thd0 ? (_Bool)0 : z$r_buff0_thd0 [L846] 0 z$r_buff1_thd0 = z$w_buff0_used && z$r_buff0_thd0 || z$w_buff1_used && z$r_buff1_thd0 ? (_Bool)0 : z$r_buff1_thd0 VAL [__unbuffered_cnt=3, __unbuffered_p2_EAX=0, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, main$tmp_guard0=1, main$tmp_guard1=0, t1489={3:0}, t1490={6:0}, t1491={7:0}, weak$$choice2=0, x=2, y=2, z$flush_delayed=0, z$mem_tmp=0, z$r_buff0_thd0=0, z$r_buff0_thd1=1, z$r_buff0_thd2=0, z$r_buff0_thd3=0, z$r_buff1_thd0=0, z$r_buff1_thd1=0, z$r_buff1_thd2=0, z$r_buff1_thd3=0, z$read_delayed=0, z$read_delayed_var={0:0}, z$w_buff0=1, z$w_buff0_used=0, z$w_buff1=0, z$w_buff1_used=0, z=1] [L849] 0 main$tmp_guard1 = !(x == 2 && y == 2 && __unbuffered_p2_EAX == 0) VAL [__unbuffered_cnt=3, __unbuffered_p2_EAX=0, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, main$tmp_guard0=1, main$tmp_guard1=0, t1489={3:0}, t1490={6:0}, t1491={7:0}, weak$$choice2=0, x=2, y=2, z$flush_delayed=0, z$mem_tmp=0, z$r_buff0_thd0=0, z$r_buff0_thd1=1, z$r_buff0_thd2=0, z$r_buff0_thd3=0, z$r_buff1_thd0=0, z$r_buff1_thd1=0, z$r_buff1_thd2=0, z$r_buff1_thd3=0, z$read_delayed=0, z$read_delayed_var={0:0}, z$w_buff0=1, z$w_buff0_used=0, z$w_buff1=0, z$w_buff1_used=0, z=1] [L851] CALL 0 __VERIFIER_assert(main$tmp_guard1) [L18] COND TRUE 0 !expression [L18] CALL 0 reach_error() [L17] COND FALSE 0 !(0) VAL [__unbuffered_cnt=3, __unbuffered_p2_EAX=0, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, main$tmp_guard0=1, main$tmp_guard1=0, weak$$choice2=0, x=2, y=2, z$flush_delayed=0, z$mem_tmp=0, z$r_buff0_thd0=0, z$r_buff0_thd1=1, z$r_buff0_thd2=0, z$r_buff0_thd3=0, z$r_buff1_thd0=0, z$r_buff1_thd1=0, z$r_buff1_thd2=0, z$r_buff1_thd3=0, z$read_delayed=0, z$read_delayed_var={0:0}, z$w_buff0=1, z$w_buff0_used=0, z$w_buff1=0, z$w_buff1_used=0, z=1] [L17] 0 __assert_fail ("0", "mix056_power.oepc_pso.oepc_rmo.oepc.c", 8, __extension__ __PRETTY_FUNCTION__) VAL [__unbuffered_cnt=3, __unbuffered_p2_EAX=0, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, main$tmp_guard0=1, main$tmp_guard1=0, weak$$choice2=0, x=2, y=2, z$flush_delayed=0, z$mem_tmp=0, z$r_buff0_thd0=0, z$r_buff0_thd1=1, z$r_buff0_thd2=0, z$r_buff0_thd3=0, z$r_buff1_thd0=0, z$r_buff1_thd1=0, z$r_buff1_thd2=0, z$r_buff1_thd3=0, z$read_delayed=0, z$read_delayed_var={0:0}, z$w_buff0=1, z$w_buff0_used=0, z$w_buff1=0, z$w_buff1_used=0, z=1] - UnprovableResult [Line: 17]: Unable to prove that all allocated memory was freed Unable to prove that all allocated memory was freed Reason: Not analyzed. - UnprovableResult [Line: -1]: Unable to prove that pointer dereference always succeeds Unable to prove that pointer dereference always succeeds Reason: Not analyzed. - UnprovableResult [Line: -1]: Unable to prove that pointer dereference always succeeds Unable to prove that pointer dereference always succeeds Reason: Not analyzed. - UnprovableResult [Line: -1]: Unable to prove that pointer dereference always succeeds Unable to prove that pointer dereference always succeeds Reason: Not analyzed. - UnprovableResult [Line: -1]: Unable to prove that pointer dereference always succeeds Unable to prove that pointer dereference always succeeds Reason: Not analyzed. - UnprovableResult [Line: -1]: Unable to prove that pointer dereference always succeeds Unable to prove that pointer dereference always succeeds Reason: Not analyzed. - UnprovableResult [Line: -1]: Unable to prove that pointer dereference always succeeds Unable to prove that pointer dereference always succeeds Reason: Not analyzed. - UnprovableResult [Line: 829]: Unable to prove that all allocated memory was freed Unable to prove that all allocated memory was freed Reason: Not analyzed. - UnprovableResult [Line: 834]: 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: 832]: 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: 836]: 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, 77 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.8s, OverallIterations: 15, TraceHistogramMax: 1, PathProgramHistogramMax: 4, EmptinessCheckTime: 0.0s, AutomataDifference: 5.6s, DeadEndRemovalTime: 0.0s, HoareAnnotationTime: 0.0s, InitialAbstractionConstructionTime: 0.0s, HoareTripleCheckerStatistics: 0 mSolverCounterUnknown, 527 SdHoareTripleChecker+Valid, 1.8s IncrementalHoareTripleChecker+Time, 0 mSdLazyCounter, 437 mSDsluCounter, 78 SdHoareTripleChecker+Invalid, 1.6s Time, 0 mProtectedAction, 0 SdHoareTripleChecker+Unchecked, 58 IncrementalHoareTripleChecker+Unchecked, 54 mSDsCounter, 32 IncrementalHoareTripleChecker+Valid, 0 mProtectedPredicate, 1381 IncrementalHoareTripleChecker+Invalid, 1471 SdHoareTripleChecker+Unknown, 0 mSolverCounterNotChecked, 32 mSolverCounterUnsat, 24 mSDtfsCounter, 1381 mSolverCounterSat, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Unknown, PredicateUnifierStatistics: 0 DeclaredPredicates, 236 GetRequests, 189 SyntacticMatches, 0 SemanticMatches, 47 ConstructedPredicates, 1 IntricatePredicates, 0 DeprecatedPredicates, 18 ImplicationChecksByTransitivity, 0.3s Time, 0.0s BasicInterpolantAutomatonTime, BiggestAbstraction: size=450occurred in iteration=14, InterpolantAutomatonStates: 61, 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.2s SsaConstructionTime, 0.6s SatisfiabilityAnalysisTime, 1.3s InterpolantComputationTime, 269 NumberOfCodeBlocks, 269 NumberOfCodeBlocksAsserted, 16 NumberOfCheckSat, 222 ConstructedInterpolants, 1 QuantifiedInterpolants, 1608 SizeOfPredicates, 12 NumberOfNonLiveVariables, 1584 ConjunctsInSsa, 76 ConjunctsInUnsatCore, 14 InterpolantComputations, 14 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-28 23:56:18,269 INFO L540 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_2b2f975c-1851-4624-a769-b2c770989b69/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