./Ultimate.py --spec ../../sv-benchmarks/c/properties/valid-memsafety.prp --file ../../sv-benchmarks/c/pthread-wmm/safe034_power.oepc_power.opt_pso.oepc_pso.opt_rmo.oepc_rmo.opt.i --full-output --architecture 32bit -------------------------------------------------------------------------------- Checking for memory safety (deref-memtrack) Using default analysis Version 0e0057cc Calling Ultimate with: /usr/lib/jvm/java-11-openjdk-amd64/bin/java -Dosgi.configuration.area=/tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_5d5af139-3929-44e4-a702-ba62df77cf50/bin/uautomizer-verify-VRDe98Ueme/data/config -Xmx15G -Xms4m -jar /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_5d5af139-3929-44e4-a702-ba62df77cf50/bin/uautomizer-verify-VRDe98Ueme/plugins/org.eclipse.equinox.launcher_1.5.800.v20200727-1323.jar -data @noDefault -ultimatedata /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_5d5af139-3929-44e4-a702-ba62df77cf50/bin/uautomizer-verify-VRDe98Ueme/data -tc /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_5d5af139-3929-44e4-a702-ba62df77cf50/bin/uautomizer-verify-VRDe98Ueme/config/AutomizerMemDerefMemtrack.xml -i ../../sv-benchmarks/c/pthread-wmm/safe034_power.oepc_power.opt_pso.oepc_pso.opt_rmo.oepc_rmo.opt.i -s /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_5d5af139-3929-44e4-a702-ba62df77cf50/bin/uautomizer-verify-VRDe98Ueme/config/svcomp-DerefFreeMemtrack-32bit-Automizer_Default.epf --cacsl2boogietranslator.entry.function main --witnessprinter.witness.directory /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_5d5af139-3929-44e4-a702-ba62df77cf50/bin/uautomizer-verify-VRDe98Ueme --witnessprinter.witness.filename witness --witnessprinter.write.witness.besides.input.file false --witnessprinter.graph.data.specification CHECK( init(main()), LTL(G valid-free) ) CHECK( init(main()), LTL(G valid-deref) ) CHECK( init(main()), LTL(G valid-memtrack) ) --witnessprinter.graph.data.producer Automizer --witnessprinter.graph.data.architecture 32bit --witnessprinter.graph.data.programhash 11eadb3d3dbb959cb5d260936a4e759de0e9c0b331e2b23d922151dc0bfe3fa5 --- Real Ultimate output --- This is Ultimate 0.2.4-dev-0e0057c [2023-11-26 12:02:06,641 INFO L188 SettingsManager]: Resetting all preferences to default values... [2023-11-26 12:02:06,714 INFO L114 SettingsManager]: Loading settings from /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_5d5af139-3929-44e4-a702-ba62df77cf50/bin/uautomizer-verify-VRDe98Ueme/config/svcomp-DerefFreeMemtrack-32bit-Automizer_Default.epf [2023-11-26 12:02:06,720 WARN L101 SettingsManager]: Preference file contains the following unknown settings: [2023-11-26 12:02:06,721 WARN L103 SettingsManager]: * de.uni_freiburg.informatik.ultimate.core.Log level for class [2023-11-26 12:02:06,752 INFO L130 SettingsManager]: Preferences different from defaults after loading the file: [2023-11-26 12:02:06,753 INFO L151 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2023-11-26 12:02:06,753 INFO L153 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2023-11-26 12:02:06,754 INFO L151 SettingsManager]: Preferences of Boogie Preprocessor differ from their defaults: [2023-11-26 12:02:06,755 INFO L153 SettingsManager]: * Use memory slicer=true [2023-11-26 12:02:06,756 INFO L151 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2023-11-26 12:02:06,756 INFO L153 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2023-11-26 12:02:06,757 INFO L151 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2023-11-26 12:02:06,758 INFO L153 SettingsManager]: * Create parallel compositions if possible=false [2023-11-26 12:02:06,759 INFO L153 SettingsManager]: * Use SBE=true [2023-11-26 12:02:06,760 INFO L151 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2023-11-26 12:02:06,760 INFO L153 SettingsManager]: * sizeof long=4 [2023-11-26 12:02:06,761 INFO L153 SettingsManager]: * Overapproximate operations on floating types=true [2023-11-26 12:02:06,762 INFO L153 SettingsManager]: * sizeof POINTER=4 [2023-11-26 12:02:06,762 INFO L153 SettingsManager]: * Check division by zero=IGNORE [2023-11-26 12:02:06,763 INFO L153 SettingsManager]: * Check for the main procedure if all allocated memory was freed=true [2023-11-26 12:02:06,764 INFO L153 SettingsManager]: * Bitprecise bitfields=true [2023-11-26 12:02:06,764 INFO L153 SettingsManager]: * SV-COMP memtrack compatibility mode=true [2023-11-26 12:02:06,765 INFO L153 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2023-11-26 12:02:06,766 INFO L153 SettingsManager]: * Adapt memory model on pointer casts if necessary=true [2023-11-26 12:02:06,766 INFO L153 SettingsManager]: * Check unreachability of reach_error function=false [2023-11-26 12:02:06,767 INFO L153 SettingsManager]: * sizeof long double=12 [2023-11-26 12:02:06,768 INFO L153 SettingsManager]: * Use constant arrays=true [2023-11-26 12:02:06,768 INFO L151 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2023-11-26 12:02:06,769 INFO L153 SettingsManager]: * Size of a code block=SequenceOfStatements [2023-11-26 12:02:06,769 INFO L153 SettingsManager]: * Only consider context switches at boundaries of atomic blocks=true [2023-11-26 12:02:06,770 INFO L153 SettingsManager]: * SMT solver=External_DefaultMode [2023-11-26 12:02:06,771 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2023-11-26 12:02:06,771 INFO L151 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2023-11-26 12:02:06,772 INFO L153 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2023-11-26 12:02:06,773 INFO L153 SettingsManager]: * Trace refinement strategy=CAMEL [2023-11-26 12:02:06,773 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2023-11-26 12:02:06,774 INFO L153 SettingsManager]: * Apply one-shot large block encoding in concurrent analysis=false [2023-11-26 12:02:06,775 INFO L153 SettingsManager]: * Automaton type used in concurrency analysis=PETRI_NET [2023-11-26 12:02:06,775 INFO L153 SettingsManager]: * Order on configurations for Petri net unfoldings=DBO [2023-11-26 12:02:06,776 INFO L153 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2023-11-26 12:02:06,777 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_5d5af139-3929-44e4-a702-ba62df77cf50/bin/uautomizer-verify-VRDe98Ueme/plugins/com.sun.xml.bind_2.2.0.v201505121915.jar) to method java.lang.ClassLoader.defineClass(java.lang.String,byte[],int,int) WARNING: Please consider reporting this to the maintainers of com.sun.xml.bind.v2.runtime.reflect.opt.Injector$1 WARNING: Use --illegal-access=warn to enable warnings of further illegal reflective access operations WARNING: All illegal access operations will be denied in a future release Applying setting for plugin de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator: Entry function -> main Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Witness directory -> /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_5d5af139-3929-44e4-a702-ba62df77cf50/bin/uautomizer-verify-VRDe98Ueme Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Witness filename -> witness Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Write witness besides input file -> false Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Graph data specification -> CHECK( init(main()), LTL(G valid-free) ) CHECK( init(main()), LTL(G valid-deref) ) CHECK( init(main()), LTL(G valid-memtrack) ) Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Graph data producer -> Automizer Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Graph data architecture -> 32bit Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Graph data programhash -> 11eadb3d3dbb959cb5d260936a4e759de0e9c0b331e2b23d922151dc0bfe3fa5 [2023-11-26 12:02:07,100 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2023-11-26 12:02:07,126 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2023-11-26 12:02:07,129 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2023-11-26 12:02:07,131 INFO L270 PluginConnector]: Initializing CDTParser... [2023-11-26 12:02:07,131 INFO L274 PluginConnector]: CDTParser initialized [2023-11-26 12:02:07,133 INFO L431 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_5d5af139-3929-44e4-a702-ba62df77cf50/bin/uautomizer-verify-VRDe98Ueme/../../sv-benchmarks/c/pthread-wmm/safe034_power.oepc_power.opt_pso.oepc_pso.opt_rmo.oepc_rmo.opt.i [2023-11-26 12:02:10,305 INFO L533 CDTParser]: Created temporary CDT project at NULL [2023-11-26 12:02:10,639 INFO L384 CDTParser]: Found 1 translation units. [2023-11-26 12:02:10,640 INFO L180 CDTParser]: Scanning /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_5d5af139-3929-44e4-a702-ba62df77cf50/sv-benchmarks/c/pthread-wmm/safe034_power.oepc_power.opt_pso.oepc_pso.opt_rmo.oepc_rmo.opt.i [2023-11-26 12:02:10,665 INFO L427 CDTParser]: About to delete temporary CDT project at /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_5d5af139-3929-44e4-a702-ba62df77cf50/bin/uautomizer-verify-VRDe98Ueme/data/9684f020e/93ac625af7e3492487ab7afbc6b7f683/FLAGac0099b09 [2023-11-26 12:02:10,691 INFO L435 CDTParser]: Successfully deleted /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_5d5af139-3929-44e4-a702-ba62df77cf50/bin/uautomizer-verify-VRDe98Ueme/data/9684f020e/93ac625af7e3492487ab7afbc6b7f683 [2023-11-26 12:02:10,698 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2023-11-26 12:02:10,701 INFO L133 ToolchainWalker]: Walking toolchain with 6 elements. [2023-11-26 12:02:10,703 INFO L112 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2023-11-26 12:02:10,703 INFO L270 PluginConnector]: Initializing CACSL2BoogieTranslator... [2023-11-26 12:02:10,709 INFO L274 PluginConnector]: CACSL2BoogieTranslator initialized [2023-11-26 12:02:10,710 INFO L184 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 26.11 12:02:10" (1/1) ... [2023-11-26 12:02:10,712 INFO L204 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@19133c02 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 26.11 12:02:10, skipping insertion in model container [2023-11-26 12:02:10,712 INFO L184 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 26.11 12:02:10" (1/1) ... [2023-11-26 12:02:10,801 INFO L177 MainTranslator]: Built tables and reachable declarations [2023-11-26 12:02:11,239 INFO L209 PostProcessor]: Analyzing one entry point: main [2023-11-26 12:02:11,253 INFO L202 MainTranslator]: Completed pre-run [2023-11-26 12:02:11,362 INFO L209 PostProcessor]: Analyzing one entry point: main [2023-11-26 12:02:11,421 WARN L675 CHandler]: The function __VERIFIER_atomic_begin is called, but not defined or handled by StandardFunctionHandler. [2023-11-26 12:02:11,422 WARN L675 CHandler]: The function __VERIFIER_atomic_end is called, but not defined or handled by StandardFunctionHandler. [2023-11-26 12:02:11,430 INFO L206 MainTranslator]: Completed translation [2023-11-26 12:02:11,431 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 26.11 12:02:11 WrapperNode [2023-11-26 12:02:11,431 INFO L131 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2023-11-26 12:02:11,432 INFO L112 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2023-11-26 12:02:11,433 INFO L270 PluginConnector]: Initializing Boogie Procedure Inliner... [2023-11-26 12:02:11,433 INFO L274 PluginConnector]: Boogie Procedure Inliner initialized [2023-11-26 12:02:11,442 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 26.11 12:02:11" (1/1) ... [2023-11-26 12:02:11,478 INFO L184 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 26.11 12:02:11" (1/1) ... [2023-11-26 12:02:11,525 INFO L138 Inliner]: procedures = 176, calls = 59, calls flagged for inlining = 6, calls inlined = 7, statements flattened = 133 [2023-11-26 12:02:11,527 INFO L131 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2023-11-26 12:02:11,528 INFO L112 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2023-11-26 12:02:11,528 INFO L270 PluginConnector]: Initializing Boogie Preprocessor... [2023-11-26 12:02:11,529 INFO L274 PluginConnector]: Boogie Preprocessor initialized [2023-11-26 12:02:11,542 INFO L184 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 26.11 12:02:11" (1/1) ... [2023-11-26 12:02:11,542 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 26.11 12:02:11" (1/1) ... [2023-11-26 12:02:11,551 INFO L184 PluginConnector]: Executing the observer MemorySlicer from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 26.11 12:02:11" (1/1) ... [2023-11-26 12:02:11,570 INFO L175 MemorySlicer]: Split 5 memory accesses to 4 slices as follows [2, 1, 1, 1]. 40 percent of accesses are in the largest equivalence class. The 2 initializations are split as follows [2, 0, 0, 0]. The 3 writes are split as follows [0, 1, 1, 1]. [2023-11-26 12:02:11,582 INFO L184 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 26.11 12:02:11" (1/1) ... [2023-11-26 12:02:11,582 INFO L184 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 26.11 12:02:11" (1/1) ... [2023-11-26 12:02:11,592 INFO L184 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 26.11 12:02:11" (1/1) ... [2023-11-26 12:02:11,608 INFO L184 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 26.11 12:02:11" (1/1) ... [2023-11-26 12:02:11,611 INFO L184 PluginConnector]: Executing the observer LTLStepAnnotator from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 26.11 12:02:11" (1/1) ... [2023-11-26 12:02:11,622 INFO L184 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 26.11 12:02:11" (1/1) ... [2023-11-26 12:02:11,627 INFO L131 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2023-11-26 12:02:11,628 INFO L112 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2023-11-26 12:02:11,632 INFO L270 PluginConnector]: Initializing RCFGBuilder... [2023-11-26 12:02:11,633 INFO L274 PluginConnector]: RCFGBuilder initialized [2023-11-26 12:02:11,634 INFO L184 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 26.11 12:02:11" (1/1) ... [2023-11-26 12:02:11,647 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2023-11-26 12:02:11,665 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_5d5af139-3929-44e4-a702-ba62df77cf50/bin/uautomizer-verify-VRDe98Ueme/z3 [2023-11-26 12:02:11,683 INFO L229 MonitoredProcess]: Starting monitored process 1 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_5d5af139-3929-44e4-a702-ba62df77cf50/bin/uautomizer-verify-VRDe98Ueme/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 (exit command is (exit), workingDir is null) [2023-11-26 12:02:11,686 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_5d5af139-3929-44e4-a702-ba62df77cf50/bin/uautomizer-verify-VRDe98Ueme/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 (1)] Waiting until timeout for monitored process [2023-11-26 12:02:11,717 INFO L130 BoogieDeclarations]: Found specification of procedure write~int#0 [2023-11-26 12:02:11,717 INFO L130 BoogieDeclarations]: Found specification of procedure write~int#1 [2023-11-26 12:02:11,717 INFO L130 BoogieDeclarations]: Found specification of procedure write~int#2 [2023-11-26 12:02:11,718 INFO L130 BoogieDeclarations]: Found specification of procedure write~int#3 [2023-11-26 12:02:11,718 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_atomic_begin [2023-11-26 12:02:11,718 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2023-11-26 12:02:11,718 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnStack [2023-11-26 12:02:11,718 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.dealloc [2023-11-26 12:02:11,718 INFO L130 BoogieDeclarations]: Found specification of procedure P0 [2023-11-26 12:02:11,719 INFO L138 BoogieDeclarations]: Found implementation of procedure P0 [2023-11-26 12:02:11,719 INFO L130 BoogieDeclarations]: Found specification of procedure P1 [2023-11-26 12:02:11,719 INFO L138 BoogieDeclarations]: Found implementation of procedure P1 [2023-11-26 12:02:11,719 INFO L130 BoogieDeclarations]: Found specification of procedure P2 [2023-11-26 12:02:11,719 INFO L138 BoogieDeclarations]: Found implementation of procedure P2 [2023-11-26 12:02:11,719 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#0 [2023-11-26 12:02:11,720 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#1 [2023-11-26 12:02:11,720 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#2 [2023-11-26 12:02:11,720 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#3 [2023-11-26 12:02:11,720 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_atomic_end [2023-11-26 12:02:11,720 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2023-11-26 12:02:11,720 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2023-11-26 12:02:11,722 WARN L213 CfgBuilder]: User set CodeBlockSize to SequenceOfStatements but program contains fork statements. Overwriting the user preferences and setting CodeBlockSize to OneNontrivialStatement [2023-11-26 12:02:11,939 INFO L241 CfgBuilder]: Building ICFG [2023-11-26 12:02:11,942 INFO L267 CfgBuilder]: Building CFG for each procedure with an implementation [2023-11-26 12:02:12,399 INFO L282 CfgBuilder]: Performing block encoding [2023-11-26 12:02:12,658 INFO L304 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2023-11-26 12:02:12,658 INFO L309 CfgBuilder]: Removed 0 assume(true) statements. [2023-11-26 12:02:12,659 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 26.11 12:02:12 BoogieIcfgContainer [2023-11-26 12:02:12,659 INFO L131 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2023-11-26 12:02:12,662 INFO L112 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2023-11-26 12:02:12,662 INFO L270 PluginConnector]: Initializing TraceAbstraction... [2023-11-26 12:02:12,666 INFO L274 PluginConnector]: TraceAbstraction initialized [2023-11-26 12:02:12,666 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 26.11 12:02:10" (1/3) ... [2023-11-26 12:02:12,667 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@4383ea70 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 26.11 12:02:12, skipping insertion in model container [2023-11-26 12:02:12,667 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 26.11 12:02:11" (2/3) ... [2023-11-26 12:02:12,668 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@4383ea70 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 26.11 12:02:12, skipping insertion in model container [2023-11-26 12:02:12,668 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 26.11 12:02:12" (3/3) ... [2023-11-26 12:02:12,669 INFO L112 eAbstractionObserver]: Analyzing ICFG safe034_power.oepc_power.opt_pso.oepc_pso.opt_rmo.oepc_rmo.opt.i [2023-11-26 12:02:12,691 INFO L203 ceAbstractionStarter]: Automizer settings: Hoare:false NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2023-11-26 12:02:12,691 INFO L162 ceAbstractionStarter]: Applying trace abstraction to program that has 9 error locations. [2023-11-26 12:02:12,692 INFO L514 ceAbstractionStarter]: Constructing petrified ICFG for 1 thread instances. [2023-11-26 12:02:12,745 INFO L144 ThreadInstanceAdder]: Constructed 0 joinOtherThreadTransitions. [2023-11-26 12:02:12,801 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 63 places, 55 transitions, 122 flow [2023-11-26 12:02:12,847 INFO L124 PetriNetUnfolderBase]: 2/52 cut-off events. [2023-11-26 12:02:12,847 INFO L125 PetriNetUnfolderBase]: For 0/0 co-relation queries the response was YES. [2023-11-26 12:02:12,856 INFO L83 FinitePrefix]: Finished finitePrefix Result has 62 conditions, 52 events. 2/52 cut-off events. For 0/0 co-relation queries the response was YES. Maximal size of possible extension queue 5. Compared 103 event pairs, 0 based on Foata normal form. 0/41 useless extension candidates. Maximal degree in co-relation 51. Up to 2 conditions per place. [2023-11-26 12:02:12,856 INFO L82 GeneralOperation]: Start removeDead. Operand has 63 places, 55 transitions, 122 flow [2023-11-26 12:02:12,861 INFO L88 GeneralOperation]: Finished RemoveDead, result has has 60 places, 52 transitions, 113 flow [2023-11-26 12:02:12,873 INFO L356 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2023-11-26 12:02:12,880 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;@7f90d026, mLbeIndependenceSettings=[IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=false, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2023-11-26 12:02:12,881 INFO L358 AbstractCegarLoop]: Starting to check reachability of 13 error locations. [2023-11-26 12:02:12,884 INFO L185 PetriNetUnfolderBase]: Found word, exiting Unfolder. [2023-11-26 12:02:12,885 INFO L124 PetriNetUnfolderBase]: 0/2 cut-off events. [2023-11-26 12:02:12,885 INFO L125 PetriNetUnfolderBase]: For 0/0 co-relation queries the response was YES. [2023-11-26 12:02:12,885 INFO L200 CegarLoopForPetriNet]: Found error trace [2023-11-26 12:02:12,886 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1] [2023-11-26 12:02:12,887 INFO L420 AbstractCegarLoop]: === Iteration 1 === Targeting ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [P2Err0ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 10 more)] === [2023-11-26 12:02:12,893 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-11-26 12:02:12,893 INFO L85 PathProgramCache]: Analyzing trace with hash 11843, now seen corresponding path program 1 times [2023-11-26 12:02:12,905 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-11-26 12:02:12,905 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [439788765] [2023-11-26 12:02:12,906 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-11-26 12:02:12,906 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-11-26 12:02:13,086 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-26 12:02:13,308 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-11-26 12:02:13,309 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-11-26 12:02:13,309 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [439788765] [2023-11-26 12:02:13,310 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [439788765] provided 1 perfect and 0 imperfect interpolant sequences [2023-11-26 12:02:13,311 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-11-26 12:02:13,311 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [1] imperfect sequences [] total 1 [2023-11-26 12:02:13,313 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1155309176] [2023-11-26 12:02:13,317 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-11-26 12:02:13,329 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2023-11-26 12:02:13,340 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-11-26 12:02:13,375 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2023-11-26 12:02:13,376 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2023-11-26 12:02:13,406 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 30 out of 55 [2023-11-26 12:02:13,409 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 60 places, 52 transitions, 113 flow. Second operand has 3 states, 3 states have (on average 30.666666666666668) internal successors, (92), 3 states have internal predecessors, (92), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-26 12:02:13,410 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2023-11-26 12:02:13,410 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 30 of 55 [2023-11-26 12:02:13,411 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2023-11-26 12:02:13,902 INFO L124 PetriNetUnfolderBase]: 459/956 cut-off events. [2023-11-26 12:02:13,902 INFO L125 PetriNetUnfolderBase]: For 8/8 co-relation queries the response was YES. [2023-11-26 12:02:13,911 INFO L83 FinitePrefix]: Finished finitePrefix Result has 1696 conditions, 956 events. 459/956 cut-off events. For 8/8 co-relation queries the response was YES. Maximal size of possible extension queue 98. Compared 7153 event pairs, 341 based on Foata normal form. 60/933 useless extension candidates. Maximal degree in co-relation 1682. Up to 539 conditions per place. [2023-11-26 12:02:13,924 INFO L140 encePairwiseOnDemand]: 50/55 looper letters, 26 selfloop transitions, 2 changer transitions 0/55 dead transitions. [2023-11-26 12:02:13,924 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 60 places, 55 transitions, 175 flow [2023-11-26 12:02:13,926 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2023-11-26 12:02:13,930 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2023-11-26 12:02:13,940 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 121 transitions. [2023-11-26 12:02:13,944 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.7333333333333333 [2023-11-26 12:02:13,946 INFO L72 ComplementDD]: Start complementDD. Operand 3 states and 121 transitions. [2023-11-26 12:02:13,946 INFO L73 IsDeterministic]: Start isDeterministic. Operand 3 states and 121 transitions. [2023-11-26 12:02:13,948 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2023-11-26 12:02:13,951 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 3 states and 121 transitions. [2023-11-26 12:02:13,956 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 4 states, 3 states have (on average 40.333333333333336) internal successors, (121), 3 states have internal predecessors, (121), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-26 12:02:13,964 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 4 states, 4 states have (on average 55.0) internal successors, (220), 4 states have internal predecessors, (220), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-26 12:02:13,965 INFO L81 ComplementDD]: Finished complementDD. Result has 4 states, 4 states have (on average 55.0) internal successors, (220), 4 states have internal predecessors, (220), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-26 12:02:13,967 INFO L175 Difference]: Start difference. First operand has 60 places, 52 transitions, 113 flow. Second operand 3 states and 121 transitions. [2023-11-26 12:02:13,968 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 60 places, 55 transitions, 175 flow [2023-11-26 12:02:13,972 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 57 places, 55 transitions, 172 flow, removed 0 selfloop flow, removed 3 redundant places. [2023-11-26 12:02:13,981 INFO L231 Difference]: Finished difference. Result has 57 places, 48 transitions, 106 flow [2023-11-26 12:02:13,984 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=55, PETRI_DIFFERENCE_MINUEND_FLOW=102, PETRI_DIFFERENCE_MINUEND_PLACES=55, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=48, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=2, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=46, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=106, PETRI_PLACES=57, PETRI_TRANSITIONS=48} [2023-11-26 12:02:13,989 INFO L281 CegarLoopForPetriNet]: 60 programPoint places, -3 predicate places. [2023-11-26 12:02:13,990 INFO L495 AbstractCegarLoop]: Abstraction has has 57 places, 48 transitions, 106 flow [2023-11-26 12:02:13,990 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 30.666666666666668) internal successors, (92), 3 states have internal predecessors, (92), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-26 12:02:13,990 INFO L200 CegarLoopForPetriNet]: Found error trace [2023-11-26 12:02:13,990 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1] [2023-11-26 12:02:13,991 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable0 [2023-11-26 12:02:13,993 INFO L420 AbstractCegarLoop]: === Iteration 2 === Targeting ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [P2Err0ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 10 more)] === [2023-11-26 12:02:13,994 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-11-26 12:02:13,994 INFO L85 PathProgramCache]: Analyzing trace with hash 11844, now seen corresponding path program 1 times [2023-11-26 12:02:13,995 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-11-26 12:02:13,995 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [676826364] [2023-11-26 12:02:13,995 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-11-26 12:02:13,996 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-11-26 12:02:14,039 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-26 12:02:14,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-26 12:02:14,170 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-11-26 12:02:14,171 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [676826364] [2023-11-26 12:02:14,171 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [676826364] provided 1 perfect and 0 imperfect interpolant sequences [2023-11-26 12:02:14,171 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-11-26 12:02:14,172 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [1] imperfect sequences [] total 1 [2023-11-26 12:02:14,172 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1660807628] [2023-11-26 12:02:14,172 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-11-26 12:02:14,174 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2023-11-26 12:02:14,174 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-11-26 12:02:14,175 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2023-11-26 12:02:14,175 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2023-11-26 12:02:14,196 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 31 out of 55 [2023-11-26 12:02:14,196 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 57 places, 48 transitions, 106 flow. Second operand has 3 states, 3 states have (on average 31.666666666666668) internal successors, (95), 3 states have internal predecessors, (95), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-26 12:02:14,197 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2023-11-26 12:02:14,197 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 31 of 55 [2023-11-26 12:02:14,198 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2023-11-26 12:02:14,520 INFO L124 PetriNetUnfolderBase]: 459/955 cut-off events. [2023-11-26 12:02:14,521 INFO L125 PetriNetUnfolderBase]: For 30/30 co-relation queries the response was YES. [2023-11-26 12:02:14,524 INFO L83 FinitePrefix]: Finished finitePrefix Result has 1723 conditions, 955 events. 459/955 cut-off events. For 30/30 co-relation queries the response was YES. Maximal size of possible extension queue 98. Compared 7157 event pairs, 341 based on Foata normal form. 1/873 useless extension candidates. Maximal degree in co-relation 1712. Up to 538 conditions per place. [2023-11-26 12:02:14,534 INFO L140 encePairwiseOnDemand]: 52/55 looper letters, 25 selfloop transitions, 2 changer transitions 0/54 dead transitions. [2023-11-26 12:02:14,534 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 58 places, 54 transitions, 172 flow [2023-11-26 12:02:14,534 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2023-11-26 12:02:14,535 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2023-11-26 12:02:14,538 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 121 transitions. [2023-11-26 12:02:14,541 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.7333333333333333 [2023-11-26 12:02:14,541 INFO L72 ComplementDD]: Start complementDD. Operand 3 states and 121 transitions. [2023-11-26 12:02:14,541 INFO L73 IsDeterministic]: Start isDeterministic. Operand 3 states and 121 transitions. [2023-11-26 12:02:14,543 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2023-11-26 12:02:14,544 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 3 states and 121 transitions. [2023-11-26 12:02:14,545 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 4 states, 3 states have (on average 40.333333333333336) internal successors, (121), 3 states have internal predecessors, (121), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-26 12:02:14,547 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 4 states, 4 states have (on average 55.0) internal successors, (220), 4 states have internal predecessors, (220), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-26 12:02:14,548 INFO L81 ComplementDD]: Finished complementDD. Result has 4 states, 4 states have (on average 55.0) internal successors, (220), 4 states have internal predecessors, (220), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-26 12:02:14,551 INFO L175 Difference]: Start difference. First operand has 57 places, 48 transitions, 106 flow. Second operand 3 states and 121 transitions. [2023-11-26 12:02:14,552 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 58 places, 54 transitions, 172 flow [2023-11-26 12:02:14,555 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 56 places, 54 transitions, 168 flow, removed 0 selfloop flow, removed 2 redundant places. [2023-11-26 12:02:14,557 INFO L231 Difference]: Finished difference. Result has 56 places, 47 transitions, 104 flow [2023-11-26 12:02:14,558 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=55, PETRI_DIFFERENCE_MINUEND_FLOW=100, PETRI_DIFFERENCE_MINUEND_PLACES=54, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=47, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=2, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=45, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=104, PETRI_PLACES=56, PETRI_TRANSITIONS=47} [2023-11-26 12:02:14,559 INFO L281 CegarLoopForPetriNet]: 60 programPoint places, -4 predicate places. [2023-11-26 12:02:14,560 INFO L495 AbstractCegarLoop]: Abstraction has has 56 places, 47 transitions, 104 flow [2023-11-26 12:02:14,560 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 31.666666666666668) internal successors, (95), 3 states have internal predecessors, (95), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-26 12:02:14,561 INFO L200 CegarLoopForPetriNet]: Found error trace [2023-11-26 12:02:14,566 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1] [2023-11-26 12:02:14,566 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1 [2023-11-26 12:02:14,566 INFO L420 AbstractCegarLoop]: === Iteration 3 === Targeting ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [P2Err0ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 10 more)] === [2023-11-26 12:02:14,567 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-11-26 12:02:14,567 INFO L85 PathProgramCache]: Analyzing trace with hash 353177348, now seen corresponding path program 1 times [2023-11-26 12:02:14,567 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-11-26 12:02:14,568 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1514456136] [2023-11-26 12:02:14,568 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-11-26 12:02:14,569 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-11-26 12:02:14,615 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-26 12:02:14,714 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-11-26 12:02:14,715 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-11-26 12:02:14,715 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1514456136] [2023-11-26 12:02:14,716 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1514456136] provided 1 perfect and 0 imperfect interpolant sequences [2023-11-26 12:02:14,717 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-11-26 12:02:14,717 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2023-11-26 12:02:14,718 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [648695700] [2023-11-26 12:02:14,718 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-11-26 12:02:14,719 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2023-11-26 12:02:14,720 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-11-26 12:02:14,720 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2023-11-26 12:02:14,721 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2023-11-26 12:02:14,748 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 30 out of 55 [2023-11-26 12:02:14,749 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 56 places, 47 transitions, 104 flow. Second operand has 3 states, 3 states have (on average 31.333333333333332) internal successors, (94), 3 states have internal predecessors, (94), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-26 12:02:14,749 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2023-11-26 12:02:14,749 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 30 of 55 [2023-11-26 12:02:14,750 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2023-11-26 12:02:15,030 INFO L124 PetriNetUnfolderBase]: 460/954 cut-off events. [2023-11-26 12:02:15,031 INFO L125 PetriNetUnfolderBase]: For 30/30 co-relation queries the response was YES. [2023-11-26 12:02:15,034 INFO L83 FinitePrefix]: Finished finitePrefix Result has 1725 conditions, 954 events. 460/954 cut-off events. For 30/30 co-relation queries the response was YES. Maximal size of possible extension queue 98. Compared 7073 event pairs, 274 based on Foata normal form. 0/875 useless extension candidates. Maximal degree in co-relation 1714. Up to 538 conditions per place. [2023-11-26 12:02:15,042 INFO L140 encePairwiseOnDemand]: 52/55 looper letters, 26 selfloop transitions, 2 changer transitions 0/53 dead transitions. [2023-11-26 12:02:15,042 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 57 places, 53 transitions, 172 flow [2023-11-26 12:02:15,043 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2023-11-26 12:02:15,043 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2023-11-26 12:02:15,044 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 119 transitions. [2023-11-26 12:02:15,044 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.7212121212121212 [2023-11-26 12:02:15,044 INFO L72 ComplementDD]: Start complementDD. Operand 3 states and 119 transitions. [2023-11-26 12:02:15,045 INFO L73 IsDeterministic]: Start isDeterministic. Operand 3 states and 119 transitions. [2023-11-26 12:02:15,046 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2023-11-26 12:02:15,046 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 3 states and 119 transitions. [2023-11-26 12:02:15,048 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 4 states, 3 states have (on average 39.666666666666664) internal successors, (119), 3 states have internal predecessors, (119), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-26 12:02:15,051 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 4 states, 4 states have (on average 55.0) internal successors, (220), 4 states have internal predecessors, (220), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-26 12:02:15,051 INFO L81 ComplementDD]: Finished complementDD. Result has 4 states, 4 states have (on average 55.0) internal successors, (220), 4 states have internal predecessors, (220), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-26 12:02:15,052 INFO L175 Difference]: Start difference. First operand has 56 places, 47 transitions, 104 flow. Second operand 3 states and 119 transitions. [2023-11-26 12:02:15,052 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 57 places, 53 transitions, 172 flow [2023-11-26 12:02:15,056 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 55 places, 53 transitions, 168 flow, removed 0 selfloop flow, removed 2 redundant places. [2023-11-26 12:02:15,058 INFO L231 Difference]: Finished difference. Result has 55 places, 46 transitions, 102 flow [2023-11-26 12:02:15,059 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=55, PETRI_DIFFERENCE_MINUEND_FLOW=98, PETRI_DIFFERENCE_MINUEND_PLACES=53, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=46, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=2, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=44, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=102, PETRI_PLACES=55, PETRI_TRANSITIONS=46} [2023-11-26 12:02:15,060 INFO L281 CegarLoopForPetriNet]: 60 programPoint places, -5 predicate places. [2023-11-26 12:02:15,061 INFO L495 AbstractCegarLoop]: Abstraction has has 55 places, 46 transitions, 102 flow [2023-11-26 12:02:15,061 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 31.333333333333332) internal successors, (94), 3 states have internal predecessors, (94), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-26 12:02:15,061 INFO L200 CegarLoopForPetriNet]: Found error trace [2023-11-26 12:02:15,062 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1] [2023-11-26 12:02:15,062 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2 [2023-11-26 12:02:15,062 INFO L420 AbstractCegarLoop]: === Iteration 4 === Targeting ULTIMATE.startErr3REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [P2Err0ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 10 more)] === [2023-11-26 12:02:15,063 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-11-26 12:02:15,063 INFO L85 PathProgramCache]: Analyzing trace with hash 353177349, now seen corresponding path program 1 times [2023-11-26 12:02:15,064 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-11-26 12:02:15,064 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [454996397] [2023-11-26 12:02:15,065 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-11-26 12:02:15,065 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-11-26 12:02:15,097 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-26 12:02:15,217 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-11-26 12:02:15,217 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-11-26 12:02:15,219 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [454996397] [2023-11-26 12:02:15,220 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [454996397] provided 1 perfect and 0 imperfect interpolant sequences [2023-11-26 12:02:15,220 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-11-26 12:02:15,220 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2023-11-26 12:02:15,225 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [556698076] [2023-11-26 12:02:15,225 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-11-26 12:02:15,226 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2023-11-26 12:02:15,226 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-11-26 12:02:15,229 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2023-11-26 12:02:15,230 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2023-11-26 12:02:15,246 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 31 out of 55 [2023-11-26 12:02:15,247 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 55 places, 46 transitions, 102 flow. Second operand has 3 states, 3 states have (on average 32.333333333333336) internal successors, (97), 3 states have internal predecessors, (97), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-26 12:02:15,247 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2023-11-26 12:02:15,247 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 31 of 55 [2023-11-26 12:02:15,247 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2023-11-26 12:02:15,483 INFO L124 PetriNetUnfolderBase]: 459/951 cut-off events. [2023-11-26 12:02:15,483 INFO L125 PetriNetUnfolderBase]: For 31/31 co-relation queries the response was YES. [2023-11-26 12:02:15,488 INFO L83 FinitePrefix]: Finished finitePrefix Result has 1720 conditions, 951 events. 459/951 cut-off events. For 31/31 co-relation queries the response was YES. Maximal size of possible extension queue 98. Compared 7036 event pairs, 274 based on Foata normal form. 2/875 useless extension candidates. Maximal degree in co-relation 1710. Up to 535 conditions per place. [2023-11-26 12:02:15,496 INFO L140 encePairwiseOnDemand]: 52/55 looper letters, 25 selfloop transitions, 2 changer transitions 0/52 dead transitions. [2023-11-26 12:02:15,496 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 56 places, 52 transitions, 168 flow [2023-11-26 12:02:15,496 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2023-11-26 12:02:15,497 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2023-11-26 12:02:15,500 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 121 transitions. [2023-11-26 12:02:15,500 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.7333333333333333 [2023-11-26 12:02:15,500 INFO L72 ComplementDD]: Start complementDD. Operand 3 states and 121 transitions. [2023-11-26 12:02:15,500 INFO L73 IsDeterministic]: Start isDeterministic. Operand 3 states and 121 transitions. [2023-11-26 12:02:15,501 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2023-11-26 12:02:15,501 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 3 states and 121 transitions. [2023-11-26 12:02:15,502 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 4 states, 3 states have (on average 40.333333333333336) internal successors, (121), 3 states have internal predecessors, (121), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-26 12:02:15,503 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 4 states, 4 states have (on average 55.0) internal successors, (220), 4 states have internal predecessors, (220), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-26 12:02:15,503 INFO L81 ComplementDD]: Finished complementDD. Result has 4 states, 4 states have (on average 55.0) internal successors, (220), 4 states have internal predecessors, (220), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-26 12:02:15,504 INFO L175 Difference]: Start difference. First operand has 55 places, 46 transitions, 102 flow. Second operand 3 states and 121 transitions. [2023-11-26 12:02:15,504 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 56 places, 52 transitions, 168 flow [2023-11-26 12:02:15,507 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 54 places, 52 transitions, 164 flow, removed 0 selfloop flow, removed 2 redundant places. [2023-11-26 12:02:15,508 INFO L231 Difference]: Finished difference. Result has 54 places, 45 transitions, 100 flow [2023-11-26 12:02:15,509 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=55, PETRI_DIFFERENCE_MINUEND_FLOW=96, PETRI_DIFFERENCE_MINUEND_PLACES=52, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=45, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=2, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=43, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=100, PETRI_PLACES=54, PETRI_TRANSITIONS=45} [2023-11-26 12:02:15,511 INFO L281 CegarLoopForPetriNet]: 60 programPoint places, -6 predicate places. [2023-11-26 12:02:15,511 INFO L495 AbstractCegarLoop]: Abstraction has has 54 places, 45 transitions, 100 flow [2023-11-26 12:02:15,512 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 32.333333333333336) internal successors, (97), 3 states have internal predecessors, (97), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-26 12:02:15,512 INFO L200 CegarLoopForPetriNet]: Found error trace [2023-11-26 12:02:15,512 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1] [2023-11-26 12:02:15,512 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable3 [2023-11-26 12:02:15,513 INFO L420 AbstractCegarLoop]: === Iteration 5 === Targeting ULTIMATE.startErr4REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [P2Err0ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 10 more)] === [2023-11-26 12:02:15,514 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-11-26 12:02:15,514 INFO L85 PathProgramCache]: Analyzing trace with hash -1163140344, now seen corresponding path program 1 times [2023-11-26 12:02:15,514 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-11-26 12:02:15,515 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1912053936] [2023-11-26 12:02:15,515 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-11-26 12:02:15,515 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-11-26 12:02:15,539 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-26 12:02:15,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-26 12:02:15,600 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-11-26 12:02:15,600 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1912053936] [2023-11-26 12:02:15,601 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1912053936] provided 1 perfect and 0 imperfect interpolant sequences [2023-11-26 12:02:15,606 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-11-26 12:02:15,606 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2023-11-26 12:02:15,606 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [176949921] [2023-11-26 12:02:15,606 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-11-26 12:02:15,607 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2023-11-26 12:02:15,607 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-11-26 12:02:15,608 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2023-11-26 12:02:15,608 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2023-11-26 12:02:15,625 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 30 out of 55 [2023-11-26 12:02:15,627 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 54 places, 45 transitions, 100 flow. Second operand has 3 states, 3 states have (on average 32.0) internal successors, (96), 3 states have internal predecessors, (96), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-26 12:02:15,627 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2023-11-26 12:02:15,627 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 30 of 55 [2023-11-26 12:02:15,628 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2023-11-26 12:02:15,856 INFO L124 PetriNetUnfolderBase]: 466/947 cut-off events. [2023-11-26 12:02:15,856 INFO L125 PetriNetUnfolderBase]: For 31/31 co-relation queries the response was YES. [2023-11-26 12:02:15,859 INFO L83 FinitePrefix]: Finished finitePrefix Result has 1729 conditions, 947 events. 466/947 cut-off events. For 31/31 co-relation queries the response was YES. Maximal size of possible extension queue 99. Compared 6839 event pairs, 353 based on Foata normal form. 0/880 useless extension candidates. Maximal degree in co-relation 1719. Up to 536 conditions per place. [2023-11-26 12:02:15,866 INFO L140 encePairwiseOnDemand]: 52/55 looper letters, 26 selfloop transitions, 2 changer transitions 0/51 dead transitions. [2023-11-26 12:02:15,866 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 55 places, 51 transitions, 168 flow [2023-11-26 12:02:15,867 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2023-11-26 12:02:15,867 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2023-11-26 12:02:15,869 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 119 transitions. [2023-11-26 12:02:15,869 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.7212121212121212 [2023-11-26 12:02:15,870 INFO L72 ComplementDD]: Start complementDD. Operand 3 states and 119 transitions. [2023-11-26 12:02:15,870 INFO L73 IsDeterministic]: Start isDeterministic. Operand 3 states and 119 transitions. [2023-11-26 12:02:15,870 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2023-11-26 12:02:15,870 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 3 states and 119 transitions. [2023-11-26 12:02:15,871 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 4 states, 3 states have (on average 39.666666666666664) internal successors, (119), 3 states have internal predecessors, (119), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-26 12:02:15,873 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 4 states, 4 states have (on average 55.0) internal successors, (220), 4 states have internal predecessors, (220), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-26 12:02:15,873 INFO L81 ComplementDD]: Finished complementDD. Result has 4 states, 4 states have (on average 55.0) internal successors, (220), 4 states have internal predecessors, (220), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-26 12:02:15,874 INFO L175 Difference]: Start difference. First operand has 54 places, 45 transitions, 100 flow. Second operand 3 states and 119 transitions. [2023-11-26 12:02:15,874 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 55 places, 51 transitions, 168 flow [2023-11-26 12:02:15,877 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 53 places, 51 transitions, 164 flow, removed 0 selfloop flow, removed 2 redundant places. [2023-11-26 12:02:15,879 INFO L231 Difference]: Finished difference. Result has 53 places, 44 transitions, 98 flow [2023-11-26 12:02:15,880 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=55, PETRI_DIFFERENCE_MINUEND_FLOW=94, PETRI_DIFFERENCE_MINUEND_PLACES=51, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=44, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=2, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=42, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=98, PETRI_PLACES=53, PETRI_TRANSITIONS=44} [2023-11-26 12:02:15,883 INFO L281 CegarLoopForPetriNet]: 60 programPoint places, -7 predicate places. [2023-11-26 12:02:15,883 INFO L495 AbstractCegarLoop]: Abstraction has has 53 places, 44 transitions, 98 flow [2023-11-26 12:02:15,883 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 32.0) internal successors, (96), 3 states have internal predecessors, (96), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-26 12:02:15,883 INFO L200 CegarLoopForPetriNet]: Found error trace [2023-11-26 12:02:15,884 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1] [2023-11-26 12:02:15,884 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable4 [2023-11-26 12:02:15,884 INFO L420 AbstractCegarLoop]: === Iteration 6 === Targeting ULTIMATE.startErr5REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [P2Err0ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 10 more)] === [2023-11-26 12:02:15,885 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-11-26 12:02:15,886 INFO L85 PathProgramCache]: Analyzing trace with hash -1163140343, now seen corresponding path program 1 times [2023-11-26 12:02:15,886 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-11-26 12:02:15,886 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1509418398] [2023-11-26 12:02:15,886 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-11-26 12:02:15,887 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-11-26 12:02:15,925 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-26 12:02:16,030 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-11-26 12:02:16,031 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-11-26 12:02:16,031 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1509418398] [2023-11-26 12:02:16,031 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1509418398] provided 1 perfect and 0 imperfect interpolant sequences [2023-11-26 12:02:16,031 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-11-26 12:02:16,031 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2023-11-26 12:02:16,032 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1647002773] [2023-11-26 12:02:16,032 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-11-26 12:02:16,032 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2023-11-26 12:02:16,033 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-11-26 12:02:16,033 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2023-11-26 12:02:16,033 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2023-11-26 12:02:16,048 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 31 out of 55 [2023-11-26 12:02:16,048 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 53 places, 44 transitions, 98 flow. Second operand has 3 states, 3 states have (on average 33.0) internal successors, (99), 3 states have internal predecessors, (99), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-26 12:02:16,049 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2023-11-26 12:02:16,049 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 31 of 55 [2023-11-26 12:02:16,049 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2023-11-26 12:02:16,280 INFO L124 PetriNetUnfolderBase]: 459/932 cut-off events. [2023-11-26 12:02:16,280 INFO L125 PetriNetUnfolderBase]: For 34/34 co-relation queries the response was YES. [2023-11-26 12:02:16,283 INFO L83 FinitePrefix]: Finished finitePrefix Result has 1705 conditions, 932 events. 459/932 cut-off events. For 34/34 co-relation queries the response was YES. Maximal size of possible extension queue 99. Compared 6758 event pairs, 346 based on Foata normal form. 6/874 useless extension candidates. Maximal degree in co-relation 1695. Up to 523 conditions per place. [2023-11-26 12:02:16,291 INFO L140 encePairwiseOnDemand]: 52/55 looper letters, 25 selfloop transitions, 2 changer transitions 0/50 dead transitions. [2023-11-26 12:02:16,291 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 54 places, 50 transitions, 164 flow [2023-11-26 12:02:16,292 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2023-11-26 12:02:16,292 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2023-11-26 12:02:16,293 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 121 transitions. [2023-11-26 12:02:16,293 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.7333333333333333 [2023-11-26 12:02:16,293 INFO L72 ComplementDD]: Start complementDD. Operand 3 states and 121 transitions. [2023-11-26 12:02:16,294 INFO L73 IsDeterministic]: Start isDeterministic. Operand 3 states and 121 transitions. [2023-11-26 12:02:16,294 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2023-11-26 12:02:16,294 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 3 states and 121 transitions. [2023-11-26 12:02:16,295 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 4 states, 3 states have (on average 40.333333333333336) internal successors, (121), 3 states have internal predecessors, (121), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-26 12:02:16,296 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 4 states, 4 states have (on average 55.0) internal successors, (220), 4 states have internal predecessors, (220), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-26 12:02:16,296 INFO L81 ComplementDD]: Finished complementDD. Result has 4 states, 4 states have (on average 55.0) internal successors, (220), 4 states have internal predecessors, (220), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-26 12:02:16,296 INFO L175 Difference]: Start difference. First operand has 53 places, 44 transitions, 98 flow. Second operand 3 states and 121 transitions. [2023-11-26 12:02:16,297 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 54 places, 50 transitions, 164 flow [2023-11-26 12:02:16,300 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 52 places, 50 transitions, 160 flow, removed 0 selfloop flow, removed 2 redundant places. [2023-11-26 12:02:16,303 INFO L231 Difference]: Finished difference. Result has 52 places, 43 transitions, 96 flow [2023-11-26 12:02:16,303 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=55, PETRI_DIFFERENCE_MINUEND_FLOW=92, PETRI_DIFFERENCE_MINUEND_PLACES=50, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=43, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=2, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=41, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=96, PETRI_PLACES=52, PETRI_TRANSITIONS=43} [2023-11-26 12:02:16,307 INFO L281 CegarLoopForPetriNet]: 60 programPoint places, -8 predicate places. [2023-11-26 12:02:16,307 INFO L495 AbstractCegarLoop]: Abstraction has has 52 places, 43 transitions, 96 flow [2023-11-26 12:02:16,307 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 33.0) internal successors, (99), 3 states have internal predecessors, (99), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-26 12:02:16,308 INFO L200 CegarLoopForPetriNet]: Found error trace [2023-11-26 12:02:16,308 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-11-26 12:02:16,308 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable5 [2023-11-26 12:02:16,308 INFO L420 AbstractCegarLoop]: === Iteration 7 === Targeting P2Err0ASSERT_VIOLATIONMEMORY_LEAK === [P2Err0ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 10 more)] === [2023-11-26 12:02:16,309 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-11-26 12:02:16,309 INFO L85 PathProgramCache]: Analyzing trace with hash 682522057, now seen corresponding path program 1 times [2023-11-26 12:02:16,309 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-11-26 12:02:16,310 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1330373277] [2023-11-26 12:02:16,310 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-11-26 12:02:16,310 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-11-26 12:02:16,342 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-26 12:02:16,507 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-11-26 12:02:16,508 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-11-26 12:02:16,508 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1330373277] [2023-11-26 12:02:16,513 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1330373277] provided 1 perfect and 0 imperfect interpolant sequences [2023-11-26 12:02:16,514 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-11-26 12:02:16,514 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [1] imperfect sequences [] total 1 [2023-11-26 12:02:16,514 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1274435894] [2023-11-26 12:02:16,514 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-11-26 12:02:16,515 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2023-11-26 12:02:16,516 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-11-26 12:02:16,516 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2023-11-26 12:02:16,516 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2023-11-26 12:02:16,519 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 32 out of 55 [2023-11-26 12:02:16,519 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 52 places, 43 transitions, 96 flow. Second operand has 3 states, 3 states have (on average 34.333333333333336) internal successors, (103), 3 states have internal predecessors, (103), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-26 12:02:16,520 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2023-11-26 12:02:16,520 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 32 of 55 [2023-11-26 12:02:16,520 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2023-11-26 12:02:16,715 INFO L124 PetriNetUnfolderBase]: 361/733 cut-off events. [2023-11-26 12:02:16,716 INFO L125 PetriNetUnfolderBase]: For 28/28 co-relation queries the response was YES. [2023-11-26 12:02:16,717 INFO L83 FinitePrefix]: Finished finitePrefix Result has 1354 conditions, 733 events. 361/733 cut-off events. For 28/28 co-relation queries the response was YES. Maximal size of possible extension queue 78. Compared 4988 event pairs, 67 based on Foata normal form. 0/726 useless extension candidates. Maximal degree in co-relation 1344. Up to 439 conditions per place. [2023-11-26 12:02:16,723 INFO L140 encePairwiseOnDemand]: 52/55 looper letters, 25 selfloop transitions, 2 changer transitions 2/52 dead transitions. [2023-11-26 12:02:16,723 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 53 places, 52 transitions, 174 flow [2023-11-26 12:02:16,724 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2023-11-26 12:02:16,724 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2023-11-26 12:02:16,725 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 126 transitions. [2023-11-26 12:02:16,726 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.7636363636363637 [2023-11-26 12:02:16,726 INFO L72 ComplementDD]: Start complementDD. Operand 3 states and 126 transitions. [2023-11-26 12:02:16,726 INFO L73 IsDeterministic]: Start isDeterministic. Operand 3 states and 126 transitions. [2023-11-26 12:02:16,726 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2023-11-26 12:02:16,726 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 3 states and 126 transitions. [2023-11-26 12:02:16,727 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 4 states, 3 states have (on average 42.0) internal successors, (126), 3 states have internal predecessors, (126), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-26 12:02:16,728 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 4 states, 4 states have (on average 55.0) internal successors, (220), 4 states have internal predecessors, (220), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-26 12:02:16,729 INFO L81 ComplementDD]: Finished complementDD. Result has 4 states, 4 states have (on average 55.0) internal successors, (220), 4 states have internal predecessors, (220), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-26 12:02:16,730 INFO L175 Difference]: Start difference. First operand has 52 places, 43 transitions, 96 flow. Second operand 3 states and 126 transitions. [2023-11-26 12:02:16,730 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 53 places, 52 transitions, 174 flow [2023-11-26 12:02:16,732 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 51 places, 52 transitions, 168 flow, removed 0 selfloop flow, removed 2 redundant places. [2023-11-26 12:02:16,733 INFO L231 Difference]: Finished difference. Result has 51 places, 41 transitions, 92 flow [2023-11-26 12:02:16,734 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=55, PETRI_DIFFERENCE_MINUEND_FLOW=90, PETRI_DIFFERENCE_MINUEND_PLACES=49, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=42, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=2, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=40, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=92, PETRI_PLACES=51, PETRI_TRANSITIONS=41} [2023-11-26 12:02:16,735 INFO L281 CegarLoopForPetriNet]: 60 programPoint places, -9 predicate places. [2023-11-26 12:02:16,735 INFO L495 AbstractCegarLoop]: Abstraction has has 51 places, 41 transitions, 92 flow [2023-11-26 12:02:16,736 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 34.333333333333336) internal successors, (103), 3 states have internal predecessors, (103), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-26 12:02:16,736 INFO L200 CegarLoopForPetriNet]: Found error trace [2023-11-26 12:02:16,736 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-11-26 12:02:16,736 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable6 [2023-11-26 12:02:16,736 INFO L420 AbstractCegarLoop]: === Iteration 8 === Targeting ULTIMATE.startErr7ASSERT_VIOLATIONMEMORY_LEAK === [P2Err0ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 10 more)] === [2023-11-26 12:02:16,737 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-11-26 12:02:16,737 INFO L85 PathProgramCache]: Analyzing trace with hash 844611556, now seen corresponding path program 1 times [2023-11-26 12:02:16,737 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-11-26 12:02:16,738 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [253881292] [2023-11-26 12:02:16,738 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-11-26 12:02:16,738 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-11-26 12:02:16,798 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-26 12:02:17,342 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-11-26 12:02:17,342 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-11-26 12:02:17,342 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [253881292] [2023-11-26 12:02:17,343 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [253881292] provided 1 perfect and 0 imperfect interpolant sequences [2023-11-26 12:02:17,343 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-11-26 12:02:17,343 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2023-11-26 12:02:17,343 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1230866034] [2023-11-26 12:02:17,344 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-11-26 12:02:17,344 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2023-11-26 12:02:17,344 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-11-26 12:02:17,345 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2023-11-26 12:02:17,345 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=12, Invalid=30, Unknown=0, NotChecked=0, Total=42 [2023-11-26 12:02:17,466 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 28 out of 55 [2023-11-26 12:02:17,467 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 51 places, 41 transitions, 92 flow. Second operand has 7 states, 7 states have (on average 29.857142857142858) internal successors, (209), 7 states have internal predecessors, (209), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-26 12:02:17,467 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2023-11-26 12:02:17,467 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 28 of 55 [2023-11-26 12:02:17,468 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2023-11-26 12:02:17,766 INFO L124 PetriNetUnfolderBase]: 316/665 cut-off events. [2023-11-26 12:02:17,767 INFO L125 PetriNetUnfolderBase]: For 42/42 co-relation queries the response was YES. [2023-11-26 12:02:17,768 INFO L83 FinitePrefix]: Finished finitePrefix Result has 1232 conditions, 665 events. 316/665 cut-off events. For 42/42 co-relation queries the response was YES. Maximal size of possible extension queue 70. Compared 4545 event pairs, 260 based on Foata normal form. 24/674 useless extension candidates. Maximal degree in co-relation 1221. Up to 415 conditions per place. [2023-11-26 12:02:17,773 INFO L140 encePairwiseOnDemand]: 50/55 looper letters, 19 selfloop transitions, 3 changer transitions 7/50 dead transitions. [2023-11-26 12:02:17,774 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 54 places, 50 transitions, 170 flow [2023-11-26 12:02:17,774 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2023-11-26 12:02:17,775 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 6 states. [2023-11-26 12:02:17,775 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6 states to 6 states and 198 transitions. [2023-11-26 12:02:17,776 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.6 [2023-11-26 12:02:17,776 INFO L72 ComplementDD]: Start complementDD. Operand 6 states and 198 transitions. [2023-11-26 12:02:17,776 INFO L73 IsDeterministic]: Start isDeterministic. Operand 6 states and 198 transitions. [2023-11-26 12:02:17,777 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2023-11-26 12:02:17,777 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 6 states and 198 transitions. [2023-11-26 12:02:17,778 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 7 states, 6 states have (on average 33.0) internal successors, (198), 6 states have internal predecessors, (198), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-26 12:02:17,779 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 7 states, 7 states have (on average 55.0) internal successors, (385), 7 states have internal predecessors, (385), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-26 12:02:17,779 INFO L81 ComplementDD]: Finished complementDD. Result has 7 states, 7 states have (on average 55.0) internal successors, (385), 7 states have internal predecessors, (385), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-26 12:02:17,779 INFO L175 Difference]: Start difference. First operand has 51 places, 41 transitions, 92 flow. Second operand 6 states and 198 transitions. [2023-11-26 12:02:17,780 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 54 places, 50 transitions, 170 flow [2023-11-26 12:02:17,780 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 52 places, 50 transitions, 164 flow, removed 0 selfloop flow, removed 2 redundant places. [2023-11-26 12:02:17,782 INFO L231 Difference]: Finished difference. Result has 52 places, 39 transitions, 90 flow [2023-11-26 12:02:17,782 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=55, PETRI_DIFFERENCE_MINUEND_FLOW=86, PETRI_DIFFERENCE_MINUEND_PLACES=47, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=40, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=3, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=37, PETRI_DIFFERENCE_SUBTRAHEND_STATES=6, PETRI_FLOW=90, PETRI_PLACES=52, PETRI_TRANSITIONS=39} [2023-11-26 12:02:17,783 INFO L281 CegarLoopForPetriNet]: 60 programPoint places, -8 predicate places. [2023-11-26 12:02:17,783 INFO L495 AbstractCegarLoop]: Abstraction has has 52 places, 39 transitions, 90 flow [2023-11-26 12:02:17,784 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 7 states, 7 states have (on average 29.857142857142858) internal successors, (209), 7 states have internal predecessors, (209), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-26 12:02:17,784 INFO L200 CegarLoopForPetriNet]: Found error trace [2023-11-26 12:02:17,784 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-11-26 12:02:17,784 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable7 [2023-11-26 12:02:17,784 INFO L420 AbstractCegarLoop]: === Iteration 9 === Targeting ULTIMATE.startErr6ASSERT_VIOLATIONMEMORY_LEAK === [P2Err0ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 10 more)] === [2023-11-26 12:02:17,785 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-11-26 12:02:17,785 INFO L85 PathProgramCache]: Analyzing trace with hash 844612832, now seen corresponding path program 1 times [2023-11-26 12:02:17,785 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-11-26 12:02:17,785 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1757542548] [2023-11-26 12:02:17,786 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-11-26 12:02:17,786 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-11-26 12:02:17,817 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-26 12:02:17,949 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-11-26 12:02:17,949 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-11-26 12:02:17,949 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1757542548] [2023-11-26 12:02:17,950 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1757542548] provided 1 perfect and 0 imperfect interpolant sequences [2023-11-26 12:02:17,950 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-11-26 12:02:17,950 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2023-11-26 12:02:17,950 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [332106767] [2023-11-26 12:02:17,951 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-11-26 12:02:17,951 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2023-11-26 12:02:17,951 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-11-26 12:02:17,952 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2023-11-26 12:02:17,952 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2023-11-26 12:02:17,957 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 28 out of 55 [2023-11-26 12:02:17,958 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 52 places, 39 transitions, 90 flow. Second operand has 4 states, 4 states have (on average 31.0) internal successors, (124), 4 states have internal predecessors, (124), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-26 12:02:17,958 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2023-11-26 12:02:17,958 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 28 of 55 [2023-11-26 12:02:17,958 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2023-11-26 12:02:18,272 INFO L124 PetriNetUnfolderBase]: 899/1613 cut-off events. [2023-11-26 12:02:18,272 INFO L125 PetriNetUnfolderBase]: For 13/13 co-relation queries the response was YES. [2023-11-26 12:02:18,275 INFO L83 FinitePrefix]: Finished finitePrefix Result has 3044 conditions, 1613 events. 899/1613 cut-off events. For 13/13 co-relation queries the response was YES. Maximal size of possible extension queue 137. Compared 10510 event pairs, 94 based on Foata normal form. 60/1664 useless extension candidates. Maximal degree in co-relation 3033. Up to 846 conditions per place. [2023-11-26 12:02:18,286 INFO L140 encePairwiseOnDemand]: 49/55 looper letters, 36 selfloop transitions, 5 changer transitions 1/60 dead transitions. [2023-11-26 12:02:18,287 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 53 places, 60 transitions, 224 flow [2023-11-26 12:02:18,287 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2023-11-26 12:02:18,287 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 4 states. [2023-11-26 12:02:18,288 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 156 transitions. [2023-11-26 12:02:18,288 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.7090909090909091 [2023-11-26 12:02:18,288 INFO L72 ComplementDD]: Start complementDD. Operand 4 states and 156 transitions. [2023-11-26 12:02:18,289 INFO L73 IsDeterministic]: Start isDeterministic. Operand 4 states and 156 transitions. [2023-11-26 12:02:18,289 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2023-11-26 12:02:18,289 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 4 states and 156 transitions. [2023-11-26 12:02:18,290 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 5 states, 4 states have (on average 39.0) internal successors, (156), 4 states have internal predecessors, (156), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-26 12:02:18,291 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 5 states, 5 states have (on average 55.0) internal successors, (275), 5 states have internal predecessors, (275), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-26 12:02:18,291 INFO L81 ComplementDD]: Finished complementDD. Result has 5 states, 5 states have (on average 55.0) internal successors, (275), 5 states have internal predecessors, (275), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-26 12:02:18,291 INFO L175 Difference]: Start difference. First operand has 52 places, 39 transitions, 90 flow. Second operand 4 states and 156 transitions. [2023-11-26 12:02:18,291 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 53 places, 60 transitions, 224 flow [2023-11-26 12:02:18,292 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 50 places, 60 transitions, 216 flow, removed 0 selfloop flow, removed 3 redundant places. [2023-11-26 12:02:18,294 INFO L231 Difference]: Finished difference. Result has 52 places, 42 transitions, 119 flow [2023-11-26 12:02:18,294 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=55, PETRI_DIFFERENCE_MINUEND_FLOW=85, PETRI_DIFFERENCE_MINUEND_PLACES=47, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=39, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=2, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=34, PETRI_DIFFERENCE_SUBTRAHEND_STATES=4, PETRI_FLOW=119, PETRI_PLACES=52, PETRI_TRANSITIONS=42} [2023-11-26 12:02:18,295 INFO L281 CegarLoopForPetriNet]: 60 programPoint places, -8 predicate places. [2023-11-26 12:02:18,295 INFO L495 AbstractCegarLoop]: Abstraction has has 52 places, 42 transitions, 119 flow [2023-11-26 12:02:18,295 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 31.0) internal successors, (124), 4 states have internal predecessors, (124), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-26 12:02:18,296 INFO L200 CegarLoopForPetriNet]: Found error trace [2023-11-26 12:02:18,296 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-26 12:02:18,296 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable8 [2023-11-26 12:02:18,296 INFO L420 AbstractCegarLoop]: === Iteration 10 === Targeting ULTIMATE.startErr6ASSERT_VIOLATIONMEMORY_LEAK === [P2Err0ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 10 more)] === [2023-11-26 12:02:18,297 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-11-26 12:02:18,297 INFO L85 PathProgramCache]: Analyzing trace with hash 1355109347, now seen corresponding path program 1 times [2023-11-26 12:02:18,297 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-11-26 12:02:18,297 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [209469539] [2023-11-26 12:02:18,298 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-11-26 12:02:18,298 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-11-26 12:02:18,344 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-26 12:02:18,596 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-11-26 12:02:18,596 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-11-26 12:02:18,597 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [209469539] [2023-11-26 12:02:18,597 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [209469539] provided 1 perfect and 0 imperfect interpolant sequences [2023-11-26 12:02:18,597 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-11-26 12:02:18,597 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2023-11-26 12:02:18,599 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [29656842] [2023-11-26 12:02:18,599 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-11-26 12:02:18,600 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2023-11-26 12:02:18,601 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-11-26 12:02:18,601 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2023-11-26 12:02:18,601 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=8, Invalid=12, Unknown=0, NotChecked=0, Total=20 [2023-11-26 12:02:18,612 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 28 out of 55 [2023-11-26 12:02:18,613 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 52 places, 42 transitions, 119 flow. Second operand has 5 states, 5 states have (on average 31.0) internal successors, (155), 5 states have internal predecessors, (155), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-26 12:02:18,613 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2023-11-26 12:02:18,613 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 28 of 55 [2023-11-26 12:02:18,613 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2023-11-26 12:02:18,958 INFO L124 PetriNetUnfolderBase]: 628/1138 cut-off events. [2023-11-26 12:02:18,959 INFO L125 PetriNetUnfolderBase]: For 311/311 co-relation queries the response was YES. [2023-11-26 12:02:18,962 INFO L83 FinitePrefix]: Finished finitePrefix Result has 2589 conditions, 1138 events. 628/1138 cut-off events. For 311/311 co-relation queries the response was YES. Maximal size of possible extension queue 77. Compared 6511 event pairs, 34 based on Foata normal form. 54/1183 useless extension candidates. Maximal degree in co-relation 2576. Up to 461 conditions per place. [2023-11-26 12:02:18,971 INFO L140 encePairwiseOnDemand]: 49/55 looper letters, 45 selfloop transitions, 8 changer transitions 1/72 dead transitions. [2023-11-26 12:02:18,971 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 56 places, 72 transitions, 310 flow [2023-11-26 12:02:18,972 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2023-11-26 12:02:18,972 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 5 states. [2023-11-26 12:02:18,973 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 196 transitions. [2023-11-26 12:02:18,974 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.7127272727272728 [2023-11-26 12:02:18,974 INFO L72 ComplementDD]: Start complementDD. Operand 5 states and 196 transitions. [2023-11-26 12:02:18,974 INFO L73 IsDeterministic]: Start isDeterministic. Operand 5 states and 196 transitions. [2023-11-26 12:02:18,975 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2023-11-26 12:02:18,975 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 5 states and 196 transitions. [2023-11-26 12:02:18,976 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 6 states, 5 states have (on average 39.2) internal successors, (196), 5 states have internal predecessors, (196), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-26 12:02:18,977 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 6 states, 6 states have (on average 55.0) internal successors, (330), 6 states have internal predecessors, (330), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-26 12:02:18,978 INFO L81 ComplementDD]: Finished complementDD. Result has 6 states, 6 states have (on average 55.0) internal successors, (330), 6 states have internal predecessors, (330), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-26 12:02:18,978 INFO L175 Difference]: Start difference. First operand has 52 places, 42 transitions, 119 flow. Second operand 5 states and 196 transitions. [2023-11-26 12:02:18,978 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 56 places, 72 transitions, 310 flow [2023-11-26 12:02:18,981 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 54 places, 72 transitions, 300 flow, removed 1 selfloop flow, removed 2 redundant places. [2023-11-26 12:02:18,984 INFO L231 Difference]: Finished difference. Result has 56 places, 45 transitions, 159 flow [2023-11-26 12:02:18,986 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=55, PETRI_DIFFERENCE_MINUEND_FLOW=111, PETRI_DIFFERENCE_MINUEND_PLACES=50, 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=159, PETRI_PLACES=56, PETRI_TRANSITIONS=45} [2023-11-26 12:02:18,987 INFO L281 CegarLoopForPetriNet]: 60 programPoint places, -4 predicate places. [2023-11-26 12:02:18,987 INFO L495 AbstractCegarLoop]: Abstraction has has 56 places, 45 transitions, 159 flow [2023-11-26 12:02:18,988 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 31.0) internal successors, (155), 5 states have internal predecessors, (155), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-26 12:02:18,988 INFO L200 CegarLoopForPetriNet]: Found error trace [2023-11-26 12:02:18,988 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] [2023-11-26 12:02:18,988 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable9 [2023-11-26 12:02:18,989 INFO L420 AbstractCegarLoop]: === Iteration 11 === Targeting ULTIMATE.startErr6ASSERT_VIOLATIONMEMORY_LEAK === [P2Err0ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 10 more)] === [2023-11-26 12:02:18,989 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-11-26 12:02:18,990 INFO L85 PathProgramCache]: Analyzing trace with hash 218698784, now seen corresponding path program 1 times [2023-11-26 12:02:18,990 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-11-26 12:02:18,992 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [250722065] [2023-11-26 12:02:18,993 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-11-26 12:02:18,993 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-11-26 12:02:19,067 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-26 12:02:19,343 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-11-26 12:02:19,344 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-11-26 12:02:19,344 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [250722065] [2023-11-26 12:02:19,344 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [250722065] provided 1 perfect and 0 imperfect interpolant sequences [2023-11-26 12:02:19,344 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-11-26 12:02:19,344 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2023-11-26 12:02:19,345 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [909521774] [2023-11-26 12:02:19,345 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-11-26 12:02:19,345 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2023-11-26 12:02:19,346 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-11-26 12:02:19,346 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2023-11-26 12:02:19,347 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=12, Invalid=18, Unknown=0, NotChecked=0, Total=30 [2023-11-26 12:02:19,360 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 28 out of 55 [2023-11-26 12:02:19,361 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 56 places, 45 transitions, 159 flow. Second operand has 6 states, 6 states have (on average 30.666666666666668) internal successors, (184), 6 states have internal predecessors, (184), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-26 12:02:19,361 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2023-11-26 12:02:19,361 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 28 of 55 [2023-11-26 12:02:19,361 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2023-11-26 12:02:19,605 INFO L124 PetriNetUnfolderBase]: 357/629 cut-off events. [2023-11-26 12:02:19,605 INFO L125 PetriNetUnfolderBase]: For 574/574 co-relation queries the response was YES. [2023-11-26 12:02:19,607 INFO L83 FinitePrefix]: Finished finitePrefix Result has 1679 conditions, 629 events. 357/629 cut-off events. For 574/574 co-relation queries the response was YES. Maximal size of possible extension queue 42. Compared 2844 event pairs, 23 based on Foata normal form. 32/652 useless extension candidates. Maximal degree in co-relation 1664. Up to 228 conditions per place. [2023-11-26 12:02:19,611 INFO L140 encePairwiseOnDemand]: 49/55 looper letters, 40 selfloop transitions, 11 changer transitions 1/70 dead transitions. [2023-11-26 12:02:19,612 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 61 places, 70 transitions, 325 flow [2023-11-26 12:02:19,612 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2023-11-26 12:02:19,612 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 6 states. [2023-11-26 12:02:19,613 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6 states to 6 states and 222 transitions. [2023-11-26 12:02:19,614 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.6727272727272727 [2023-11-26 12:02:19,614 INFO L72 ComplementDD]: Start complementDD. Operand 6 states and 222 transitions. [2023-11-26 12:02:19,614 INFO L73 IsDeterministic]: Start isDeterministic. Operand 6 states and 222 transitions. [2023-11-26 12:02:19,614 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2023-11-26 12:02:19,615 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 6 states and 222 transitions. [2023-11-26 12:02:19,615 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 7 states, 6 states have (on average 37.0) internal successors, (222), 6 states have internal predecessors, (222), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-26 12:02:19,617 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 7 states, 7 states have (on average 55.0) internal successors, (385), 7 states have internal predecessors, (385), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-26 12:02:19,617 INFO L81 ComplementDD]: Finished complementDD. Result has 7 states, 7 states have (on average 55.0) internal successors, (385), 7 states have internal predecessors, (385), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-26 12:02:19,617 INFO L175 Difference]: Start difference. First operand has 56 places, 45 transitions, 159 flow. Second operand 6 states and 222 transitions. [2023-11-26 12:02:19,617 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 61 places, 70 transitions, 325 flow [2023-11-26 12:02:19,620 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 57 places, 70 transitions, 300 flow, removed 4 selfloop flow, removed 4 redundant places. [2023-11-26 12:02:19,622 INFO L231 Difference]: Finished difference. Result has 59 places, 45 transitions, 173 flow [2023-11-26 12:02:19,622 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=55, PETRI_DIFFERENCE_MINUEND_FLOW=137, PETRI_DIFFERENCE_MINUEND_PLACES=52, 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=173, PETRI_PLACES=59, PETRI_TRANSITIONS=45} [2023-11-26 12:02:19,623 INFO L281 CegarLoopForPetriNet]: 60 programPoint places, -1 predicate places. [2023-11-26 12:02:19,623 INFO L495 AbstractCegarLoop]: Abstraction has has 59 places, 45 transitions, 173 flow [2023-11-26 12:02:19,624 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 30.666666666666668) internal successors, (184), 6 states have internal predecessors, (184), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-26 12:02:19,624 INFO L200 CegarLoopForPetriNet]: Found error trace [2023-11-26 12:02:19,624 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-11-26 12:02:19,624 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable10 [2023-11-26 12:02:19,624 INFO L420 AbstractCegarLoop]: === Iteration 12 === Targeting ULTIMATE.startErr6ASSERT_VIOLATIONMEMORY_LEAK === [P2Err0ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 10 more)] === [2023-11-26 12:02:19,625 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-11-26 12:02:19,625 INFO L85 PathProgramCache]: Analyzing trace with hash -921595523, now seen corresponding path program 1 times [2023-11-26 12:02:19,625 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-11-26 12:02:19,625 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [413047271] [2023-11-26 12:02:19,626 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-11-26 12:02:19,626 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-11-26 12:02:19,687 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-26 12:02:19,988 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-11-26 12:02:19,988 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-11-26 12:02:19,988 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [413047271] [2023-11-26 12:02:19,989 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [413047271] provided 1 perfect and 0 imperfect interpolant sequences [2023-11-26 12:02:19,989 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-11-26 12:02:19,989 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2023-11-26 12:02:19,989 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [52850433] [2023-11-26 12:02:19,989 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-11-26 12:02:19,990 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2023-11-26 12:02:19,990 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-11-26 12:02:19,991 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2023-11-26 12:02:19,991 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2023-11-26 12:02:20,007 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 27 out of 55 [2023-11-26 12:02:20,007 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 59 places, 45 transitions, 173 flow. Second operand has 6 states, 6 states have (on average 30.166666666666668) internal successors, (181), 6 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-26 12:02:20,007 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2023-11-26 12:02:20,008 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 27 of 55 [2023-11-26 12:02:20,008 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2023-11-26 12:02:20,447 INFO L124 PetriNetUnfolderBase]: 767/1560 cut-off events. [2023-11-26 12:02:20,447 INFO L125 PetriNetUnfolderBase]: For 672/688 co-relation queries the response was YES. [2023-11-26 12:02:20,453 INFO L83 FinitePrefix]: Finished finitePrefix Result has 3505 conditions, 1560 events. 767/1560 cut-off events. For 672/688 co-relation queries the response was YES. Maximal size of possible extension queue 100. Compared 9455 event pairs, 56 based on Foata normal form. 8/1531 useless extension candidates. Maximal degree in co-relation 3489. Up to 543 conditions per place. [2023-11-26 12:02:20,460 INFO L140 encePairwiseOnDemand]: 46/55 looper letters, 44 selfloop transitions, 10 changer transitions 12/89 dead transitions. [2023-11-26 12:02:20,461 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 65 places, 89 transitions, 412 flow [2023-11-26 12:02:20,461 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2023-11-26 12:02:20,461 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 7 states. [2023-11-26 12:02:20,462 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 7 states to 7 states and 256 transitions. [2023-11-26 12:02:20,463 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.6649350649350649 [2023-11-26 12:02:20,463 INFO L72 ComplementDD]: Start complementDD. Operand 7 states and 256 transitions. [2023-11-26 12:02:20,463 INFO L73 IsDeterministic]: Start isDeterministic. Operand 7 states and 256 transitions. [2023-11-26 12:02:20,464 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2023-11-26 12:02:20,464 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 7 states and 256 transitions. [2023-11-26 12:02:20,466 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 8 states, 7 states have (on average 36.57142857142857) internal successors, (256), 7 states have internal predecessors, (256), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-26 12:02:20,468 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 8 states, 8 states have (on average 55.0) internal successors, (440), 8 states have internal predecessors, (440), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-26 12:02:20,470 INFO L81 ComplementDD]: Finished complementDD. Result has 8 states, 8 states have (on average 55.0) internal successors, (440), 8 states have internal predecessors, (440), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-26 12:02:20,470 INFO L175 Difference]: Start difference. First operand has 59 places, 45 transitions, 173 flow. Second operand 7 states and 256 transitions. [2023-11-26 12:02:20,470 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 65 places, 89 transitions, 412 flow [2023-11-26 12:02:20,483 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 57 places, 89 transitions, 348 flow, removed 14 selfloop flow, removed 8 redundant places. [2023-11-26 12:02:20,485 INFO L231 Difference]: Finished difference. Result has 63 places, 52 transitions, 187 flow [2023-11-26 12:02:20,485 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=55, PETRI_DIFFERENCE_MINUEND_FLOW=117, PETRI_DIFFERENCE_MINUEND_PLACES=51, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=45, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=3, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=39, PETRI_DIFFERENCE_SUBTRAHEND_STATES=7, PETRI_FLOW=187, PETRI_PLACES=63, PETRI_TRANSITIONS=52} [2023-11-26 12:02:20,488 INFO L281 CegarLoopForPetriNet]: 60 programPoint places, 3 predicate places. [2023-11-26 12:02:20,489 INFO L495 AbstractCegarLoop]: Abstraction has has 63 places, 52 transitions, 187 flow [2023-11-26 12:02:20,489 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 30.166666666666668) internal successors, (181), 6 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-26 12:02:20,489 INFO L200 CegarLoopForPetriNet]: Found error trace [2023-11-26 12:02:20,490 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-11-26 12:02:20,490 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable11 [2023-11-26 12:02:20,490 INFO L420 AbstractCegarLoop]: === Iteration 13 === Targeting ULTIMATE.startErr6ASSERT_VIOLATIONMEMORY_LEAK === [P2Err0ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 10 more)] === [2023-11-26 12:02:20,491 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-11-26 12:02:20,491 INFO L85 PathProgramCache]: Analyzing trace with hash 64696271, now seen corresponding path program 2 times [2023-11-26 12:02:20,491 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-11-26 12:02:20,491 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [944530041] [2023-11-26 12:02:20,491 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-11-26 12:02:20,492 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-11-26 12:02:20,559 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-26 12:02:20,816 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-11-26 12:02:20,817 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-11-26 12:02:20,817 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [944530041] [2023-11-26 12:02:20,817 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [944530041] provided 1 perfect and 0 imperfect interpolant sequences [2023-11-26 12:02:20,817 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-11-26 12:02:20,818 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2023-11-26 12:02:20,818 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2140199518] [2023-11-26 12:02:20,818 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-11-26 12:02:20,818 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2023-11-26 12:02:20,819 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-11-26 12:02:20,820 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2023-11-26 12:02:20,820 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=10, Invalid=20, Unknown=0, NotChecked=0, Total=30 [2023-11-26 12:02:20,835 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 28 out of 55 [2023-11-26 12:02:20,835 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 63 places, 52 transitions, 187 flow. Second operand has 6 states, 6 states have (on average 31.0) internal successors, (186), 6 states have internal predecessors, (186), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-26 12:02:20,835 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2023-11-26 12:02:20,836 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 28 of 55 [2023-11-26 12:02:20,836 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2023-11-26 12:02:21,224 INFO L124 PetriNetUnfolderBase]: 916/1909 cut-off events. [2023-11-26 12:02:21,225 INFO L125 PetriNetUnfolderBase]: For 679/699 co-relation queries the response was YES. [2023-11-26 12:02:21,233 INFO L83 FinitePrefix]: Finished finitePrefix Result has 4293 conditions, 1909 events. 916/1909 cut-off events. For 679/699 co-relation queries the response was YES. Maximal size of possible extension queue 126. Compared 12530 event pairs, 237 based on Foata normal form. 28/1853 useless extension candidates. Maximal degree in co-relation 4275. Up to 757 conditions per place. [2023-11-26 12:02:21,238 INFO L140 encePairwiseOnDemand]: 48/55 looper letters, 24 selfloop transitions, 4 changer transitions 28/81 dead transitions. [2023-11-26 12:02:21,239 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 66 places, 81 transitions, 396 flow [2023-11-26 12:02:21,239 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2023-11-26 12:02:21,239 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 6 states. [2023-11-26 12:02:21,240 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6 states to 6 states and 216 transitions. [2023-11-26 12:02:21,241 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.6545454545454545 [2023-11-26 12:02:21,241 INFO L72 ComplementDD]: Start complementDD. Operand 6 states and 216 transitions. [2023-11-26 12:02:21,241 INFO L73 IsDeterministic]: Start isDeterministic. Operand 6 states and 216 transitions. [2023-11-26 12:02:21,242 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2023-11-26 12:02:21,242 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 6 states and 216 transitions. [2023-11-26 12:02:21,243 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 7 states, 6 states have (on average 36.0) internal successors, (216), 6 states have internal predecessors, (216), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-26 12:02:21,244 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 7 states, 7 states have (on average 55.0) internal successors, (385), 7 states have internal predecessors, (385), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-26 12:02:21,245 INFO L81 ComplementDD]: Finished complementDD. Result has 7 states, 7 states have (on average 55.0) internal successors, (385), 7 states have internal predecessors, (385), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-26 12:02:21,245 INFO L175 Difference]: Start difference. First operand has 63 places, 52 transitions, 187 flow. Second operand 6 states and 216 transitions. [2023-11-26 12:02:21,245 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 66 places, 81 transitions, 396 flow [2023-11-26 12:02:21,249 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 64 places, 81 transitions, 390 flow, removed 3 selfloop flow, removed 2 redundant places. [2023-11-26 12:02:21,251 INFO L231 Difference]: Finished difference. Result has 68 places, 49 transitions, 186 flow [2023-11-26 12:02:21,251 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=55, PETRI_DIFFERENCE_MINUEND_FLOW=183, PETRI_DIFFERENCE_MINUEND_PLACES=59, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=52, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=4, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=48, PETRI_DIFFERENCE_SUBTRAHEND_STATES=6, PETRI_FLOW=186, PETRI_PLACES=68, PETRI_TRANSITIONS=49} [2023-11-26 12:02:21,252 INFO L281 CegarLoopForPetriNet]: 60 programPoint places, 8 predicate places. [2023-11-26 12:02:21,253 INFO L495 AbstractCegarLoop]: Abstraction has has 68 places, 49 transitions, 186 flow [2023-11-26 12:02:21,253 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 31.0) internal successors, (186), 6 states have internal predecessors, (186), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-26 12:02:21,253 INFO L200 CegarLoopForPetriNet]: Found error trace [2023-11-26 12:02:21,254 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-11-26 12:02:21,254 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable12 [2023-11-26 12:02:21,254 INFO L420 AbstractCegarLoop]: === Iteration 14 === Targeting ULTIMATE.startErr6ASSERT_VIOLATIONMEMORY_LEAK === [P2Err0ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 10 more)] === [2023-11-26 12:02:21,255 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-11-26 12:02:21,256 INFO L85 PathProgramCache]: Analyzing trace with hash 326794943, now seen corresponding path program 3 times [2023-11-26 12:02:21,256 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-11-26 12:02:21,256 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [590261609] [2023-11-26 12:02:21,256 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-11-26 12:02:21,257 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-11-26 12:02:21,339 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-26 12:02:21,959 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-11-26 12:02:21,960 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-11-26 12:02:21,960 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [590261609] [2023-11-26 12:02:21,960 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [590261609] provided 1 perfect and 0 imperfect interpolant sequences [2023-11-26 12:02:21,960 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-11-26 12:02:21,960 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2023-11-26 12:02:21,961 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [698985555] [2023-11-26 12:02:21,961 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-11-26 12:02:21,961 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 8 states [2023-11-26 12:02:21,961 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-11-26 12:02:21,962 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2023-11-26 12:02:21,962 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=15, Invalid=41, Unknown=0, NotChecked=0, Total=56 [2023-11-26 12:02:21,972 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 31 out of 55 [2023-11-26 12:02:21,973 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 68 places, 49 transitions, 186 flow. Second operand has 8 states, 8 states have (on average 32.875) internal successors, (263), 8 states have internal predecessors, (263), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-26 12:02:21,973 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2023-11-26 12:02:21,973 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 31 of 55 [2023-11-26 12:02:21,973 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2023-11-26 12:02:22,348 INFO L124 PetriNetUnfolderBase]: 449/942 cut-off events. [2023-11-26 12:02:22,348 INFO L125 PetriNetUnfolderBase]: For 163/171 co-relation queries the response was YES. [2023-11-26 12:02:22,351 INFO L83 FinitePrefix]: Finished finitePrefix Result has 1984 conditions, 942 events. 449/942 cut-off events. For 163/171 co-relation queries the response was YES. Maximal size of possible extension queue 66. Compared 5197 event pairs, 78 based on Foata normal form. 16/887 useless extension candidates. Maximal degree in co-relation 1962. Up to 233 conditions per place. [2023-11-26 12:02:22,355 INFO L140 encePairwiseOnDemand]: 47/55 looper letters, 24 selfloop transitions, 6 changer transitions 15/75 dead transitions. [2023-11-26 12:02:22,355 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 74 places, 75 transitions, 342 flow [2023-11-26 12:02:22,356 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2023-11-26 12:02:22,356 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 9 states. [2023-11-26 12:02:22,357 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 9 states to 9 states and 323 transitions. [2023-11-26 12:02:22,357 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.6525252525252525 [2023-11-26 12:02:22,358 INFO L72 ComplementDD]: Start complementDD. Operand 9 states and 323 transitions. [2023-11-26 12:02:22,358 INFO L73 IsDeterministic]: Start isDeterministic. Operand 9 states and 323 transitions. [2023-11-26 12:02:22,358 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2023-11-26 12:02:22,358 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 9 states and 323 transitions. [2023-11-26 12:02:22,360 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 10 states, 9 states have (on average 35.888888888888886) internal successors, (323), 9 states have internal predecessors, (323), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-26 12:02:22,361 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 10 states, 10 states have (on average 55.0) internal successors, (550), 10 states have internal predecessors, (550), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-26 12:02:22,362 INFO L81 ComplementDD]: Finished complementDD. Result has 10 states, 10 states have (on average 55.0) internal successors, (550), 10 states have internal predecessors, (550), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-26 12:02:22,362 INFO L175 Difference]: Start difference. First operand has 68 places, 49 transitions, 186 flow. Second operand 9 states and 323 transitions. [2023-11-26 12:02:22,362 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 74 places, 75 transitions, 342 flow [2023-11-26 12:02:22,364 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 67 places, 75 transitions, 312 flow, removed 8 selfloop flow, removed 7 redundant places. [2023-11-26 12:02:22,366 INFO L231 Difference]: Finished difference. Result has 71 places, 51 transitions, 198 flow [2023-11-26 12:02:22,367 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=55, PETRI_DIFFERENCE_MINUEND_FLOW=160, PETRI_DIFFERENCE_MINUEND_PLACES=59, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=49, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=4, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=43, PETRI_DIFFERENCE_SUBTRAHEND_STATES=9, PETRI_FLOW=198, PETRI_PLACES=71, PETRI_TRANSITIONS=51} [2023-11-26 12:02:22,367 INFO L281 CegarLoopForPetriNet]: 60 programPoint places, 11 predicate places. [2023-11-26 12:02:22,367 INFO L495 AbstractCegarLoop]: Abstraction has has 71 places, 51 transitions, 198 flow [2023-11-26 12:02:22,368 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 8 states, 8 states have (on average 32.875) internal successors, (263), 8 states have internal predecessors, (263), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-26 12:02:22,368 INFO L200 CegarLoopForPetriNet]: Found error trace [2023-11-26 12:02:22,368 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-11-26 12:02:22,368 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable13 [2023-11-26 12:02:22,369 INFO L420 AbstractCegarLoop]: === Iteration 15 === Targeting ULTIMATE.startErr6ASSERT_VIOLATIONMEMORY_LEAK === [P2Err0ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 10 more)] === [2023-11-26 12:02:22,369 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-11-26 12:02:22,369 INFO L85 PathProgramCache]: Analyzing trace with hash 564638267, now seen corresponding path program 4 times [2023-11-26 12:02:22,369 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-11-26 12:02:22,370 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2021670969] [2023-11-26 12:02:22,370 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-11-26 12:02:22,370 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-11-26 12:02:22,409 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-26 12:02:22,650 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-11-26 12:02:22,650 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-11-26 12:02:22,650 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2021670969] [2023-11-26 12:02:22,651 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2021670969] provided 1 perfect and 0 imperfect interpolant sequences [2023-11-26 12:02:22,651 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-11-26 12:02:22,651 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2023-11-26 12:02:22,651 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1338115359] [2023-11-26 12:02:22,652 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-11-26 12:02:22,653 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2023-11-26 12:02:22,655 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-11-26 12:02:22,656 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2023-11-26 12:02:22,656 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=12, Invalid=30, Unknown=0, NotChecked=0, Total=42 [2023-11-26 12:02:22,682 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 27 out of 55 [2023-11-26 12:02:22,683 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 71 places, 51 transitions, 198 flow. Second operand has 7 states, 7 states have (on average 29.714285714285715) internal successors, (208), 7 states have internal predecessors, (208), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-26 12:02:22,683 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2023-11-26 12:02:22,683 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 27 of 55 [2023-11-26 12:02:22,684 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2023-11-26 12:02:23,152 INFO L124 PetriNetUnfolderBase]: 675/1424 cut-off events. [2023-11-26 12:02:23,152 INFO L125 PetriNetUnfolderBase]: For 580/580 co-relation queries the response was YES. [2023-11-26 12:02:23,158 INFO L83 FinitePrefix]: Finished finitePrefix Result has 3142 conditions, 1424 events. 675/1424 cut-off events. For 580/580 co-relation queries the response was YES. Maximal size of possible extension queue 113. Compared 8799 event pairs, 202 based on Foata normal form. 8/1337 useless extension candidates. Maximal degree in co-relation 3121. Up to 460 conditions per place. [2023-11-26 12:02:23,162 INFO L140 encePairwiseOnDemand]: 47/55 looper letters, 22 selfloop transitions, 3 changer transitions 34/82 dead transitions. [2023-11-26 12:02:23,163 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 75 places, 82 transitions, 423 flow [2023-11-26 12:02:23,163 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2023-11-26 12:02:23,164 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 8 states. [2023-11-26 12:02:23,165 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 8 states to 8 states and 273 transitions. [2023-11-26 12:02:23,165 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.6204545454545455 [2023-11-26 12:02:23,166 INFO L72 ComplementDD]: Start complementDD. Operand 8 states and 273 transitions. [2023-11-26 12:02:23,166 INFO L73 IsDeterministic]: Start isDeterministic. Operand 8 states and 273 transitions. [2023-11-26 12:02:23,166 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2023-11-26 12:02:23,167 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 8 states and 273 transitions. [2023-11-26 12:02:23,168 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 9 states, 8 states have (on average 34.125) internal successors, (273), 8 states have internal predecessors, (273), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-26 12:02:23,170 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 9 states, 9 states have (on average 55.0) internal successors, (495), 9 states have internal predecessors, (495), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-26 12:02:23,170 INFO L81 ComplementDD]: Finished complementDD. Result has 9 states, 9 states have (on average 55.0) internal successors, (495), 9 states have internal predecessors, (495), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-26 12:02:23,171 INFO L175 Difference]: Start difference. First operand has 71 places, 51 transitions, 198 flow. Second operand 8 states and 273 transitions. [2023-11-26 12:02:23,171 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 75 places, 82 transitions, 423 flow [2023-11-26 12:02:23,174 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 69 places, 82 transitions, 396 flow, removed 7 selfloop flow, removed 6 redundant places. [2023-11-26 12:02:23,176 INFO L231 Difference]: Finished difference. Result has 72 places, 45 transitions, 152 flow [2023-11-26 12:02:23,177 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=55, PETRI_DIFFERENCE_MINUEND_FLOW=184, PETRI_DIFFERENCE_MINUEND_PLACES=62, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=51, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=3, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=48, PETRI_DIFFERENCE_SUBTRAHEND_STATES=8, PETRI_FLOW=152, PETRI_PLACES=72, PETRI_TRANSITIONS=45} [2023-11-26 12:02:23,177 INFO L281 CegarLoopForPetriNet]: 60 programPoint places, 12 predicate places. [2023-11-26 12:02:23,178 INFO L495 AbstractCegarLoop]: Abstraction has has 72 places, 45 transitions, 152 flow [2023-11-26 12:02:23,178 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 7 states, 7 states have (on average 29.714285714285715) internal successors, (208), 7 states have internal predecessors, (208), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-26 12:02:23,178 INFO L200 CegarLoopForPetriNet]: Found error trace [2023-11-26 12:02:23,179 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-11-26 12:02:23,179 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable14 [2023-11-26 12:02:23,179 INFO L420 AbstractCegarLoop]: === Iteration 16 === Targeting ULTIMATE.startErr6ASSERT_VIOLATIONMEMORY_LEAK === [P2Err0ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 10 more)] === [2023-11-26 12:02:23,180 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-11-26 12:02:23,180 INFO L85 PathProgramCache]: Analyzing trace with hash 1719126863, now seen corresponding path program 5 times [2023-11-26 12:02:23,180 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-11-26 12:02:23,180 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [442475026] [2023-11-26 12:02:23,181 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-11-26 12:02:23,181 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-11-26 12:02:23,242 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2023-11-26 12:02:23,243 INFO L356 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2023-11-26 12:02:23,288 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2023-11-26 12:02:23,324 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2023-11-26 12:02:23,324 INFO L360 BasicCegarLoop]: Counterexample is feasible [2023-11-26 12:02:23,326 INFO L805 garLoopResultBuilder]: Registering result UNSAFE for location ULTIMATE.startErr6ASSERT_VIOLATIONMEMORY_LEAK (12 of 13 remaining) [2023-11-26 12:02:23,328 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location P2Err0ASSERT_VIOLATIONMEMORY_LEAK (11 of 13 remaining) [2023-11-26 12:02:23,328 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE (10 of 13 remaining) [2023-11-26 12:02:23,328 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE (9 of 13 remaining) [2023-11-26 12:02:23,329 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (8 of 13 remaining) [2023-11-26 12:02:23,329 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr3REQUIRES_VIOLATIONMEMORY_DEREFERENCE (7 of 13 remaining) [2023-11-26 12:02:23,329 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr4REQUIRES_VIOLATIONMEMORY_DEREFERENCE (6 of 13 remaining) [2023-11-26 12:02:23,329 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr5REQUIRES_VIOLATIONMEMORY_DEREFERENCE (5 of 13 remaining) [2023-11-26 12:02:23,329 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr7ASSERT_VIOLATIONMEMORY_LEAK (4 of 13 remaining) [2023-11-26 12:02:23,330 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (3 of 13 remaining) [2023-11-26 12:02:23,330 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (2 of 13 remaining) [2023-11-26 12:02:23,330 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr2INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (1 of 13 remaining) [2023-11-26 12:02:23,330 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location P2Err0ASSERT_VIOLATIONMEMORY_LEAK (0 of 13 remaining) [2023-11-26 12:02:23,331 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable15 [2023-11-26 12:02:23,331 INFO L445 BasicCegarLoop]: Path program histogram: [5, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-11-26 12:02:23,337 INFO L228 ceAbstractionStarter]: Analysis of concurrent program completed with 1 thread instances [2023-11-26 12:02:23,338 INFO L178 ceAbstractionStarter]: Computing trace abstraction results [2023-11-26 12:02:23,394 WARN L1572 BoogieBacktranslator]: Unfinished Backtranslation: IdentifierExpression #t~pre5 could not be translated [2023-11-26 12:02:23,397 WARN L1572 BoogieBacktranslator]: Unfinished Backtranslation: IdentifierExpression #t~pre7 could not be translated [2023-11-26 12:02:23,398 WARN L1572 BoogieBacktranslator]: Unfinished Backtranslation: IdentifierExpression #t~pre9 could not be translated [2023-11-26 12:02:23,410 WARN L1572 BoogieBacktranslator]: Unfinished Backtranslation: unknown boogie variable #t~nondet0 [2023-11-26 12:02:23,411 WARN L1572 BoogieBacktranslator]: Unfinished Backtranslation: unknown boogie variable #t~nondet0 [2023-11-26 12:02:23,423 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 26.11 12:02:23 BasicIcfg [2023-11-26 12:02:23,423 INFO L131 PluginConnector]: ------------------------ END TraceAbstraction---------------------------- [2023-11-26 12:02:23,424 INFO L112 PluginConnector]: ------------------------Witness Printer---------------------------- [2023-11-26 12:02:23,424 INFO L270 PluginConnector]: Initializing Witness Printer... [2023-11-26 12:02:23,425 INFO L274 PluginConnector]: Witness Printer initialized [2023-11-26 12:02:23,425 INFO L184 PluginConnector]: Executing the observer RCFGCatcher from plugin Witness Printer for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 26.11 12:02:12" (3/4) ... [2023-11-26 12:02:23,427 INFO L140 WitnessPrinter]: No result that supports witness generation found [2023-11-26 12:02:23,428 INFO L131 PluginConnector]: ------------------------ END Witness Printer---------------------------- [2023-11-26 12:02:23,429 INFO L158 Benchmark]: Toolchain (without parser) took 12728.33ms. Allocated memory was 161.5MB in the beginning and 308.3MB in the end (delta: 146.8MB). Free memory was 116.8MB in the beginning and 200.5MB in the end (delta: -83.7MB). Peak memory consumption was 66.3MB. Max. memory is 16.1GB. [2023-11-26 12:02:23,430 INFO L158 Benchmark]: CDTParser took 0.34ms. Allocated memory is still 161.5MB. Free memory is still 136.1MB. There was no memory consumed. Max. memory is 16.1GB. [2023-11-26 12:02:23,430 INFO L158 Benchmark]: CACSL2BoogieTranslator took 728.29ms. Allocated memory is still 161.5MB. Free memory was 116.8MB in the beginning and 93.7MB in the end (delta: 23.1MB). Peak memory consumption was 23.1MB. Max. memory is 16.1GB. [2023-11-26 12:02:23,430 INFO L158 Benchmark]: Boogie Procedure Inliner took 95.35ms. Allocated memory is still 161.5MB. Free memory was 93.7MB in the beginning and 90.9MB in the end (delta: 2.8MB). Peak memory consumption was 4.2MB. Max. memory is 16.1GB. [2023-11-26 12:02:23,431 INFO L158 Benchmark]: Boogie Preprocessor took 98.67ms. Allocated memory is still 161.5MB. Free memory was 90.9MB in the beginning and 88.1MB in the end (delta: 2.8MB). Peak memory consumption was 2.1MB. Max. memory is 16.1GB. [2023-11-26 12:02:23,431 INFO L158 Benchmark]: RCFGBuilder took 1031.71ms. Allocated memory is still 161.5MB. Free memory was 88.1MB in the beginning and 120.3MB in the end (delta: -32.2MB). Peak memory consumption was 40.8MB. Max. memory is 16.1GB. [2023-11-26 12:02:23,432 INFO L158 Benchmark]: TraceAbstraction took 10761.82ms. Allocated memory was 161.5MB in the beginning and 308.3MB in the end (delta: 146.8MB). Free memory was 120.3MB in the beginning and 201.5MB in the end (delta: -81.2MB). Peak memory consumption was 65.3MB. Max. memory is 16.1GB. [2023-11-26 12:02:23,432 INFO L158 Benchmark]: Witness Printer took 4.43ms. Allocated memory is still 308.3MB. Free memory was 201.5MB in the beginning and 200.5MB in the end (delta: 1.1MB). Peak memory consumption was 2.1MB. Max. memory is 16.1GB. [2023-11-26 12:02:23,434 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.34ms. Allocated memory is still 161.5MB. Free memory is still 136.1MB. There was no memory consumed. Max. memory is 16.1GB. * CACSL2BoogieTranslator took 728.29ms. Allocated memory is still 161.5MB. Free memory was 116.8MB in the beginning and 93.7MB in the end (delta: 23.1MB). Peak memory consumption was 23.1MB. Max. memory is 16.1GB. * Boogie Procedure Inliner took 95.35ms. Allocated memory is still 161.5MB. Free memory was 93.7MB in the beginning and 90.9MB in the end (delta: 2.8MB). Peak memory consumption was 4.2MB. Max. memory is 16.1GB. * Boogie Preprocessor took 98.67ms. Allocated memory is still 161.5MB. Free memory was 90.9MB in the beginning and 88.1MB in the end (delta: 2.8MB). Peak memory consumption was 2.1MB. Max. memory is 16.1GB. * RCFGBuilder took 1031.71ms. Allocated memory is still 161.5MB. Free memory was 88.1MB in the beginning and 120.3MB in the end (delta: -32.2MB). Peak memory consumption was 40.8MB. Max. memory is 16.1GB. * TraceAbstraction took 10761.82ms. Allocated memory was 161.5MB in the beginning and 308.3MB in the end (delta: 146.8MB). Free memory was 120.3MB in the beginning and 201.5MB in the end (delta: -81.2MB). Peak memory consumption was 65.3MB. Max. memory is 16.1GB. * Witness Printer took 4.43ms. Allocated memory is still 308.3MB. Free memory was 201.5MB in the beginning and 200.5MB in the end (delta: 1.1MB). Peak memory consumption was 2.1MB. 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_p0_EAX = 0; [L713] 0 int __unbuffered_p1_EAX = 0; [L714] 0 _Bool main$tmp_guard0; [L715] 0 _Bool main$tmp_guard1; [L717] 0 int x = 0; [L719] 0 int y = 0; [L720] 0 _Bool y$flush_delayed; [L721] 0 int y$mem_tmp; [L722] 0 _Bool y$r_buff0_thd0; [L723] 0 _Bool y$r_buff0_thd1; [L724] 0 _Bool y$r_buff0_thd2; [L725] 0 _Bool y$r_buff0_thd3; [L726] 0 _Bool y$r_buff1_thd0; [L727] 0 _Bool y$r_buff1_thd1; [L728] 0 _Bool y$r_buff1_thd2; [L729] 0 _Bool y$r_buff1_thd3; [L730] 0 _Bool y$read_delayed; [L731] 0 int *y$read_delayed_var; [L732] 0 int y$w_buff0; [L733] 0 _Bool y$w_buff0_used; [L734] 0 int y$w_buff1; [L735] 0 _Bool y$w_buff1_used; [L737] 0 int z = 0; [L738] 0 _Bool weak$$choice0; [L739] 0 _Bool weak$$choice2; [L827] 0 pthread_t t2577; [L828] FCALL, FORK 0 pthread_create(&t2577, ((void *)0), P0, ((void *)0)) VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=0, __unbuffered_p1_EAX=0, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, t2577={5:0}, weak$$choice0=0, weak$$choice2=0, x=0, y$flush_delayed=0, y$mem_tmp=0, y$r_buff0_thd0=0, y$r_buff0_thd1=0, y$r_buff0_thd2=0, y$r_buff0_thd3=0, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$r_buff1_thd3=0, y$read_delayed=0, y$read_delayed_var={0:0}, y$w_buff0=0, y$w_buff0_used=0, y$w_buff1=0, y$w_buff1_used=0, y=0, z=0] [L829] 0 pthread_t t2578; [L830] FCALL, FORK 0 pthread_create(&t2578, ((void *)0), P1, ((void *)0)) VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=0, __unbuffered_p1_EAX=0, arg={0:0}, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, t2577={5:0}, t2578={6:0}, weak$$choice0=0, weak$$choice2=0, x=0, y$flush_delayed=0, y$mem_tmp=0, y$r_buff0_thd0=0, y$r_buff0_thd1=0, y$r_buff0_thd2=0, y$r_buff0_thd3=0, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$r_buff1_thd3=0, y$read_delayed=0, y$read_delayed_var={0:0}, y$w_buff0=0, y$w_buff0_used=0, y$w_buff1=0, y$w_buff1_used=0, y=0, z=0] [L831] 0 pthread_t t2579; [L832] FCALL, FORK 0 pthread_create(&t2579, ((void *)0), P2, ((void *)0)) VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=0, __unbuffered_p1_EAX=0, arg={0:0}, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, t2577={5:0}, t2578={6:0}, t2579={3:0}, weak$$choice0=0, weak$$choice2=0, x=0, y$flush_delayed=0, y$mem_tmp=0, y$r_buff0_thd0=0, y$r_buff0_thd1=0, y$r_buff0_thd2=0, y$r_buff0_thd3=0, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$r_buff1_thd3=0, y$read_delayed=0, y$read_delayed_var={0:0}, y$w_buff0=0, y$w_buff0_used=0, y$w_buff1=0, y$w_buff1_used=0, y=0, z=0] [L790] 3 y$w_buff1 = y$w_buff0 [L791] 3 y$w_buff0 = 1 [L792] 3 y$w_buff1_used = y$w_buff0_used [L793] 3 y$w_buff0_used = (_Bool)1 [L794] CALL 3 __VERIFIER_assert(!(y$w_buff1_used && y$w_buff0_used)) [L18] COND FALSE 3 !(!expression) [L794] RET 3 __VERIFIER_assert(!(y$w_buff1_used && y$w_buff0_used)) [L795] 3 y$r_buff1_thd0 = y$r_buff0_thd0 [L796] 3 y$r_buff1_thd1 = y$r_buff0_thd1 [L797] 3 y$r_buff1_thd2 = y$r_buff0_thd2 [L798] 3 y$r_buff1_thd3 = y$r_buff0_thd3 [L799] 3 y$r_buff0_thd3 = (_Bool)1 VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=0, __unbuffered_p1_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=0, y$flush_delayed=0, y$mem_tmp=0, y$r_buff0_thd0=0, y$r_buff0_thd1=0, y$r_buff0_thd2=0, y$r_buff0_thd3=1, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$r_buff1_thd3=0, y$read_delayed=0, y$read_delayed_var={0:0}, y$w_buff0=1, y$w_buff0_used=1, y$w_buff1=0, y$w_buff1_used=0, y=0, z=0] [L802] 3 z = 1 VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=0, __unbuffered_p1_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=0, y$flush_delayed=0, y$mem_tmp=0, y$r_buff0_thd0=0, y$r_buff0_thd1=0, y$r_buff0_thd2=0, y$r_buff0_thd3=1, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$r_buff1_thd3=0, y$read_delayed=0, y$read_delayed_var={0:0}, y$w_buff0=1, y$w_buff0_used=1, y$w_buff1=0, y$w_buff1_used=0, y=0, z=1] [L743] 1 z = 2 VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=0, __unbuffered_p1_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=0, y$flush_delayed=0, y$mem_tmp=0, y$r_buff0_thd0=0, y$r_buff0_thd1=0, y$r_buff0_thd2=0, y$r_buff0_thd3=1, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$r_buff1_thd3=0, y$read_delayed=0, y$read_delayed_var={0:0}, y$w_buff0=1, y$w_buff0_used=1, y$w_buff1=0, y$w_buff1_used=0, y=0, z=2] [L748] 1 __unbuffered_p0_EAX = x VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=0, __unbuffered_p1_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=0, y$flush_delayed=0, y$mem_tmp=0, y$r_buff0_thd0=0, y$r_buff0_thd1=0, y$r_buff0_thd2=0, y$r_buff0_thd3=1, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$r_buff1_thd3=0, y$read_delayed=0, y$read_delayed_var={0:0}, y$w_buff0=1, y$w_buff0_used=1, y$w_buff1=0, y$w_buff1_used=0, y=0, z=2] [L760] 2 x = 1 VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=0, __unbuffered_p1_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=1, y$flush_delayed=0, y$mem_tmp=0, y$r_buff0_thd0=0, y$r_buff0_thd1=0, y$r_buff0_thd2=0, y$r_buff0_thd3=1, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$r_buff1_thd3=0, y$read_delayed=0, y$read_delayed_var={0:0}, y$w_buff0=1, y$w_buff0_used=1, y$w_buff1=0, y$w_buff1_used=0, y=0, z=2] [L765] 2 weak$$choice0 = __VERIFIER_nondet_bool() [L766] 2 weak$$choice2 = __VERIFIER_nondet_bool() [L767] 2 y$flush_delayed = weak$$choice2 [L768] 2 y$mem_tmp = y [L769] 2 y = !y$w_buff0_used || !y$r_buff0_thd2 && !y$w_buff1_used || !y$r_buff0_thd2 && !y$r_buff1_thd2 ? y : (y$w_buff0_used && y$r_buff0_thd2 ? y$w_buff0 : y$w_buff1) [L770] 2 y$w_buff0 = weak$$choice2 ? y$w_buff0 : (!y$w_buff0_used || !y$r_buff0_thd2 && !y$w_buff1_used || !y$r_buff0_thd2 && !y$r_buff1_thd2 ? y$w_buff0 : (y$w_buff0_used && y$r_buff0_thd2 ? y$w_buff0 : y$w_buff0)) [L771] 2 y$w_buff1 = weak$$choice2 ? y$w_buff1 : (!y$w_buff0_used || !y$r_buff0_thd2 && !y$w_buff1_used || !y$r_buff0_thd2 && !y$r_buff1_thd2 ? y$w_buff1 : (y$w_buff0_used && y$r_buff0_thd2 ? y$w_buff1 : y$w_buff1)) [L772] 2 y$w_buff0_used = weak$$choice2 ? y$w_buff0_used : (!y$w_buff0_used || !y$r_buff0_thd2 && !y$w_buff1_used || !y$r_buff0_thd2 && !y$r_buff1_thd2 ? y$w_buff0_used : (y$w_buff0_used && y$r_buff0_thd2 ? (_Bool)0 : y$w_buff0_used)) [L773] 2 y$w_buff1_used = weak$$choice2 ? y$w_buff1_used : (!y$w_buff0_used || !y$r_buff0_thd2 && !y$w_buff1_used || !y$r_buff0_thd2 && !y$r_buff1_thd2 ? y$w_buff1_used : (y$w_buff0_used && y$r_buff0_thd2 ? (_Bool)0 : (_Bool)0)) [L774] 2 y$r_buff0_thd2 = weak$$choice2 ? y$r_buff0_thd2 : (!y$w_buff0_used || !y$r_buff0_thd2 && !y$w_buff1_used || !y$r_buff0_thd2 && !y$r_buff1_thd2 ? y$r_buff0_thd2 : (y$w_buff0_used && y$r_buff0_thd2 ? (_Bool)0 : y$r_buff0_thd2)) [L775] 2 y$r_buff1_thd2 = weak$$choice2 ? y$r_buff1_thd2 : (!y$w_buff0_used || !y$r_buff0_thd2 && !y$w_buff1_used || !y$r_buff0_thd2 && !y$r_buff1_thd2 ? y$r_buff1_thd2 : (y$w_buff0_used && y$r_buff0_thd2 ? (_Bool)0 : (_Bool)0)) [L776] 2 __unbuffered_p1_EAX = y [L777] 2 y = y$flush_delayed ? y$mem_tmp : y [L778] 2 y$flush_delayed = (_Bool)0 VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=0, __unbuffered_p1_EAX=0, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice2=1, x=1, y$flush_delayed=0, y$mem_tmp=0, y$r_buff0_thd0=0, y$r_buff0_thd1=0, y$r_buff0_thd2=0, y$r_buff0_thd3=1, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$r_buff1_thd3=0, y$read_delayed=0, y$read_delayed_var={0:0}, y$w_buff0=1, y$w_buff0_used=1, y$w_buff1=0, y$w_buff1_used=0, y=0, z=2] [L805] 3 y = y$w_buff0_used && y$r_buff0_thd3 ? y$w_buff0 : (y$w_buff1_used && y$r_buff1_thd3 ? y$w_buff1 : y) [L806] 3 y$w_buff0_used = y$w_buff0_used && y$r_buff0_thd3 ? (_Bool)0 : y$w_buff0_used [L807] 3 y$w_buff1_used = y$w_buff0_used && y$r_buff0_thd3 || y$w_buff1_used && y$r_buff1_thd3 ? (_Bool)0 : y$w_buff1_used [L808] 3 y$r_buff0_thd3 = y$w_buff0_used && y$r_buff0_thd3 ? (_Bool)0 : y$r_buff0_thd3 [L809] 3 y$r_buff1_thd3 = y$w_buff0_used && y$r_buff0_thd3 || y$w_buff1_used && y$r_buff1_thd3 ? (_Bool)0 : y$r_buff1_thd3 VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=0, __unbuffered_p1_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=1, x=1, y$flush_delayed=0, y$mem_tmp=0, y$r_buff0_thd0=0, y$r_buff0_thd1=0, y$r_buff0_thd2=0, y$r_buff0_thd3=1, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$r_buff1_thd3=0, y$read_delayed=0, y$read_delayed_var={0:0}, y$w_buff0=1, y$w_buff0_used=0, y$w_buff1=0, y$w_buff1_used=0, y=1, z=2] [L812] 3 __unbuffered_cnt = __unbuffered_cnt + 1 VAL [__unbuffered_cnt=1, __unbuffered_p0_EAX=0, __unbuffered_p1_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=1, x=1, y$flush_delayed=0, y$mem_tmp=0, y$r_buff0_thd0=0, y$r_buff0_thd1=0, y$r_buff0_thd2=0, y$r_buff0_thd3=1, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$r_buff1_thd3=0, y$read_delayed=0, y$read_delayed_var={0:0}, y$w_buff0=1, y$w_buff0_used=0, y$w_buff1=0, y$w_buff1_used=0, y=1, z=2] [L753] 1 __unbuffered_cnt = __unbuffered_cnt + 1 VAL [__unbuffered_cnt=2, __unbuffered_p0_EAX=0, __unbuffered_p1_EAX=0, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice2=1, x=1, y$flush_delayed=0, y$mem_tmp=0, y$r_buff0_thd0=0, y$r_buff0_thd1=0, y$r_buff0_thd2=0, y$r_buff0_thd3=1, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$r_buff1_thd3=0, y$read_delayed=0, y$read_delayed_var={0:0}, y$w_buff0=1, y$w_buff0_used=0, y$w_buff1=0, y$w_buff1_used=0, y=1, z=2] [L783] 2 __unbuffered_cnt = __unbuffered_cnt + 1 VAL [__unbuffered_cnt=3, __unbuffered_p0_EAX=0, __unbuffered_p1_EAX=0, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice2=1, x=1, y$flush_delayed=0, y$mem_tmp=0, y$r_buff0_thd0=0, y$r_buff0_thd1=0, y$r_buff0_thd2=0, y$r_buff0_thd3=1, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$r_buff1_thd3=0, y$read_delayed=0, y$read_delayed_var={0:0}, y$w_buff0=1, y$w_buff0_used=0, y$w_buff1=0, y$w_buff1_used=0, y=1, z=2] [L834] 0 main$tmp_guard0 = __unbuffered_cnt == 3 VAL [__unbuffered_cnt=3, __unbuffered_p0_EAX=0, __unbuffered_p1_EAX=0, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, main$tmp_guard0=1, main$tmp_guard1=0, t2577={5:0}, t2578={6:0}, t2579={3:0}, weak$$choice2=1, x=1, y$flush_delayed=0, y$mem_tmp=0, y$r_buff0_thd0=0, y$r_buff0_thd1=0, y$r_buff0_thd2=0, y$r_buff0_thd3=1, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$r_buff1_thd3=0, y$read_delayed=0, y$read_delayed_var={0:0}, y$w_buff0=1, y$w_buff0_used=0, y$w_buff1=0, y$w_buff1_used=0, y=1, z=2] [L836] CALL 0 assume_abort_if_not(main$tmp_guard0) [L3] COND FALSE 0 !(!cond) [L836] RET 0 assume_abort_if_not(main$tmp_guard0) [L838] 0 y = y$w_buff0_used && y$r_buff0_thd0 ? y$w_buff0 : (y$w_buff1_used && y$r_buff1_thd0 ? y$w_buff1 : y) [L839] 0 y$w_buff0_used = y$w_buff0_used && y$r_buff0_thd0 ? (_Bool)0 : y$w_buff0_used [L840] 0 y$w_buff1_used = y$w_buff0_used && y$r_buff0_thd0 || y$w_buff1_used && y$r_buff1_thd0 ? (_Bool)0 : y$w_buff1_used [L841] 0 y$r_buff0_thd0 = y$w_buff0_used && y$r_buff0_thd0 ? (_Bool)0 : y$r_buff0_thd0 [L842] 0 y$r_buff1_thd0 = y$w_buff0_used && y$r_buff0_thd0 || y$w_buff1_used && y$r_buff1_thd0 ? (_Bool)0 : y$r_buff1_thd0 VAL [__unbuffered_cnt=3, __unbuffered_p0_EAX=0, __unbuffered_p1_EAX=0, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, main$tmp_guard0=1, main$tmp_guard1=0, t2577={5:0}, t2578={6:0}, t2579={3:0}, weak$$choice2=1, x=1, y$flush_delayed=0, y$mem_tmp=0, y$r_buff0_thd0=0, y$r_buff0_thd1=0, y$r_buff0_thd2=0, y$r_buff0_thd3=1, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$r_buff1_thd3=0, y$read_delayed=0, y$read_delayed_var={0:0}, y$w_buff0=1, y$w_buff0_used=0, y$w_buff1=0, y$w_buff1_used=0, y=1, z=2] [L845] 0 main$tmp_guard1 = !(z == 2 && __unbuffered_p0_EAX == 0 && __unbuffered_p1_EAX == 0) VAL [__unbuffered_cnt=3, __unbuffered_p0_EAX=0, __unbuffered_p1_EAX=0, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, main$tmp_guard0=1, main$tmp_guard1=0, t2577={5:0}, t2578={6:0}, t2579={3:0}, weak$$choice2=1, x=1, y$flush_delayed=0, y$mem_tmp=0, y$r_buff0_thd0=0, y$r_buff0_thd1=0, y$r_buff0_thd2=0, y$r_buff0_thd3=1, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$r_buff1_thd3=0, y$read_delayed=0, y$read_delayed_var={0:0}, y$w_buff0=1, y$w_buff0_used=0, y$w_buff1=0, y$w_buff1_used=0, y=1, z=2] [L847] CALL 0 __VERIFIER_assert(main$tmp_guard1) [L18] COND TRUE 0 !expression [L18] CALL 0 reach_error() [L17] COND FALSE 0 !(0) VAL [__unbuffered_cnt=3, __unbuffered_p0_EAX=0, __unbuffered_p1_EAX=0, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, main$tmp_guard0=1, main$tmp_guard1=0, weak$$choice2=1, x=1, y$flush_delayed=0, y$mem_tmp=0, y$r_buff0_thd0=0, y$r_buff0_thd1=0, y$r_buff0_thd2=0, y$r_buff0_thd3=1, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$r_buff1_thd3=0, y$read_delayed=0, y$read_delayed_var={0:0}, y$w_buff0=1, y$w_buff0_used=0, y$w_buff1=0, y$w_buff1_used=0, y=1, z=2] [L17] 0 __assert_fail ("0", "safe034_power.oepc_power.opt_pso.oepc_pso.opt_rmo.oepc_rmo.opt.c", 8, __extension__ __PRETTY_FUNCTION__) VAL [__unbuffered_cnt=3, __unbuffered_p0_EAX=0, __unbuffered_p1_EAX=0, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, main$tmp_guard0=1, main$tmp_guard1=0, weak$$choice2=1, x=1, y$flush_delayed=0, y$mem_tmp=0, y$r_buff0_thd0=0, y$r_buff0_thd1=0, y$r_buff0_thd2=0, y$r_buff0_thd3=1, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$r_buff1_thd3=0, y$read_delayed=0, y$read_delayed_var={0:0}, y$w_buff0=1, y$w_buff0_used=0, y$w_buff1=0, y$w_buff1_used=0, y=1, z=2] - 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: 825]: Unable to prove that all allocated memory was freed Unable to prove that all allocated memory was freed Reason: Not analyzed. - UnprovableResult [Line: 828]: Unable to prove that petrification did provide enough thread instances (tool internal message) Unable to prove that petrification did provide enough thread instances (tool internal message) Reason: Not analyzed. - UnprovableResult [Line: 830]: Unable to prove that petrification did provide enough thread instances (tool internal message) Unable to prove that petrification did provide enough thread instances (tool internal message) Reason: Not analyzed. - UnprovableResult [Line: 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. - StatisticsResult: Ultimate Automizer benchmark data with 1 thread instances CFG has 7 procedures, 81 locations, 13 error locations. Started 1 CEGAR loops. EmptinessCheckTime: 0.0s, RemoveRedundantFlowTime: 0.0s, RemoveRedundantFlowUnfoldingTime: 0.0s, BackfoldingTime: 0.0s, BackfoldingUnfoldingTime: 0.0s, FlowIncreaseByBackfolding: 0, BasicCegarLoop: OverallTime: 10.5s, OverallIterations: 16, TraceHistogramMax: 1, PathProgramHistogramMax: 5, EmptinessCheckTime: 0.0s, AutomataDifference: 5.7s, DeadEndRemovalTime: 0.0s, HoareAnnotationTime: 0.0s, InitialAbstractionConstructionTime: 0.1s, HoareTripleCheckerStatistics: 0 mSolverCounterUnknown, 627 SdHoareTripleChecker+Valid, 1.9s IncrementalHoareTripleChecker+Time, 0 mSdLazyCounter, 506 mSDsluCounter, 194 SdHoareTripleChecker+Invalid, 1.5s Time, 0 mProtectedAction, 0 SdHoareTripleChecker+Unchecked, 0 IncrementalHoareTripleChecker+Unchecked, 136 mSDsCounter, 33 IncrementalHoareTripleChecker+Valid, 0 mProtectedPredicate, 1410 IncrementalHoareTripleChecker+Invalid, 1443 SdHoareTripleChecker+Unknown, 0 mSolverCounterNotChecked, 33 mSolverCounterUnsat, 58 mSDtfsCounter, 1410 mSolverCounterSat, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Unknown, PredicateUnifierStatistics: 0 DeclaredPredicates, 76 GetRequests, 17 SyntacticMatches, 0 SemanticMatches, 59 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 22 ImplicationChecksByTransitivity, 0.5s Time, 0.0s BasicInterpolantAutomatonTime, BiggestAbstraction: size=198occurred in iteration=14, InterpolantAutomatonStates: 72, traceCheckStatistics: No data available, InterpolantConsolidationStatistics: No data available, PathInvariantsStatistics: No data available, 0/0 InterpolantCoveringCapability, TotalInterpolationStatistics: No data available, 0.0s DumpTime, AutomataMinimizationStatistics: No data available, HoareAnnotationStatistics: No data available, RefinementEngineStatistics: TRACE_CHECK: 0.1s SsaConstructionTime, 0.6s SatisfiabilityAnalysisTime, 3.5s InterpolantComputationTime, 304 NumberOfCodeBlocks, 304 NumberOfCodeBlocksAsserted, 16 NumberOfCheckSat, 254 ConstructedInterpolants, 0 QuantifiedInterpolants, 1396 SizeOfPredicates, 0 NumberOfNonLiveVariables, 0 ConjunctsInSsa, 0 ConjunctsInUnsatCore, 15 InterpolantComputations, 15 PerfectInterpolantSequences, 0/0 InterpolantCoveringCapability, INVARIANT_SYNTHESIS: No data available, INTERPOLANT_CONSOLIDATION: No data available, ABSTRACT_INTERPRETATION: No data available, PDR: No data available, ACCELERATED_INTERPOLATION: No data available, SIFA: No data available, ReuseStatistics: No data available RESULT: Ultimate could not prove your program: unable to determine feasibility of some traces [2023-11-26 12:02:23,463 INFO L540 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_5d5af139-3929-44e4-a702-ba62df77cf50/bin/uautomizer-verify-VRDe98Ueme/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 (1)] Forceful destruction successful, exit code 0 Received shutdown request... --- End real Ultimate output --- Execution finished normally Using bit-precise analysis Retrying with bit-precise analysis ### Bit-precise run ### Calling Ultimate with: /usr/lib/jvm/java-11-openjdk-amd64/bin/java -Dosgi.configuration.area=/tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_5d5af139-3929-44e4-a702-ba62df77cf50/bin/uautomizer-verify-VRDe98Ueme/data/config -Xmx15G -Xms4m -jar /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_5d5af139-3929-44e4-a702-ba62df77cf50/bin/uautomizer-verify-VRDe98Ueme/plugins/org.eclipse.equinox.launcher_1.5.800.v20200727-1323.jar -data @noDefault -ultimatedata /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_5d5af139-3929-44e4-a702-ba62df77cf50/bin/uautomizer-verify-VRDe98Ueme/data -tc /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_5d5af139-3929-44e4-a702-ba62df77cf50/bin/uautomizer-verify-VRDe98Ueme/config/AutomizerMemDerefMemtrack.xml -i ../../sv-benchmarks/c/pthread-wmm/safe034_power.oepc_power.opt_pso.oepc_pso.opt_rmo.oepc_rmo.opt.i -s /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_5d5af139-3929-44e4-a702-ba62df77cf50/bin/uautomizer-verify-VRDe98Ueme/config/svcomp-DerefFreeMemtrack-32bit-Automizer_Bitvector.epf --cacsl2boogietranslator.entry.function main --witnessprinter.witness.directory /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_5d5af139-3929-44e4-a702-ba62df77cf50/bin/uautomizer-verify-VRDe98Ueme --witnessprinter.witness.filename witness --witnessprinter.write.witness.besides.input.file false --witnessprinter.graph.data.specification CHECK( init(main()), LTL(G valid-free) ) CHECK( init(main()), LTL(G valid-deref) ) CHECK( init(main()), LTL(G valid-memtrack) ) --witnessprinter.graph.data.producer Automizer --witnessprinter.graph.data.architecture 32bit --witnessprinter.graph.data.programhash 11eadb3d3dbb959cb5d260936a4e759de0e9c0b331e2b23d922151dc0bfe3fa5 --- Real Ultimate output --- This is Ultimate 0.2.4-dev-0e0057c [2023-11-26 12:02:26,240 INFO L188 SettingsManager]: Resetting all preferences to default values... [2023-11-26 12:02:26,395 INFO L114 SettingsManager]: Loading settings from /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_5d5af139-3929-44e4-a702-ba62df77cf50/bin/uautomizer-verify-VRDe98Ueme/config/svcomp-DerefFreeMemtrack-32bit-Automizer_Bitvector.epf [2023-11-26 12:02:26,404 WARN L101 SettingsManager]: Preference file contains the following unknown settings: [2023-11-26 12:02:26,408 WARN L103 SettingsManager]: * de.uni_freiburg.informatik.ultimate.core.Log level for class [2023-11-26 12:02:26,458 INFO L130 SettingsManager]: Preferences different from defaults after loading the file: [2023-11-26 12:02:26,459 INFO L151 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2023-11-26 12:02:26,460 INFO L153 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2023-11-26 12:02:26,461 INFO L151 SettingsManager]: Preferences of Boogie Preprocessor differ from their defaults: [2023-11-26 12:02:26,467 INFO L153 SettingsManager]: * Use memory slicer=true [2023-11-26 12:02:26,467 INFO L151 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2023-11-26 12:02:26,468 INFO L153 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2023-11-26 12:02:26,469 INFO L151 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2023-11-26 12:02:26,471 INFO L153 SettingsManager]: * Create parallel compositions if possible=false [2023-11-26 12:02:26,472 INFO L153 SettingsManager]: * Use SBE=true [2023-11-26 12:02:26,472 INFO L151 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2023-11-26 12:02:26,473 INFO L153 SettingsManager]: * sizeof long=4 [2023-11-26 12:02:26,473 INFO L153 SettingsManager]: * Overapproximate operations on floating types=true [2023-11-26 12:02:26,474 INFO L153 SettingsManager]: * sizeof POINTER=4 [2023-11-26 12:02:26,475 INFO L153 SettingsManager]: * Check division by zero=IGNORE [2023-11-26 12:02:26,476 INFO L153 SettingsManager]: * Check for the main procedure if all allocated memory was freed=true [2023-11-26 12:02:26,477 INFO L153 SettingsManager]: * Bitprecise bitfields=true [2023-11-26 12:02:26,477 INFO L153 SettingsManager]: * SV-COMP memtrack compatibility mode=true [2023-11-26 12:02:26,478 INFO L153 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2023-11-26 12:02:26,478 INFO L153 SettingsManager]: * Adapt memory model on pointer casts if necessary=true [2023-11-26 12:02:26,479 INFO L153 SettingsManager]: * Use bitvectors instead of ints=true [2023-11-26 12:02:26,479 INFO L153 SettingsManager]: * Memory model=HoenickeLindenmann_4ByteResolution [2023-11-26 12:02:26,480 INFO L153 SettingsManager]: * Check unreachability of reach_error function=false [2023-11-26 12:02:26,480 INFO L153 SettingsManager]: * sizeof long double=12 [2023-11-26 12:02:26,481 INFO L153 SettingsManager]: * Use constant arrays=true [2023-11-26 12:02:26,483 INFO L151 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2023-11-26 12:02:26,484 INFO L153 SettingsManager]: * Size of a code block=SequenceOfStatements [2023-11-26 12:02:26,484 INFO L153 SettingsManager]: * Only consider context switches at boundaries of atomic blocks=true [2023-11-26 12:02:26,484 INFO L153 SettingsManager]: * SMT solver=External_DefaultMode [2023-11-26 12:02:26,485 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2023-11-26 12:02:26,485 INFO L151 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2023-11-26 12:02:26,486 INFO L153 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2023-11-26 12:02:26,487 INFO L153 SettingsManager]: * Trace refinement strategy=WOLF [2023-11-26 12:02:26,487 INFO L153 SettingsManager]: * Command for external solver=cvc4 --incremental --print-success --lang smt [2023-11-26 12:02:26,487 INFO L153 SettingsManager]: * Apply one-shot large block encoding in concurrent analysis=false [2023-11-26 12:02:26,488 INFO L153 SettingsManager]: * Automaton type used in concurrency analysis=PETRI_NET [2023-11-26 12:02:26,488 INFO L153 SettingsManager]: * Order on configurations for Petri net unfoldings=DBO [2023-11-26 12:02:26,488 INFO L153 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2023-11-26 12:02:26,489 INFO L153 SettingsManager]: * Logic for external solver=AUFBV [2023-11-26 12:02:26,489 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_5d5af139-3929-44e4-a702-ba62df77cf50/bin/uautomizer-verify-VRDe98Ueme/plugins/com.sun.xml.bind_2.2.0.v201505121915.jar) to method java.lang.ClassLoader.defineClass(java.lang.String,byte[],int,int) WARNING: Please consider reporting this to the maintainers of com.sun.xml.bind.v2.runtime.reflect.opt.Injector$1 WARNING: Use --illegal-access=warn to enable warnings of further illegal reflective access operations WARNING: All illegal access operations will be denied in a future release Applying setting for plugin de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator: Entry function -> main Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Witness directory -> /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_5d5af139-3929-44e4-a702-ba62df77cf50/bin/uautomizer-verify-VRDe98Ueme Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Witness filename -> witness Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Write witness besides input file -> false Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Graph data specification -> CHECK( init(main()), LTL(G valid-free) ) CHECK( init(main()), LTL(G valid-deref) ) CHECK( init(main()), LTL(G valid-memtrack) ) Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Graph data producer -> Automizer Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Graph data architecture -> 32bit Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Graph data programhash -> 11eadb3d3dbb959cb5d260936a4e759de0e9c0b331e2b23d922151dc0bfe3fa5 [2023-11-26 12:02:26,975 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2023-11-26 12:02:27,004 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2023-11-26 12:02:27,009 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2023-11-26 12:02:27,011 INFO L270 PluginConnector]: Initializing CDTParser... [2023-11-26 12:02:27,012 INFO L274 PluginConnector]: CDTParser initialized [2023-11-26 12:02:27,013 INFO L431 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_5d5af139-3929-44e4-a702-ba62df77cf50/bin/uautomizer-verify-VRDe98Ueme/../../sv-benchmarks/c/pthread-wmm/safe034_power.oepc_power.opt_pso.oepc_pso.opt_rmo.oepc_rmo.opt.i [2023-11-26 12:02:30,239 INFO L533 CDTParser]: Created temporary CDT project at NULL [2023-11-26 12:02:30,622 INFO L384 CDTParser]: Found 1 translation units. [2023-11-26 12:02:30,623 INFO L180 CDTParser]: Scanning /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_5d5af139-3929-44e4-a702-ba62df77cf50/sv-benchmarks/c/pthread-wmm/safe034_power.oepc_power.opt_pso.oepc_pso.opt_rmo.oepc_rmo.opt.i [2023-11-26 12:02:30,648 INFO L427 CDTParser]: About to delete temporary CDT project at /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_5d5af139-3929-44e4-a702-ba62df77cf50/bin/uautomizer-verify-VRDe98Ueme/data/f36c54a7f/3c756f5eb53e4cd8ba441e47896f6fc1/FLAGd0ae561e5 [2023-11-26 12:02:30,664 INFO L435 CDTParser]: Successfully deleted /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_5d5af139-3929-44e4-a702-ba62df77cf50/bin/uautomizer-verify-VRDe98Ueme/data/f36c54a7f/3c756f5eb53e4cd8ba441e47896f6fc1 [2023-11-26 12:02:30,667 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2023-11-26 12:02:30,674 INFO L133 ToolchainWalker]: Walking toolchain with 6 elements. [2023-11-26 12:02:30,677 INFO L112 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2023-11-26 12:02:30,680 INFO L270 PluginConnector]: Initializing CACSL2BoogieTranslator... [2023-11-26 12:02:30,686 INFO L274 PluginConnector]: CACSL2BoogieTranslator initialized [2023-11-26 12:02:30,687 INFO L184 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 26.11 12:02:30" (1/1) ... [2023-11-26 12:02:30,688 INFO L204 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@56391ba9 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 26.11 12:02:30, skipping insertion in model container [2023-11-26 12:02:30,689 INFO L184 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 26.11 12:02:30" (1/1) ... [2023-11-26 12:02:30,753 INFO L177 MainTranslator]: Built tables and reachable declarations [2023-11-26 12:02:31,220 INFO L209 PostProcessor]: Analyzing one entry point: main [2023-11-26 12:02:31,248 INFO L202 MainTranslator]: Completed pre-run [2023-11-26 12:02:31,357 INFO L209 PostProcessor]: Analyzing one entry point: main [2023-11-26 12:02:31,432 WARN L675 CHandler]: The function __VERIFIER_atomic_begin is called, but not defined or handled by StandardFunctionHandler. [2023-11-26 12:02:31,433 WARN L675 CHandler]: The function __VERIFIER_atomic_end is called, but not defined or handled by StandardFunctionHandler. [2023-11-26 12:02:31,442 INFO L206 MainTranslator]: Completed translation [2023-11-26 12:02:31,442 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 26.11 12:02:31 WrapperNode [2023-11-26 12:02:31,443 INFO L131 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2023-11-26 12:02:31,444 INFO L112 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2023-11-26 12:02:31,445 INFO L270 PluginConnector]: Initializing Boogie Procedure Inliner... [2023-11-26 12:02:31,445 INFO L274 PluginConnector]: Boogie Procedure Inliner initialized [2023-11-26 12:02:31,455 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 26.11 12:02:31" (1/1) ... [2023-11-26 12:02:31,512 INFO L184 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 26.11 12:02:31" (1/1) ... [2023-11-26 12:02:31,560 INFO L138 Inliner]: procedures = 179, calls = 59, calls flagged for inlining = 6, calls inlined = 7, statements flattened = 134 [2023-11-26 12:02:31,560 INFO L131 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2023-11-26 12:02:31,562 INFO L112 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2023-11-26 12:02:31,562 INFO L270 PluginConnector]: Initializing Boogie Preprocessor... [2023-11-26 12:02:31,562 INFO L274 PluginConnector]: Boogie Preprocessor initialized [2023-11-26 12:02:31,575 INFO L184 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 26.11 12:02:31" (1/1) ... [2023-11-26 12:02:31,575 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 26.11 12:02:31" (1/1) ... [2023-11-26 12:02:31,592 INFO L184 PluginConnector]: Executing the observer MemorySlicer from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 26.11 12:02:31" (1/1) ... [2023-11-26 12:02:31,625 INFO L175 MemorySlicer]: Split 5 memory accesses to 4 slices as follows [2, 1, 1, 1]. 40 percent of accesses are in the largest equivalence class. The 2 initializations are split as follows [2, 0, 0, 0]. The 3 writes are split as follows [0, 1, 1, 1]. [2023-11-26 12:02:31,632 INFO L184 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 26.11 12:02:31" (1/1) ... [2023-11-26 12:02:31,632 INFO L184 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 26.11 12:02:31" (1/1) ... [2023-11-26 12:02:31,643 INFO L184 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 26.11 12:02:31" (1/1) ... [2023-11-26 12:02:31,655 INFO L184 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 26.11 12:02:31" (1/1) ... [2023-11-26 12:02:31,661 INFO L184 PluginConnector]: Executing the observer LTLStepAnnotator from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 26.11 12:02:31" (1/1) ... [2023-11-26 12:02:31,673 INFO L184 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 26.11 12:02:31" (1/1) ... [2023-11-26 12:02:31,678 INFO L131 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2023-11-26 12:02:31,685 INFO L112 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2023-11-26 12:02:31,686 INFO L270 PluginConnector]: Initializing RCFGBuilder... [2023-11-26 12:02:31,686 INFO L274 PluginConnector]: RCFGBuilder initialized [2023-11-26 12:02:31,687 INFO L184 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 26.11 12:02:31" (1/1) ... [2023-11-26 12:02:31,694 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2023-11-26 12:02:31,710 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_5d5af139-3929-44e4-a702-ba62df77cf50/bin/uautomizer-verify-VRDe98Ueme/z3 [2023-11-26 12:02:31,728 INFO L229 MonitoredProcess]: Starting monitored process 1 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_5d5af139-3929-44e4-a702-ba62df77cf50/bin/uautomizer-verify-VRDe98Ueme/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 (exit command is (exit), workingDir is null) [2023-11-26 12:02:31,755 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_5d5af139-3929-44e4-a702-ba62df77cf50/bin/uautomizer-verify-VRDe98Ueme/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 (1)] Waiting until timeout for monitored process [2023-11-26 12:02:31,791 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_atomic_begin [2023-11-26 12:02:31,791 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2023-11-26 12:02:31,791 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnStack [2023-11-26 12:02:31,792 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.dealloc [2023-11-26 12:02:31,792 INFO L130 BoogieDeclarations]: Found specification of procedure write~intINTTYPE4#0 [2023-11-26 12:02:31,792 INFO L130 BoogieDeclarations]: Found specification of procedure write~intINTTYPE4#1 [2023-11-26 12:02:31,792 INFO L130 BoogieDeclarations]: Found specification of procedure write~intINTTYPE4#2 [2023-11-26 12:02:31,795 INFO L130 BoogieDeclarations]: Found specification of procedure write~intINTTYPE4#3 [2023-11-26 12:02:31,795 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~intINTTYPE1#0 [2023-11-26 12:02:31,795 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~intINTTYPE1#1 [2023-11-26 12:02:31,796 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~intINTTYPE1#2 [2023-11-26 12:02:31,796 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~intINTTYPE1#3 [2023-11-26 12:02:31,796 INFO L130 BoogieDeclarations]: Found specification of procedure P0 [2023-11-26 12:02:31,796 INFO L138 BoogieDeclarations]: Found implementation of procedure P0 [2023-11-26 12:02:31,796 INFO L130 BoogieDeclarations]: Found specification of procedure P1 [2023-11-26 12:02:31,797 INFO L138 BoogieDeclarations]: Found implementation of procedure P1 [2023-11-26 12:02:31,798 INFO L130 BoogieDeclarations]: Found specification of procedure P2 [2023-11-26 12:02:31,798 INFO L138 BoogieDeclarations]: Found implementation of procedure P2 [2023-11-26 12:02:31,799 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_atomic_end [2023-11-26 12:02:31,800 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2023-11-26 12:02:31,800 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2023-11-26 12:02:31,801 WARN L213 CfgBuilder]: User set CodeBlockSize to SequenceOfStatements but program contains fork statements. Overwriting the user preferences and setting CodeBlockSize to OneNontrivialStatement [2023-11-26 12:02:32,055 INFO L241 CfgBuilder]: Building ICFG [2023-11-26 12:02:32,059 INFO L267 CfgBuilder]: Building CFG for each procedure with an implementation [2023-11-26 12:02:32,506 INFO L282 CfgBuilder]: Performing block encoding [2023-11-26 12:02:32,874 INFO L304 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2023-11-26 12:02:32,874 INFO L309 CfgBuilder]: Removed 0 assume(true) statements. [2023-11-26 12:02:32,876 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 26.11 12:02:32 BoogieIcfgContainer [2023-11-26 12:02:32,876 INFO L131 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2023-11-26 12:02:32,878 INFO L112 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2023-11-26 12:02:32,879 INFO L270 PluginConnector]: Initializing TraceAbstraction... [2023-11-26 12:02:32,882 INFO L274 PluginConnector]: TraceAbstraction initialized [2023-11-26 12:02:32,882 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 26.11 12:02:30" (1/3) ... [2023-11-26 12:02:32,883 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@688c57bd and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 26.11 12:02:32, skipping insertion in model container [2023-11-26 12:02:32,883 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 26.11 12:02:31" (2/3) ... [2023-11-26 12:02:32,885 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@688c57bd and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 26.11 12:02:32, skipping insertion in model container [2023-11-26 12:02:32,885 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 26.11 12:02:32" (3/3) ... [2023-11-26 12:02:32,887 INFO L112 eAbstractionObserver]: Analyzing ICFG safe034_power.oepc_power.opt_pso.oepc_pso.opt_rmo.oepc_rmo.opt.i [2023-11-26 12:02:32,908 INFO L203 ceAbstractionStarter]: Automizer settings: Hoare:false NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2023-11-26 12:02:32,908 INFO L162 ceAbstractionStarter]: Applying trace abstraction to program that has 9 error locations. [2023-11-26 12:02:32,908 INFO L514 ceAbstractionStarter]: Constructing petrified ICFG for 1 thread instances. [2023-11-26 12:02:32,983 INFO L144 ThreadInstanceAdder]: Constructed 0 joinOtherThreadTransitions. [2023-11-26 12:02:33,033 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 63 places, 55 transitions, 122 flow [2023-11-26 12:02:33,085 INFO L124 PetriNetUnfolderBase]: 2/52 cut-off events. [2023-11-26 12:02:33,085 INFO L125 PetriNetUnfolderBase]: For 0/0 co-relation queries the response was YES. [2023-11-26 12:02:33,098 INFO L83 FinitePrefix]: Finished finitePrefix Result has 62 conditions, 52 events. 2/52 cut-off events. For 0/0 co-relation queries the response was YES. Maximal size of possible extension queue 5. Compared 103 event pairs, 0 based on Foata normal form. 0/41 useless extension candidates. Maximal degree in co-relation 51. Up to 2 conditions per place. [2023-11-26 12:02:33,098 INFO L82 GeneralOperation]: Start removeDead. Operand has 63 places, 55 transitions, 122 flow [2023-11-26 12:02:33,107 INFO L88 GeneralOperation]: Finished RemoveDead, result has has 60 places, 52 transitions, 113 flow [2023-11-26 12:02:33,125 INFO L356 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2023-11-26 12:02:33,133 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;@1722d0e5, mLbeIndependenceSettings=[IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=false, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2023-11-26 12:02:33,134 INFO L358 AbstractCegarLoop]: Starting to check reachability of 13 error locations. [2023-11-26 12:02:33,138 INFO L185 PetriNetUnfolderBase]: Found word, exiting Unfolder. [2023-11-26 12:02:33,138 INFO L124 PetriNetUnfolderBase]: 0/2 cut-off events. [2023-11-26 12:02:33,139 INFO L125 PetriNetUnfolderBase]: For 0/0 co-relation queries the response was YES. [2023-11-26 12:02:33,139 INFO L200 CegarLoopForPetriNet]: Found error trace [2023-11-26 12:02:33,140 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1] [2023-11-26 12:02:33,141 INFO L420 AbstractCegarLoop]: === Iteration 1 === Targeting ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [P2Err0ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 10 more)] === [2023-11-26 12:02:33,148 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-11-26 12:02:33,148 INFO L85 PathProgramCache]: Analyzing trace with hash 11907, now seen corresponding path program 1 times [2023-11-26 12:02:33,164 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2023-11-26 12:02:33,165 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [1133422161] [2023-11-26 12:02:33,165 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-11-26 12:02:33,166 INFO L173 SolverBuilder]: Constructing external solver with command: mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2023-11-26 12:02:33,166 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_5d5af139-3929-44e4-a702-ba62df77cf50/bin/uautomizer-verify-VRDe98Ueme/mathsat [2023-11-26 12:02:33,169 INFO L229 MonitoredProcess]: Starting monitored process 2 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_5d5af139-3929-44e4-a702-ba62df77cf50/bin/uautomizer-verify-VRDe98Ueme/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (exit command is (exit), workingDir is null) [2023-11-26 12:02:33,211 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_5d5af139-3929-44e4-a702-ba62df77cf50/bin/uautomizer-verify-VRDe98Ueme/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (2)] Waiting until timeout for monitored process [2023-11-26 12:02:33,403 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-26 12:02:33,407 INFO L262 TraceCheckSpWp]: Trace formula consists of 50 conjuncts, 3 conjunts are in the unsatisfiable core [2023-11-26 12:02:33,412 INFO L285 TraceCheckSpWp]: Computing forward predicates... [2023-11-26 12:02:33,490 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 6 treesize of output 7 [2023-11-26 12:02:33,509 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-11-26 12:02:33,509 INFO L323 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2023-11-26 12:02:33,511 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2023-11-26 12:02:33,511 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [1133422161] [2023-11-26 12:02:33,512 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [1133422161] provided 1 perfect and 0 imperfect interpolant sequences [2023-11-26 12:02:33,512 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-11-26 12:02:33,512 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [1] imperfect sequences [] total 1 [2023-11-26 12:02:33,515 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1244409489] [2023-11-26 12:02:33,516 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-11-26 12:02:33,524 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2023-11-26 12:02:33,530 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2023-11-26 12:02:33,568 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2023-11-26 12:02:33,569 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2023-11-26 12:02:33,617 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 30 out of 55 [2023-11-26 12:02:33,621 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 60 places, 52 transitions, 113 flow. Second operand has 3 states, 3 states have (on average 30.666666666666668) internal successors, (92), 3 states have internal predecessors, (92), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-26 12:02:33,622 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2023-11-26 12:02:33,622 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 30 of 55 [2023-11-26 12:02:33,623 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2023-11-26 12:02:34,072 INFO L124 PetriNetUnfolderBase]: 459/956 cut-off events. [2023-11-26 12:02:34,072 INFO L125 PetriNetUnfolderBase]: For 8/8 co-relation queries the response was YES. [2023-11-26 12:02:34,080 INFO L83 FinitePrefix]: Finished finitePrefix Result has 1696 conditions, 956 events. 459/956 cut-off events. For 8/8 co-relation queries the response was YES. Maximal size of possible extension queue 98. Compared 7153 event pairs, 341 based on Foata normal form. 60/933 useless extension candidates. Maximal degree in co-relation 1682. Up to 539 conditions per place. [2023-11-26 12:02:34,091 INFO L140 encePairwiseOnDemand]: 50/55 looper letters, 26 selfloop transitions, 2 changer transitions 0/55 dead transitions. [2023-11-26 12:02:34,092 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 60 places, 55 transitions, 175 flow [2023-11-26 12:02:34,093 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2023-11-26 12:02:34,096 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2023-11-26 12:02:34,105 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 121 transitions. [2023-11-26 12:02:34,108 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.7333333333333333 [2023-11-26 12:02:34,109 INFO L72 ComplementDD]: Start complementDD. Operand 3 states and 121 transitions. [2023-11-26 12:02:34,110 INFO L73 IsDeterministic]: Start isDeterministic. Operand 3 states and 121 transitions. [2023-11-26 12:02:34,112 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2023-11-26 12:02:34,114 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 3 states and 121 transitions. [2023-11-26 12:02:34,119 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 4 states, 3 states have (on average 40.333333333333336) internal successors, (121), 3 states have internal predecessors, (121), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-26 12:02:34,127 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 4 states, 4 states have (on average 55.0) internal successors, (220), 4 states have internal predecessors, (220), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-26 12:02:34,127 INFO L81 ComplementDD]: Finished complementDD. Result has 4 states, 4 states have (on average 55.0) internal successors, (220), 4 states have internal predecessors, (220), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-26 12:02:34,129 INFO L175 Difference]: Start difference. First operand has 60 places, 52 transitions, 113 flow. Second operand 3 states and 121 transitions. [2023-11-26 12:02:34,131 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 60 places, 55 transitions, 175 flow [2023-11-26 12:02:34,134 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 57 places, 55 transitions, 172 flow, removed 0 selfloop flow, removed 3 redundant places. [2023-11-26 12:02:34,143 INFO L231 Difference]: Finished difference. Result has 57 places, 48 transitions, 106 flow [2023-11-26 12:02:34,145 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=55, PETRI_DIFFERENCE_MINUEND_FLOW=102, PETRI_DIFFERENCE_MINUEND_PLACES=55, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=48, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=2, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=46, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=106, PETRI_PLACES=57, PETRI_TRANSITIONS=48} [2023-11-26 12:02:34,149 INFO L281 CegarLoopForPetriNet]: 60 programPoint places, -3 predicate places. [2023-11-26 12:02:34,150 INFO L495 AbstractCegarLoop]: Abstraction has has 57 places, 48 transitions, 106 flow [2023-11-26 12:02:34,150 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 30.666666666666668) internal successors, (92), 3 states have internal predecessors, (92), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-26 12:02:34,150 INFO L200 CegarLoopForPetriNet]: Found error trace [2023-11-26 12:02:34,150 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1] [2023-11-26 12:02:34,153 INFO L540 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_5d5af139-3929-44e4-a702-ba62df77cf50/bin/uautomizer-verify-VRDe98Ueme/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (2)] Forceful destruction successful, exit code 0 [2023-11-26 12:02:34,351 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 2 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_5d5af139-3929-44e4-a702-ba62df77cf50/bin/uautomizer-verify-VRDe98Ueme/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2023-11-26 12:02:34,351 INFO L420 AbstractCegarLoop]: === Iteration 2 === Targeting ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [P2Err0ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 10 more)] === [2023-11-26 12:02:34,352 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-11-26 12:02:34,352 INFO L85 PathProgramCache]: Analyzing trace with hash 11908, now seen corresponding path program 1 times [2023-11-26 12:02:34,353 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2023-11-26 12:02:34,354 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [1998918118] [2023-11-26 12:02:34,354 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-11-26 12:02:34,354 INFO L173 SolverBuilder]: Constructing external solver with command: mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2023-11-26 12:02:34,355 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_5d5af139-3929-44e4-a702-ba62df77cf50/bin/uautomizer-verify-VRDe98Ueme/mathsat [2023-11-26 12:02:34,356 INFO L229 MonitoredProcess]: Starting monitored process 3 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_5d5af139-3929-44e4-a702-ba62df77cf50/bin/uautomizer-verify-VRDe98Ueme/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (exit command is (exit), workingDir is null) [2023-11-26 12:02:34,378 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_5d5af139-3929-44e4-a702-ba62df77cf50/bin/uautomizer-verify-VRDe98Ueme/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (3)] Waiting until timeout for monitored process [2023-11-26 12:02:34,473 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-26 12:02:34,475 INFO L262 TraceCheckSpWp]: Trace formula consists of 50 conjuncts, 4 conjunts are in the unsatisfiable core [2023-11-26 12:02:34,476 INFO L285 TraceCheckSpWp]: Computing forward predicates... [2023-11-26 12:02:34,485 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 6 treesize of output 5 [2023-11-26 12:02:34,498 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-11-26 12:02:34,499 INFO L323 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2023-11-26 12:02:34,499 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2023-11-26 12:02:34,499 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [1998918118] [2023-11-26 12:02:34,501 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [1998918118] provided 1 perfect and 0 imperfect interpolant sequences [2023-11-26 12:02:34,503 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-11-26 12:02:34,503 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [1] imperfect sequences [] total 1 [2023-11-26 12:02:34,503 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [33050114] [2023-11-26 12:02:34,504 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-11-26 12:02:34,505 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2023-11-26 12:02:34,505 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2023-11-26 12:02:34,506 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2023-11-26 12:02:34,506 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2023-11-26 12:02:34,549 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 31 out of 55 [2023-11-26 12:02:34,549 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 57 places, 48 transitions, 106 flow. Second operand has 3 states, 3 states have (on average 31.666666666666668) internal successors, (95), 3 states have internal predecessors, (95), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-26 12:02:34,549 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2023-11-26 12:02:34,550 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 31 of 55 [2023-11-26 12:02:34,550 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2023-11-26 12:02:34,832 INFO L124 PetriNetUnfolderBase]: 459/955 cut-off events. [2023-11-26 12:02:34,832 INFO L125 PetriNetUnfolderBase]: For 30/30 co-relation queries the response was YES. [2023-11-26 12:02:34,835 INFO L83 FinitePrefix]: Finished finitePrefix Result has 1723 conditions, 955 events. 459/955 cut-off events. For 30/30 co-relation queries the response was YES. Maximal size of possible extension queue 98. Compared 7157 event pairs, 341 based on Foata normal form. 1/873 useless extension candidates. Maximal degree in co-relation 1712. Up to 538 conditions per place. [2023-11-26 12:02:34,844 INFO L140 encePairwiseOnDemand]: 52/55 looper letters, 25 selfloop transitions, 2 changer transitions 0/54 dead transitions. [2023-11-26 12:02:34,844 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 58 places, 54 transitions, 172 flow [2023-11-26 12:02:34,845 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2023-11-26 12:02:34,845 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2023-11-26 12:02:34,848 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 121 transitions. [2023-11-26 12:02:34,850 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.7333333333333333 [2023-11-26 12:02:34,851 INFO L72 ComplementDD]: Start complementDD. Operand 3 states and 121 transitions. [2023-11-26 12:02:34,851 INFO L73 IsDeterministic]: Start isDeterministic. Operand 3 states and 121 transitions. [2023-11-26 12:02:34,853 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2023-11-26 12:02:34,853 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 3 states and 121 transitions. [2023-11-26 12:02:34,855 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 4 states, 3 states have (on average 40.333333333333336) internal successors, (121), 3 states have internal predecessors, (121), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-26 12:02:34,856 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 4 states, 4 states have (on average 55.0) internal successors, (220), 4 states have internal predecessors, (220), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-26 12:02:34,857 INFO L81 ComplementDD]: Finished complementDD. Result has 4 states, 4 states have (on average 55.0) internal successors, (220), 4 states have internal predecessors, (220), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-26 12:02:34,857 INFO L175 Difference]: Start difference. First operand has 57 places, 48 transitions, 106 flow. Second operand 3 states and 121 transitions. [2023-11-26 12:02:34,857 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 58 places, 54 transitions, 172 flow [2023-11-26 12:02:34,861 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 56 places, 54 transitions, 168 flow, removed 0 selfloop flow, removed 2 redundant places. [2023-11-26 12:02:34,863 INFO L231 Difference]: Finished difference. Result has 56 places, 47 transitions, 104 flow [2023-11-26 12:02:34,863 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=55, PETRI_DIFFERENCE_MINUEND_FLOW=100, PETRI_DIFFERENCE_MINUEND_PLACES=54, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=47, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=2, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=45, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=104, PETRI_PLACES=56, PETRI_TRANSITIONS=47} [2023-11-26 12:02:34,864 INFO L281 CegarLoopForPetriNet]: 60 programPoint places, -4 predicate places. [2023-11-26 12:02:34,864 INFO L495 AbstractCegarLoop]: Abstraction has has 56 places, 47 transitions, 104 flow [2023-11-26 12:02:34,865 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 31.666666666666668) internal successors, (95), 3 states have internal predecessors, (95), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-26 12:02:34,865 INFO L200 CegarLoopForPetriNet]: Found error trace [2023-11-26 12:02:34,865 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1] [2023-11-26 12:02:34,873 INFO L540 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_5d5af139-3929-44e4-a702-ba62df77cf50/bin/uautomizer-verify-VRDe98Ueme/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (3)] Forceful destruction successful, exit code 0 [2023-11-26 12:02:35,067 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 3 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_5d5af139-3929-44e4-a702-ba62df77cf50/bin/uautomizer-verify-VRDe98Ueme/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2023-11-26 12:02:35,068 INFO L420 AbstractCegarLoop]: === Iteration 3 === Targeting ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [P2Err0ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 10 more)] === [2023-11-26 12:02:35,069 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-11-26 12:02:35,069 INFO L85 PathProgramCache]: Analyzing trace with hash 355085958, now seen corresponding path program 1 times [2023-11-26 12:02:35,069 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2023-11-26 12:02:35,070 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [1181187341] [2023-11-26 12:02:35,070 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-11-26 12:02:35,070 INFO L173 SolverBuilder]: Constructing external solver with command: mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2023-11-26 12:02:35,070 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_5d5af139-3929-44e4-a702-ba62df77cf50/bin/uautomizer-verify-VRDe98Ueme/mathsat [2023-11-26 12:02:35,071 INFO L229 MonitoredProcess]: Starting monitored process 4 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_5d5af139-3929-44e4-a702-ba62df77cf50/bin/uautomizer-verify-VRDe98Ueme/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (exit command is (exit), workingDir is null) [2023-11-26 12:02:35,109 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_5d5af139-3929-44e4-a702-ba62df77cf50/bin/uautomizer-verify-VRDe98Ueme/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (4)] Waiting until timeout for monitored process [2023-11-26 12:02:35,178 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-26 12:02:35,180 INFO L262 TraceCheckSpWp]: Trace formula consists of 71 conjuncts, 3 conjunts are in the unsatisfiable core [2023-11-26 12:02:35,182 INFO L285 TraceCheckSpWp]: Computing forward predicates... [2023-11-26 12:02:35,191 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 6 treesize of output 7 [2023-11-26 12:02:35,200 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-11-26 12:02:35,200 INFO L323 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2023-11-26 12:02:35,201 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2023-11-26 12:02:35,201 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [1181187341] [2023-11-26 12:02:35,202 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [1181187341] provided 1 perfect and 0 imperfect interpolant sequences [2023-11-26 12:02:35,202 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-11-26 12:02:35,202 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2023-11-26 12:02:35,203 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [575184509] [2023-11-26 12:02:35,203 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-11-26 12:02:35,207 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2023-11-26 12:02:35,208 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2023-11-26 12:02:35,209 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2023-11-26 12:02:35,210 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2023-11-26 12:02:35,248 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 30 out of 55 [2023-11-26 12:02:35,249 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 56 places, 47 transitions, 104 flow. Second operand has 3 states, 3 states have (on average 31.333333333333332) internal successors, (94), 3 states have internal predecessors, (94), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-26 12:02:35,249 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2023-11-26 12:02:35,249 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 30 of 55 [2023-11-26 12:02:35,249 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2023-11-26 12:02:35,477 INFO L124 PetriNetUnfolderBase]: 460/954 cut-off events. [2023-11-26 12:02:35,478 INFO L125 PetriNetUnfolderBase]: For 30/30 co-relation queries the response was YES. [2023-11-26 12:02:35,481 INFO L83 FinitePrefix]: Finished finitePrefix Result has 1725 conditions, 954 events. 460/954 cut-off events. For 30/30 co-relation queries the response was YES. Maximal size of possible extension queue 98. Compared 7073 event pairs, 274 based on Foata normal form. 0/875 useless extension candidates. Maximal degree in co-relation 1714. Up to 538 conditions per place. [2023-11-26 12:02:35,488 INFO L140 encePairwiseOnDemand]: 52/55 looper letters, 26 selfloop transitions, 2 changer transitions 0/53 dead transitions. [2023-11-26 12:02:35,488 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 57 places, 53 transitions, 172 flow [2023-11-26 12:02:35,489 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2023-11-26 12:02:35,489 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2023-11-26 12:02:35,492 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 119 transitions. [2023-11-26 12:02:35,493 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.7212121212121212 [2023-11-26 12:02:35,493 INFO L72 ComplementDD]: Start complementDD. Operand 3 states and 119 transitions. [2023-11-26 12:02:35,494 INFO L73 IsDeterministic]: Start isDeterministic. Operand 3 states and 119 transitions. [2023-11-26 12:02:35,494 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2023-11-26 12:02:35,494 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 3 states and 119 transitions. [2023-11-26 12:02:35,496 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 4 states, 3 states have (on average 39.666666666666664) internal successors, (119), 3 states have internal predecessors, (119), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-26 12:02:35,498 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 4 states, 4 states have (on average 55.0) internal successors, (220), 4 states have internal predecessors, (220), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-26 12:02:35,499 INFO L81 ComplementDD]: Finished complementDD. Result has 4 states, 4 states have (on average 55.0) internal successors, (220), 4 states have internal predecessors, (220), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-26 12:02:35,499 INFO L175 Difference]: Start difference. First operand has 56 places, 47 transitions, 104 flow. Second operand 3 states and 119 transitions. [2023-11-26 12:02:35,499 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 57 places, 53 transitions, 172 flow [2023-11-26 12:02:35,502 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 55 places, 53 transitions, 168 flow, removed 0 selfloop flow, removed 2 redundant places. [2023-11-26 12:02:35,504 INFO L231 Difference]: Finished difference. Result has 55 places, 46 transitions, 102 flow [2023-11-26 12:02:35,504 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=55, PETRI_DIFFERENCE_MINUEND_FLOW=98, PETRI_DIFFERENCE_MINUEND_PLACES=53, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=46, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=2, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=44, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=102, PETRI_PLACES=55, PETRI_TRANSITIONS=46} [2023-11-26 12:02:35,506 INFO L281 CegarLoopForPetriNet]: 60 programPoint places, -5 predicate places. [2023-11-26 12:02:35,506 INFO L495 AbstractCegarLoop]: Abstraction has has 55 places, 46 transitions, 102 flow [2023-11-26 12:02:35,506 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 31.333333333333332) internal successors, (94), 3 states have internal predecessors, (94), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-26 12:02:35,506 INFO L200 CegarLoopForPetriNet]: Found error trace [2023-11-26 12:02:35,507 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1] [2023-11-26 12:02:35,514 INFO L540 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_5d5af139-3929-44e4-a702-ba62df77cf50/bin/uautomizer-verify-VRDe98Ueme/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (4)] Forceful destruction successful, exit code 0 [2023-11-26 12:02:35,715 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 4 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_5d5af139-3929-44e4-a702-ba62df77cf50/bin/uautomizer-verify-VRDe98Ueme/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2023-11-26 12:02:35,715 INFO L420 AbstractCegarLoop]: === Iteration 4 === Targeting ULTIMATE.startErr3REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [P2Err0ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 10 more)] === [2023-11-26 12:02:35,716 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-11-26 12:02:35,716 INFO L85 PathProgramCache]: Analyzing trace with hash 355085959, now seen corresponding path program 1 times [2023-11-26 12:02:35,716 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2023-11-26 12:02:35,717 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [1564813150] [2023-11-26 12:02:35,717 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-11-26 12:02:35,717 INFO L173 SolverBuilder]: Constructing external solver with command: mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2023-11-26 12:02:35,717 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_5d5af139-3929-44e4-a702-ba62df77cf50/bin/uautomizer-verify-VRDe98Ueme/mathsat [2023-11-26 12:02:35,718 INFO L229 MonitoredProcess]: Starting monitored process 5 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_5d5af139-3929-44e4-a702-ba62df77cf50/bin/uautomizer-verify-VRDe98Ueme/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (exit command is (exit), workingDir is null) [2023-11-26 12:02:35,771 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_5d5af139-3929-44e4-a702-ba62df77cf50/bin/uautomizer-verify-VRDe98Ueme/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (5)] Waiting until timeout for monitored process [2023-11-26 12:02:35,834 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-26 12:02:35,836 INFO L262 TraceCheckSpWp]: Trace formula consists of 71 conjuncts, 4 conjunts are in the unsatisfiable core [2023-11-26 12:02:35,837 INFO L285 TraceCheckSpWp]: Computing forward predicates... [2023-11-26 12:02:35,846 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 6 treesize of output 5 [2023-11-26 12:02:35,859 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-11-26 12:02:35,859 INFO L323 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2023-11-26 12:02:35,859 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2023-11-26 12:02:35,859 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [1564813150] [2023-11-26 12:02:35,860 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [1564813150] provided 1 perfect and 0 imperfect interpolant sequences [2023-11-26 12:02:35,860 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-11-26 12:02:35,860 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2023-11-26 12:02:35,860 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1947109191] [2023-11-26 12:02:35,860 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-11-26 12:02:35,861 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2023-11-26 12:02:35,861 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2023-11-26 12:02:35,862 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2023-11-26 12:02:35,862 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2023-11-26 12:02:35,894 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 31 out of 55 [2023-11-26 12:02:35,894 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 55 places, 46 transitions, 102 flow. Second operand has 3 states, 3 states have (on average 32.333333333333336) internal successors, (97), 3 states have internal predecessors, (97), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-26 12:02:35,895 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2023-11-26 12:02:35,895 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 31 of 55 [2023-11-26 12:02:35,895 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2023-11-26 12:02:36,111 INFO L124 PetriNetUnfolderBase]: 459/950 cut-off events. [2023-11-26 12:02:36,111 INFO L125 PetriNetUnfolderBase]: For 31/31 co-relation queries the response was YES. [2023-11-26 12:02:36,114 INFO L83 FinitePrefix]: Finished finitePrefix Result has 1719 conditions, 950 events. 459/950 cut-off events. For 31/31 co-relation queries the response was YES. Maximal size of possible extension queue 98. Compared 7121 event pairs, 340 based on Foata normal form. 2/874 useless extension candidates. Maximal degree in co-relation 1709. Up to 535 conditions per place. [2023-11-26 12:02:36,121 INFO L140 encePairwiseOnDemand]: 52/55 looper letters, 25 selfloop transitions, 2 changer transitions 0/52 dead transitions. [2023-11-26 12:02:36,122 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 56 places, 52 transitions, 168 flow [2023-11-26 12:02:36,122 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2023-11-26 12:02:36,123 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2023-11-26 12:02:36,123 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 121 transitions. [2023-11-26 12:02:36,124 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.7333333333333333 [2023-11-26 12:02:36,124 INFO L72 ComplementDD]: Start complementDD. Operand 3 states and 121 transitions. [2023-11-26 12:02:36,124 INFO L73 IsDeterministic]: Start isDeterministic. Operand 3 states and 121 transitions. [2023-11-26 12:02:36,124 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2023-11-26 12:02:36,125 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 3 states and 121 transitions. [2023-11-26 12:02:36,125 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 4 states, 3 states have (on average 40.333333333333336) internal successors, (121), 3 states have internal predecessors, (121), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-26 12:02:36,126 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 4 states, 4 states have (on average 55.0) internal successors, (220), 4 states have internal predecessors, (220), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-26 12:02:36,127 INFO L81 ComplementDD]: Finished complementDD. Result has 4 states, 4 states have (on average 55.0) internal successors, (220), 4 states have internal predecessors, (220), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-26 12:02:36,127 INFO L175 Difference]: Start difference. First operand has 55 places, 46 transitions, 102 flow. Second operand 3 states and 121 transitions. [2023-11-26 12:02:36,127 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 56 places, 52 transitions, 168 flow [2023-11-26 12:02:36,129 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 54 places, 52 transitions, 164 flow, removed 0 selfloop flow, removed 2 redundant places. [2023-11-26 12:02:36,130 INFO L231 Difference]: Finished difference. Result has 54 places, 45 transitions, 100 flow [2023-11-26 12:02:36,131 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=55, PETRI_DIFFERENCE_MINUEND_FLOW=96, PETRI_DIFFERENCE_MINUEND_PLACES=52, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=45, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=2, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=43, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=100, PETRI_PLACES=54, PETRI_TRANSITIONS=45} [2023-11-26 12:02:36,131 INFO L281 CegarLoopForPetriNet]: 60 programPoint places, -6 predicate places. [2023-11-26 12:02:36,132 INFO L495 AbstractCegarLoop]: Abstraction has has 54 places, 45 transitions, 100 flow [2023-11-26 12:02:36,132 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 32.333333333333336) internal successors, (97), 3 states have internal predecessors, (97), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-26 12:02:36,132 INFO L200 CegarLoopForPetriNet]: Found error trace [2023-11-26 12:02:36,132 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1] [2023-11-26 12:02:36,139 INFO L540 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_5d5af139-3929-44e4-a702-ba62df77cf50/bin/uautomizer-verify-VRDe98Ueme/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (5)] Forceful destruction successful, exit code 0 [2023-11-26 12:02:36,335 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 5 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_5d5af139-3929-44e4-a702-ba62df77cf50/bin/uautomizer-verify-VRDe98Ueme/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2023-11-26 12:02:36,336 INFO L420 AbstractCegarLoop]: === Iteration 5 === Targeting ULTIMATE.startErr4REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [P2Err0ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 10 more)] === [2023-11-26 12:02:36,336 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-11-26 12:02:36,337 INFO L85 PathProgramCache]: Analyzing trace with hash -138312696, now seen corresponding path program 1 times [2023-11-26 12:02:36,337 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2023-11-26 12:02:36,337 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [1687019557] [2023-11-26 12:02:36,337 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-11-26 12:02:36,338 INFO L173 SolverBuilder]: Constructing external solver with command: mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2023-11-26 12:02:36,338 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_5d5af139-3929-44e4-a702-ba62df77cf50/bin/uautomizer-verify-VRDe98Ueme/mathsat [2023-11-26 12:02:36,339 INFO L229 MonitoredProcess]: Starting monitored process 6 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_5d5af139-3929-44e4-a702-ba62df77cf50/bin/uautomizer-verify-VRDe98Ueme/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (exit command is (exit), workingDir is null) [2023-11-26 12:02:36,342 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_5d5af139-3929-44e4-a702-ba62df77cf50/bin/uautomizer-verify-VRDe98Ueme/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (6)] Waiting until timeout for monitored process [2023-11-26 12:02:36,446 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-26 12:02:36,450 INFO L262 TraceCheckSpWp]: Trace formula consists of 93 conjuncts, 3 conjunts are in the unsatisfiable core [2023-11-26 12:02:36,452 INFO L285 TraceCheckSpWp]: Computing forward predicates... [2023-11-26 12:02:36,464 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 6 treesize of output 7 [2023-11-26 12:02:36,471 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-11-26 12:02:36,471 INFO L323 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2023-11-26 12:02:36,472 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2023-11-26 12:02:36,472 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [1687019557] [2023-11-26 12:02:36,472 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [1687019557] provided 1 perfect and 0 imperfect interpolant sequences [2023-11-26 12:02:36,472 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-11-26 12:02:36,473 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2023-11-26 12:02:36,473 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [866890044] [2023-11-26 12:02:36,473 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-11-26 12:02:36,473 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2023-11-26 12:02:36,474 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2023-11-26 12:02:36,474 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2023-11-26 12:02:36,474 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2023-11-26 12:02:36,500 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 30 out of 55 [2023-11-26 12:02:36,501 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 54 places, 45 transitions, 100 flow. Second operand has 3 states, 3 states have (on average 32.0) internal successors, (96), 3 states have internal predecessors, (96), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-26 12:02:36,501 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2023-11-26 12:02:36,501 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 30 of 55 [2023-11-26 12:02:36,502 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2023-11-26 12:02:36,734 INFO L124 PetriNetUnfolderBase]: 466/952 cut-off events. [2023-11-26 12:02:36,735 INFO L125 PetriNetUnfolderBase]: For 31/31 co-relation queries the response was YES. [2023-11-26 12:02:36,738 INFO L83 FinitePrefix]: Finished finitePrefix Result has 1734 conditions, 952 events. 466/952 cut-off events. For 31/31 co-relation queries the response was YES. Maximal size of possible extension queue 98. Compared 7016 event pairs, 194 based on Foata normal form. 0/885 useless extension candidates. Maximal degree in co-relation 1724. Up to 536 conditions per place. [2023-11-26 12:02:36,745 INFO L140 encePairwiseOnDemand]: 52/55 looper letters, 26 selfloop transitions, 2 changer transitions 0/51 dead transitions. [2023-11-26 12:02:36,745 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 55 places, 51 transitions, 168 flow [2023-11-26 12:02:36,746 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2023-11-26 12:02:36,746 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2023-11-26 12:02:36,746 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 119 transitions. [2023-11-26 12:02:36,747 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.7212121212121212 [2023-11-26 12:02:36,747 INFO L72 ComplementDD]: Start complementDD. Operand 3 states and 119 transitions. [2023-11-26 12:02:36,747 INFO L73 IsDeterministic]: Start isDeterministic. Operand 3 states and 119 transitions. [2023-11-26 12:02:36,747 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2023-11-26 12:02:36,748 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 3 states and 119 transitions. [2023-11-26 12:02:36,748 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 4 states, 3 states have (on average 39.666666666666664) internal successors, (119), 3 states have internal predecessors, (119), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-26 12:02:36,749 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 4 states, 4 states have (on average 55.0) internal successors, (220), 4 states have internal predecessors, (220), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-26 12:02:36,750 INFO L81 ComplementDD]: Finished complementDD. Result has 4 states, 4 states have (on average 55.0) internal successors, (220), 4 states have internal predecessors, (220), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-26 12:02:36,750 INFO L175 Difference]: Start difference. First operand has 54 places, 45 transitions, 100 flow. Second operand 3 states and 119 transitions. [2023-11-26 12:02:36,750 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 55 places, 51 transitions, 168 flow [2023-11-26 12:02:36,752 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 53 places, 51 transitions, 164 flow, removed 0 selfloop flow, removed 2 redundant places. [2023-11-26 12:02:36,753 INFO L231 Difference]: Finished difference. Result has 53 places, 44 transitions, 98 flow [2023-11-26 12:02:36,754 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=55, PETRI_DIFFERENCE_MINUEND_FLOW=94, PETRI_DIFFERENCE_MINUEND_PLACES=51, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=44, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=2, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=42, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=98, PETRI_PLACES=53, PETRI_TRANSITIONS=44} [2023-11-26 12:02:36,754 INFO L281 CegarLoopForPetriNet]: 60 programPoint places, -7 predicate places. [2023-11-26 12:02:36,755 INFO L495 AbstractCegarLoop]: Abstraction has has 53 places, 44 transitions, 98 flow [2023-11-26 12:02:36,755 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 32.0) internal successors, (96), 3 states have internal predecessors, (96), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-26 12:02:36,755 INFO L200 CegarLoopForPetriNet]: Found error trace [2023-11-26 12:02:36,755 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1] [2023-11-26 12:02:36,764 INFO L540 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_5d5af139-3929-44e4-a702-ba62df77cf50/bin/uautomizer-verify-VRDe98Ueme/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (6)] Forceful destruction successful, exit code 0 [2023-11-26 12:02:36,958 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 6 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_5d5af139-3929-44e4-a702-ba62df77cf50/bin/uautomizer-verify-VRDe98Ueme/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2023-11-26 12:02:36,959 INFO L420 AbstractCegarLoop]: === Iteration 6 === Targeting ULTIMATE.startErr5REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [P2Err0ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 10 more)] === [2023-11-26 12:02:36,959 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-11-26 12:02:36,960 INFO L85 PathProgramCache]: Analyzing trace with hash -138312695, now seen corresponding path program 1 times [2023-11-26 12:02:36,960 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2023-11-26 12:02:36,960 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [1814600502] [2023-11-26 12:02:36,960 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-11-26 12:02:36,961 INFO L173 SolverBuilder]: Constructing external solver with command: mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2023-11-26 12:02:36,961 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_5d5af139-3929-44e4-a702-ba62df77cf50/bin/uautomizer-verify-VRDe98Ueme/mathsat [2023-11-26 12:02:36,962 INFO L229 MonitoredProcess]: Starting monitored process 7 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_5d5af139-3929-44e4-a702-ba62df77cf50/bin/uautomizer-verify-VRDe98Ueme/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (exit command is (exit), workingDir is null) [2023-11-26 12:02:36,965 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_5d5af139-3929-44e4-a702-ba62df77cf50/bin/uautomizer-verify-VRDe98Ueme/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (7)] Waiting until timeout for monitored process [2023-11-26 12:02:37,065 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-26 12:02:37,068 INFO L262 TraceCheckSpWp]: Trace formula consists of 93 conjuncts, 4 conjunts are in the unsatisfiable core [2023-11-26 12:02:37,069 INFO L285 TraceCheckSpWp]: Computing forward predicates... [2023-11-26 12:02:37,084 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 6 treesize of output 5 [2023-11-26 12:02:37,095 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-11-26 12:02:37,096 INFO L323 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2023-11-26 12:02:37,096 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2023-11-26 12:02:37,096 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [1814600502] [2023-11-26 12:02:37,097 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [1814600502] provided 1 perfect and 0 imperfect interpolant sequences [2023-11-26 12:02:37,097 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-11-26 12:02:37,097 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2023-11-26 12:02:37,097 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1907134160] [2023-11-26 12:02:37,097 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-11-26 12:02:37,098 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2023-11-26 12:02:37,098 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2023-11-26 12:02:37,099 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2023-11-26 12:02:37,100 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2023-11-26 12:02:37,138 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 31 out of 55 [2023-11-26 12:02:37,138 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 53 places, 44 transitions, 98 flow. Second operand has 3 states, 3 states have (on average 33.0) internal successors, (99), 3 states have internal predecessors, (99), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-26 12:02:37,138 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2023-11-26 12:02:37,138 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 31 of 55 [2023-11-26 12:02:37,139 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2023-11-26 12:02:37,359 INFO L124 PetriNetUnfolderBase]: 459/939 cut-off events. [2023-11-26 12:02:37,359 INFO L125 PetriNetUnfolderBase]: For 34/34 co-relation queries the response was YES. [2023-11-26 12:02:37,362 INFO L83 FinitePrefix]: Finished finitePrefix Result has 1712 conditions, 939 events. 459/939 cut-off events. For 34/34 co-relation queries the response was YES. Maximal size of possible extension queue 98. Compared 6914 event pairs, 194 based on Foata normal form. 6/875 useless extension candidates. Maximal degree in co-relation 1702. Up to 523 conditions per place. [2023-11-26 12:02:37,369 INFO L140 encePairwiseOnDemand]: 52/55 looper letters, 25 selfloop transitions, 2 changer transitions 0/50 dead transitions. [2023-11-26 12:02:37,370 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 54 places, 50 transitions, 164 flow [2023-11-26 12:02:37,370 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2023-11-26 12:02:37,371 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2023-11-26 12:02:37,371 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 121 transitions. [2023-11-26 12:02:37,372 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.7333333333333333 [2023-11-26 12:02:37,372 INFO L72 ComplementDD]: Start complementDD. Operand 3 states and 121 transitions. [2023-11-26 12:02:37,372 INFO L73 IsDeterministic]: Start isDeterministic. Operand 3 states and 121 transitions. [2023-11-26 12:02:37,372 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2023-11-26 12:02:37,372 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 3 states and 121 transitions. [2023-11-26 12:02:37,373 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 4 states, 3 states have (on average 40.333333333333336) internal successors, (121), 3 states have internal predecessors, (121), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-26 12:02:37,374 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 4 states, 4 states have (on average 55.0) internal successors, (220), 4 states have internal predecessors, (220), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-26 12:02:37,375 INFO L81 ComplementDD]: Finished complementDD. Result has 4 states, 4 states have (on average 55.0) internal successors, (220), 4 states have internal predecessors, (220), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-26 12:02:37,375 INFO L175 Difference]: Start difference. First operand has 53 places, 44 transitions, 98 flow. Second operand 3 states and 121 transitions. [2023-11-26 12:02:37,375 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 54 places, 50 transitions, 164 flow [2023-11-26 12:02:37,376 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 52 places, 50 transitions, 160 flow, removed 0 selfloop flow, removed 2 redundant places. [2023-11-26 12:02:37,378 INFO L231 Difference]: Finished difference. Result has 52 places, 43 transitions, 96 flow [2023-11-26 12:02:37,378 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=55, PETRI_DIFFERENCE_MINUEND_FLOW=92, PETRI_DIFFERENCE_MINUEND_PLACES=50, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=43, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=2, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=41, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=96, PETRI_PLACES=52, PETRI_TRANSITIONS=43} [2023-11-26 12:02:37,379 INFO L281 CegarLoopForPetriNet]: 60 programPoint places, -8 predicate places. [2023-11-26 12:02:37,380 INFO L495 AbstractCegarLoop]: Abstraction has has 52 places, 43 transitions, 96 flow [2023-11-26 12:02:37,380 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 33.0) internal successors, (99), 3 states have internal predecessors, (99), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-26 12:02:37,380 INFO L200 CegarLoopForPetriNet]: Found error trace [2023-11-26 12:02:37,380 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-11-26 12:02:37,384 INFO L540 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_5d5af139-3929-44e4-a702-ba62df77cf50/bin/uautomizer-verify-VRDe98Ueme/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (7)] Forceful destruction successful, exit code 0 [2023-11-26 12:02:37,583 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 7 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_5d5af139-3929-44e4-a702-ba62df77cf50/bin/uautomizer-verify-VRDe98Ueme/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2023-11-26 12:02:37,584 INFO L420 AbstractCegarLoop]: === Iteration 7 === Targeting P2Err0ASSERT_VIOLATIONMEMORY_LEAK === [P2Err0ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 10 more)] === [2023-11-26 12:02:37,584 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-11-26 12:02:37,584 INFO L85 PathProgramCache]: Analyzing trace with hash -1599521653, now seen corresponding path program 1 times [2023-11-26 12:02:37,584 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2023-11-26 12:02:37,585 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [228692260] [2023-11-26 12:02:37,585 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-11-26 12:02:37,585 INFO L173 SolverBuilder]: Constructing external solver with command: mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2023-11-26 12:02:37,585 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_5d5af139-3929-44e4-a702-ba62df77cf50/bin/uautomizer-verify-VRDe98Ueme/mathsat [2023-11-26 12:02:37,586 INFO L229 MonitoredProcess]: Starting monitored process 8 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_5d5af139-3929-44e4-a702-ba62df77cf50/bin/uautomizer-verify-VRDe98Ueme/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (exit command is (exit), workingDir is null) [2023-11-26 12:02:37,588 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_5d5af139-3929-44e4-a702-ba62df77cf50/bin/uautomizer-verify-VRDe98Ueme/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (8)] Waiting until timeout for monitored process [2023-11-26 12:02:37,697 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-26 12:02:37,700 INFO L262 TraceCheckSpWp]: Trace formula consists of 114 conjuncts, 5 conjunts are in the unsatisfiable core [2023-11-26 12:02:37,701 INFO L285 TraceCheckSpWp]: Computing forward predicates... [2023-11-26 12:02:37,727 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-11-26 12:02:37,728 INFO L323 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2023-11-26 12:02:37,728 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2023-11-26 12:02:37,728 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [228692260] [2023-11-26 12:02:37,729 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [228692260] provided 1 perfect and 0 imperfect interpolant sequences [2023-11-26 12:02:37,729 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-11-26 12:02:37,729 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [1] imperfect sequences [] total 1 [2023-11-26 12:02:37,729 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1628155924] [2023-11-26 12:02:37,729 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-11-26 12:02:37,730 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2023-11-26 12:02:37,730 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2023-11-26 12:02:37,731 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2023-11-26 12:02:37,731 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2023-11-26 12:02:37,731 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 32 out of 55 [2023-11-26 12:02:37,732 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 52 places, 43 transitions, 96 flow. Second operand has 3 states, 3 states have (on average 34.333333333333336) internal successors, (103), 3 states have internal predecessors, (103), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-26 12:02:37,732 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2023-11-26 12:02:37,732 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 32 of 55 [2023-11-26 12:02:37,732 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2023-11-26 12:02:37,911 INFO L124 PetriNetUnfolderBase]: 361/733 cut-off events. [2023-11-26 12:02:37,911 INFO L125 PetriNetUnfolderBase]: For 28/28 co-relation queries the response was YES. [2023-11-26 12:02:37,914 INFO L83 FinitePrefix]: Finished finitePrefix Result has 1354 conditions, 733 events. 361/733 cut-off events. For 28/28 co-relation queries the response was YES. Maximal size of possible extension queue 78. Compared 4987 event pairs, 67 based on Foata normal form. 0/726 useless extension candidates. Maximal degree in co-relation 1344. Up to 439 conditions per place. [2023-11-26 12:02:37,919 INFO L140 encePairwiseOnDemand]: 52/55 looper letters, 25 selfloop transitions, 2 changer transitions 2/52 dead transitions. [2023-11-26 12:02:37,919 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 53 places, 52 transitions, 174 flow [2023-11-26 12:02:37,919 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2023-11-26 12:02:37,920 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2023-11-26 12:02:37,920 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 126 transitions. [2023-11-26 12:02:37,921 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.7636363636363637 [2023-11-26 12:02:37,921 INFO L72 ComplementDD]: Start complementDD. Operand 3 states and 126 transitions. [2023-11-26 12:02:37,921 INFO L73 IsDeterministic]: Start isDeterministic. Operand 3 states and 126 transitions. [2023-11-26 12:02:37,921 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2023-11-26 12:02:37,922 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 3 states and 126 transitions. [2023-11-26 12:02:37,922 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 4 states, 3 states have (on average 42.0) internal successors, (126), 3 states have internal predecessors, (126), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-26 12:02:37,923 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 4 states, 4 states have (on average 55.0) internal successors, (220), 4 states have internal predecessors, (220), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-26 12:02:37,924 INFO L81 ComplementDD]: Finished complementDD. Result has 4 states, 4 states have (on average 55.0) internal successors, (220), 4 states have internal predecessors, (220), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-26 12:02:37,925 INFO L175 Difference]: Start difference. First operand has 52 places, 43 transitions, 96 flow. Second operand 3 states and 126 transitions. [2023-11-26 12:02:37,925 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 53 places, 52 transitions, 174 flow [2023-11-26 12:02:37,926 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 51 places, 52 transitions, 168 flow, removed 0 selfloop flow, removed 2 redundant places. [2023-11-26 12:02:37,928 INFO L231 Difference]: Finished difference. Result has 51 places, 41 transitions, 92 flow [2023-11-26 12:02:37,928 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=55, PETRI_DIFFERENCE_MINUEND_FLOW=90, PETRI_DIFFERENCE_MINUEND_PLACES=49, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=42, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=2, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=40, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=92, PETRI_PLACES=51, PETRI_TRANSITIONS=41} [2023-11-26 12:02:37,929 INFO L281 CegarLoopForPetriNet]: 60 programPoint places, -9 predicate places. [2023-11-26 12:02:37,929 INFO L495 AbstractCegarLoop]: Abstraction has has 51 places, 41 transitions, 92 flow [2023-11-26 12:02:37,929 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 34.333333333333336) internal successors, (103), 3 states have internal predecessors, (103), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-26 12:02:37,929 INFO L200 CegarLoopForPetriNet]: Found error trace [2023-11-26 12:02:37,929 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-11-26 12:02:37,937 INFO L552 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_5d5af139-3929-44e4-a702-ba62df77cf50/bin/uautomizer-verify-VRDe98Ueme/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (8)] Ended with exit code 0 [2023-11-26 12:02:38,132 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 8 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_5d5af139-3929-44e4-a702-ba62df77cf50/bin/uautomizer-verify-VRDe98Ueme/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2023-11-26 12:02:38,132 INFO L420 AbstractCegarLoop]: === Iteration 8 === Targeting ULTIMATE.startErr7ASSERT_VIOLATIONMEMORY_LEAK === [P2Err0ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 10 more)] === [2023-11-26 12:02:38,133 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-11-26 12:02:38,133 INFO L85 PathProgramCache]: Analyzing trace with hash -70680028, now seen corresponding path program 1 times [2023-11-26 12:02:38,133 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2023-11-26 12:02:38,133 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [2075543690] [2023-11-26 12:02:38,134 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-11-26 12:02:38,134 INFO L173 SolverBuilder]: Constructing external solver with command: mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2023-11-26 12:02:38,134 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_5d5af139-3929-44e4-a702-ba62df77cf50/bin/uautomizer-verify-VRDe98Ueme/mathsat [2023-11-26 12:02:38,135 INFO L229 MonitoredProcess]: Starting monitored process 9 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_5d5af139-3929-44e4-a702-ba62df77cf50/bin/uautomizer-verify-VRDe98Ueme/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (exit command is (exit), workingDir is null) [2023-11-26 12:02:38,173 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_5d5af139-3929-44e4-a702-ba62df77cf50/bin/uautomizer-verify-VRDe98Ueme/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (9)] Waiting until timeout for monitored process [2023-11-26 12:02:38,260 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-26 12:02:38,264 INFO L262 TraceCheckSpWp]: Trace formula consists of 123 conjuncts, 3 conjunts are in the unsatisfiable core [2023-11-26 12:02:38,266 INFO L285 TraceCheckSpWp]: Computing forward predicates... [2023-11-26 12:02:38,315 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-11-26 12:02:38,315 INFO L323 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2023-11-26 12:02:38,315 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2023-11-26 12:02:38,317 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [2075543690] [2023-11-26 12:02:38,320 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [2075543690] provided 1 perfect and 0 imperfect interpolant sequences [2023-11-26 12:02:38,321 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-11-26 12:02:38,321 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2023-11-26 12:02:38,321 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [840334211] [2023-11-26 12:02:38,322 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-11-26 12:02:38,322 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2023-11-26 12:02:38,322 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2023-11-26 12:02:38,323 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2023-11-26 12:02:38,323 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2023-11-26 12:02:38,332 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 28 out of 55 [2023-11-26 12:02:38,332 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 51 places, 41 transitions, 92 flow. Second operand has 4 states, 4 states have (on average 31.0) internal successors, (124), 4 states have internal predecessors, (124), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-26 12:02:38,332 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2023-11-26 12:02:38,332 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 28 of 55 [2023-11-26 12:02:38,333 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2023-11-26 12:02:38,683 INFO L124 PetriNetUnfolderBase]: 1014/1836 cut-off events. [2023-11-26 12:02:38,683 INFO L125 PetriNetUnfolderBase]: For 96/96 co-relation queries the response was YES. [2023-11-26 12:02:38,689 INFO L83 FinitePrefix]: Finished finitePrefix Result has 3517 conditions, 1836 events. 1014/1836 cut-off events. For 96/96 co-relation queries the response was YES. Maximal size of possible extension queue 153. Compared 12327 event pairs, 94 based on Foata normal form. 60/1887 useless extension candidates. Maximal degree in co-relation 3506. Up to 1015 conditions per place. [2023-11-26 12:02:38,716 INFO L140 encePairwiseOnDemand]: 49/55 looper letters, 37 selfloop transitions, 5 changer transitions 1/62 dead transitions. [2023-11-26 12:02:38,716 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 53 places, 62 transitions, 228 flow [2023-11-26 12:02:38,717 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2023-11-26 12:02:38,717 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 4 states. [2023-11-26 12:02:38,718 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 157 transitions. [2023-11-26 12:02:38,718 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.7136363636363636 [2023-11-26 12:02:38,718 INFO L72 ComplementDD]: Start complementDD. Operand 4 states and 157 transitions. [2023-11-26 12:02:38,718 INFO L73 IsDeterministic]: Start isDeterministic. Operand 4 states and 157 transitions. [2023-11-26 12:02:38,719 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2023-11-26 12:02:38,719 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 4 states and 157 transitions. [2023-11-26 12:02:38,719 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 5 states, 4 states have (on average 39.25) internal successors, (157), 4 states have internal predecessors, (157), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-26 12:02:38,720 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 5 states, 5 states have (on average 55.0) internal successors, (275), 5 states have internal predecessors, (275), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-26 12:02:38,721 INFO L81 ComplementDD]: Finished complementDD. Result has 5 states, 5 states have (on average 55.0) internal successors, (275), 5 states have internal predecessors, (275), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-26 12:02:38,721 INFO L175 Difference]: Start difference. First operand has 51 places, 41 transitions, 92 flow. Second operand 4 states and 157 transitions. [2023-11-26 12:02:38,721 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 53 places, 62 transitions, 228 flow [2023-11-26 12:02:38,722 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 51 places, 62 transitions, 220 flow, removed 0 selfloop flow, removed 2 redundant places. [2023-11-26 12:02:38,723 INFO L231 Difference]: Finished difference. Result has 53 places, 44 transitions, 122 flow [2023-11-26 12:02:38,724 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=55, PETRI_DIFFERENCE_MINUEND_FLOW=88, PETRI_DIFFERENCE_MINUEND_PLACES=48, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=41, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=2, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=36, PETRI_DIFFERENCE_SUBTRAHEND_STATES=4, PETRI_FLOW=122, PETRI_PLACES=53, PETRI_TRANSITIONS=44} [2023-11-26 12:02:38,724 INFO L281 CegarLoopForPetriNet]: 60 programPoint places, -7 predicate places. [2023-11-26 12:02:38,725 INFO L495 AbstractCegarLoop]: Abstraction has has 53 places, 44 transitions, 122 flow [2023-11-26 12:02:38,725 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 31.0) internal successors, (124), 4 states have internal predecessors, (124), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-26 12:02:38,725 INFO L200 CegarLoopForPetriNet]: Found error trace [2023-11-26 12:02:38,725 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-26 12:02:38,736 INFO L540 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_5d5af139-3929-44e4-a702-ba62df77cf50/bin/uautomizer-verify-VRDe98Ueme/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (9)] Forceful destruction successful, exit code 0 [2023-11-26 12:02:38,928 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 9 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_5d5af139-3929-44e4-a702-ba62df77cf50/bin/uautomizer-verify-VRDe98Ueme/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2023-11-26 12:02:38,928 INFO L420 AbstractCegarLoop]: === Iteration 9 === Targeting ULTIMATE.startErr7ASSERT_VIOLATIONMEMORY_LEAK === [P2Err0ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 10 more)] === [2023-11-26 12:02:38,929 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-11-26 12:02:38,929 INFO L85 PathProgramCache]: Analyzing trace with hash 1064309801, now seen corresponding path program 1 times [2023-11-26 12:02:38,929 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2023-11-26 12:02:38,929 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [255625567] [2023-11-26 12:02:38,930 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-11-26 12:02:38,930 INFO L173 SolverBuilder]: Constructing external solver with command: mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2023-11-26 12:02:38,930 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_5d5af139-3929-44e4-a702-ba62df77cf50/bin/uautomizer-verify-VRDe98Ueme/mathsat [2023-11-26 12:02:38,932 INFO L229 MonitoredProcess]: Starting monitored process 10 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_5d5af139-3929-44e4-a702-ba62df77cf50/bin/uautomizer-verify-VRDe98Ueme/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (exit command is (exit), workingDir is null) [2023-11-26 12:02:38,937 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_5d5af139-3929-44e4-a702-ba62df77cf50/bin/uautomizer-verify-VRDe98Ueme/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (10)] Waiting until timeout for monitored process [2023-11-26 12:02:39,075 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-26 12:02:39,079 INFO L262 TraceCheckSpWp]: Trace formula consists of 144 conjuncts, 4 conjunts are in the unsatisfiable core [2023-11-26 12:02:39,081 INFO L285 TraceCheckSpWp]: Computing forward predicates... [2023-11-26 12:02:39,164 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-11-26 12:02:39,164 INFO L323 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2023-11-26 12:02:39,165 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2023-11-26 12:02:39,165 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [255625567] [2023-11-26 12:02:39,165 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [255625567] provided 1 perfect and 0 imperfect interpolant sequences [2023-11-26 12:02:39,165 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-11-26 12:02:39,165 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2023-11-26 12:02:39,166 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1225259932] [2023-11-26 12:02:39,166 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-11-26 12:02:39,167 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2023-11-26 12:02:39,167 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2023-11-26 12:02:39,168 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2023-11-26 12:02:39,168 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2023-11-26 12:02:39,185 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 28 out of 55 [2023-11-26 12:02:39,186 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 53 places, 44 transitions, 122 flow. Second operand has 5 states, 5 states have (on average 31.0) internal successors, (155), 5 states have internal predecessors, (155), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-26 12:02:39,186 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2023-11-26 12:02:39,186 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 28 of 55 [2023-11-26 12:02:39,186 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2023-11-26 12:02:39,529 INFO L124 PetriNetUnfolderBase]: 688/1262 cut-off events. [2023-11-26 12:02:39,529 INFO L125 PetriNetUnfolderBase]: For 323/323 co-relation queries the response was YES. [2023-11-26 12:02:39,533 INFO L83 FinitePrefix]: Finished finitePrefix Result has 2805 conditions, 1262 events. 688/1262 cut-off events. For 323/323 co-relation queries the response was YES. Maximal size of possible extension queue 82. Compared 7414 event pairs, 34 based on Foata normal form. 54/1307 useless extension candidates. Maximal degree in co-relation 2792. Up to 553 conditions per place. [2023-11-26 12:02:39,542 INFO L140 encePairwiseOnDemand]: 49/55 looper letters, 46 selfloop transitions, 8 changer transitions 1/74 dead transitions. [2023-11-26 12:02:39,542 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 57 places, 74 transitions, 313 flow [2023-11-26 12:02:39,543 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2023-11-26 12:02:39,543 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 5 states. [2023-11-26 12:02:39,544 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 197 transitions. [2023-11-26 12:02:39,544 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.7163636363636363 [2023-11-26 12:02:39,544 INFO L72 ComplementDD]: Start complementDD. Operand 5 states and 197 transitions. [2023-11-26 12:02:39,545 INFO L73 IsDeterministic]: Start isDeterministic. Operand 5 states and 197 transitions. [2023-11-26 12:02:39,545 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2023-11-26 12:02:39,545 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 5 states and 197 transitions. [2023-11-26 12:02:39,546 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 6 states, 5 states have (on average 39.4) internal successors, (197), 5 states have internal predecessors, (197), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-26 12:02:39,547 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 6 states, 6 states have (on average 55.0) internal successors, (330), 6 states have internal predecessors, (330), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-26 12:02:39,548 INFO L81 ComplementDD]: Finished complementDD. Result has 6 states, 6 states have (on average 55.0) internal successors, (330), 6 states have internal predecessors, (330), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-26 12:02:39,548 INFO L175 Difference]: Start difference. First operand has 53 places, 44 transitions, 122 flow. Second operand 5 states and 197 transitions. [2023-11-26 12:02:39,548 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 57 places, 74 transitions, 313 flow [2023-11-26 12:02:39,550 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 55 places, 74 transitions, 303 flow, removed 1 selfloop flow, removed 2 redundant places. [2023-11-26 12:02:39,551 INFO L231 Difference]: Finished difference. Result has 57 places, 47 transitions, 162 flow [2023-11-26 12:02:39,552 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=55, PETRI_DIFFERENCE_MINUEND_FLOW=114, PETRI_DIFFERENCE_MINUEND_PLACES=51, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=44, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=5, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=36, PETRI_DIFFERENCE_SUBTRAHEND_STATES=5, PETRI_FLOW=162, PETRI_PLACES=57, PETRI_TRANSITIONS=47} [2023-11-26 12:02:39,553 INFO L281 CegarLoopForPetriNet]: 60 programPoint places, -3 predicate places. [2023-11-26 12:02:39,553 INFO L495 AbstractCegarLoop]: Abstraction has has 57 places, 47 transitions, 162 flow [2023-11-26 12:02:39,553 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 31.0) internal successors, (155), 5 states have internal predecessors, (155), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-26 12:02:39,553 INFO L200 CegarLoopForPetriNet]: Found error trace [2023-11-26 12:02:39,554 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] [2023-11-26 12:02:39,563 INFO L540 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_5d5af139-3929-44e4-a702-ba62df77cf50/bin/uautomizer-verify-VRDe98Ueme/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (10)] Forceful destruction successful, exit code 0 [2023-11-26 12:02:39,757 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 10 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_5d5af139-3929-44e4-a702-ba62df77cf50/bin/uautomizer-verify-VRDe98Ueme/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2023-11-26 12:02:39,757 INFO L420 AbstractCegarLoop]: === Iteration 10 === Targeting ULTIMATE.startErr7ASSERT_VIOLATIONMEMORY_LEAK === [P2Err0ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 10 more)] === [2023-11-26 12:02:39,757 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-11-26 12:02:39,757 INFO L85 PathProgramCache]: Analyzing trace with hash -1498535002, now seen corresponding path program 1 times [2023-11-26 12:02:39,758 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2023-11-26 12:02:39,758 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [742393350] [2023-11-26 12:02:39,758 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-11-26 12:02:39,758 INFO L173 SolverBuilder]: Constructing external solver with command: mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2023-11-26 12:02:39,759 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_5d5af139-3929-44e4-a702-ba62df77cf50/bin/uautomizer-verify-VRDe98Ueme/mathsat [2023-11-26 12:02:39,759 INFO L229 MonitoredProcess]: Starting monitored process 11 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_5d5af139-3929-44e4-a702-ba62df77cf50/bin/uautomizer-verify-VRDe98Ueme/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (exit command is (exit), workingDir is null) [2023-11-26 12:02:39,762 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_5d5af139-3929-44e4-a702-ba62df77cf50/bin/uautomizer-verify-VRDe98Ueme/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (11)] Waiting until timeout for monitored process [2023-11-26 12:02:39,882 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-26 12:02:39,886 INFO L262 TraceCheckSpWp]: Trace formula consists of 151 conjuncts, 5 conjunts are in the unsatisfiable core [2023-11-26 12:02:39,888 INFO L285 TraceCheckSpWp]: Computing forward predicates... [2023-11-26 12:02:39,974 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-11-26 12:02:39,974 INFO L323 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2023-11-26 12:02:39,975 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2023-11-26 12:02:39,975 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [742393350] [2023-11-26 12:02:39,975 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [742393350] provided 1 perfect and 0 imperfect interpolant sequences [2023-11-26 12:02:39,975 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-11-26 12:02:39,975 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2023-11-26 12:02:39,976 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1879419056] [2023-11-26 12:02:39,976 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-11-26 12:02:39,976 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2023-11-26 12:02:39,977 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2023-11-26 12:02:39,977 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2023-11-26 12:02:39,978 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2023-11-26 12:02:39,985 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 28 out of 55 [2023-11-26 12:02:39,986 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 57 places, 47 transitions, 162 flow. Second operand has 6 states, 6 states have (on average 30.666666666666668) internal successors, (184), 6 states have internal predecessors, (184), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-26 12:02:39,986 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2023-11-26 12:02:39,986 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 28 of 55 [2023-11-26 12:02:39,986 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2023-11-26 12:02:40,266 INFO L124 PetriNetUnfolderBase]: 369/657 cut-off events. [2023-11-26 12:02:40,266 INFO L125 PetriNetUnfolderBase]: For 574/574 co-relation queries the response was YES. [2023-11-26 12:02:40,269 INFO L83 FinitePrefix]: Finished finitePrefix Result has 1715 conditions, 657 events. 369/657 cut-off events. For 574/574 co-relation queries the response was YES. Maximal size of possible extension queue 42. Compared 3011 event pairs, 23 based on Foata normal form. 32/680 useless extension candidates. Maximal degree in co-relation 1700. Up to 228 conditions per place. [2023-11-26 12:02:40,273 INFO L140 encePairwiseOnDemand]: 49/55 looper letters, 41 selfloop transitions, 11 changer transitions 1/72 dead transitions. [2023-11-26 12:02:40,274 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 62 places, 72 transitions, 328 flow [2023-11-26 12:02:40,274 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2023-11-26 12:02:40,274 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 6 states. [2023-11-26 12:02:40,275 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6 states to 6 states and 223 transitions. [2023-11-26 12:02:40,276 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.6757575757575758 [2023-11-26 12:02:40,276 INFO L72 ComplementDD]: Start complementDD. Operand 6 states and 223 transitions. [2023-11-26 12:02:40,276 INFO L73 IsDeterministic]: Start isDeterministic. Operand 6 states and 223 transitions. [2023-11-26 12:02:40,276 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2023-11-26 12:02:40,276 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 6 states and 223 transitions. [2023-11-26 12:02:40,277 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 7 states, 6 states have (on average 37.166666666666664) internal successors, (223), 6 states have internal predecessors, (223), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-26 12:02:40,278 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 7 states, 7 states have (on average 55.0) internal successors, (385), 7 states have internal predecessors, (385), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-26 12:02:40,279 INFO L81 ComplementDD]: Finished complementDD. Result has 7 states, 7 states have (on average 55.0) internal successors, (385), 7 states have internal predecessors, (385), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-26 12:02:40,279 INFO L175 Difference]: Start difference. First operand has 57 places, 47 transitions, 162 flow. Second operand 6 states and 223 transitions. [2023-11-26 12:02:40,279 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 62 places, 72 transitions, 328 flow [2023-11-26 12:02:40,297 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 58 places, 72 transitions, 303 flow, removed 4 selfloop flow, removed 4 redundant places. [2023-11-26 12:02:40,299 INFO L231 Difference]: Finished difference. Result has 60 places, 47 transitions, 176 flow [2023-11-26 12:02:40,302 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=55, PETRI_DIFFERENCE_MINUEND_FLOW=140, PETRI_DIFFERENCE_MINUEND_PLACES=53, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=47, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=11, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=36, PETRI_DIFFERENCE_SUBTRAHEND_STATES=6, PETRI_FLOW=176, PETRI_PLACES=60, PETRI_TRANSITIONS=47} [2023-11-26 12:02:40,303 INFO L281 CegarLoopForPetriNet]: 60 programPoint places, 0 predicate places. [2023-11-26 12:02:40,304 INFO L495 AbstractCegarLoop]: Abstraction has has 60 places, 47 transitions, 176 flow [2023-11-26 12:02:40,304 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 30.666666666666668) internal successors, (184), 6 states have internal predecessors, (184), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-26 12:02:40,304 INFO L200 CegarLoopForPetriNet]: Found error trace [2023-11-26 12:02:40,304 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-11-26 12:02:40,314 INFO L540 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_5d5af139-3929-44e4-a702-ba62df77cf50/bin/uautomizer-verify-VRDe98Ueme/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (11)] Forceful destruction successful, exit code 0 [2023-11-26 12:02:40,512 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 11 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_5d5af139-3929-44e4-a702-ba62df77cf50/bin/uautomizer-verify-VRDe98Ueme/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2023-11-26 12:02:40,512 INFO L420 AbstractCegarLoop]: === Iteration 11 === Targeting ULTIMATE.startErr7ASSERT_VIOLATIONMEMORY_LEAK === [P2Err0ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 10 more)] === [2023-11-26 12:02:40,513 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-11-26 12:02:40,513 INFO L85 PathProgramCache]: Analyzing trace with hash -505245629, now seen corresponding path program 1 times [2023-11-26 12:02:40,513 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2023-11-26 12:02:40,514 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [1258030594] [2023-11-26 12:02:40,514 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-11-26 12:02:40,514 INFO L173 SolverBuilder]: Constructing external solver with command: mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2023-11-26 12:02:40,514 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_5d5af139-3929-44e4-a702-ba62df77cf50/bin/uautomizer-verify-VRDe98Ueme/mathsat [2023-11-26 12:02:40,515 INFO L229 MonitoredProcess]: Starting monitored process 12 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_5d5af139-3929-44e4-a702-ba62df77cf50/bin/uautomizer-verify-VRDe98Ueme/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (exit command is (exit), workingDir is null) [2023-11-26 12:02:40,526 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_5d5af139-3929-44e4-a702-ba62df77cf50/bin/uautomizer-verify-VRDe98Ueme/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (12)] Waiting until timeout for monitored process [2023-11-26 12:02:40,690 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-26 12:02:40,694 INFO L262 TraceCheckSpWp]: Trace formula consists of 167 conjuncts, 14 conjunts are in the unsatisfiable core [2023-11-26 12:02:40,697 INFO L285 TraceCheckSpWp]: Computing forward predicates... [2023-11-26 12:02:41,348 WARN L876 $PredicateComparison]: unable to prove that (exists ((|v_ULTIMATE.start_main_~#t2579~0#1.base_41| (_ BitVec 32)) (|v_ULTIMATE.start_main_~#t2577~0#1.base_41| (_ BitVec 32)) (|v_ULTIMATE.start_main_~#t2578~0#1.base_49| (_ BitVec 32))) (let ((.cse0 (store |c_ULTIMATE.start_main_old_#valid#1| |v_ULTIMATE.start_main_~#t2577~0#1.base_41| (_ bv1 1)))) (and (= (store (store (store |c_ULTIMATE.start_main_old_#valid#1| |v_ULTIMATE.start_main_~#t2577~0#1.base_41| (_ bv0 1)) |v_ULTIMATE.start_main_~#t2578~0#1.base_49| (_ bv0 1)) |v_ULTIMATE.start_main_~#t2579~0#1.base_41| (_ bv0 1)) |c_#valid|) (= (select |c_ULTIMATE.start_main_old_#valid#1| |v_ULTIMATE.start_main_~#t2577~0#1.base_41|) (_ bv0 1)) (= (select .cse0 |v_ULTIMATE.start_main_~#t2578~0#1.base_49|) (_ bv0 1)) (= (_ bv0 1) (select (store .cse0 |v_ULTIMATE.start_main_~#t2578~0#1.base_49| (_ bv1 1)) |v_ULTIMATE.start_main_~#t2579~0#1.base_41|))))) is different from true [2023-11-26 12:02:41,350 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-11-26 12:02:41,350 INFO L323 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2023-11-26 12:02:41,350 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2023-11-26 12:02:41,350 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [1258030594] [2023-11-26 12:02:41,351 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [1258030594] provided 1 perfect and 0 imperfect interpolant sequences [2023-11-26 12:02:41,351 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-11-26 12:02:41,351 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2023-11-26 12:02:41,351 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [276583270] [2023-11-26 12:02:41,351 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-11-26 12:02:41,352 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2023-11-26 12:02:41,352 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2023-11-26 12:02:41,352 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2023-11-26 12:02:41,353 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=14, Unknown=1, NotChecked=6, Total=30 [2023-11-26 12:02:41,353 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 22 out of 55 [2023-11-26 12:02:41,354 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 60 places, 47 transitions, 176 flow. Second operand has 6 states, 6 states have (on average 25.0) internal successors, (150), 6 states have internal predecessors, (150), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-26 12:02:41,354 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2023-11-26 12:02:41,354 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 22 of 55 [2023-11-26 12:02:41,354 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2023-11-26 12:02:41,601 INFO L124 PetriNetUnfolderBase]: 196/435 cut-off events. [2023-11-26 12:02:41,601 INFO L125 PetriNetUnfolderBase]: For 147/149 co-relation queries the response was YES. [2023-11-26 12:02:41,603 INFO L83 FinitePrefix]: Finished finitePrefix Result has 946 conditions, 435 events. 196/435 cut-off events. For 147/149 co-relation queries the response was YES. Maximal size of possible extension queue 32. Compared 2035 event pairs, 156 based on Foata normal form. 8/409 useless extension candidates. Maximal degree in co-relation 929. Up to 270 conditions per place. [2023-11-26 12:02:41,606 INFO L140 encePairwiseOnDemand]: 47/55 looper letters, 25 selfloop transitions, 7 changer transitions 0/57 dead transitions. [2023-11-26 12:02:41,606 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 65 places, 57 transitions, 260 flow [2023-11-26 12:02:41,607 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2023-11-26 12:02:41,607 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 6 states. [2023-11-26 12:02:41,608 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6 states to 6 states and 165 transitions. [2023-11-26 12:02:41,608 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.5 [2023-11-26 12:02:41,608 INFO L72 ComplementDD]: Start complementDD. Operand 6 states and 165 transitions. [2023-11-26 12:02:41,608 INFO L73 IsDeterministic]: Start isDeterministic. Operand 6 states and 165 transitions. [2023-11-26 12:02:41,609 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2023-11-26 12:02:41,609 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 6 states and 165 transitions. [2023-11-26 12:02:41,610 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 7 states, 6 states have (on average 27.5) internal successors, (165), 6 states have internal predecessors, (165), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-26 12:02:41,610 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 7 states, 7 states have (on average 55.0) internal successors, (385), 7 states have internal predecessors, (385), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-26 12:02:41,611 INFO L81 ComplementDD]: Finished complementDD. Result has 7 states, 7 states have (on average 55.0) internal successors, (385), 7 states have internal predecessors, (385), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-26 12:02:41,611 INFO L175 Difference]: Start difference. First operand has 60 places, 47 transitions, 176 flow. Second operand 6 states and 165 transitions. [2023-11-26 12:02:41,611 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 65 places, 57 transitions, 260 flow [2023-11-26 12:02:41,613 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 57 places, 57 transitions, 204 flow, removed 10 selfloop flow, removed 8 redundant places. [2023-11-26 12:02:41,614 INFO L231 Difference]: Finished difference. Result has 58 places, 50 transitions, 152 flow [2023-11-26 12:02:41,615 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=55, PETRI_DIFFERENCE_MINUEND_FLOW=120, PETRI_DIFFERENCE_MINUEND_PLACES=52, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=47, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=4, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=40, PETRI_DIFFERENCE_SUBTRAHEND_STATES=6, PETRI_FLOW=152, PETRI_PLACES=58, PETRI_TRANSITIONS=50} [2023-11-26 12:02:41,615 INFO L281 CegarLoopForPetriNet]: 60 programPoint places, -2 predicate places. [2023-11-26 12:02:41,615 INFO L495 AbstractCegarLoop]: Abstraction has has 58 places, 50 transitions, 152 flow [2023-11-26 12:02:41,616 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 25.0) internal successors, (150), 6 states have internal predecessors, (150), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-26 12:02:41,616 INFO L200 CegarLoopForPetriNet]: Found error trace [2023-11-26 12:02:41,616 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-11-26 12:02:41,627 INFO L540 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_5d5af139-3929-44e4-a702-ba62df77cf50/bin/uautomizer-verify-VRDe98Ueme/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (12)] Forceful destruction successful, exit code 0 [2023-11-26 12:02:41,819 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 12 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_5d5af139-3929-44e4-a702-ba62df77cf50/bin/uautomizer-verify-VRDe98Ueme/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2023-11-26 12:02:41,820 INFO L420 AbstractCegarLoop]: === Iteration 12 === Targeting ULTIMATE.startErr6ASSERT_VIOLATIONMEMORY_LEAK === [P2Err0ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 10 more)] === [2023-11-26 12:02:41,820 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-11-26 12:02:41,820 INFO L85 PathProgramCache]: Analyzing trace with hash -936930451, now seen corresponding path program 1 times [2023-11-26 12:02:41,821 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2023-11-26 12:02:41,821 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [575860443] [2023-11-26 12:02:41,821 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-11-26 12:02:41,821 INFO L173 SolverBuilder]: Constructing external solver with command: mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2023-11-26 12:02:41,821 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_5d5af139-3929-44e4-a702-ba62df77cf50/bin/uautomizer-verify-VRDe98Ueme/mathsat [2023-11-26 12:02:41,822 INFO L229 MonitoredProcess]: Starting monitored process 13 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_5d5af139-3929-44e4-a702-ba62df77cf50/bin/uautomizer-verify-VRDe98Ueme/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (exit command is (exit), workingDir is null) [2023-11-26 12:02:41,834 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_5d5af139-3929-44e4-a702-ba62df77cf50/bin/uautomizer-verify-VRDe98Ueme/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (13)] Waiting until timeout for monitored process [2023-11-26 12:02:41,965 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-26 12:02:41,970 INFO L262 TraceCheckSpWp]: Trace formula consists of 163 conjuncts, 5 conjunts are in the unsatisfiable core [2023-11-26 12:02:41,973 INFO L285 TraceCheckSpWp]: Computing forward predicates... [2023-11-26 12:02:42,010 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-11-26 12:02:42,010 INFO L323 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2023-11-26 12:02:42,010 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2023-11-26 12:02:42,010 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [575860443] [2023-11-26 12:02:42,011 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [575860443] provided 1 perfect and 0 imperfect interpolant sequences [2023-11-26 12:02:42,011 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-11-26 12:02:42,011 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2023-11-26 12:02:42,011 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2099480496] [2023-11-26 12:02:42,011 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-11-26 12:02:42,012 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2023-11-26 12:02:42,012 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2023-11-26 12:02:42,012 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2023-11-26 12:02:42,013 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2023-11-26 12:02:42,022 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 29 out of 55 [2023-11-26 12:02:42,023 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 58 places, 50 transitions, 152 flow. Second operand has 5 states, 5 states have (on average 32.4) internal successors, (162), 5 states have internal predecessors, (162), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-26 12:02:42,023 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2023-11-26 12:02:42,023 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 29 of 55 [2023-11-26 12:02:42,023 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2023-11-26 12:02:42,271 INFO L124 PetriNetUnfolderBase]: 467/971 cut-off events. [2023-11-26 12:02:42,272 INFO L125 PetriNetUnfolderBase]: For 319/347 co-relation queries the response was YES. [2023-11-26 12:02:42,275 INFO L83 FinitePrefix]: Finished finitePrefix Result has 2245 conditions, 971 events. 467/971 cut-off events. For 319/347 co-relation queries the response was YES. Maximal size of possible extension queue 62. Compared 5378 event pairs, 224 based on Foata normal form. 8/926 useless extension candidates. Maximal degree in co-relation 2232. Up to 432 conditions per place. [2023-11-26 12:02:42,281 INFO L140 encePairwiseOnDemand]: 49/55 looper letters, 40 selfloop transitions, 5 changer transitions 0/71 dead transitions. [2023-11-26 12:02:42,282 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 62 places, 71 transitions, 314 flow [2023-11-26 12:02:42,282 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2023-11-26 12:02:42,282 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 5 states. [2023-11-26 12:02:42,283 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 185 transitions. [2023-11-26 12:02:42,283 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.6727272727272727 [2023-11-26 12:02:42,283 INFO L72 ComplementDD]: Start complementDD. Operand 5 states and 185 transitions. [2023-11-26 12:02:42,284 INFO L73 IsDeterministic]: Start isDeterministic. Operand 5 states and 185 transitions. [2023-11-26 12:02:42,284 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2023-11-26 12:02:42,284 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 5 states and 185 transitions. [2023-11-26 12:02:42,285 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-26 12:02:42,287 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 6 states, 6 states have (on average 55.0) internal successors, (330), 6 states have internal predecessors, (330), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-26 12:02:42,287 INFO L81 ComplementDD]: Finished complementDD. Result has 6 states, 6 states have (on average 55.0) internal successors, (330), 6 states have internal predecessors, (330), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-26 12:02:42,287 INFO L175 Difference]: Start difference. First operand has 58 places, 50 transitions, 152 flow. Second operand 5 states and 185 transitions. [2023-11-26 12:02:42,287 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 62 places, 71 transitions, 314 flow [2023-11-26 12:02:42,289 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 58 places, 71 transitions, 300 flow, removed 0 selfloop flow, removed 4 redundant places. [2023-11-26 12:02:42,291 INFO L231 Difference]: Finished difference. Result has 61 places, 54 transitions, 180 flow [2023-11-26 12:02:42,291 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=55, PETRI_DIFFERENCE_MINUEND_FLOW=142, PETRI_DIFFERENCE_MINUEND_PLACES=54, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=50, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=1, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=45, PETRI_DIFFERENCE_SUBTRAHEND_STATES=5, PETRI_FLOW=180, PETRI_PLACES=61, PETRI_TRANSITIONS=54} [2023-11-26 12:02:42,292 INFO L281 CegarLoopForPetriNet]: 60 programPoint places, 1 predicate places. [2023-11-26 12:02:42,292 INFO L495 AbstractCegarLoop]: Abstraction has has 61 places, 54 transitions, 180 flow [2023-11-26 12:02:42,293 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 32.4) internal successors, (162), 5 states have internal predecessors, (162), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-26 12:02:42,293 INFO L200 CegarLoopForPetriNet]: Found error trace [2023-11-26 12:02:42,293 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-11-26 12:02:42,306 INFO L552 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_5d5af139-3929-44e4-a702-ba62df77cf50/bin/uautomizer-verify-VRDe98Ueme/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (13)] Ended with exit code 0 [2023-11-26 12:02:42,496 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 13 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_5d5af139-3929-44e4-a702-ba62df77cf50/bin/uautomizer-verify-VRDe98Ueme/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2023-11-26 12:02:42,497 INFO L420 AbstractCegarLoop]: === Iteration 13 === Targeting ULTIMATE.startErr6ASSERT_VIOLATIONMEMORY_LEAK === [P2Err0ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 10 more)] === [2023-11-26 12:02:42,497 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-11-26 12:02:42,497 INFO L85 PathProgramCache]: Analyzing trace with hash -43718151, now seen corresponding path program 2 times [2023-11-26 12:02:42,498 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2023-11-26 12:02:42,498 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [1963810314] [2023-11-26 12:02:42,498 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2023-11-26 12:02:42,498 INFO L173 SolverBuilder]: Constructing external solver with command: mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2023-11-26 12:02:42,498 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_5d5af139-3929-44e4-a702-ba62df77cf50/bin/uautomizer-verify-VRDe98Ueme/mathsat [2023-11-26 12:02:42,499 INFO L229 MonitoredProcess]: Starting monitored process 14 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_5d5af139-3929-44e4-a702-ba62df77cf50/bin/uautomizer-verify-VRDe98Ueme/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (exit command is (exit), workingDir is null) [2023-11-26 12:02:42,500 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_5d5af139-3929-44e4-a702-ba62df77cf50/bin/uautomizer-verify-VRDe98Ueme/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (14)] Waiting until timeout for monitored process [2023-11-26 12:02:42,643 INFO L228 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 1 check-sat command(s) [2023-11-26 12:02:42,643 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2023-11-26 12:02:42,648 INFO L262 TraceCheckSpWp]: Trace formula consists of 163 conjuncts, 6 conjunts are in the unsatisfiable core [2023-11-26 12:02:42,650 INFO L285 TraceCheckSpWp]: Computing forward predicates... [2023-11-26 12:02:42,721 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-11-26 12:02:42,721 INFO L323 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2023-11-26 12:02:42,722 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2023-11-26 12:02:42,722 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [1963810314] [2023-11-26 12:02:42,722 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [1963810314] provided 1 perfect and 0 imperfect interpolant sequences [2023-11-26 12:02:42,722 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-11-26 12:02:42,722 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2023-11-26 12:02:42,722 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [476284852] [2023-11-26 12:02:42,723 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-11-26 12:02:42,723 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2023-11-26 12:02:42,723 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2023-11-26 12:02:42,724 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2023-11-26 12:02:42,724 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2023-11-26 12:02:42,740 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 29 out of 55 [2023-11-26 12:02:42,740 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 61 places, 54 transitions, 180 flow. Second operand has 6 states, 6 states have (on average 31.833333333333332) internal successors, (191), 6 states have internal predecessors, (191), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-26 12:02:42,740 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2023-11-26 12:02:42,741 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 29 of 55 [2023-11-26 12:02:42,741 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2023-11-26 12:02:43,162 INFO L124 PetriNetUnfolderBase]: 932/1890 cut-off events. [2023-11-26 12:02:43,163 INFO L125 PetriNetUnfolderBase]: For 671/769 co-relation queries the response was YES. [2023-11-26 12:02:43,170 INFO L83 FinitePrefix]: Finished finitePrefix Result has 4479 conditions, 1890 events. 932/1890 cut-off events. For 671/769 co-relation queries the response was YES. Maximal size of possible extension queue 111. Compared 11865 event pairs, 185 based on Foata normal form. 8/1791 useless extension candidates. Maximal degree in co-relation 4464. Up to 717 conditions per place. [2023-11-26 12:02:43,185 INFO L140 encePairwiseOnDemand]: 49/55 looper letters, 53 selfloop transitions, 8 changer transitions 0/88 dead transitions. [2023-11-26 12:02:43,185 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 66 places, 88 transitions, 424 flow [2023-11-26 12:02:43,186 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2023-11-26 12:02:43,186 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 6 states. [2023-11-26 12:02:43,187 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6 states to 6 states and 224 transitions. [2023-11-26 12:02:43,187 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.6787878787878788 [2023-11-26 12:02:43,187 INFO L72 ComplementDD]: Start complementDD. Operand 6 states and 224 transitions. [2023-11-26 12:02:43,187 INFO L73 IsDeterministic]: Start isDeterministic. Operand 6 states and 224 transitions. [2023-11-26 12:02:43,188 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2023-11-26 12:02:43,188 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 6 states and 224 transitions. [2023-11-26 12:02:43,189 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 7 states, 6 states have (on average 37.333333333333336) internal successors, (224), 6 states have internal predecessors, (224), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-26 12:02:43,190 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 7 states, 7 states have (on average 55.0) internal successors, (385), 7 states have internal predecessors, (385), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-26 12:02:43,190 INFO L81 ComplementDD]: Finished complementDD. Result has 7 states, 7 states have (on average 55.0) internal successors, (385), 7 states have internal predecessors, (385), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-26 12:02:43,190 INFO L175 Difference]: Start difference. First operand has 61 places, 54 transitions, 180 flow. Second operand 6 states and 224 transitions. [2023-11-26 12:02:43,191 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 66 places, 88 transitions, 424 flow [2023-11-26 12:02:43,195 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 65 places, 88 transitions, 422 flow, removed 0 selfloop flow, removed 1 redundant places. [2023-11-26 12:02:43,198 INFO L231 Difference]: Finished difference. Result has 69 places, 61 transitions, 261 flow [2023-11-26 12:02:43,198 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=55, PETRI_DIFFERENCE_MINUEND_FLOW=178, PETRI_DIFFERENCE_MINUEND_PLACES=60, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=54, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=1, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=46, PETRI_DIFFERENCE_SUBTRAHEND_STATES=6, PETRI_FLOW=261, PETRI_PLACES=69, PETRI_TRANSITIONS=61} [2023-11-26 12:02:43,199 INFO L281 CegarLoopForPetriNet]: 60 programPoint places, 9 predicate places. [2023-11-26 12:02:43,199 INFO L495 AbstractCegarLoop]: Abstraction has has 69 places, 61 transitions, 261 flow [2023-11-26 12:02:43,200 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 31.833333333333332) internal successors, (191), 6 states have internal predecessors, (191), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-26 12:02:43,200 INFO L200 CegarLoopForPetriNet]: Found error trace [2023-11-26 12:02:43,200 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-11-26 12:02:43,206 INFO L540 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_5d5af139-3929-44e4-a702-ba62df77cf50/bin/uautomizer-verify-VRDe98Ueme/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (14)] Forceful destruction successful, exit code 0 [2023-11-26 12:02:43,406 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 14 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_5d5af139-3929-44e4-a702-ba62df77cf50/bin/uautomizer-verify-VRDe98Ueme/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2023-11-26 12:02:43,406 INFO L420 AbstractCegarLoop]: === Iteration 14 === Targeting ULTIMATE.startErr6ASSERT_VIOLATIONMEMORY_LEAK === [P2Err0ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 10 more)] === [2023-11-26 12:02:43,407 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-11-26 12:02:43,407 INFO L85 PathProgramCache]: Analyzing trace with hash 917855531, now seen corresponding path program 3 times [2023-11-26 12:02:43,407 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2023-11-26 12:02:43,407 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [1828172974] [2023-11-26 12:02:43,407 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST2 [2023-11-26 12:02:43,407 INFO L173 SolverBuilder]: Constructing external solver with command: mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2023-11-26 12:02:43,407 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_5d5af139-3929-44e4-a702-ba62df77cf50/bin/uautomizer-verify-VRDe98Ueme/mathsat [2023-11-26 12:02:43,409 INFO L229 MonitoredProcess]: Starting monitored process 15 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_5d5af139-3929-44e4-a702-ba62df77cf50/bin/uautomizer-verify-VRDe98Ueme/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (exit command is (exit), workingDir is null) [2023-11-26 12:02:43,411 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_5d5af139-3929-44e4-a702-ba62df77cf50/bin/uautomizer-verify-VRDe98Ueme/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (15)] Waiting until timeout for monitored process [2023-11-26 12:02:43,561 INFO L228 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued 1 check-sat command(s) [2023-11-26 12:02:43,562 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2023-11-26 12:02:43,567 INFO L262 TraceCheckSpWp]: Trace formula consists of 163 conjuncts, 11 conjunts are in the unsatisfiable core [2023-11-26 12:02:43,570 INFO L285 TraceCheckSpWp]: Computing forward predicates... [2023-11-26 12:02:43,897 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-11-26 12:02:43,897 INFO L323 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2023-11-26 12:02:43,897 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2023-11-26 12:02:43,897 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [1828172974] [2023-11-26 12:02:43,898 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [1828172974] provided 1 perfect and 0 imperfect interpolant sequences [2023-11-26 12:02:43,898 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-11-26 12:02:43,898 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2023-11-26 12:02:43,898 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [44153398] [2023-11-26 12:02:43,898 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-11-26 12:02:43,899 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 8 states [2023-11-26 12:02:43,899 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2023-11-26 12:02:43,900 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2023-11-26 12:02:43,900 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=15, Invalid=41, Unknown=0, NotChecked=0, Total=56 [2023-11-26 12:02:43,914 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 31 out of 55 [2023-11-26 12:02:43,914 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 69 places, 61 transitions, 261 flow. Second operand has 8 states, 8 states have (on average 32.875) internal successors, (263), 8 states have internal predecessors, (263), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-26 12:02:43,915 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2023-11-26 12:02:43,915 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 31 of 55 [2023-11-26 12:02:43,915 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2023-11-26 12:02:44,503 INFO L124 PetriNetUnfolderBase]: 1145/2366 cut-off events. [2023-11-26 12:02:44,503 INFO L125 PetriNetUnfolderBase]: For 1714/1720 co-relation queries the response was YES. [2023-11-26 12:02:44,514 INFO L83 FinitePrefix]: Finished finitePrefix Result has 6323 conditions, 2366 events. 1145/2366 cut-off events. For 1714/1720 co-relation queries the response was YES. Maximal size of possible extension queue 130. Compared 15654 event pairs, 264 based on Foata normal form. 8/2272 useless extension candidates. Maximal degree in co-relation 6304. Up to 1145 conditions per place. [2023-11-26 12:02:44,526 INFO L140 encePairwiseOnDemand]: 46/55 looper letters, 52 selfloop transitions, 18 changer transitions 0/100 dead transitions. [2023-11-26 12:02:44,526 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 77 places, 100 transitions, 599 flow [2023-11-26 12:02:44,527 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2023-11-26 12:02:44,527 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 9 states. [2023-11-26 12:02:44,528 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 9 states to 9 states and 326 transitions. [2023-11-26 12:02:44,529 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.6585858585858586 [2023-11-26 12:02:44,529 INFO L72 ComplementDD]: Start complementDD. Operand 9 states and 326 transitions. [2023-11-26 12:02:44,529 INFO L73 IsDeterministic]: Start isDeterministic. Operand 9 states and 326 transitions. [2023-11-26 12:02:44,531 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2023-11-26 12:02:44,532 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 9 states and 326 transitions. [2023-11-26 12:02:44,533 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 10 states, 9 states have (on average 36.22222222222222) internal successors, (326), 9 states have internal predecessors, (326), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-26 12:02:44,535 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 10 states, 10 states have (on average 55.0) internal successors, (550), 10 states have internal predecessors, (550), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-26 12:02:44,535 INFO L81 ComplementDD]: Finished complementDD. Result has 10 states, 10 states have (on average 55.0) internal successors, (550), 10 states have internal predecessors, (550), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-26 12:02:44,535 INFO L175 Difference]: Start difference. First operand has 69 places, 61 transitions, 261 flow. Second operand 9 states and 326 transitions. [2023-11-26 12:02:44,536 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 77 places, 100 transitions, 599 flow [2023-11-26 12:02:44,549 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 76 places, 100 transitions, 598 flow, removed 0 selfloop flow, removed 1 redundant places. [2023-11-26 12:02:44,552 INFO L231 Difference]: Finished difference. Result has 80 places, 75 transitions, 460 flow [2023-11-26 12:02:44,552 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=55, PETRI_DIFFERENCE_MINUEND_FLOW=260, PETRI_DIFFERENCE_MINUEND_PLACES=68, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=61, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=4, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=44, PETRI_DIFFERENCE_SUBTRAHEND_STATES=9, PETRI_FLOW=460, PETRI_PLACES=80, PETRI_TRANSITIONS=75} [2023-11-26 12:02:44,554 INFO L281 CegarLoopForPetriNet]: 60 programPoint places, 20 predicate places. [2023-11-26 12:02:44,554 INFO L495 AbstractCegarLoop]: Abstraction has has 80 places, 75 transitions, 460 flow [2023-11-26 12:02:44,554 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 8 states, 8 states have (on average 32.875) internal successors, (263), 8 states have internal predecessors, (263), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-26 12:02:44,554 INFO L200 CegarLoopForPetriNet]: Found error trace [2023-11-26 12:02:44,555 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-11-26 12:02:44,567 INFO L540 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_5d5af139-3929-44e4-a702-ba62df77cf50/bin/uautomizer-verify-VRDe98Ueme/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (15)] Forceful destruction successful, exit code 0 [2023-11-26 12:02:44,759 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 15 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_5d5af139-3929-44e4-a702-ba62df77cf50/bin/uautomizer-verify-VRDe98Ueme/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2023-11-26 12:02:44,759 INFO L420 AbstractCegarLoop]: === Iteration 15 === Targeting ULTIMATE.startErr6ASSERT_VIOLATIONMEMORY_LEAK === [P2Err0ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 10 more)] === [2023-11-26 12:02:44,759 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-11-26 12:02:44,759 INFO L85 PathProgramCache]: Analyzing trace with hash -820194701, now seen corresponding path program 4 times [2023-11-26 12:02:44,760 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2023-11-26 12:02:44,760 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [1176710943] [2023-11-26 12:02:44,760 INFO L93 rtionOrderModulation]: Changing assertion order to TERMS_WITH_SMALL_CONSTANTS_FIRST [2023-11-26 12:02:44,760 INFO L173 SolverBuilder]: Constructing external solver with command: mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2023-11-26 12:02:44,761 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_5d5af139-3929-44e4-a702-ba62df77cf50/bin/uautomizer-verify-VRDe98Ueme/mathsat [2023-11-26 12:02:44,762 INFO L229 MonitoredProcess]: Starting monitored process 16 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_5d5af139-3929-44e4-a702-ba62df77cf50/bin/uautomizer-verify-VRDe98Ueme/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (exit command is (exit), workingDir is null) [2023-11-26 12:02:44,766 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_5d5af139-3929-44e4-a702-ba62df77cf50/bin/uautomizer-verify-VRDe98Ueme/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (16)] Waiting until timeout for monitored process [2023-11-26 12:02:44,936 INFO L228 tOrderPrioritization]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 0 check-sat command(s) [2023-11-26 12:02:44,936 INFO L229 tOrderPrioritization]: Conjunction of SSA is sat [2023-11-26 12:02:44,936 INFO L356 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2023-11-26 12:02:45,009 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2023-11-26 12:02:45,103 INFO L130 FreeRefinementEngine]: Strategy WOLF found a feasible trace [2023-11-26 12:02:45,103 INFO L360 BasicCegarLoop]: Counterexample is feasible [2023-11-26 12:02:45,104 INFO L805 garLoopResultBuilder]: Registering result UNSAFE for location ULTIMATE.startErr6ASSERT_VIOLATIONMEMORY_LEAK (12 of 13 remaining) [2023-11-26 12:02:45,106 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location P2Err0ASSERT_VIOLATIONMEMORY_LEAK (11 of 13 remaining) [2023-11-26 12:02:45,107 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE (10 of 13 remaining) [2023-11-26 12:02:45,107 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE (9 of 13 remaining) [2023-11-26 12:02:45,107 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (8 of 13 remaining) [2023-11-26 12:02:45,108 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr3REQUIRES_VIOLATIONMEMORY_DEREFERENCE (7 of 13 remaining) [2023-11-26 12:02:45,108 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr4REQUIRES_VIOLATIONMEMORY_DEREFERENCE (6 of 13 remaining) [2023-11-26 12:02:45,108 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr5REQUIRES_VIOLATIONMEMORY_DEREFERENCE (5 of 13 remaining) [2023-11-26 12:02:45,108 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr7ASSERT_VIOLATIONMEMORY_LEAK (4 of 13 remaining) [2023-11-26 12:02:45,108 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (3 of 13 remaining) [2023-11-26 12:02:45,109 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (2 of 13 remaining) [2023-11-26 12:02:45,109 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr2INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (1 of 13 remaining) [2023-11-26 12:02:45,109 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location P2Err0ASSERT_VIOLATIONMEMORY_LEAK (0 of 13 remaining) [2023-11-26 12:02:45,114 INFO L540 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_5d5af139-3929-44e4-a702-ba62df77cf50/bin/uautomizer-verify-VRDe98Ueme/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (16)] Forceful destruction successful, exit code 0 [2023-11-26 12:02:45,314 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 16 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_5d5af139-3929-44e4-a702-ba62df77cf50/bin/uautomizer-verify-VRDe98Ueme/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2023-11-26 12:02:45,314 INFO L445 BasicCegarLoop]: Path program histogram: [4, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-11-26 12:02:45,321 INFO L228 ceAbstractionStarter]: Analysis of concurrent program completed with 1 thread instances [2023-11-26 12:02:45,321 INFO L178 ceAbstractionStarter]: Computing trace abstraction results [2023-11-26 12:02:45,411 WARN L1572 BoogieBacktranslator]: Unfinished Backtranslation: IdentifierExpression #t~pre5 could not be translated [2023-11-26 12:02:45,416 WARN L1572 BoogieBacktranslator]: Unfinished Backtranslation: IdentifierExpression #t~pre7 could not be translated [2023-11-26 12:02:45,419 WARN L1572 BoogieBacktranslator]: Unfinished Backtranslation: IdentifierExpression #t~pre9 could not be translated [2023-11-26 12:02:45,435 WARN L1572 BoogieBacktranslator]: Unfinished Backtranslation: unknown boogie variable #t~nondet0 [2023-11-26 12:02:45,445 WARN L1572 BoogieBacktranslator]: Unfinished Backtranslation: unknown boogie variable #t~nondet0 [2023-11-26 12:02:45,463 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 26.11 12:02:45 BasicIcfg [2023-11-26 12:02:45,463 INFO L131 PluginConnector]: ------------------------ END TraceAbstraction---------------------------- [2023-11-26 12:02:45,463 INFO L112 PluginConnector]: ------------------------Witness Printer---------------------------- [2023-11-26 12:02:45,464 INFO L270 PluginConnector]: Initializing Witness Printer... [2023-11-26 12:02:45,464 INFO L274 PluginConnector]: Witness Printer initialized [2023-11-26 12:02:45,464 INFO L184 PluginConnector]: Executing the observer RCFGCatcher from plugin Witness Printer for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 26.11 12:02:32" (3/4) ... [2023-11-26 12:02:45,466 INFO L140 WitnessPrinter]: No result that supports witness generation found [2023-11-26 12:02:45,467 INFO L131 PluginConnector]: ------------------------ END Witness Printer---------------------------- [2023-11-26 12:02:45,468 INFO L158 Benchmark]: Toolchain (without parser) took 14794.59ms. Allocated memory was 81.8MB in the beginning and 182.5MB in the end (delta: 100.7MB). Free memory was 56.1MB in the beginning and 61.8MB in the end (delta: -5.7MB). Peak memory consumption was 95.4MB. Max. memory is 16.1GB. [2023-11-26 12:02:45,469 INFO L158 Benchmark]: CDTParser took 1.51ms. Allocated memory is still 81.8MB. Free memory was 57.6MB in the beginning and 57.4MB in the end (delta: 150.9kB). Peak memory consumption was 2.1MB. Max. memory is 16.1GB. [2023-11-26 12:02:45,469 INFO L158 Benchmark]: CACSL2BoogieTranslator took 765.97ms. Allocated memory is still 81.8MB. Free memory was 55.9MB in the beginning and 53.9MB in the end (delta: 2.0MB). Peak memory consumption was 24.4MB. Max. memory is 16.1GB. [2023-11-26 12:02:45,470 INFO L158 Benchmark]: Boogie Procedure Inliner took 116.24ms. Allocated memory is still 81.8MB. Free memory was 53.9MB in the beginning and 51.4MB in the end (delta: 2.5MB). Peak memory consumption was 2.1MB. Max. memory is 16.1GB. [2023-11-26 12:02:45,470 INFO L158 Benchmark]: Boogie Preprocessor took 122.02ms. Allocated memory is still 81.8MB. Free memory was 51.4MB in the beginning and 47.9MB in the end (delta: 3.4MB). Peak memory consumption was 4.2MB. Max. memory is 16.1GB. [2023-11-26 12:02:45,471 INFO L158 Benchmark]: RCFGBuilder took 1191.50ms. Allocated memory was 81.8MB in the beginning and 104.9MB in the end (delta: 23.1MB). Free memory was 47.9MB in the beginning and 68.7MB in the end (delta: -20.7MB). Peak memory consumption was 25.2MB. Max. memory is 16.1GB. [2023-11-26 12:02:45,471 INFO L158 Benchmark]: TraceAbstraction took 12584.55ms. Allocated memory was 104.9MB in the beginning and 182.5MB in the end (delta: 77.6MB). Free memory was 68.1MB in the beginning and 61.8MB in the end (delta: 6.2MB). Peak memory consumption was 82.3MB. Max. memory is 16.1GB. [2023-11-26 12:02:45,471 INFO L158 Benchmark]: Witness Printer took 4.26ms. Allocated memory is still 182.5MB. Free memory is still 61.8MB. There was no memory consumed. Max. memory is 16.1GB. [2023-11-26 12:02:45,475 INFO L338 ainManager$Toolchain]: ####################### End [Toolchain 1] ####################### --- Results --- * Results from de.uni_freiburg.informatik.ultimate.core: - StatisticsResult: Toolchain Benchmarks Benchmark results are: * CDTParser took 1.51ms. Allocated memory is still 81.8MB. Free memory was 57.6MB in the beginning and 57.4MB in the end (delta: 150.9kB). Peak memory consumption was 2.1MB. Max. memory is 16.1GB. * CACSL2BoogieTranslator took 765.97ms. Allocated memory is still 81.8MB. Free memory was 55.9MB in the beginning and 53.9MB in the end (delta: 2.0MB). Peak memory consumption was 24.4MB. Max. memory is 16.1GB. * Boogie Procedure Inliner took 116.24ms. Allocated memory is still 81.8MB. Free memory was 53.9MB in the beginning and 51.4MB in the end (delta: 2.5MB). Peak memory consumption was 2.1MB. Max. memory is 16.1GB. * Boogie Preprocessor took 122.02ms. Allocated memory is still 81.8MB. Free memory was 51.4MB in the beginning and 47.9MB in the end (delta: 3.4MB). Peak memory consumption was 4.2MB. Max. memory is 16.1GB. * RCFGBuilder took 1191.50ms. Allocated memory was 81.8MB in the beginning and 104.9MB in the end (delta: 23.1MB). Free memory was 47.9MB in the beginning and 68.7MB in the end (delta: -20.7MB). Peak memory consumption was 25.2MB. Max. memory is 16.1GB. * TraceAbstraction took 12584.55ms. Allocated memory was 104.9MB in the beginning and 182.5MB in the end (delta: 77.6MB). Free memory was 68.1MB in the beginning and 61.8MB in the end (delta: 6.2MB). Peak memory consumption was 82.3MB. Max. memory is 16.1GB. * Witness Printer took 4.26ms. Allocated memory is still 182.5MB. Free memory is still 61.8MB. 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_p0_EAX = 0; [L713] 0 int __unbuffered_p1_EAX = 0; [L714] 0 _Bool main$tmp_guard0; [L715] 0 _Bool main$tmp_guard1; [L717] 0 int x = 0; [L719] 0 int y = 0; [L720] 0 _Bool y$flush_delayed; [L721] 0 int y$mem_tmp; [L722] 0 _Bool y$r_buff0_thd0; [L723] 0 _Bool y$r_buff0_thd1; [L724] 0 _Bool y$r_buff0_thd2; [L725] 0 _Bool y$r_buff0_thd3; [L726] 0 _Bool y$r_buff1_thd0; [L727] 0 _Bool y$r_buff1_thd1; [L728] 0 _Bool y$r_buff1_thd2; [L729] 0 _Bool y$r_buff1_thd3; [L730] 0 _Bool y$read_delayed; [L731] 0 int *y$read_delayed_var; [L732] 0 int y$w_buff0; [L733] 0 _Bool y$w_buff0_used; [L734] 0 int y$w_buff1; [L735] 0 _Bool y$w_buff1_used; [L737] 0 int z = 0; [L738] 0 _Bool weak$$choice0; [L739] 0 _Bool weak$$choice2; [L827] 0 pthread_t t2577; [L828] FCALL, FORK 0 pthread_create(&t2577, ((void *)0), P0, ((void *)0)) VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=0, __unbuffered_p1_EAX=0, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, t2577={5:0}, weak$$choice0=0, weak$$choice2=0, x=0, y$flush_delayed=0, y$mem_tmp=0, y$r_buff0_thd0=0, y$r_buff0_thd1=0, y$r_buff0_thd2=0, y$r_buff0_thd3=0, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$r_buff1_thd3=0, y$read_delayed=0, y$read_delayed_var={0:0}, y$w_buff0=0, y$w_buff0_used=0, y$w_buff1=0, y$w_buff1_used=0, y=0, z=0] [L829] 0 pthread_t t2578; [L830] FCALL, FORK 0 pthread_create(&t2578, ((void *)0), P1, ((void *)0)) VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=0, __unbuffered_p1_EAX=0, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, t2577={5:0}, t2578={7:0}, weak$$choice0=0, weak$$choice2=0, x=0, y$flush_delayed=0, y$mem_tmp=0, y$r_buff0_thd0=0, y$r_buff0_thd1=0, y$r_buff0_thd2=0, y$r_buff0_thd3=0, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$r_buff1_thd3=0, y$read_delayed=0, y$read_delayed_var={0:0}, y$w_buff0=0, y$w_buff0_used=0, y$w_buff1=0, y$w_buff1_used=0, y=0, z=0] [L831] 0 pthread_t t2579; [L832] FCALL, FORK 0 pthread_create(&t2579, ((void *)0), P2, ((void *)0)) VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=0, __unbuffered_p1_EAX=0, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, t2577={5:0}, t2578={7:0}, t2579={-2147483645:0}, weak$$choice0=0, weak$$choice2=0, x=0, y$flush_delayed=0, y$mem_tmp=0, y$r_buff0_thd0=0, y$r_buff0_thd1=0, y$r_buff0_thd2=0, y$r_buff0_thd3=0, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$r_buff1_thd3=0, y$read_delayed=0, y$read_delayed_var={0:0}, y$w_buff0=0, y$w_buff0_used=0, y$w_buff1=0, y$w_buff1_used=0, y=0, z=0] [L790] 3 y$w_buff1 = y$w_buff0 [L791] 3 y$w_buff0 = 1 [L792] 3 y$w_buff1_used = y$w_buff0_used [L793] 3 y$w_buff0_used = (_Bool)1 [L794] CALL 3 __VERIFIER_assert(!(y$w_buff1_used && y$w_buff0_used)) [L18] COND FALSE 3 !(!expression) [L794] RET 3 __VERIFIER_assert(!(y$w_buff1_used && y$w_buff0_used)) [L795] 3 y$r_buff1_thd0 = y$r_buff0_thd0 [L796] 3 y$r_buff1_thd1 = y$r_buff0_thd1 [L797] 3 y$r_buff1_thd2 = y$r_buff0_thd2 [L798] 3 y$r_buff1_thd3 = y$r_buff0_thd3 [L799] 3 y$r_buff0_thd3 = (_Bool)1 VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=0, __unbuffered_p1_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$flush_delayed=0, y$mem_tmp=0, y$r_buff0_thd0=0, y$r_buff0_thd1=0, y$r_buff0_thd2=0, y$r_buff0_thd3=1, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$r_buff1_thd3=0, y$read_delayed=0, y$read_delayed_var={0:0}, y$w_buff0=1, y$w_buff0_used=1, y$w_buff1=0, y$w_buff1_used=0, y=0, z=0] [L802] 3 z = 1 VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=0, __unbuffered_p1_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$flush_delayed=0, y$mem_tmp=0, y$r_buff0_thd0=0, y$r_buff0_thd1=0, y$r_buff0_thd2=0, y$r_buff0_thd3=1, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$r_buff1_thd3=0, y$read_delayed=0, y$read_delayed_var={0:0}, y$w_buff0=1, y$w_buff0_used=1, y$w_buff1=0, y$w_buff1_used=0, y=0, z=1] [L743] 1 z = 2 VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=0, __unbuffered_p1_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=0, y$flush_delayed=0, y$mem_tmp=0, y$r_buff0_thd0=0, y$r_buff0_thd1=0, y$r_buff0_thd2=0, y$r_buff0_thd3=1, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$r_buff1_thd3=0, y$read_delayed=0, y$read_delayed_var={0:0}, y$w_buff0=1, y$w_buff0_used=1, y$w_buff1=0, y$w_buff1_used=0, y=0, z=2] [L748] 1 __unbuffered_p0_EAX = x VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=0, __unbuffered_p1_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$flush_delayed=0, y$mem_tmp=0, y$r_buff0_thd0=0, y$r_buff0_thd1=0, y$r_buff0_thd2=0, y$r_buff0_thd3=1, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$r_buff1_thd3=0, y$read_delayed=0, y$read_delayed_var={0:0}, y$w_buff0=1, y$w_buff0_used=1, y$w_buff1=0, y$w_buff1_used=0, y=0, z=2] [L760] 2 x = 1 VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=0, __unbuffered_p1_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=1, y$flush_delayed=0, y$mem_tmp=0, y$r_buff0_thd0=0, y$r_buff0_thd1=0, y$r_buff0_thd2=0, y$r_buff0_thd3=1, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$r_buff1_thd3=0, y$read_delayed=0, y$read_delayed_var={0:0}, y$w_buff0=1, y$w_buff0_used=1, y$w_buff1=0, y$w_buff1_used=0, y=0, z=2] [L765] 2 weak$$choice0 = __VERIFIER_nondet_bool() [L766] 2 weak$$choice2 = __VERIFIER_nondet_bool() [L767] 2 y$flush_delayed = weak$$choice2 [L768] 2 y$mem_tmp = y [L769] 2 y = !y$w_buff0_used || !y$r_buff0_thd2 && !y$w_buff1_used || !y$r_buff0_thd2 && !y$r_buff1_thd2 ? y : (y$w_buff0_used && y$r_buff0_thd2 ? y$w_buff0 : y$w_buff1) [L770] 2 y$w_buff0 = weak$$choice2 ? y$w_buff0 : (!y$w_buff0_used || !y$r_buff0_thd2 && !y$w_buff1_used || !y$r_buff0_thd2 && !y$r_buff1_thd2 ? y$w_buff0 : (y$w_buff0_used && y$r_buff0_thd2 ? y$w_buff0 : y$w_buff0)) [L771] 2 y$w_buff1 = weak$$choice2 ? y$w_buff1 : (!y$w_buff0_used || !y$r_buff0_thd2 && !y$w_buff1_used || !y$r_buff0_thd2 && !y$r_buff1_thd2 ? y$w_buff1 : (y$w_buff0_used && y$r_buff0_thd2 ? y$w_buff1 : y$w_buff1)) [L772] 2 y$w_buff0_used = weak$$choice2 ? y$w_buff0_used : (!y$w_buff0_used || !y$r_buff0_thd2 && !y$w_buff1_used || !y$r_buff0_thd2 && !y$r_buff1_thd2 ? y$w_buff0_used : (y$w_buff0_used && y$r_buff0_thd2 ? (_Bool)0 : y$w_buff0_used)) [L773] 2 y$w_buff1_used = weak$$choice2 ? y$w_buff1_used : (!y$w_buff0_used || !y$r_buff0_thd2 && !y$w_buff1_used || !y$r_buff0_thd2 && !y$r_buff1_thd2 ? y$w_buff1_used : (y$w_buff0_used && y$r_buff0_thd2 ? (_Bool)0 : (_Bool)0)) [L774] 2 y$r_buff0_thd2 = weak$$choice2 ? y$r_buff0_thd2 : (!y$w_buff0_used || !y$r_buff0_thd2 && !y$w_buff1_used || !y$r_buff0_thd2 && !y$r_buff1_thd2 ? y$r_buff0_thd2 : (y$w_buff0_used && y$r_buff0_thd2 ? (_Bool)0 : y$r_buff0_thd2)) [L775] 2 y$r_buff1_thd2 = weak$$choice2 ? y$r_buff1_thd2 : (!y$w_buff0_used || !y$r_buff0_thd2 && !y$w_buff1_used || !y$r_buff0_thd2 && !y$r_buff1_thd2 ? y$r_buff1_thd2 : (y$w_buff0_used && y$r_buff0_thd2 ? (_Bool)0 : (_Bool)0)) [L776] 2 __unbuffered_p1_EAX = y [L777] 2 y = y$flush_delayed ? y$mem_tmp : y [L778] 2 y$flush_delayed = (_Bool)0 VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=0, __unbuffered_p1_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=1, y$flush_delayed=0, y$mem_tmp=0, y$r_buff0_thd0=0, y$r_buff0_thd1=0, y$r_buff0_thd2=0, y$r_buff0_thd3=1, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$r_buff1_thd3=0, y$read_delayed=0, y$read_delayed_var={0:0}, y$w_buff0=1, y$w_buff0_used=1, y$w_buff1=0, y$w_buff1_used=0, y=0, z=2] [L805] 3 y = y$w_buff0_used && y$r_buff0_thd3 ? y$w_buff0 : (y$w_buff1_used && y$r_buff1_thd3 ? y$w_buff1 : y) [L806] 3 y$w_buff0_used = y$w_buff0_used && y$r_buff0_thd3 ? (_Bool)0 : y$w_buff0_used [L807] 3 y$w_buff1_used = y$w_buff0_used && y$r_buff0_thd3 || y$w_buff1_used && y$r_buff1_thd3 ? (_Bool)0 : y$w_buff1_used [L808] 3 y$r_buff0_thd3 = y$w_buff0_used && y$r_buff0_thd3 ? (_Bool)0 : y$r_buff0_thd3 [L809] 3 y$r_buff1_thd3 = y$w_buff0_used && y$r_buff0_thd3 || y$w_buff1_used && y$r_buff1_thd3 ? (_Bool)0 : y$r_buff1_thd3 VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=0, __unbuffered_p1_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=1, y$flush_delayed=0, y$mem_tmp=0, y$r_buff0_thd0=0, y$r_buff0_thd1=0, y$r_buff0_thd2=0, y$r_buff0_thd3=1, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$r_buff1_thd3=0, y$read_delayed=0, y$read_delayed_var={0:0}, y$w_buff0=1, y$w_buff0_used=0, y$w_buff1=0, y$w_buff1_used=0, y=1, z=2] [L753] 1 __unbuffered_cnt = __unbuffered_cnt + 1 VAL [__unbuffered_cnt=1, __unbuffered_p0_EAX=0, __unbuffered_p1_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=1, y$flush_delayed=0, y$mem_tmp=0, y$r_buff0_thd0=0, y$r_buff0_thd1=0, y$r_buff0_thd2=0, y$r_buff0_thd3=1, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$r_buff1_thd3=0, y$read_delayed=0, y$read_delayed_var={0:0}, y$w_buff0=1, y$w_buff0_used=0, y$w_buff1=0, y$w_buff1_used=0, y=1, z=2] [L783] 2 __unbuffered_cnt = __unbuffered_cnt + 1 VAL [__unbuffered_cnt=2, __unbuffered_p0_EAX=0, __unbuffered_p1_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=1, y$flush_delayed=0, y$mem_tmp=0, y$r_buff0_thd0=0, y$r_buff0_thd1=0, y$r_buff0_thd2=0, y$r_buff0_thd3=1, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$r_buff1_thd3=0, y$read_delayed=0, y$read_delayed_var={0:0}, y$w_buff0=1, y$w_buff0_used=0, y$w_buff1=0, y$w_buff1_used=0, y=1, z=2] [L812] 3 __unbuffered_cnt = __unbuffered_cnt + 1 VAL [__unbuffered_cnt=3, __unbuffered_p0_EAX=0, __unbuffered_p1_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=1, y$flush_delayed=0, y$mem_tmp=0, y$r_buff0_thd0=0, y$r_buff0_thd1=0, y$r_buff0_thd2=0, y$r_buff0_thd3=1, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$r_buff1_thd3=0, y$read_delayed=0, y$read_delayed_var={0:0}, y$w_buff0=1, y$w_buff0_used=0, y$w_buff1=0, y$w_buff1_used=0, y=1, z=2] [L834] 0 main$tmp_guard0 = __unbuffered_cnt == 3 VAL [__unbuffered_cnt=3, __unbuffered_p0_EAX=0, __unbuffered_p1_EAX=0, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, main$tmp_guard0=1, main$tmp_guard1=0, t2577={5:0}, t2578={7:0}, t2579={-2147483645:0}, weak$$choice2=0, x=1, y$flush_delayed=0, y$mem_tmp=0, y$r_buff0_thd0=0, y$r_buff0_thd1=0, y$r_buff0_thd2=0, y$r_buff0_thd3=1, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$r_buff1_thd3=0, y$read_delayed=0, y$read_delayed_var={0:0}, y$w_buff0=1, y$w_buff0_used=0, y$w_buff1=0, y$w_buff1_used=0, y=1, z=2] [L836] CALL 0 assume_abort_if_not(main$tmp_guard0) [L3] COND FALSE 0 !(!cond) [L836] RET 0 assume_abort_if_not(main$tmp_guard0) [L838] 0 y = y$w_buff0_used && y$r_buff0_thd0 ? y$w_buff0 : (y$w_buff1_used && y$r_buff1_thd0 ? y$w_buff1 : y) [L839] 0 y$w_buff0_used = y$w_buff0_used && y$r_buff0_thd0 ? (_Bool)0 : y$w_buff0_used [L840] 0 y$w_buff1_used = y$w_buff0_used && y$r_buff0_thd0 || y$w_buff1_used && y$r_buff1_thd0 ? (_Bool)0 : y$w_buff1_used [L841] 0 y$r_buff0_thd0 = y$w_buff0_used && y$r_buff0_thd0 ? (_Bool)0 : y$r_buff0_thd0 [L842] 0 y$r_buff1_thd0 = y$w_buff0_used && y$r_buff0_thd0 || y$w_buff1_used && y$r_buff1_thd0 ? (_Bool)0 : y$r_buff1_thd0 VAL [__unbuffered_cnt=3, __unbuffered_p0_EAX=0, __unbuffered_p1_EAX=0, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, main$tmp_guard0=1, main$tmp_guard1=0, t2577={5:0}, t2578={7:0}, t2579={-2147483645:0}, weak$$choice2=0, x=1, y$flush_delayed=0, y$mem_tmp=0, y$r_buff0_thd0=0, y$r_buff0_thd1=0, y$r_buff0_thd2=0, y$r_buff0_thd3=1, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$r_buff1_thd3=0, y$read_delayed=0, y$read_delayed_var={0:0}, y$w_buff0=1, y$w_buff0_used=0, y$w_buff1=0, y$w_buff1_used=0, y=1, z=2] [L845] 0 main$tmp_guard1 = !(z == 2 && __unbuffered_p0_EAX == 0 && __unbuffered_p1_EAX == 0) VAL [__unbuffered_cnt=3, __unbuffered_p0_EAX=0, __unbuffered_p1_EAX=0, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, main$tmp_guard0=1, main$tmp_guard1=0, t2577={5:0}, t2578={7:0}, t2579={-2147483645:0}, weak$$choice2=0, x=1, y$flush_delayed=0, y$mem_tmp=0, y$r_buff0_thd0=0, y$r_buff0_thd1=0, y$r_buff0_thd2=0, y$r_buff0_thd3=1, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$r_buff1_thd3=0, y$read_delayed=0, y$read_delayed_var={0:0}, y$w_buff0=1, y$w_buff0_used=0, y$w_buff1=0, y$w_buff1_used=0, y=1, z=2] [L847] CALL 0 __VERIFIER_assert(main$tmp_guard1) [L18] COND TRUE 0 !expression [L18] CALL 0 reach_error() [L17] COND FALSE 0 !(0) VAL [__unbuffered_cnt=3, __unbuffered_p0_EAX=0, __unbuffered_p1_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=1, y$flush_delayed=0, y$mem_tmp=0, y$r_buff0_thd0=0, y$r_buff0_thd1=0, y$r_buff0_thd2=0, y$r_buff0_thd3=1, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$r_buff1_thd3=0, y$read_delayed=0, y$read_delayed_var={0:0}, y$w_buff0=1, y$w_buff0_used=0, y$w_buff1=0, y$w_buff1_used=0, y=1, z=2] [L17] 0 __assert_fail ("0", "safe034_power.oepc_power.opt_pso.oepc_pso.opt_rmo.oepc_rmo.opt.c", 8, __extension__ __PRETTY_FUNCTION__) VAL [__unbuffered_cnt=3, __unbuffered_p0_EAX=0, __unbuffered_p1_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=1, y$flush_delayed=0, y$mem_tmp=0, y$r_buff0_thd0=0, y$r_buff0_thd1=0, y$r_buff0_thd2=0, y$r_buff0_thd3=1, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$r_buff1_thd3=0, y$read_delayed=0, y$read_delayed_var={0:0}, y$w_buff0=1, y$w_buff0_used=0, y$w_buff1=0, y$w_buff1_used=0, y=1, z=2] - 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: 825]: Unable to prove that all allocated memory was freed Unable to prove that all allocated memory was freed Reason: Not analyzed. - UnprovableResult [Line: 828]: Unable to prove that petrification did provide enough thread instances (tool internal message) Unable to prove that petrification did provide enough thread instances (tool internal message) Reason: Not analyzed. - UnprovableResult [Line: 830]: Unable to prove that petrification did provide enough thread instances (tool internal message) Unable to prove that petrification did provide enough thread instances (tool internal message) Reason: Not analyzed. - UnprovableResult [Line: 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. - StatisticsResult: Ultimate Automizer benchmark data with 1 thread instances CFG has 7 procedures, 81 locations, 13 error locations. Started 1 CEGAR loops. EmptinessCheckTime: 0.0s, RemoveRedundantFlowTime: 0.0s, RemoveRedundantFlowUnfoldingTime: 0.0s, BackfoldingTime: 0.0s, BackfoldingUnfoldingTime: 0.0s, FlowIncreaseByBackfolding: 0, BasicCegarLoop: OverallTime: 12.3s, OverallIterations: 15, TraceHistogramMax: 1, PathProgramHistogramMax: 4, EmptinessCheckTime: 0.0s, AutomataDifference: 5.1s, DeadEndRemovalTime: 0.0s, HoareAnnotationTime: 0.0s, InitialAbstractionConstructionTime: 0.1s, HoareTripleCheckerStatistics: 0 mSolverCounterUnknown, 466 SdHoareTripleChecker+Valid, 1.9s IncrementalHoareTripleChecker+Time, 0 mSdLazyCounter, 371 mSDsluCounter, 84 SdHoareTripleChecker+Invalid, 1.5s Time, 0 mProtectedAction, 0 SdHoareTripleChecker+Unchecked, 52 IncrementalHoareTripleChecker+Unchecked, 48 mSDsCounter, 24 IncrementalHoareTripleChecker+Valid, 0 mProtectedPredicate, 1197 IncrementalHoareTripleChecker+Invalid, 1273 SdHoareTripleChecker+Unknown, 0 mSolverCounterNotChecked, 24 mSolverCounterUnsat, 36 mSDtfsCounter, 1197 mSolverCounterSat, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Unknown, PredicateUnifierStatistics: 0 DeclaredPredicates, 252 GetRequests, 204 SyntacticMatches, 0 SemanticMatches, 48 ConstructedPredicates, 1 IntricatePredicates, 0 DeprecatedPredicates, 13 ImplicationChecksByTransitivity, 0.4s Time, 0.0s BasicInterpolantAutomatonTime, BiggestAbstraction: size=460occurred in iteration=14, InterpolantAutomatonStates: 62, traceCheckStatistics: No data available, InterpolantConsolidationStatistics: No data available, PathInvariantsStatistics: No data available, 0/0 InterpolantCoveringCapability, TotalInterpolationStatistics: No data available, 0.0s DumpTime, AutomataMinimizationStatistics: No data available, HoareAnnotationStatistics: No data available, RefinementEngineStatistics: TRACE_CHECK: 0.3s SsaConstructionTime, 0.8s SatisfiabilityAnalysisTime, 1.6s InterpolantComputationTime, 286 NumberOfCodeBlocks, 286 NumberOfCodeBlocksAsserted, 16 NumberOfCheckSat, 237 ConstructedInterpolants, 1 QuantifiedInterpolants, 1758 SizeOfPredicates, 13 NumberOfNonLiveVariables, 1616 ConjunctsInSsa, 74 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-26 12:02:45,515 INFO L540 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_5d5af139-3929-44e4-a702-ba62df77cf50/bin/uautomizer-verify-VRDe98Ueme/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 (1)] Forceful destruction successful, exit code 0 Received shutdown request... --- End real Ultimate output --- Execution finished normally Writing output log to file Ultimate.log Result: UNKNOWN: Overapproximated counterexample