./Ultimate.py --spec ../../sv-benchmarks/c/properties/valid-memsafety.prp --file ../../sv-benchmarks/c/pthread-wmm/safe012_power.opt.i --full-output --architecture 32bit -------------------------------------------------------------------------------- Checking for memory safety (deref-memtrack) Using default analysis Version d790fecc Calling Ultimate with: /usr/bin/java -Dosgi.configuration.area=/tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_8dc03989-dd1e-4552-8a40-46136af171cd/bin/uautomizer-verify-aQ6SnzHsRB/data/config -Xmx15G -Xms4m -jar /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_8dc03989-dd1e-4552-8a40-46136af171cd/bin/uautomizer-verify-aQ6SnzHsRB/plugins/org.eclipse.equinox.launcher_1.6.800.v20240513-1750.jar -data @noDefault -ultimatedata /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_8dc03989-dd1e-4552-8a40-46136af171cd/bin/uautomizer-verify-aQ6SnzHsRB/data -tc /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_8dc03989-dd1e-4552-8a40-46136af171cd/bin/uautomizer-verify-aQ6SnzHsRB/config/AutomizerMemDerefMemtrack.xml -i ../../sv-benchmarks/c/pthread-wmm/safe012_power.opt.i -s /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_8dc03989-dd1e-4552-8a40-46136af171cd/bin/uautomizer-verify-aQ6SnzHsRB/config/svcomp-DerefFreeMemtrack-32bit-Automizer_Default.epf --cacsl2boogietranslator.entry.function main --witnessprinter.witness.directory /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_8dc03989-dd1e-4552-8a40-46136af171cd/bin/uautomizer-verify-aQ6SnzHsRB --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 697ff70a4856546a25a8cc2eb04fc80299855e02086960ffcc9a4790310db5da --- Real Ultimate output --- This is Ultimate 0.3.0-dev-d790fec [2024-11-28 05:21:55,793 INFO L188 SettingsManager]: Resetting all preferences to default values... [2024-11-28 05:21:55,918 INFO L114 SettingsManager]: Loading settings from /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_8dc03989-dd1e-4552-8a40-46136af171cd/bin/uautomizer-verify-aQ6SnzHsRB/config/svcomp-DerefFreeMemtrack-32bit-Automizer_Default.epf [2024-11-28 05:21:55,925 WARN L101 SettingsManager]: Preference file contains the following unknown settings: [2024-11-28 05:21:55,925 WARN L103 SettingsManager]: * de.uni_freiburg.informatik.ultimate.core.Log level for class [2024-11-28 05:21:55,958 INFO L130 SettingsManager]: Preferences different from defaults after loading the file: [2024-11-28 05:21:55,959 INFO L151 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2024-11-28 05:21:55,959 INFO L153 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2024-11-28 05:21:55,960 INFO L151 SettingsManager]: Preferences of Boogie Preprocessor differ from their defaults: [2024-11-28 05:21:55,960 INFO L153 SettingsManager]: * Use memory slicer=true [2024-11-28 05:21:55,960 INFO L151 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2024-11-28 05:21:55,960 INFO L153 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2024-11-28 05:21:55,961 INFO L151 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2024-11-28 05:21:55,961 INFO L153 SettingsManager]: * Create parallel compositions if possible=false [2024-11-28 05:21:55,961 INFO L153 SettingsManager]: * Use SBE=true [2024-11-28 05:21:55,961 INFO L151 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2024-11-28 05:21:55,962 INFO L153 SettingsManager]: * sizeof long=4 [2024-11-28 05:21:55,962 INFO L153 SettingsManager]: * Overapproximate operations on floating types=true [2024-11-28 05:21:55,962 INFO L153 SettingsManager]: * sizeof POINTER=4 [2024-11-28 05:21:55,962 INFO L153 SettingsManager]: * Check division by zero=IGNORE [2024-11-28 05:21:55,962 INFO L153 SettingsManager]: * Check for the main procedure if all allocated memory was freed=true [2024-11-28 05:21:55,963 INFO L153 SettingsManager]: * Bitprecise bitfields=true [2024-11-28 05:21:55,963 INFO L153 SettingsManager]: * SV-COMP memtrack compatibility mode=true [2024-11-28 05:21:55,963 INFO L153 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2024-11-28 05:21:55,963 INFO L153 SettingsManager]: * Adapt memory model on pointer casts if necessary=true [2024-11-28 05:21:55,963 INFO L153 SettingsManager]: * Check unreachability of reach_error function=false [2024-11-28 05:21:55,964 INFO L153 SettingsManager]: * sizeof long double=12 [2024-11-28 05:21:55,964 INFO L153 SettingsManager]: * Behaviour of calls to undefined functions=OVERAPPROXIMATE_BEHAVIOUR [2024-11-28 05:21:55,964 INFO L153 SettingsManager]: * Use constant arrays=true [2024-11-28 05:21:55,964 INFO L151 SettingsManager]: Preferences of IcfgBuilder differ from their defaults: [2024-11-28 05:21:55,964 INFO L153 SettingsManager]: * Size of a code block=SequenceOfStatements [2024-11-28 05:21:55,964 INFO L153 SettingsManager]: * Only consider context switches at boundaries of atomic blocks=true [2024-11-28 05:21:55,965 INFO L153 SettingsManager]: * SMT solver=External_DefaultMode [2024-11-28 05:21:55,965 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2024-11-28 05:21:55,965 INFO L151 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2024-11-28 05:21:55,965 INFO L153 SettingsManager]: * Size of a code block=SequenceOfStatements [2024-11-28 05:21:55,965 INFO L153 SettingsManager]: * Only consider context switches at boundaries of atomic blocks=true [2024-11-28 05:21:55,965 INFO L153 SettingsManager]: * SMT solver=External_DefaultMode [2024-11-28 05:21:55,965 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2024-11-28 05:21:55,966 INFO L151 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2024-11-28 05:21:55,966 INFO L153 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2024-11-28 05:21:55,966 INFO L153 SettingsManager]: * Trace refinement strategy=CAMEL [2024-11-28 05:21:55,966 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2024-11-28 05:21:55,966 INFO L153 SettingsManager]: * Apply one-shot large block encoding in concurrent analysis=false [2024-11-28 05:21:55,967 INFO L153 SettingsManager]: * Automaton type used in concurrency analysis=PETRI_NET [2024-11-28 05:21:55,967 INFO L153 SettingsManager]: * Order on configurations for Petri net unfoldings=DBO [2024-11-28 05:21:55,967 INFO L153 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2024-11-28 05:21:55,967 INFO L153 SettingsManager]: * Looper check in Petri net analysis=SEMANTIC 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_8dc03989-dd1e-4552-8a40-46136af171cd/bin/uautomizer-verify-aQ6SnzHsRB 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 -> 697ff70a4856546a25a8cc2eb04fc80299855e02086960ffcc9a4790310db5da [2024-11-28 05:21:56,363 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2024-11-28 05:21:56,379 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2024-11-28 05:21:56,383 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2024-11-28 05:21:56,386 INFO L270 PluginConnector]: Initializing CDTParser... [2024-11-28 05:21:56,387 INFO L274 PluginConnector]: CDTParser initialized [2024-11-28 05:21:56,388 INFO L431 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_8dc03989-dd1e-4552-8a40-46136af171cd/bin/uautomizer-verify-aQ6SnzHsRB/../../sv-benchmarks/c/pthread-wmm/safe012_power.opt.i [2024-11-28 05:22:00,223 INFO L533 CDTParser]: Created temporary CDT project at /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_8dc03989-dd1e-4552-8a40-46136af171cd/bin/uautomizer-verify-aQ6SnzHsRB/data/8d97e38ee/bf82284f47ca4567ad640bfda3c32a4a/FLAGab7f553cd [2024-11-28 05:22:00,715 INFO L384 CDTParser]: Found 1 translation units. [2024-11-28 05:22:00,716 INFO L180 CDTParser]: Scanning /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_8dc03989-dd1e-4552-8a40-46136af171cd/sv-benchmarks/c/pthread-wmm/safe012_power.opt.i [2024-11-28 05:22:00,738 INFO L427 CDTParser]: About to delete temporary CDT project at /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_8dc03989-dd1e-4552-8a40-46136af171cd/bin/uautomizer-verify-aQ6SnzHsRB/data/8d97e38ee/bf82284f47ca4567ad640bfda3c32a4a/FLAGab7f553cd [2024-11-28 05:22:00,760 INFO L435 CDTParser]: Successfully deleted /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_8dc03989-dd1e-4552-8a40-46136af171cd/bin/uautomizer-verify-aQ6SnzHsRB/data/8d97e38ee/bf82284f47ca4567ad640bfda3c32a4a [2024-11-28 05:22:00,762 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2024-11-28 05:22:00,764 INFO L133 ToolchainWalker]: Walking toolchain with 6 elements. [2024-11-28 05:22:00,766 INFO L112 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2024-11-28 05:22:00,766 INFO L270 PluginConnector]: Initializing CACSL2BoogieTranslator... [2024-11-28 05:22:00,770 INFO L274 PluginConnector]: CACSL2BoogieTranslator initialized [2024-11-28 05:22:00,772 INFO L184 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 28.11 05:22:00" (1/1) ... [2024-11-28 05:22:00,773 INFO L204 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@664495ab and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 28.11 05:22:00, skipping insertion in model container [2024-11-28 05:22:00,774 INFO L184 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 28.11 05:22:00" (1/1) ... [2024-11-28 05:22:00,827 INFO L175 MainTranslator]: Built tables and reachable declarations [2024-11-28 05:22:01,518 INFO L210 PostProcessor]: Analyzing one entry point: main [2024-11-28 05:22:01,543 INFO L200 MainTranslator]: Completed pre-run [2024-11-28 05:22:01,660 INFO L210 PostProcessor]: Analyzing one entry point: main [2024-11-28 05:22:01,695 INFO L204 MainTranslator]: Completed translation [2024-11-28 05:22:01,695 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 28.11 05:22:01 WrapperNode [2024-11-28 05:22:01,695 INFO L131 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2024-11-28 05:22:01,696 INFO L112 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2024-11-28 05:22:01,696 INFO L270 PluginConnector]: Initializing Boogie Procedure Inliner... [2024-11-28 05:22:01,696 INFO L274 PluginConnector]: Boogie Procedure Inliner initialized [2024-11-28 05:22:01,703 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 28.11 05:22:01" (1/1) ... [2024-11-28 05:22:01,723 INFO L184 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 28.11 05:22:01" (1/1) ... [2024-11-28 05:22:01,781 INFO L138 Inliner]: procedures = 175, calls = 60, calls flagged for inlining = 6, calls inlined = 7, statements flattened = 174 [2024-11-28 05:22:01,781 INFO L131 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2024-11-28 05:22:01,782 INFO L112 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2024-11-28 05:22:01,782 INFO L270 PluginConnector]: Initializing Boogie Preprocessor... [2024-11-28 05:22:01,782 INFO L274 PluginConnector]: Boogie Preprocessor initialized [2024-11-28 05:22:01,802 INFO L184 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 28.11 05:22:01" (1/1) ... [2024-11-28 05:22:01,802 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 28.11 05:22:01" (1/1) ... [2024-11-28 05:22:01,811 INFO L184 PluginConnector]: Executing the observer MemorySlicer from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 28.11 05:22:01" (1/1) ... [2024-11-28 05:22:01,860 INFO L175 MemorySlicer]: Split 18 memory accesses to 2 slices as follows [2, 16]. 89 percent of accesses are in the largest equivalence class. The 3 initializations are split as follows [2, 1]. The 5 writes are split as follows [0, 5]. [2024-11-28 05:22:01,861 INFO L184 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 28.11 05:22:01" (1/1) ... [2024-11-28 05:22:01,861 INFO L184 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 28.11 05:22:01" (1/1) ... [2024-11-28 05:22:01,886 INFO L184 PluginConnector]: Executing the observer ReplaceArrayAssignments from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 28.11 05:22:01" (1/1) ... [2024-11-28 05:22:01,888 INFO L184 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 28.11 05:22:01" (1/1) ... [2024-11-28 05:22:01,895 INFO L184 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 28.11 05:22:01" (1/1) ... [2024-11-28 05:22:01,901 INFO L184 PluginConnector]: Executing the observer LTLStepAnnotator from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 28.11 05:22:01" (1/1) ... [2024-11-28 05:22:01,903 INFO L184 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 28.11 05:22:01" (1/1) ... [2024-11-28 05:22:01,911 INFO L131 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2024-11-28 05:22:01,916 INFO L112 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2024-11-28 05:22:01,920 INFO L270 PluginConnector]: Initializing RCFGBuilder... [2024-11-28 05:22:01,920 INFO L274 PluginConnector]: RCFGBuilder initialized [2024-11-28 05:22:01,921 INFO L184 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 28.11 05:22:01" (1/1) ... [2024-11-28 05:22:01,933 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2024-11-28 05:22:01,951 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_8dc03989-dd1e-4552-8a40-46136af171cd/bin/uautomizer-verify-aQ6SnzHsRB/z3 [2024-11-28 05:22:01,972 INFO L229 MonitoredProcess]: Starting monitored process 1 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_8dc03989-dd1e-4552-8a40-46136af171cd/bin/uautomizer-verify-aQ6SnzHsRB/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 (exit command is (exit), workingDir is null) [2024-11-28 05:22:01,979 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_8dc03989-dd1e-4552-8a40-46136af171cd/bin/uautomizer-verify-aQ6SnzHsRB/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 (1)] Waiting until timeout for monitored process [2024-11-28 05:22:02,014 INFO L130 BoogieDeclarations]: Found specification of procedure read~int#0 [2024-11-28 05:22:02,014 INFO L130 BoogieDeclarations]: Found specification of procedure read~int#1 [2024-11-28 05:22:02,014 INFO L130 BoogieDeclarations]: Found specification of procedure write~int#0 [2024-11-28 05:22:02,014 INFO L130 BoogieDeclarations]: Found specification of procedure write~int#1 [2024-11-28 05:22:02,014 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_atomic_begin [2024-11-28 05:22:02,014 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2024-11-28 05:22:02,014 INFO L130 BoogieDeclarations]: Found specification of procedure P0 [2024-11-28 05:22:02,015 INFO L138 BoogieDeclarations]: Found implementation of procedure P0 [2024-11-28 05:22:02,015 INFO L130 BoogieDeclarations]: Found specification of procedure P1 [2024-11-28 05:22:02,015 INFO L138 BoogieDeclarations]: Found implementation of procedure P1 [2024-11-28 05:22:02,016 INFO L130 BoogieDeclarations]: Found specification of procedure P2 [2024-11-28 05:22:02,016 INFO L138 BoogieDeclarations]: Found implementation of procedure P2 [2024-11-28 05:22:02,016 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#0 [2024-11-28 05:22:02,016 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#1 [2024-11-28 05:22:02,016 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_atomic_end [2024-11-28 05:22:02,016 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2024-11-28 05:22:02,016 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2024-11-28 05:22:02,018 WARN L203 CfgBuilder]: User set CodeBlockSize to SequenceOfStatements but program contains fork statements. Overwriting the user preferences and setting CodeBlockSize to OneNontrivialStatement. [2024-11-28 05:22:02,244 INFO L234 CfgBuilder]: Building ICFG [2024-11-28 05:22:02,246 INFO L260 CfgBuilder]: Building CFG for each procedure with an implementation [2024-11-28 05:22:03,018 INFO L279 CfgBuilder]: Omitted future-live optimization because the input is a concurrent program. [2024-11-28 05:22:03,019 INFO L283 CfgBuilder]: Performing block encoding [2024-11-28 05:22:03,941 WARN L170 LargeBlockEncoding]: Complex 4:9 sequential composition. Such compositions can cause exponential blowup and should not occur in structured programs. [2024-11-28 05:22:04,230 INFO L307 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2024-11-28 05:22:04,230 INFO L312 CfgBuilder]: Removed 0 assume(true) statements. [2024-11-28 05:22:04,233 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 28.11 05:22:04 BoogieIcfgContainer [2024-11-28 05:22:04,234 INFO L131 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2024-11-28 05:22:04,237 INFO L112 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2024-11-28 05:22:04,237 INFO L270 PluginConnector]: Initializing TraceAbstraction... [2024-11-28 05:22:04,245 INFO L274 PluginConnector]: TraceAbstraction initialized [2024-11-28 05:22:04,245 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 28.11 05:22:00" (1/3) ... [2024-11-28 05:22:04,246 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@64205231 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 28.11 05:22:04, skipping insertion in model container [2024-11-28 05:22:04,246 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 28.11 05:22:01" (2/3) ... [2024-11-28 05:22:04,246 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@64205231 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 28.11 05:22:04, skipping insertion in model container [2024-11-28 05:22:04,247 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 28.11 05:22:04" (3/3) ... [2024-11-28 05:22:04,248 INFO L128 eAbstractionObserver]: Analyzing ICFG safe012_power.opt.i [2024-11-28 05:22:04,274 INFO L216 ceAbstractionStarter]: Automizer settings: Hoare:None NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2024-11-28 05:22:04,277 INFO L151 ceAbstractionStarter]: Applying trace abstraction to ICFG safe012_power.opt.i that has 4 procedures, 73 locations, 1 initial locations, 0 loop locations, and 33 error locations. [2024-11-28 05:22:04,278 INFO L491 ceAbstractionStarter]: Constructing petrified ICFG for 1 thread instances. [2024-11-28 05:22:04,723 INFO L143 ThreadInstanceAdder]: Constructed 0 joinOtherThreadTransitions. [2024-11-28 05:22:04,771 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 82 places, 101 transitions, 214 flow [2024-11-28 05:22:04,910 INFO L124 PetriNetUnfolderBase]: 29/98 cut-off events. [2024-11-28 05:22:04,916 INFO L125 PetriNetUnfolderBase]: For 0/0 co-relation queries the response was YES. [2024-11-28 05:22:04,925 INFO L83 FinitePrefix]: Finished finitePrefix Result has 108 conditions, 98 events. 29/98 cut-off events. For 0/0 co-relation queries the response was YES. Maximal size of possible extension queue 24. Compared 322 event pairs, 0 based on Foata normal form. 0/36 useless extension candidates. Maximal degree in co-relation 100. Up to 4 conditions per place. [2024-11-28 05:22:04,927 INFO L82 GeneralOperation]: Start removeDead. Operand has 82 places, 101 transitions, 214 flow [2024-11-28 05:22:04,936 INFO L88 GeneralOperation]: Finished RemoveDead, result has has 79 places, 98 transitions, 205 flow [2024-11-28 05:22:04,956 INFO L332 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2024-11-28 05:22:04,984 INFO L333 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, mAutomataTypeConcurrency=PETRI_NET, mHoareTripleChecks=INCREMENTAL, mHoareAnnotationPositions=None, 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;@7292d9b9, mLbeIndependenceSettings=[IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=false, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2024-11-28 05:22:04,985 INFO L334 AbstractCegarLoop]: Starting to check reachability of 61 error locations. [2024-11-28 05:22:05,005 INFO L185 PetriNetUnfolderBase]: Found word, exiting Unfolder. [2024-11-28 05:22:05,005 INFO L124 PetriNetUnfolderBase]: 0/12 cut-off events. [2024-11-28 05:22:05,005 INFO L125 PetriNetUnfolderBase]: For 0/0 co-relation queries the response was YES. [2024-11-28 05:22:05,006 INFO L198 CegarLoopForPetriNet]: Found error trace [2024-11-28 05:22:05,007 INFO L206 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1] [2024-11-28 05:22:05,007 INFO L396 AbstractCegarLoop]: === Iteration 1 === Targeting P1Err0ASSERT_VIOLATIONMEMORY_LEAK === [P1Err0ASSERT_VIOLATIONMEMORY_LEAK, P1Err1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, P1Err2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 58 more)] === [2024-11-28 05:22:05,014 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-28 05:22:05,016 INFO L85 PathProgramCache]: Analyzing trace with hash -1534162934, now seen corresponding path program 1 times [2024-11-28 05:22:05,028 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-28 05:22:05,028 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1730412560] [2024-11-28 05:22:05,030 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-28 05:22:05,031 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-28 05:22:05,256 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-28 05:22:05,929 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-28 05:22:05,930 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-28 05:22:05,930 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1730412560] [2024-11-28 05:22:05,931 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1730412560] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-28 05:22:05,931 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-28 05:22:05,932 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [1] imperfect sequences [] total 1 [2024-11-28 05:22:05,933 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1647956303] [2024-11-28 05:22:05,934 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-28 05:22:05,944 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2024-11-28 05:22:05,951 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-28 05:22:05,984 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-11-28 05:22:05,985 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-11-28 05:22:05,988 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 19 out of 101 [2024-11-28 05:22:05,991 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 79 places, 98 transitions, 205 flow. Second operand has 3 states, 3 states have (on average 20.666666666666668) internal successors, (62), 3 states have internal predecessors, (62), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-28 05:22:05,991 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-11-28 05:22:05,992 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 19 of 101 [2024-11-28 05:22:05,993 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-11-28 05:22:10,623 INFO L124 PetriNetUnfolderBase]: 9134/13826 cut-off events. [2024-11-28 05:22:10,624 INFO L125 PetriNetUnfolderBase]: For 14/14 co-relation queries the response was YES. [2024-11-28 05:22:10,670 INFO L83 FinitePrefix]: Finished finitePrefix Result has 26910 conditions, 13826 events. 9134/13826 cut-off events. For 14/14 co-relation queries the response was YES. Maximal size of possible extension queue 1611. Compared 111430 event pairs, 2689 based on Foata normal form. 516/7789 useless extension candidates. Maximal degree in co-relation 26899. Up to 7491 conditions per place. [2024-11-28 05:22:10,773 INFO L140 encePairwiseOnDemand]: 54/101 looper letters, 69 selfloop transitions, 3 changer transitions 0/88 dead transitions. [2024-11-28 05:22:10,774 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 65 places, 88 transitions, 332 flow [2024-11-28 05:22:10,775 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-11-28 05:22:10,778 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2024-11-28 05:22:10,790 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 213 transitions. [2024-11-28 05:22:10,793 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.7029702970297029 [2024-11-28 05:22:10,795 INFO L175 Difference]: Start difference. First operand has 79 places, 98 transitions, 205 flow. Second operand 3 states and 213 transitions. [2024-11-28 05:22:10,797 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 65 places, 88 transitions, 332 flow [2024-11-28 05:22:10,808 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 62 places, 88 transitions, 328 flow, removed 0 selfloop flow, removed 3 redundant places. [2024-11-28 05:22:10,814 INFO L231 Difference]: Finished difference. Result has 64 places, 57 transitions, 140 flow [2024-11-28 05:22:10,818 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=101, PETRI_DIFFERENCE_MINUEND_FLOW=118, PETRI_DIFFERENCE_MINUEND_PLACES=60, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=56, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=2, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=53, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=140, PETRI_PLACES=64, PETRI_TRANSITIONS=57} [2024-11-28 05:22:10,824 INFO L279 CegarLoopForPetriNet]: 79 programPoint places, -15 predicate places. [2024-11-28 05:22:10,826 INFO L471 AbstractCegarLoop]: Abstraction has has 64 places, 57 transitions, 140 flow [2024-11-28 05:22:10,826 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 20.666666666666668) internal successors, (62), 3 states have internal predecessors, (62), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-28 05:22:10,826 INFO L198 CegarLoopForPetriNet]: Found error trace [2024-11-28 05:22:10,826 INFO L206 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1] [2024-11-28 05:22:10,827 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable0 [2024-11-28 05:22:10,828 INFO L396 AbstractCegarLoop]: === Iteration 2 === Targeting P1Err1REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [P1Err0ASSERT_VIOLATIONMEMORY_LEAK, P1Err1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, P1Err2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 58 more)] === [2024-11-28 05:22:10,829 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-28 05:22:10,829 INFO L85 PathProgramCache]: Analyzing trace with hash -314409790, now seen corresponding path program 1 times [2024-11-28 05:22:10,829 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-28 05:22:10,830 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [425172865] [2024-11-28 05:22:10,830 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-28 05:22:10,830 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-28 05:22:10,893 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-28 05:22:11,107 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-28 05:22:11,108 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-28 05:22:11,109 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [425172865] [2024-11-28 05:22:11,109 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [425172865] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-28 05:22:11,109 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-28 05:22:11,109 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [1] imperfect sequences [] total 1 [2024-11-28 05:22:11,110 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [72736595] [2024-11-28 05:22:11,110 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-28 05:22:11,113 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2024-11-28 05:22:11,113 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-28 05:22:11,114 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-11-28 05:22:11,114 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-11-28 05:22:11,118 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 19 out of 101 [2024-11-28 05:22:11,118 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 64 places, 57 transitions, 140 flow. Second operand has 3 states, 3 states have (on average 21.0) internal successors, (63), 3 states have internal predecessors, (63), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-28 05:22:11,118 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-11-28 05:22:11,119 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 19 of 101 [2024-11-28 05:22:11,120 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-11-28 05:22:12,892 INFO L124 PetriNetUnfolderBase]: 4048/6490 cut-off events. [2024-11-28 05:22:12,892 INFO L125 PetriNetUnfolderBase]: For 1100/1100 co-relation queries the response was YES. [2024-11-28 05:22:12,915 INFO L83 FinitePrefix]: Finished finitePrefix Result has 13393 conditions, 6490 events. 4048/6490 cut-off events. For 1100/1100 co-relation queries the response was YES. Maximal size of possible extension queue 721. Compared 53255 event pairs, 3658 based on Foata normal form. 0/4390 useless extension candidates. Maximal degree in co-relation 13381. Up to 5819 conditions per place. [2024-11-28 05:22:12,961 INFO L140 encePairwiseOnDemand]: 93/101 looper letters, 33 selfloop transitions, 1 changer transitions 0/50 dead transitions. [2024-11-28 05:22:12,962 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 59 places, 50 transitions, 194 flow [2024-11-28 05:22:12,962 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-11-28 05:22:12,962 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2024-11-28 05:22:12,965 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 97 transitions. [2024-11-28 05:22:12,967 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.3201320132013201 [2024-11-28 05:22:12,968 INFO L175 Difference]: Start difference. First operand has 64 places, 57 transitions, 140 flow. Second operand 3 states and 97 transitions. [2024-11-28 05:22:12,968 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 59 places, 50 transitions, 194 flow [2024-11-28 05:22:12,970 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 57 places, 50 transitions, 188 flow, removed 0 selfloop flow, removed 2 redundant places. [2024-11-28 05:22:12,973 INFO L231 Difference]: Finished difference. Result has 57 places, 50 transitions, 122 flow [2024-11-28 05:22:12,974 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=101, PETRI_DIFFERENCE_MINUEND_FLOW=120, PETRI_DIFFERENCE_MINUEND_PLACES=55, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=50, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=1, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=49, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=122, PETRI_PLACES=57, PETRI_TRANSITIONS=50} [2024-11-28 05:22:12,975 INFO L279 CegarLoopForPetriNet]: 79 programPoint places, -22 predicate places. [2024-11-28 05:22:12,976 INFO L471 AbstractCegarLoop]: Abstraction has has 57 places, 50 transitions, 122 flow [2024-11-28 05:22:12,976 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 21.0) internal successors, (63), 3 states have internal predecessors, (63), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-28 05:22:12,976 INFO L198 CegarLoopForPetriNet]: Found error trace [2024-11-28 05:22:12,977 INFO L206 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1] [2024-11-28 05:22:12,977 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1 [2024-11-28 05:22:12,977 INFO L396 AbstractCegarLoop]: === Iteration 3 === Targeting P1Err2REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [P1Err0ASSERT_VIOLATIONMEMORY_LEAK, P1Err1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, P1Err2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 58 more)] === [2024-11-28 05:22:12,979 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-28 05:22:12,979 INFO L85 PathProgramCache]: Analyzing trace with hash -314409789, now seen corresponding path program 1 times [2024-11-28 05:22:12,979 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-28 05:22:12,979 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [876308984] [2024-11-28 05:22:12,980 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-28 05:22:12,980 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-28 05:22:13,032 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-28 05:22:13,287 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-28 05:22:13,288 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-28 05:22:13,289 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [876308984] [2024-11-28 05:22:13,289 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [876308984] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-28 05:22:13,289 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-28 05:22:13,289 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [1] imperfect sequences [] total 1 [2024-11-28 05:22:13,290 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1697936409] [2024-11-28 05:22:13,290 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-28 05:22:13,290 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2024-11-28 05:22:13,291 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-28 05:22:13,291 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-11-28 05:22:13,291 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-11-28 05:22:13,292 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 19 out of 101 [2024-11-28 05:22:13,294 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 57 places, 50 transitions, 122 flow. Second operand has 3 states, 3 states have (on average 21.0) internal successors, (63), 3 states have internal predecessors, (63), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-28 05:22:13,294 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-11-28 05:22:13,295 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 19 of 101 [2024-11-28 05:22:13,295 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-11-28 05:22:14,218 INFO L124 PetriNetUnfolderBase]: 1238/2098 cut-off events. [2024-11-28 05:22:14,218 INFO L125 PetriNetUnfolderBase]: For 178/178 co-relation queries the response was YES. [2024-11-28 05:22:14,227 INFO L83 FinitePrefix]: Finished finitePrefix Result has 4313 conditions, 2098 events. 1238/2098 cut-off events. For 178/178 co-relation queries the response was YES. Maximal size of possible extension queue 208. Compared 15026 event pairs, 1040 based on Foata normal form. 88/1854 useless extension candidates. Maximal degree in co-relation 4305. Up to 1809 conditions per place. [2024-11-28 05:22:14,240 INFO L140 encePairwiseOnDemand]: 93/101 looper letters, 25 selfloop transitions, 1 changer transitions 1/43 dead transitions. [2024-11-28 05:22:14,240 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 52 places, 43 transitions, 162 flow [2024-11-28 05:22:14,241 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-11-28 05:22:14,241 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2024-11-28 05:22:14,242 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 90 transitions. [2024-11-28 05:22:14,242 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.297029702970297 [2024-11-28 05:22:14,242 INFO L175 Difference]: Start difference. First operand has 57 places, 50 transitions, 122 flow. Second operand 3 states and 90 transitions. [2024-11-28 05:22:14,243 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 52 places, 43 transitions, 162 flow [2024-11-28 05:22:14,243 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 51 places, 43 transitions, 161 flow, removed 0 selfloop flow, removed 1 redundant places. [2024-11-28 05:22:14,245 INFO L231 Difference]: Finished difference. Result has 51 places, 42 transitions, 107 flow [2024-11-28 05:22:14,245 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=101, PETRI_DIFFERENCE_MINUEND_FLOW=107, PETRI_DIFFERENCE_MINUEND_PLACES=49, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=43, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=1, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=42, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=107, PETRI_PLACES=51, PETRI_TRANSITIONS=42} [2024-11-28 05:22:14,246 INFO L279 CegarLoopForPetriNet]: 79 programPoint places, -28 predicate places. [2024-11-28 05:22:14,246 INFO L471 AbstractCegarLoop]: Abstraction has has 51 places, 42 transitions, 107 flow [2024-11-28 05:22:14,246 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 21.0) internal successors, (63), 3 states have internal predecessors, (63), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-28 05:22:14,247 INFO L198 CegarLoopForPetriNet]: Found error trace [2024-11-28 05:22:14,247 INFO L206 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-28 05:22:14,247 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2 [2024-11-28 05:22:14,247 INFO L396 AbstractCegarLoop]: === Iteration 4 === Targeting ULTIMATE.startErr4REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [P1Err0ASSERT_VIOLATIONMEMORY_LEAK, P1Err1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, P1Err2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 58 more)] === [2024-11-28 05:22:14,247 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-28 05:22:14,248 INFO L85 PathProgramCache]: Analyzing trace with hash -1265561778, now seen corresponding path program 1 times [2024-11-28 05:22:14,248 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-28 05:22:14,248 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1455367130] [2024-11-28 05:22:14,248 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-28 05:22:14,248 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-28 05:22:14,282 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-28 05:22:14,422 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-28 05:22:14,422 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-28 05:22:14,422 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1455367130] [2024-11-28 05:22:14,422 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1455367130] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-28 05:22:14,423 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-28 05:22:14,423 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [1] imperfect sequences [] total 1 [2024-11-28 05:22:14,423 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1321954919] [2024-11-28 05:22:14,423 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-28 05:22:14,424 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2024-11-28 05:22:14,424 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-28 05:22:14,424 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-11-28 05:22:14,425 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-11-28 05:22:14,425 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 19 out of 101 [2024-11-28 05:22:14,426 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 51 places, 42 transitions, 107 flow. Second operand has 3 states, 3 states have (on average 22.333333333333332) internal successors, (67), 3 states have internal predecessors, (67), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-28 05:22:14,426 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-11-28 05:22:14,426 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 19 of 101 [2024-11-28 05:22:14,426 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-11-28 05:22:15,116 INFO L124 PetriNetUnfolderBase]: 1051/1839 cut-off events. [2024-11-28 05:22:15,117 INFO L125 PetriNetUnfolderBase]: For 128/128 co-relation queries the response was YES. [2024-11-28 05:22:15,127 INFO L83 FinitePrefix]: Finished finitePrefix Result has 3712 conditions, 1839 events. 1051/1839 cut-off events. For 128/128 co-relation queries the response was YES. Maximal size of possible extension queue 191. Compared 12978 event pairs, 151 based on Foata normal form. 0/1601 useless extension candidates. Maximal degree in co-relation 3703. Up to 1377 conditions per place. [2024-11-28 05:22:15,136 INFO L140 encePairwiseOnDemand]: 94/101 looper letters, 31 selfloop transitions, 6 changer transitions 0/53 dead transitions. [2024-11-28 05:22:15,136 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 52 places, 53 transitions, 205 flow [2024-11-28 05:22:15,137 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-11-28 05:22:15,137 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2024-11-28 05:22:15,138 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 95 transitions. [2024-11-28 05:22:15,138 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.31353135313531355 [2024-11-28 05:22:15,138 INFO L175 Difference]: Start difference. First operand has 51 places, 42 transitions, 107 flow. Second operand 3 states and 95 transitions. [2024-11-28 05:22:15,138 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 52 places, 53 transitions, 205 flow [2024-11-28 05:22:15,139 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 51 places, 53 transitions, 204 flow, removed 0 selfloop flow, removed 1 redundant places. [2024-11-28 05:22:15,140 INFO L231 Difference]: Finished difference. Result has 52 places, 42 transitions, 128 flow [2024-11-28 05:22:15,140 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=101, PETRI_DIFFERENCE_MINUEND_FLOW=106, PETRI_DIFFERENCE_MINUEND_PLACES=49, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=42, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=6, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=36, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=128, PETRI_PLACES=52, PETRI_TRANSITIONS=42} [2024-11-28 05:22:15,144 INFO L279 CegarLoopForPetriNet]: 79 programPoint places, -27 predicate places. [2024-11-28 05:22:15,145 INFO L471 AbstractCegarLoop]: Abstraction has has 52 places, 42 transitions, 128 flow [2024-11-28 05:22:15,145 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 22.333333333333332) internal successors, (67), 3 states have internal predecessors, (67), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-28 05:22:15,145 INFO L198 CegarLoopForPetriNet]: Found error trace [2024-11-28 05:22:15,145 INFO L206 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-28 05:22:15,146 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable3 [2024-11-28 05:22:15,146 INFO L396 AbstractCegarLoop]: === Iteration 5 === Targeting ULTIMATE.startErr5REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [P1Err0ASSERT_VIOLATIONMEMORY_LEAK, P1Err1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, P1Err2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 58 more)] === [2024-11-28 05:22:15,146 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-28 05:22:15,149 INFO L85 PathProgramCache]: Analyzing trace with hash -117472616, now seen corresponding path program 1 times [2024-11-28 05:22:15,149 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-28 05:22:15,149 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1171924834] [2024-11-28 05:22:15,150 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-28 05:22:15,150 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-28 05:22:15,193 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-28 05:22:15,734 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-28 05:22:15,734 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-28 05:22:15,734 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1171924834] [2024-11-28 05:22:15,735 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1171924834] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-28 05:22:15,735 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-28 05:22:15,735 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2024-11-28 05:22:15,735 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [617147013] [2024-11-28 05:22:15,735 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-28 05:22:15,735 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2024-11-28 05:22:15,736 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-28 05:22:15,736 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2024-11-28 05:22:15,736 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2024-11-28 05:22:15,736 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 19 out of 101 [2024-11-28 05:22:15,738 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 52 places, 42 transitions, 128 flow. Second operand has 4 states, 4 states have (on average 21.75) internal successors, (87), 4 states have internal predecessors, (87), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-28 05:22:15,738 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-11-28 05:22:15,738 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 19 of 101 [2024-11-28 05:22:15,739 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-11-28 05:22:16,344 INFO L124 PetriNetUnfolderBase]: 972/1718 cut-off events. [2024-11-28 05:22:16,344 INFO L125 PetriNetUnfolderBase]: For 278/278 co-relation queries the response was YES. [2024-11-28 05:22:16,353 INFO L83 FinitePrefix]: Finished finitePrefix Result has 3924 conditions, 1718 events. 972/1718 cut-off events. For 278/278 co-relation queries the response was YES. Maximal size of possible extension queue 173. Compared 11911 event pairs, 123 based on Foata normal form. 0/1564 useless extension candidates. Maximal degree in co-relation 3913. Up to 1255 conditions per place. [2024-11-28 05:22:16,360 INFO L140 encePairwiseOnDemand]: 95/101 looper letters, 30 selfloop transitions, 6 changer transitions 0/52 dead transitions. [2024-11-28 05:22:16,361 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 54 places, 52 transitions, 220 flow [2024-11-28 05:22:16,361 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2024-11-28 05:22:16,362 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 4 states. [2024-11-28 05:22:16,363 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 112 transitions. [2024-11-28 05:22:16,364 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.27722772277227725 [2024-11-28 05:22:16,365 INFO L175 Difference]: Start difference. First operand has 52 places, 42 transitions, 128 flow. Second operand 4 states and 112 transitions. [2024-11-28 05:22:16,365 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 54 places, 52 transitions, 220 flow [2024-11-28 05:22:16,367 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 52 places, 52 transitions, 208 flow, removed 0 selfloop flow, removed 2 redundant places. [2024-11-28 05:22:16,369 INFO L231 Difference]: Finished difference. Result has 52 places, 41 transitions, 124 flow [2024-11-28 05:22:16,369 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=101, PETRI_DIFFERENCE_MINUEND_FLOW=112, PETRI_DIFFERENCE_MINUEND_PLACES=49, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=41, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=6, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=35, PETRI_DIFFERENCE_SUBTRAHEND_STATES=4, PETRI_FLOW=124, PETRI_PLACES=52, PETRI_TRANSITIONS=41} [2024-11-28 05:22:16,373 INFO L279 CegarLoopForPetriNet]: 79 programPoint places, -27 predicate places. [2024-11-28 05:22:16,374 INFO L471 AbstractCegarLoop]: Abstraction has has 52 places, 41 transitions, 124 flow [2024-11-28 05:22:16,374 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 21.75) internal successors, (87), 4 states have internal predecessors, (87), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-28 05:22:16,374 INFO L198 CegarLoopForPetriNet]: Found error trace [2024-11-28 05:22:16,374 INFO L206 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-28 05:22:16,374 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable4 [2024-11-28 05:22:16,374 INFO L396 AbstractCegarLoop]: === Iteration 6 === Targeting ULTIMATE.startErr4REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [P1Err0ASSERT_VIOLATIONMEMORY_LEAK, P1Err1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, P1Err2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 58 more)] === [2024-11-28 05:22:16,375 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-28 05:22:16,375 INFO L85 PathProgramCache]: Analyzing trace with hash -117472617, now seen corresponding path program 1 times [2024-11-28 05:22:16,375 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-28 05:22:16,375 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [120860602] [2024-11-28 05:22:16,376 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-28 05:22:16,376 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-28 05:22:16,415 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-28 05:22:16,552 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-28 05:22:16,552 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-28 05:22:16,553 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [120860602] [2024-11-28 05:22:16,553 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [120860602] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-28 05:22:16,553 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-28 05:22:16,553 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2024-11-28 05:22:16,553 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [382179912] [2024-11-28 05:22:16,554 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-28 05:22:16,554 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2024-11-28 05:22:16,555 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-28 05:22:16,555 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2024-11-28 05:22:16,555 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2024-11-28 05:22:16,564 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 19 out of 101 [2024-11-28 05:22:16,565 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 52 places, 41 transitions, 124 flow. Second operand has 4 states, 4 states have (on average 21.75) internal successors, (87), 4 states have internal predecessors, (87), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-28 05:22:16,565 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-11-28 05:22:16,566 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 19 of 101 [2024-11-28 05:22:16,566 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-11-28 05:22:17,123 INFO L124 PetriNetUnfolderBase]: 893/1597 cut-off events. [2024-11-28 05:22:17,123 INFO L125 PetriNetUnfolderBase]: For 272/272 co-relation queries the response was YES. [2024-11-28 05:22:17,129 INFO L83 FinitePrefix]: Finished finitePrefix Result has 3634 conditions, 1597 events. 893/1597 cut-off events. For 272/272 co-relation queries the response was YES. Maximal size of possible extension queue 155. Compared 10924 event pairs, 95 based on Foata normal form. 42/1485 useless extension candidates. Maximal degree in co-relation 3623. Up to 1134 conditions per place. [2024-11-28 05:22:17,136 INFO L140 encePairwiseOnDemand]: 95/101 looper letters, 29 selfloop transitions, 6 changer transitions 0/51 dead transitions. [2024-11-28 05:22:17,136 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 54 places, 51 transitions, 214 flow [2024-11-28 05:22:17,137 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2024-11-28 05:22:17,137 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 4 states. [2024-11-28 05:22:17,138 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 111 transitions. [2024-11-28 05:22:17,138 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.2747524752475248 [2024-11-28 05:22:17,138 INFO L175 Difference]: Start difference. First operand has 52 places, 41 transitions, 124 flow. Second operand 4 states and 111 transitions. [2024-11-28 05:22:17,139 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 54 places, 51 transitions, 214 flow [2024-11-28 05:22:17,140 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 51 places, 51 transitions, 201 flow, removed 0 selfloop flow, removed 3 redundant places. [2024-11-28 05:22:17,141 INFO L231 Difference]: Finished difference. Result has 51 places, 40 transitions, 119 flow [2024-11-28 05:22:17,142 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=101, PETRI_DIFFERENCE_MINUEND_FLOW=107, PETRI_DIFFERENCE_MINUEND_PLACES=48, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=40, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=6, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=34, PETRI_DIFFERENCE_SUBTRAHEND_STATES=4, PETRI_FLOW=119, PETRI_PLACES=51, PETRI_TRANSITIONS=40} [2024-11-28 05:22:17,143 INFO L279 CegarLoopForPetriNet]: 79 programPoint places, -28 predicate places. [2024-11-28 05:22:17,143 INFO L471 AbstractCegarLoop]: Abstraction has has 51 places, 40 transitions, 119 flow [2024-11-28 05:22:17,143 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 21.75) internal successors, (87), 4 states have internal predecessors, (87), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-28 05:22:17,143 INFO L198 CegarLoopForPetriNet]: Found error trace [2024-11-28 05:22:17,143 INFO L206 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-28 05:22:17,144 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable5 [2024-11-28 05:22:17,144 INFO L396 AbstractCegarLoop]: === Iteration 7 === Targeting ULTIMATE.startErr7ASSERT_VIOLATIONMEMORY_LEAK === [P1Err0ASSERT_VIOLATIONMEMORY_LEAK, P1Err1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, P1Err2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 58 more)] === [2024-11-28 05:22:17,144 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-28 05:22:17,145 INFO L85 PathProgramCache]: Analyzing trace with hash -580456776, now seen corresponding path program 1 times [2024-11-28 05:22:17,145 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-28 05:22:17,145 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1662367398] [2024-11-28 05:22:17,145 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-28 05:22:17,145 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-28 05:22:17,170 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-28 05:22:17,220 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-28 05:22:17,220 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-28 05:22:17,220 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1662367398] [2024-11-28 05:22:17,220 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1662367398] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-28 05:22:17,220 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-28 05:22:17,221 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [1] imperfect sequences [] total 1 [2024-11-28 05:22:17,221 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1164578093] [2024-11-28 05:22:17,221 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-28 05:22:17,221 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2024-11-28 05:22:17,222 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-28 05:22:17,222 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-11-28 05:22:17,222 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-11-28 05:22:17,224 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 18 out of 101 [2024-11-28 05:22:17,225 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 51 places, 40 transitions, 119 flow. Second operand has 3 states, 3 states have (on average 22.333333333333332) internal successors, (67), 3 states have internal predecessors, (67), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-28 05:22:17,225 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-11-28 05:22:17,225 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 18 of 101 [2024-11-28 05:22:17,225 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-11-28 05:22:17,665 INFO L124 PetriNetUnfolderBase]: 893/1553 cut-off events. [2024-11-28 05:22:17,665 INFO L125 PetriNetUnfolderBase]: For 258/258 co-relation queries the response was YES. [2024-11-28 05:22:17,671 INFO L83 FinitePrefix]: Finished finitePrefix Result has 3589 conditions, 1553 events. 893/1553 cut-off events. For 258/258 co-relation queries the response was YES. Maximal size of possible extension queue 152. Compared 10756 event pairs, 749 based on Foata normal form. 50/1425 useless extension candidates. Maximal degree in co-relation 3579. Up to 1314 conditions per place. [2024-11-28 05:22:17,678 INFO L140 encePairwiseOnDemand]: 99/101 looper letters, 22 selfloop transitions, 1 changer transitions 1/39 dead transitions. [2024-11-28 05:22:17,678 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 52 places, 39 transitions, 165 flow [2024-11-28 05:22:17,679 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-11-28 05:22:17,679 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2024-11-28 05:22:17,680 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 78 transitions. [2024-11-28 05:22:17,680 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.25742574257425743 [2024-11-28 05:22:17,680 INFO L175 Difference]: Start difference. First operand has 51 places, 40 transitions, 119 flow. Second operand 3 states and 78 transitions. [2024-11-28 05:22:17,680 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 52 places, 39 transitions, 165 flow [2024-11-28 05:22:17,682 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 50 places, 39 transitions, 158 flow, removed 0 selfloop flow, removed 2 redundant places. [2024-11-28 05:22:17,683 INFO L231 Difference]: Finished difference. Result has 50 places, 38 transitions, 110 flow [2024-11-28 05:22:17,683 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=101, PETRI_DIFFERENCE_MINUEND_FLOW=110, PETRI_DIFFERENCE_MINUEND_PLACES=48, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=39, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=1, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=38, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=110, PETRI_PLACES=50, PETRI_TRANSITIONS=38} [2024-11-28 05:22:17,684 INFO L279 CegarLoopForPetriNet]: 79 programPoint places, -29 predicate places. [2024-11-28 05:22:17,684 INFO L471 AbstractCegarLoop]: Abstraction has has 50 places, 38 transitions, 110 flow [2024-11-28 05:22:17,685 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 22.333333333333332) internal successors, (67), 3 states have internal predecessors, (67), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-28 05:22:17,685 INFO L198 CegarLoopForPetriNet]: Found error trace [2024-11-28 05:22:17,685 INFO L206 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-28 05:22:17,685 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable6 [2024-11-28 05:22:17,685 INFO L396 AbstractCegarLoop]: === Iteration 8 === Targeting ULTIMATE.startErr6ASSERT_VIOLATIONMEMORY_LEAK === [P1Err0ASSERT_VIOLATIONMEMORY_LEAK, P1Err1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, P1Err2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 58 more)] === [2024-11-28 05:22:17,686 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-28 05:22:17,686 INFO L85 PathProgramCache]: Analyzing trace with hash -580455517, now seen corresponding path program 1 times [2024-11-28 05:22:17,686 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-28 05:22:17,687 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1786543501] [2024-11-28 05:22:17,687 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-28 05:22:17,687 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-28 05:22:17,718 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-28 05:22:18,023 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-28 05:22:18,024 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-28 05:22:18,024 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1786543501] [2024-11-28 05:22:18,024 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1786543501] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-28 05:22:18,024 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-28 05:22:18,024 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2024-11-28 05:22:18,024 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1057715193] [2024-11-28 05:22:18,024 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-28 05:22:18,025 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2024-11-28 05:22:18,025 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-28 05:22:18,025 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2024-11-28 05:22:18,025 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2024-11-28 05:22:18,037 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 17 out of 101 [2024-11-28 05:22:18,037 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 50 places, 38 transitions, 110 flow. Second operand has 5 states, 5 states have (on average 19.4) internal successors, (97), 5 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) [2024-11-28 05:22:18,038 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-11-28 05:22:18,038 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 17 of 101 [2024-11-28 05:22:18,038 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-11-28 05:22:19,295 INFO L124 PetriNetUnfolderBase]: 1669/2937 cut-off events. [2024-11-28 05:22:19,296 INFO L125 PetriNetUnfolderBase]: For 229/229 co-relation queries the response was YES. [2024-11-28 05:22:19,307 INFO L83 FinitePrefix]: Finished finitePrefix Result has 6655 conditions, 2937 events. 1669/2937 cut-off events. For 229/229 co-relation queries the response was YES. Maximal size of possible extension queue 204. Compared 19918 event pairs, 501 based on Foata normal form. 0/2585 useless extension candidates. Maximal degree in co-relation 6645. Up to 1258 conditions per place. [2024-11-28 05:22:19,316 INFO L140 encePairwiseOnDemand]: 95/101 looper letters, 39 selfloop transitions, 2 changer transitions 61/115 dead transitions. [2024-11-28 05:22:19,317 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 56 places, 115 transitions, 604 flow [2024-11-28 05:22:19,317 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2024-11-28 05:22:19,318 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 8 states. [2024-11-28 05:22:19,319 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 8 states to 8 states and 233 transitions. [2024-11-28 05:22:19,320 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.28836633663366334 [2024-11-28 05:22:19,320 INFO L175 Difference]: Start difference. First operand has 50 places, 38 transitions, 110 flow. Second operand 8 states and 233 transitions. [2024-11-28 05:22:19,320 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 56 places, 115 transitions, 604 flow [2024-11-28 05:22:19,321 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 55 places, 115 transitions, 603 flow, removed 0 selfloop flow, removed 1 redundant places. [2024-11-28 05:22:19,323 INFO L231 Difference]: Finished difference. Result has 60 places, 37 transitions, 123 flow [2024-11-28 05:22:19,323 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=101, PETRI_DIFFERENCE_MINUEND_FLOW=109, PETRI_DIFFERENCE_MINUEND_PLACES=48, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=38, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=2, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=36, PETRI_DIFFERENCE_SUBTRAHEND_STATES=8, PETRI_FLOW=123, PETRI_PLACES=60, PETRI_TRANSITIONS=37} [2024-11-28 05:22:19,324 INFO L279 CegarLoopForPetriNet]: 79 programPoint places, -19 predicate places. [2024-11-28 05:22:19,324 INFO L471 AbstractCegarLoop]: Abstraction has has 60 places, 37 transitions, 123 flow [2024-11-28 05:22:19,325 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 19.4) internal successors, (97), 5 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) [2024-11-28 05:22:19,325 INFO L198 CegarLoopForPetriNet]: Found error trace [2024-11-28 05:22:19,325 INFO L206 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-28 05:22:19,325 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable7 [2024-11-28 05:22:19,326 INFO L396 AbstractCegarLoop]: === Iteration 9 === Targeting ULTIMATE.startErr6ASSERT_VIOLATIONMEMORY_LEAK === [P1Err0ASSERT_VIOLATIONMEMORY_LEAK, P1Err1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, P1Err2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 58 more)] === [2024-11-28 05:22:19,326 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-28 05:22:19,326 INFO L85 PathProgramCache]: Analyzing trace with hash -2134269652, now seen corresponding path program 1 times [2024-11-28 05:22:19,326 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-28 05:22:19,327 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1627533868] [2024-11-28 05:22:19,327 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-28 05:22:19,327 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-28 05:22:19,354 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-28 05:22:19,645 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-28 05:22:19,645 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-28 05:22:19,645 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1627533868] [2024-11-28 05:22:19,645 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1627533868] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-28 05:22:19,646 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-28 05:22:19,646 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2024-11-28 05:22:19,646 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1797809295] [2024-11-28 05:22:19,646 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-28 05:22:19,646 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2024-11-28 05:22:19,647 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-28 05:22:19,647 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2024-11-28 05:22:19,647 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2024-11-28 05:22:19,661 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 16 out of 101 [2024-11-28 05:22:19,661 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 60 places, 37 transitions, 123 flow. Second operand has 6 states, 6 states have (on average 18.166666666666668) internal successors, (109), 6 states have internal predecessors, (109), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-28 05:22:19,661 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-11-28 05:22:19,661 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 16 of 101 [2024-11-28 05:22:19,662 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-11-28 05:22:20,898 INFO L124 PetriNetUnfolderBase]: 1686/3007 cut-off events. [2024-11-28 05:22:20,899 INFO L125 PetriNetUnfolderBase]: For 602/602 co-relation queries the response was YES. [2024-11-28 05:22:20,911 INFO L83 FinitePrefix]: Finished finitePrefix Result has 7006 conditions, 3007 events. 1686/3007 cut-off events. For 602/602 co-relation queries the response was YES. Maximal size of possible extension queue 225. Compared 21148 event pairs, 301 based on Foata normal form. 64/2869 useless extension candidates. Maximal degree in co-relation 6990. Up to 890 conditions per place. [2024-11-28 05:22:20,919 INFO L140 encePairwiseOnDemand]: 95/101 looper letters, 36 selfloop transitions, 3 changer transitions 39/90 dead transitions. [2024-11-28 05:22:20,919 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 61 places, 90 transitions, 452 flow [2024-11-28 05:22:20,920 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2024-11-28 05:22:20,920 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 8 states. [2024-11-28 05:22:20,921 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 8 states to 8 states and 205 transitions. [2024-11-28 05:22:20,922 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.2537128712871287 [2024-11-28 05:22:20,922 INFO L175 Difference]: Start difference. First operand has 60 places, 37 transitions, 123 flow. Second operand 8 states and 205 transitions. [2024-11-28 05:22:20,922 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 61 places, 90 transitions, 452 flow [2024-11-28 05:22:20,942 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 55 places, 90 transitions, 430 flow, removed 8 selfloop flow, removed 6 redundant places. [2024-11-28 05:22:20,943 INFO L231 Difference]: Finished difference. Result has 61 places, 37 transitions, 133 flow [2024-11-28 05:22:20,946 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=101, PETRI_DIFFERENCE_MINUEND_FLOW=111, PETRI_DIFFERENCE_MINUEND_PLACES=48, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=37, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=3, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=34, PETRI_DIFFERENCE_SUBTRAHEND_STATES=8, PETRI_FLOW=133, PETRI_PLACES=61, PETRI_TRANSITIONS=37} [2024-11-28 05:22:20,947 INFO L279 CegarLoopForPetriNet]: 79 programPoint places, -18 predicate places. [2024-11-28 05:22:20,948 INFO L471 AbstractCegarLoop]: Abstraction has has 61 places, 37 transitions, 133 flow [2024-11-28 05:22:20,948 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 18.166666666666668) internal successors, (109), 6 states have internal predecessors, (109), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-28 05:22:20,948 INFO L198 CegarLoopForPetriNet]: Found error trace [2024-11-28 05:22:20,948 INFO L206 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-28 05:22:20,948 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable8 [2024-11-28 05:22:20,948 INFO L396 AbstractCegarLoop]: === Iteration 10 === Targeting ULTIMATE.startErr6ASSERT_VIOLATIONMEMORY_LEAK === [P1Err0ASSERT_VIOLATIONMEMORY_LEAK, P1Err1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, P1Err2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 58 more)] === [2024-11-28 05:22:20,950 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-28 05:22:20,950 INFO L85 PathProgramCache]: Analyzing trace with hash -17266492, now seen corresponding path program 1 times [2024-11-28 05:22:20,950 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-28 05:22:20,950 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [46716424] [2024-11-28 05:22:20,950 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-28 05:22:20,950 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-28 05:22:21,007 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-28 05:22:22,321 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-28 05:22:22,322 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-28 05:22:22,322 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [46716424] [2024-11-28 05:22:22,322 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [46716424] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-28 05:22:22,322 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-28 05:22:22,322 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2024-11-28 05:22:22,322 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [91688693] [2024-11-28 05:22:22,323 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-28 05:22:22,323 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2024-11-28 05:22:22,323 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-28 05:22:22,324 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2024-11-28 05:22:22,324 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=13, Invalid=29, Unknown=0, NotChecked=0, Total=42 [2024-11-28 05:22:22,326 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 18 out of 101 [2024-11-28 05:22:22,326 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 61 places, 37 transitions, 133 flow. Second operand has 7 states, 7 states have (on average 19.857142857142858) internal successors, (139), 7 states have internal predecessors, (139), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-28 05:22:22,327 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-11-28 05:22:22,327 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 18 of 101 [2024-11-28 05:22:22,327 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-11-28 05:22:23,166 INFO L124 PetriNetUnfolderBase]: 653/1325 cut-off events. [2024-11-28 05:22:23,166 INFO L125 PetriNetUnfolderBase]: For 512/513 co-relation queries the response was YES. [2024-11-28 05:22:23,173 INFO L83 FinitePrefix]: Finished finitePrefix Result has 3067 conditions, 1325 events. 653/1325 cut-off events. For 512/513 co-relation queries the response was YES. Maximal size of possible extension queue 117. Compared 8694 event pairs, 362 based on Foata normal form. 24/1234 useless extension candidates. Maximal degree in co-relation 3049. Up to 866 conditions per place. [2024-11-28 05:22:23,178 INFO L140 encePairwiseOnDemand]: 92/101 looper letters, 33 selfloop transitions, 8 changer transitions 29/84 dead transitions. [2024-11-28 05:22:23,178 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 67 places, 84 transitions, 405 flow [2024-11-28 05:22:23,179 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 11 states. [2024-11-28 05:22:23,179 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 11 states. [2024-11-28 05:22:23,181 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 11 states to 11 states and 271 transitions. [2024-11-28 05:22:23,181 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.24392439243924394 [2024-11-28 05:22:23,181 INFO L175 Difference]: Start difference. First operand has 61 places, 37 transitions, 133 flow. Second operand 11 states and 271 transitions. [2024-11-28 05:22:23,181 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 67 places, 84 transitions, 405 flow [2024-11-28 05:22:23,188 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 59 places, 84 transitions, 365 flow, removed 16 selfloop flow, removed 8 redundant places. [2024-11-28 05:22:23,192 INFO L231 Difference]: Finished difference. Result has 67 places, 43 transitions, 180 flow [2024-11-28 05:22:23,192 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=101, PETRI_DIFFERENCE_MINUEND_FLOW=113, PETRI_DIFFERENCE_MINUEND_PLACES=49, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=37, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=4, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=31, PETRI_DIFFERENCE_SUBTRAHEND_STATES=11, PETRI_FLOW=180, PETRI_PLACES=67, PETRI_TRANSITIONS=43} [2024-11-28 05:22:23,194 INFO L279 CegarLoopForPetriNet]: 79 programPoint places, -12 predicate places. [2024-11-28 05:22:23,196 INFO L471 AbstractCegarLoop]: Abstraction has has 67 places, 43 transitions, 180 flow [2024-11-28 05:22:23,196 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 7 states, 7 states have (on average 19.857142857142858) internal successors, (139), 7 states have internal predecessors, (139), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-28 05:22:23,196 INFO L198 CegarLoopForPetriNet]: Found error trace [2024-11-28 05:22:23,196 INFO L206 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-28 05:22:23,197 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable9 [2024-11-28 05:22:23,197 INFO L396 AbstractCegarLoop]: === Iteration 11 === Targeting ULTIMATE.startErr6ASSERT_VIOLATIONMEMORY_LEAK === [P1Err0ASSERT_VIOLATIONMEMORY_LEAK, P1Err1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, P1Err2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 58 more)] === [2024-11-28 05:22:23,197 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-28 05:22:23,197 INFO L85 PathProgramCache]: Analyzing trace with hash 1507240392, now seen corresponding path program 1 times [2024-11-28 05:22:23,198 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-28 05:22:23,198 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [131761682] [2024-11-28 05:22:23,198 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-28 05:22:23,201 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-28 05:22:23,294 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-28 05:22:25,301 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-28 05:22:25,301 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-28 05:22:25,301 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [131761682] [2024-11-28 05:22:25,301 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [131761682] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-28 05:22:25,301 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-28 05:22:25,302 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2024-11-28 05:22:25,302 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1675650612] [2024-11-28 05:22:25,302 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-28 05:22:25,302 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 8 states [2024-11-28 05:22:25,302 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-28 05:22:25,303 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2024-11-28 05:22:25,303 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=15, Invalid=41, Unknown=0, NotChecked=0, Total=56 [2024-11-28 05:22:25,306 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 18 out of 101 [2024-11-28 05:22:25,306 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 67 places, 43 transitions, 180 flow. Second operand has 8 states, 8 states have (on average 19.75) internal successors, (158), 8 states have internal predecessors, (158), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-28 05:22:25,307 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-11-28 05:22:25,307 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 18 of 101 [2024-11-28 05:22:25,308 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-11-28 05:22:26,257 INFO L124 PetriNetUnfolderBase]: 633/1281 cut-off events. [2024-11-28 05:22:26,257 INFO L125 PetriNetUnfolderBase]: For 1426/1427 co-relation queries the response was YES. [2024-11-28 05:22:26,263 INFO L83 FinitePrefix]: Finished finitePrefix Result has 3527 conditions, 1281 events. 633/1281 cut-off events. For 1426/1427 co-relation queries the response was YES. Maximal size of possible extension queue 108. Compared 8238 event pairs, 350 based on Foata normal form. 16/1176 useless extension candidates. Maximal degree in co-relation 3507. Up to 798 conditions per place. [2024-11-28 05:22:26,269 INFO L140 encePairwiseOnDemand]: 92/101 looper letters, 35 selfloop transitions, 10 changer transitions 23/82 dead transitions. [2024-11-28 05:22:26,269 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 71 places, 82 transitions, 458 flow [2024-11-28 05:22:26,269 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 11 states. [2024-11-28 05:22:26,270 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 11 states. [2024-11-28 05:22:26,271 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 11 states to 11 states and 266 transitions. [2024-11-28 05:22:26,271 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.23942394239423942 [2024-11-28 05:22:26,271 INFO L175 Difference]: Start difference. First operand has 67 places, 43 transitions, 180 flow. Second operand 11 states and 266 transitions. [2024-11-28 05:22:26,271 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 71 places, 82 transitions, 458 flow [2024-11-28 05:22:26,284 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 67 places, 82 transitions, 436 flow, removed 11 selfloop flow, removed 4 redundant places. [2024-11-28 05:22:26,286 INFO L231 Difference]: Finished difference. Result has 75 places, 45 transitions, 236 flow [2024-11-28 05:22:26,286 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=101, PETRI_DIFFERENCE_MINUEND_FLOW=170, PETRI_DIFFERENCE_MINUEND_PLACES=57, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=43, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=8, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=33, PETRI_DIFFERENCE_SUBTRAHEND_STATES=11, PETRI_FLOW=236, PETRI_PLACES=75, PETRI_TRANSITIONS=45} [2024-11-28 05:22:26,287 INFO L279 CegarLoopForPetriNet]: 79 programPoint places, -4 predicate places. [2024-11-28 05:22:26,287 INFO L471 AbstractCegarLoop]: Abstraction has has 75 places, 45 transitions, 236 flow [2024-11-28 05:22:26,287 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 8 states, 8 states have (on average 19.75) internal successors, (158), 8 states have internal predecessors, (158), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-28 05:22:26,288 INFO L198 CegarLoopForPetriNet]: Found error trace [2024-11-28 05:22:26,288 INFO L206 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] [2024-11-28 05:22:26,288 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable10 [2024-11-28 05:22:26,288 INFO L396 AbstractCegarLoop]: === Iteration 12 === Targeting ULTIMATE.startErr6ASSERT_VIOLATIONMEMORY_LEAK === [P1Err0ASSERT_VIOLATIONMEMORY_LEAK, P1Err1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, P1Err2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 58 more)] === [2024-11-28 05:22:26,289 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-28 05:22:26,290 INFO L85 PathProgramCache]: Analyzing trace with hash -443927459, now seen corresponding path program 1 times [2024-11-28 05:22:26,290 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-28 05:22:26,290 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1862846237] [2024-11-28 05:22:26,290 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-28 05:22:26,291 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-28 05:22:26,326 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-28 05:22:26,427 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-28 05:22:26,428 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-28 05:22:26,428 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1862846237] [2024-11-28 05:22:26,428 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1862846237] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-28 05:22:26,428 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-28 05:22:26,428 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2024-11-28 05:22:26,428 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1234629406] [2024-11-28 05:22:26,428 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-28 05:22:26,429 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2024-11-28 05:22:26,429 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-28 05:22:26,429 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-11-28 05:22:26,430 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-11-28 05:22:26,430 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 19 out of 101 [2024-11-28 05:22:26,430 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 75 places, 45 transitions, 236 flow. Second operand has 3 states, 3 states have (on average 23.666666666666668) internal successors, (71), 3 states have internal predecessors, (71), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-28 05:22:26,430 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-11-28 05:22:26,430 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 19 of 101 [2024-11-28 05:22:26,431 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-11-28 05:22:26,836 INFO L124 PetriNetUnfolderBase]: 546/1029 cut-off events. [2024-11-28 05:22:26,837 INFO L125 PetriNetUnfolderBase]: For 2318/2318 co-relation queries the response was YES. [2024-11-28 05:22:26,843 INFO L83 FinitePrefix]: Finished finitePrefix Result has 3461 conditions, 1029 events. 546/1029 cut-off events. For 2318/2318 co-relation queries the response was YES. Maximal size of possible extension queue 102. Compared 6279 event pairs, 378 based on Foata normal form. 0/923 useless extension candidates. Maximal degree in co-relation 3435. Up to 791 conditions per place. [2024-11-28 05:22:26,848 INFO L140 encePairwiseOnDemand]: 93/101 looper letters, 29 selfloop transitions, 13 changer transitions 0/56 dead transitions. [2024-11-28 05:22:26,848 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 71 places, 56 transitions, 372 flow [2024-11-28 05:22:26,848 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-11-28 05:22:26,848 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2024-11-28 05:22:26,849 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 92 transitions. [2024-11-28 05:22:26,850 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.30363036303630364 [2024-11-28 05:22:26,851 INFO L175 Difference]: Start difference. First operand has 75 places, 45 transitions, 236 flow. Second operand 3 states and 92 transitions. [2024-11-28 05:22:26,851 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 71 places, 56 transitions, 372 flow [2024-11-28 05:22:26,864 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 61 places, 56 transitions, 318 flow, removed 18 selfloop flow, removed 10 redundant places. [2024-11-28 05:22:26,868 INFO L231 Difference]: Finished difference. Result has 62 places, 50 transitions, 271 flow [2024-11-28 05:22:26,868 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=101, PETRI_DIFFERENCE_MINUEND_FLOW=190, PETRI_DIFFERENCE_MINUEND_PLACES=59, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=45, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=8, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=32, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=271, PETRI_PLACES=62, PETRI_TRANSITIONS=50} [2024-11-28 05:22:26,870 INFO L279 CegarLoopForPetriNet]: 79 programPoint places, -17 predicate places. [2024-11-28 05:22:26,870 INFO L471 AbstractCegarLoop]: Abstraction has has 62 places, 50 transitions, 271 flow [2024-11-28 05:22:26,870 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 23.666666666666668) internal successors, (71), 3 states have internal predecessors, (71), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-28 05:22:26,870 INFO L198 CegarLoopForPetriNet]: Found error trace [2024-11-28 05:22:26,870 INFO L206 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] [2024-11-28 05:22:26,870 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable11 [2024-11-28 05:22:26,871 INFO L396 AbstractCegarLoop]: === Iteration 13 === Targeting ULTIMATE.startErr6ASSERT_VIOLATIONMEMORY_LEAK === [P1Err0ASSERT_VIOLATIONMEMORY_LEAK, P1Err1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, P1Err2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 58 more)] === [2024-11-28 05:22:26,873 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-28 05:22:26,873 INFO L85 PathProgramCache]: Analyzing trace with hash -1602168992, now seen corresponding path program 1 times [2024-11-28 05:22:26,873 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-28 05:22:26,874 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [930470980] [2024-11-28 05:22:26,874 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-28 05:22:26,874 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-28 05:22:26,955 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-28 05:22:27,204 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-28 05:22:27,204 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-28 05:22:27,204 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [930470980] [2024-11-28 05:22:27,204 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [930470980] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-28 05:22:27,204 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-28 05:22:27,204 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2024-11-28 05:22:27,204 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1094159661] [2024-11-28 05:22:27,205 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-28 05:22:27,205 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2024-11-28 05:22:27,205 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-28 05:22:27,205 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2024-11-28 05:22:27,205 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2024-11-28 05:22:27,224 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 15 out of 101 [2024-11-28 05:22:27,224 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 62 places, 50 transitions, 271 flow. Second operand has 4 states, 4 states have (on average 18.75) internal successors, (75), 4 states have internal predecessors, (75), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-28 05:22:27,225 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-11-28 05:22:27,225 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 15 of 101 [2024-11-28 05:22:27,225 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-11-28 05:22:27,956 INFO L124 PetriNetUnfolderBase]: 1698/2777 cut-off events. [2024-11-28 05:22:27,956 INFO L125 PetriNetUnfolderBase]: For 2608/2608 co-relation queries the response was YES. [2024-11-28 05:22:27,973 INFO L83 FinitePrefix]: Finished finitePrefix Result has 7595 conditions, 2777 events. 1698/2777 cut-off events. For 2608/2608 co-relation queries the response was YES. Maximal size of possible extension queue 193. Compared 15862 event pairs, 166 based on Foata normal form. 113/2766 useless extension candidates. Maximal degree in co-relation 7577. Up to 1666 conditions per place. [2024-11-28 05:22:27,984 INFO L140 encePairwiseOnDemand]: 95/101 looper letters, 70 selfloop transitions, 5 changer transitions 1/86 dead transitions. [2024-11-28 05:22:27,984 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 65 places, 86 transitions, 650 flow [2024-11-28 05:22:27,984 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2024-11-28 05:22:27,985 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 4 states. [2024-11-28 05:22:27,985 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 115 transitions. [2024-11-28 05:22:27,986 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.28465346534653463 [2024-11-28 05:22:27,986 INFO L175 Difference]: Start difference. First operand has 62 places, 50 transitions, 271 flow. Second operand 4 states and 115 transitions. [2024-11-28 05:22:27,986 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 65 places, 86 transitions, 650 flow [2024-11-28 05:22:27,997 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 64 places, 86 transitions, 618 flow, removed 5 selfloop flow, removed 1 redundant places. [2024-11-28 05:22:27,999 INFO L231 Difference]: Finished difference. Result has 66 places, 52 transitions, 276 flow [2024-11-28 05:22:27,999 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=101, PETRI_DIFFERENCE_MINUEND_FLOW=242, PETRI_DIFFERENCE_MINUEND_PLACES=61, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=49, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=2, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=44, PETRI_DIFFERENCE_SUBTRAHEND_STATES=4, PETRI_FLOW=276, PETRI_PLACES=66, PETRI_TRANSITIONS=52} [2024-11-28 05:22:28,002 INFO L279 CegarLoopForPetriNet]: 79 programPoint places, -13 predicate places. [2024-11-28 05:22:28,002 INFO L471 AbstractCegarLoop]: Abstraction has has 66 places, 52 transitions, 276 flow [2024-11-28 05:22:28,002 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 18.75) internal successors, (75), 4 states have internal predecessors, (75), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-28 05:22:28,002 INFO L198 CegarLoopForPetriNet]: Found error trace [2024-11-28 05:22:28,003 INFO L206 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] [2024-11-28 05:22:28,003 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable12 [2024-11-28 05:22:28,003 INFO L396 AbstractCegarLoop]: === Iteration 14 === Targeting ULTIMATE.startErr6ASSERT_VIOLATIONMEMORY_LEAK === [P1Err0ASSERT_VIOLATIONMEMORY_LEAK, P1Err1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, P1Err2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 58 more)] === [2024-11-28 05:22:28,004 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-28 05:22:28,004 INFO L85 PathProgramCache]: Analyzing trace with hash -1827440594, now seen corresponding path program 1 times [2024-11-28 05:22:28,004 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-28 05:22:28,004 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [178128461] [2024-11-28 05:22:28,005 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-28 05:22:28,005 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-28 05:22:28,094 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-28 05:22:28,357 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-28 05:22:28,357 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-28 05:22:28,358 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [178128461] [2024-11-28 05:22:28,358 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [178128461] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-28 05:22:28,358 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-28 05:22:28,359 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2024-11-28 05:22:28,359 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [213855323] [2024-11-28 05:22:28,359 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-28 05:22:28,359 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2024-11-28 05:22:28,359 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-28 05:22:28,360 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2024-11-28 05:22:28,360 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=8, Invalid=12, Unknown=0, NotChecked=0, Total=20 [2024-11-28 05:22:28,368 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 15 out of 101 [2024-11-28 05:22:28,368 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 66 places, 52 transitions, 276 flow. Second operand has 5 states, 5 states have (on average 18.4) internal successors, (92), 5 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) [2024-11-28 05:22:28,368 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-11-28 05:22:28,369 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 15 of 101 [2024-11-28 05:22:28,369 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-11-28 05:22:28,997 INFO L124 PetriNetUnfolderBase]: 1190/1998 cut-off events. [2024-11-28 05:22:28,997 INFO L125 PetriNetUnfolderBase]: For 2108/2332 co-relation queries the response was YES. [2024-11-28 05:22:29,002 INFO L83 FinitePrefix]: Finished finitePrefix Result has 5966 conditions, 1998 events. 1190/1998 cut-off events. For 2108/2332 co-relation queries the response was YES. Maximal size of possible extension queue 122. Compared 10391 event pairs, 60 based on Foata normal form. 116/2039 useless extension candidates. Maximal degree in co-relation 5945. Up to 961 conditions per place. [2024-11-28 05:22:29,008 INFO L140 encePairwiseOnDemand]: 95/101 looper letters, 69 selfloop transitions, 8 changer transitions 1/88 dead transitions. [2024-11-28 05:22:29,009 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 70 places, 88 transitions, 638 flow [2024-11-28 05:22:29,009 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2024-11-28 05:22:29,010 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 5 states. [2024-11-28 05:22:29,010 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 136 transitions. [2024-11-28 05:22:29,011 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.2693069306930693 [2024-11-28 05:22:29,011 INFO L175 Difference]: Start difference. First operand has 66 places, 52 transitions, 276 flow. Second operand 5 states and 136 transitions. [2024-11-28 05:22:29,011 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 70 places, 88 transitions, 638 flow [2024-11-28 05:22:29,018 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 68 places, 88 transitions, 628 flow, removed 1 selfloop flow, removed 2 redundant places. [2024-11-28 05:22:29,019 INFO L231 Difference]: Finished difference. Result has 70 places, 54 transitions, 307 flow [2024-11-28 05:22:29,020 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=101, PETRI_DIFFERENCE_MINUEND_FLOW=259, PETRI_DIFFERENCE_MINUEND_PLACES=64, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=51, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=5, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=43, PETRI_DIFFERENCE_SUBTRAHEND_STATES=5, PETRI_FLOW=307, PETRI_PLACES=70, PETRI_TRANSITIONS=54} [2024-11-28 05:22:29,020 INFO L279 CegarLoopForPetriNet]: 79 programPoint places, -9 predicate places. [2024-11-28 05:22:29,020 INFO L471 AbstractCegarLoop]: Abstraction has has 70 places, 54 transitions, 307 flow [2024-11-28 05:22:29,021 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 18.4) internal successors, (92), 5 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) [2024-11-28 05:22:29,021 INFO L198 CegarLoopForPetriNet]: Found error trace [2024-11-28 05:22:29,021 INFO L206 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] [2024-11-28 05:22:29,021 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable13 [2024-11-28 05:22:29,022 INFO L396 AbstractCegarLoop]: === Iteration 15 === Targeting ULTIMATE.startErr6ASSERT_VIOLATIONMEMORY_LEAK === [P1Err0ASSERT_VIOLATIONMEMORY_LEAK, P1Err1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, P1Err2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 58 more)] === [2024-11-28 05:22:29,022 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-28 05:22:29,022 INFO L85 PathProgramCache]: Analyzing trace with hash 1260574147, now seen corresponding path program 1 times [2024-11-28 05:22:29,022 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-28 05:22:29,023 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [611948321] [2024-11-28 05:22:29,023 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-28 05:22:29,023 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-28 05:22:29,189 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-28 05:22:29,507 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-28 05:22:29,507 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-28 05:22:29,508 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [611948321] [2024-11-28 05:22:29,508 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [611948321] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-28 05:22:29,508 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-28 05:22:29,508 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2024-11-28 05:22:29,508 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1563989593] [2024-11-28 05:22:29,508 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-28 05:22:29,509 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2024-11-28 05:22:29,509 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-28 05:22:29,509 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2024-11-28 05:22:29,509 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=12, Invalid=18, Unknown=0, NotChecked=0, Total=30 [2024-11-28 05:22:29,524 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 15 out of 101 [2024-11-28 05:22:29,524 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 70 places, 54 transitions, 307 flow. Second operand has 6 states, 6 states have (on average 18.166666666666668) internal successors, (109), 6 states have internal predecessors, (109), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-28 05:22:29,525 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-11-28 05:22:29,525 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 15 of 101 [2024-11-28 05:22:29,525 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-11-28 05:22:30,069 INFO L124 PetriNetUnfolderBase]: 650/1106 cut-off events. [2024-11-28 05:22:30,069 INFO L125 PetriNetUnfolderBase]: For 1924/2366 co-relation queries the response was YES. [2024-11-28 05:22:30,073 INFO L83 FinitePrefix]: Finished finitePrefix Result has 3570 conditions, 1106 events. 650/1106 cut-off events. For 1924/2366 co-relation queries the response was YES. Maximal size of possible extension queue 76. Compared 4837 event pairs, 38 based on Foata normal form. 92/1137 useless extension candidates. Maximal degree in co-relation 3547. Up to 368 conditions per place. [2024-11-28 05:22:30,076 INFO L140 encePairwiseOnDemand]: 95/101 looper letters, 62 selfloop transitions, 11 changer transitions 1/84 dead transitions. [2024-11-28 05:22:30,077 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 75 places, 84 transitions, 614 flow [2024-11-28 05:22:30,077 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2024-11-28 05:22:30,077 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 6 states. [2024-11-28 05:22:30,078 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6 states to 6 states and 149 transitions. [2024-11-28 05:22:30,078 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.24587458745874588 [2024-11-28 05:22:30,079 INFO L175 Difference]: Start difference. First operand has 70 places, 54 transitions, 307 flow. Second operand 6 states and 149 transitions. [2024-11-28 05:22:30,079 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 75 places, 84 transitions, 614 flow [2024-11-28 05:22:30,083 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 67 places, 84 transitions, 555 flow, removed 17 selfloop flow, removed 8 redundant places. [2024-11-28 05:22:30,085 INFO L231 Difference]: Finished difference. Result has 69 places, 53 transitions, 290 flow [2024-11-28 05:22:30,085 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=101, PETRI_DIFFERENCE_MINUEND_FLOW=254, PETRI_DIFFERENCE_MINUEND_PLACES=62, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=53, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=11, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=42, PETRI_DIFFERENCE_SUBTRAHEND_STATES=6, PETRI_FLOW=290, PETRI_PLACES=69, PETRI_TRANSITIONS=53} [2024-11-28 05:22:30,085 INFO L279 CegarLoopForPetriNet]: 79 programPoint places, -10 predicate places. [2024-11-28 05:22:30,086 INFO L471 AbstractCegarLoop]: Abstraction has has 69 places, 53 transitions, 290 flow [2024-11-28 05:22:30,086 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 18.166666666666668) internal successors, (109), 6 states have internal predecessors, (109), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-28 05:22:30,086 INFO L198 CegarLoopForPetriNet]: Found error trace [2024-11-28 05:22:30,086 INFO L206 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] [2024-11-28 05:22:30,086 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable14 [2024-11-28 05:22:30,087 INFO L396 AbstractCegarLoop]: === Iteration 16 === Targeting ULTIMATE.startErr6ASSERT_VIOLATIONMEMORY_LEAK === [P1Err0ASSERT_VIOLATIONMEMORY_LEAK, P1Err1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, P1Err2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 58 more)] === [2024-11-28 05:22:30,087 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-28 05:22:30,087 INFO L85 PathProgramCache]: Analyzing trace with hash -506382811, now seen corresponding path program 1 times [2024-11-28 05:22:30,087 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-28 05:22:30,088 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [814946722] [2024-11-28 05:22:30,088 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-28 05:22:30,088 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-28 05:22:30,136 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-28 05:22:30,477 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-28 05:22:30,477 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-28 05:22:30,477 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [814946722] [2024-11-28 05:22:30,477 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [814946722] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-28 05:22:30,477 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-28 05:22:30,477 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2024-11-28 05:22:30,477 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1398039731] [2024-11-28 05:22:30,477 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-28 05:22:30,478 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2024-11-28 05:22:30,478 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-28 05:22:30,478 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2024-11-28 05:22:30,478 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2024-11-28 05:22:30,487 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 16 out of 101 [2024-11-28 05:22:30,487 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 69 places, 53 transitions, 290 flow. Second operand has 6 states, 6 states have (on average 19.0) internal successors, (114), 6 states have internal predecessors, (114), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-28 05:22:30,487 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-11-28 05:22:30,487 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 16 of 101 [2024-11-28 05:22:30,487 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-11-28 05:22:31,000 INFO L124 PetriNetUnfolderBase]: 639/1232 cut-off events. [2024-11-28 05:22:31,001 INFO L125 PetriNetUnfolderBase]: For 1280/1310 co-relation queries the response was YES. [2024-11-28 05:22:31,006 INFO L83 FinitePrefix]: Finished finitePrefix Result has 3459 conditions, 1232 events. 639/1232 cut-off events. For 1280/1310 co-relation queries the response was YES. Maximal size of possible extension queue 106. Compared 6781 event pairs, 122 based on Foata normal form. 16/1165 useless extension candidates. Maximal degree in co-relation 3439. Up to 442 conditions per place. [2024-11-28 05:22:31,009 INFO L140 encePairwiseOnDemand]: 96/101 looper letters, 29 selfloop transitions, 1 changer transitions 35/83 dead transitions. [2024-11-28 05:22:31,009 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 74 places, 83 transitions, 542 flow [2024-11-28 05:22:31,010 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2024-11-28 05:22:31,010 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 6 states. [2024-11-28 05:22:31,010 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6 states to 6 states and 146 transitions. [2024-11-28 05:22:31,011 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.24092409240924093 [2024-11-28 05:22:31,011 INFO L175 Difference]: Start difference. First operand has 69 places, 53 transitions, 290 flow. Second operand 6 states and 146 transitions. [2024-11-28 05:22:31,011 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 74 places, 83 transitions, 542 flow [2024-11-28 05:22:31,017 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 66 places, 83 transitions, 474 flow, removed 16 selfloop flow, removed 8 redundant places. [2024-11-28 05:22:31,019 INFO L231 Difference]: Finished difference. Result has 70 places, 44 transitions, 181 flow [2024-11-28 05:22:31,020 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=101, PETRI_DIFFERENCE_MINUEND_FLOW=232, PETRI_DIFFERENCE_MINUEND_PLACES=61, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=53, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=1, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=52, PETRI_DIFFERENCE_SUBTRAHEND_STATES=6, PETRI_FLOW=181, PETRI_PLACES=70, PETRI_TRANSITIONS=44} [2024-11-28 05:22:31,020 INFO L279 CegarLoopForPetriNet]: 79 programPoint places, -9 predicate places. [2024-11-28 05:22:31,021 INFO L471 AbstractCegarLoop]: Abstraction has has 70 places, 44 transitions, 181 flow [2024-11-28 05:22:31,021 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 19.0) internal successors, (114), 6 states have internal predecessors, (114), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-28 05:22:31,021 INFO L198 CegarLoopForPetriNet]: Found error trace [2024-11-28 05:22:31,021 INFO L206 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] [2024-11-28 05:22:31,021 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable15 [2024-11-28 05:22:31,022 INFO L396 AbstractCegarLoop]: === Iteration 17 === Targeting ULTIMATE.startErr6ASSERT_VIOLATIONMEMORY_LEAK === [P1Err0ASSERT_VIOLATIONMEMORY_LEAK, P1Err1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, P1Err2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 58 more)] === [2024-11-28 05:22:31,022 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-28 05:22:31,022 INFO L85 PathProgramCache]: Analyzing trace with hash 1805011975, now seen corresponding path program 2 times [2024-11-28 05:22:31,022 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-28 05:22:31,023 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [803258893] [2024-11-28 05:22:31,023 INFO L95 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2024-11-28 05:22:31,023 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-28 05:22:31,169 INFO L229 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 1 check-sat command(s) [2024-11-28 05:22:31,169 INFO L230 tOrderPrioritization]: Conjunction of SSA is sat [2024-11-28 05:22:31,169 INFO L357 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2024-11-28 05:22:31,373 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-11-28 05:22:31,432 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2024-11-28 05:22:31,432 INFO L340 BasicCegarLoop]: Counterexample is feasible [2024-11-28 05:22:31,433 INFO L782 garLoopResultBuilder]: Registering result UNSAFE for location ULTIMATE.startErr6ASSERT_VIOLATIONMEMORY_LEAK (60 of 61 remaining) [2024-11-28 05:22:31,435 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location P1Err0ASSERT_VIOLATIONMEMORY_LEAK (59 of 61 remaining) [2024-11-28 05:22:31,436 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location P1Err1REQUIRES_VIOLATIONMEMORY_DEREFERENCE (58 of 61 remaining) [2024-11-28 05:22:31,436 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location P1Err2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (57 of 61 remaining) [2024-11-28 05:22:31,436 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location P1Err3REQUIRES_VIOLATIONMEMORY_DEREFERENCE (56 of 61 remaining) [2024-11-28 05:22:31,436 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location P1Err4REQUIRES_VIOLATIONMEMORY_DEREFERENCE (55 of 61 remaining) [2024-11-28 05:22:31,436 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location P2Err0REQUIRES_VIOLATIONMEMORY_DEREFERENCE (54 of 61 remaining) [2024-11-28 05:22:31,437 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location P2Err1REQUIRES_VIOLATIONMEMORY_DEREFERENCE (53 of 61 remaining) [2024-11-28 05:22:31,437 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location P2Err2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (52 of 61 remaining) [2024-11-28 05:22:31,437 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location P2Err3REQUIRES_VIOLATIONMEMORY_DEREFERENCE (51 of 61 remaining) [2024-11-28 05:22:31,437 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location P2Err4REQUIRES_VIOLATIONMEMORY_DEREFERENCE (50 of 61 remaining) [2024-11-28 05:22:31,437 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location P2Err5REQUIRES_VIOLATIONMEMORY_DEREFERENCE (49 of 61 remaining) [2024-11-28 05:22:31,437 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location P2Err6REQUIRES_VIOLATIONMEMORY_DEREFERENCE (48 of 61 remaining) [2024-11-28 05:22:31,438 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location P2Err7REQUIRES_VIOLATIONMEMORY_DEREFERENCE (47 of 61 remaining) [2024-11-28 05:22:31,438 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location P2Err8REQUIRES_VIOLATIONMEMORY_DEREFERENCE (46 of 61 remaining) [2024-11-28 05:22:31,438 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location P2Err9REQUIRES_VIOLATIONMEMORY_DEREFERENCE (45 of 61 remaining) [2024-11-28 05:22:31,438 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location P2Err10REQUIRES_VIOLATIONMEMORY_DEREFERENCE (44 of 61 remaining) [2024-11-28 05:22:31,438 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location P2Err11REQUIRES_VIOLATIONMEMORY_DEREFERENCE (43 of 61 remaining) [2024-11-28 05:22:31,438 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location P2Err12REQUIRES_VIOLATIONMEMORY_DEREFERENCE (42 of 61 remaining) [2024-11-28 05:22:31,438 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location P2Err13REQUIRES_VIOLATIONMEMORY_DEREFERENCE (41 of 61 remaining) [2024-11-28 05:22:31,439 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location P2Err14REQUIRES_VIOLATIONMEMORY_DEREFERENCE (40 of 61 remaining) [2024-11-28 05:22:31,439 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location P2Err15REQUIRES_VIOLATIONMEMORY_DEREFERENCE (39 of 61 remaining) [2024-11-28 05:22:31,439 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location P2Err16REQUIRES_VIOLATIONMEMORY_DEREFERENCE (38 of 61 remaining) [2024-11-28 05:22:31,439 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location P2Err17REQUIRES_VIOLATIONMEMORY_DEREFERENCE (37 of 61 remaining) [2024-11-28 05:22:31,439 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location P2Err18REQUIRES_VIOLATIONMEMORY_DEREFERENCE (36 of 61 remaining) [2024-11-28 05:22:31,439 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location P2Err19REQUIRES_VIOLATIONMEMORY_DEREFERENCE (35 of 61 remaining) [2024-11-28 05:22:31,439 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE (34 of 61 remaining) [2024-11-28 05:22:31,440 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE (33 of 61 remaining) [2024-11-28 05:22:31,440 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (32 of 61 remaining) [2024-11-28 05:22:31,440 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr3REQUIRES_VIOLATIONMEMORY_DEREFERENCE (31 of 61 remaining) [2024-11-28 05:22:31,440 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr4REQUIRES_VIOLATIONMEMORY_DEREFERENCE (30 of 61 remaining) [2024-11-28 05:22:31,440 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr5REQUIRES_VIOLATIONMEMORY_DEREFERENCE (29 of 61 remaining) [2024-11-28 05:22:31,440 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr7ASSERT_VIOLATIONMEMORY_LEAK (28 of 61 remaining) [2024-11-28 05:22:31,440 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (27 of 61 remaining) [2024-11-28 05:22:31,440 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (26 of 61 remaining) [2024-11-28 05:22:31,440 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr2INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (25 of 61 remaining) [2024-11-28 05:22:31,440 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location P1Err0ASSERT_VIOLATIONMEMORY_LEAK (24 of 61 remaining) [2024-11-28 05:22:31,440 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location P1Err1REQUIRES_VIOLATIONMEMORY_DEREFERENCE (23 of 61 remaining) [2024-11-28 05:22:31,440 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location P1Err2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (22 of 61 remaining) [2024-11-28 05:22:31,440 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location P1Err3REQUIRES_VIOLATIONMEMORY_DEREFERENCE (21 of 61 remaining) [2024-11-28 05:22:31,441 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location P1Err4REQUIRES_VIOLATIONMEMORY_DEREFERENCE (20 of 61 remaining) [2024-11-28 05:22:31,441 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location P2Err0REQUIRES_VIOLATIONMEMORY_DEREFERENCE (19 of 61 remaining) [2024-11-28 05:22:31,441 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location P2Err1REQUIRES_VIOLATIONMEMORY_DEREFERENCE (18 of 61 remaining) [2024-11-28 05:22:31,441 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location P2Err2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (17 of 61 remaining) [2024-11-28 05:22:31,441 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location P2Err3REQUIRES_VIOLATIONMEMORY_DEREFERENCE (16 of 61 remaining) [2024-11-28 05:22:31,441 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location P2Err4REQUIRES_VIOLATIONMEMORY_DEREFERENCE (15 of 61 remaining) [2024-11-28 05:22:31,441 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location P2Err5REQUIRES_VIOLATIONMEMORY_DEREFERENCE (14 of 61 remaining) [2024-11-28 05:22:31,441 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location P2Err6REQUIRES_VIOLATIONMEMORY_DEREFERENCE (13 of 61 remaining) [2024-11-28 05:22:31,441 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location P2Err7REQUIRES_VIOLATIONMEMORY_DEREFERENCE (12 of 61 remaining) [2024-11-28 05:22:31,441 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location P2Err8REQUIRES_VIOLATIONMEMORY_DEREFERENCE (11 of 61 remaining) [2024-11-28 05:22:31,441 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location P2Err9REQUIRES_VIOLATIONMEMORY_DEREFERENCE (10 of 61 remaining) [2024-11-28 05:22:31,441 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location P2Err10REQUIRES_VIOLATIONMEMORY_DEREFERENCE (9 of 61 remaining) [2024-11-28 05:22:31,441 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location P2Err11REQUIRES_VIOLATIONMEMORY_DEREFERENCE (8 of 61 remaining) [2024-11-28 05:22:31,441 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location P2Err12REQUIRES_VIOLATIONMEMORY_DEREFERENCE (7 of 61 remaining) [2024-11-28 05:22:31,441 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location P2Err13REQUIRES_VIOLATIONMEMORY_DEREFERENCE (6 of 61 remaining) [2024-11-28 05:22:31,442 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location P2Err14REQUIRES_VIOLATIONMEMORY_DEREFERENCE (5 of 61 remaining) [2024-11-28 05:22:31,442 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location P2Err15REQUIRES_VIOLATIONMEMORY_DEREFERENCE (4 of 61 remaining) [2024-11-28 05:22:31,442 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location P2Err16REQUIRES_VIOLATIONMEMORY_DEREFERENCE (3 of 61 remaining) [2024-11-28 05:22:31,443 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location P2Err17REQUIRES_VIOLATIONMEMORY_DEREFERENCE (2 of 61 remaining) [2024-11-28 05:22:31,443 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location P2Err18REQUIRES_VIOLATIONMEMORY_DEREFERENCE (1 of 61 remaining) [2024-11-28 05:22:31,443 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location P2Err19REQUIRES_VIOLATIONMEMORY_DEREFERENCE (0 of 61 remaining) [2024-11-28 05:22:31,443 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable16 [2024-11-28 05:22:31,444 INFO L422 BasicCegarLoop]: Path program histogram: [2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-28 05:22:31,594 INFO L241 ceAbstractionStarter]: Analysis of concurrent program completed with 1 thread instances [2024-11-28 05:22:31,594 INFO L170 ceAbstractionStarter]: Computing trace abstraction results [2024-11-28 05:22:31,600 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 28.11 05:22:31 BasicIcfg [2024-11-28 05:22:31,601 INFO L131 PluginConnector]: ------------------------ END TraceAbstraction---------------------------- [2024-11-28 05:22:31,601 INFO L112 PluginConnector]: ------------------------Witness Printer---------------------------- [2024-11-28 05:22:31,602 INFO L270 PluginConnector]: Initializing Witness Printer... [2024-11-28 05:22:31,602 INFO L274 PluginConnector]: Witness Printer initialized [2024-11-28 05:22:31,603 INFO L184 PluginConnector]: Executing the observer RCFGCatcher from plugin Witness Printer for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 28.11 05:22:04" (3/4) ... [2024-11-28 05:22:31,605 INFO L149 WitnessPrinter]: No result that supports witness generation found [2024-11-28 05:22:31,606 INFO L131 PluginConnector]: ------------------------ END Witness Printer---------------------------- [2024-11-28 05:22:31,607 INFO L158 Benchmark]: Toolchain (without parser) took 30843.36ms. Allocated memory was 142.6MB in the beginning and 1.1GB in the end (delta: 998.2MB). Free memory was 99.4MB in the beginning and 715.3MB in the end (delta: -615.9MB). Peak memory consumption was 386.1MB. Max. memory is 16.1GB. [2024-11-28 05:22:31,609 INFO L158 Benchmark]: CDTParser took 0.93ms. Allocated memory is still 167.8MB. Free memory is still 104.5MB. There was no memory consumed. Max. memory is 16.1GB. [2024-11-28 05:22:31,609 INFO L158 Benchmark]: CACSL2BoogieTranslator took 930.31ms. Allocated memory is still 142.6MB. Free memory was 99.1MB in the beginning and 75.4MB in the end (delta: 23.7MB). Peak memory consumption was 25.2MB. Max. memory is 16.1GB. [2024-11-28 05:22:31,610 INFO L158 Benchmark]: Boogie Procedure Inliner took 85.32ms. Allocated memory is still 142.6MB. Free memory was 75.4MB in the beginning and 72.7MB in the end (delta: 2.7MB). There was no memory consumed. Max. memory is 16.1GB. [2024-11-28 05:22:31,610 INFO L158 Benchmark]: Boogie Preprocessor took 132.52ms. Allocated memory is still 142.6MB. Free memory was 72.7MB in the beginning and 68.9MB in the end (delta: 3.8MB). Peak memory consumption was 8.4MB. Max. memory is 16.1GB. [2024-11-28 05:22:31,611 INFO L158 Benchmark]: RCFGBuilder took 2318.19ms. Allocated memory was 142.6MB in the beginning and 343.9MB in the end (delta: 201.3MB). Free memory was 68.9MB in the beginning and 236.8MB in the end (delta: -168.0MB). Peak memory consumption was 49.2MB. Max. memory is 16.1GB. [2024-11-28 05:22:31,612 INFO L158 Benchmark]: TraceAbstraction took 27364.09ms. Allocated memory was 343.9MB in the beginning and 1.1GB in the end (delta: 796.9MB). Free memory was 236.8MB in the beginning and 715.6MB in the end (delta: -478.7MB). Peak memory consumption was 311.4MB. Max. memory is 16.1GB. [2024-11-28 05:22:31,613 INFO L158 Benchmark]: Witness Printer took 4.96ms. Allocated memory is still 1.1GB. Free memory was 715.6MB in the beginning and 715.3MB in the end (delta: 236.7kB). Peak memory consumption was 8.4MB. Max. memory is 16.1GB. [2024-11-28 05:22:31,615 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.93ms. Allocated memory is still 167.8MB. Free memory is still 104.5MB. There was no memory consumed. Max. memory is 16.1GB. * CACSL2BoogieTranslator took 930.31ms. Allocated memory is still 142.6MB. Free memory was 99.1MB in the beginning and 75.4MB in the end (delta: 23.7MB). Peak memory consumption was 25.2MB. Max. memory is 16.1GB. * Boogie Procedure Inliner took 85.32ms. Allocated memory is still 142.6MB. Free memory was 75.4MB in the beginning and 72.7MB in the end (delta: 2.7MB). There was no memory consumed. Max. memory is 16.1GB. * Boogie Preprocessor took 132.52ms. Allocated memory is still 142.6MB. Free memory was 72.7MB in the beginning and 68.9MB in the end (delta: 3.8MB). Peak memory consumption was 8.4MB. Max. memory is 16.1GB. * RCFGBuilder took 2318.19ms. Allocated memory was 142.6MB in the beginning and 343.9MB in the end (delta: 201.3MB). Free memory was 68.9MB in the beginning and 236.8MB in the end (delta: -168.0MB). Peak memory consumption was 49.2MB. Max. memory is 16.1GB. * TraceAbstraction took 27364.09ms. Allocated memory was 343.9MB in the beginning and 1.1GB in the end (delta: 796.9MB). Free memory was 236.8MB in the beginning and 715.6MB in the end (delta: -478.7MB). Peak memory consumption was 311.4MB. Max. memory is 16.1GB. * Witness Printer took 4.96ms. Allocated memory is still 1.1GB. Free memory was 715.6MB in the beginning and 715.3MB in the end (delta: 236.7kB). Peak memory consumption was 8.4MB. Max. memory is 16.1GB. * Results from de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: - UnprovableResult [Line: 17]: Unable to prove that all allocated memory was freed Unable to prove that all allocated memory was freed Reason: overapproximation of memtrack at line 17. Possible FailurePath: [L709] 0 int __unbuffered_cnt = 0; [L711] 0 int __unbuffered_p0_EAX = 0; [L713] 0 int __unbuffered_p0_EBX = 0; [L715] 0 int __unbuffered_p2_EAX = 0; [L716] 0 _Bool __unbuffered_p2_EAX$flush_delayed; [L717] 0 int __unbuffered_p2_EAX$mem_tmp; [L718] 0 _Bool __unbuffered_p2_EAX$r_buff0_thd0; [L719] 0 _Bool __unbuffered_p2_EAX$r_buff0_thd1; [L720] 0 _Bool __unbuffered_p2_EAX$r_buff0_thd2; [L721] 0 _Bool __unbuffered_p2_EAX$r_buff0_thd3; [L722] 0 _Bool __unbuffered_p2_EAX$r_buff1_thd0; [L723] 0 _Bool __unbuffered_p2_EAX$r_buff1_thd1; [L724] 0 _Bool __unbuffered_p2_EAX$r_buff1_thd2; [L725] 0 _Bool __unbuffered_p2_EAX$r_buff1_thd3; [L726] 0 _Bool __unbuffered_p2_EAX$read_delayed; [L727] 0 int *__unbuffered_p2_EAX$read_delayed_var; [L728] 0 int __unbuffered_p2_EAX$w_buff0; [L729] 0 _Bool __unbuffered_p2_EAX$w_buff0_used; [L730] 0 int __unbuffered_p2_EAX$w_buff1; [L731] 0 _Bool __unbuffered_p2_EAX$w_buff1_used; [L732] 0 _Bool main$tmp_guard0; [L733] 0 _Bool main$tmp_guard1; [L735] 0 int x = 0; [L737] 0 int y = 0; [L737] 0 int y = 0; [L738] 0 _Bool y$flush_delayed; [L739] 0 int y$mem_tmp; [L740] 0 _Bool y$r_buff0_thd0; [L741] 0 _Bool y$r_buff0_thd1; [L742] 0 _Bool y$r_buff0_thd2; [L743] 0 _Bool y$r_buff0_thd3; [L744] 0 _Bool y$r_buff1_thd0; [L745] 0 _Bool y$r_buff1_thd1; [L746] 0 _Bool y$r_buff1_thd2; [L747] 0 _Bool y$r_buff1_thd3; [L748] 0 _Bool y$read_delayed; [L749] 0 int *y$read_delayed_var; [L750] 0 int y$w_buff0; [L751] 0 _Bool y$w_buff0_used; [L752] 0 int y$w_buff1; [L753] 0 _Bool y$w_buff1_used; [L755] 0 int z = 0; [L756] 0 _Bool weak$$choice0; [L757] 0 _Bool weak$$choice1; [L758] 0 _Bool weak$$choice2; [L850] 0 pthread_t t2052; [L851] FCALL, FORK 0 pthread_create(&t2052, ((void *)0), P0, ((void *)0)) VAL [\old(arg)={0:0}, __unbuffered_cnt=0, __unbuffered_p0_EAX=0, __unbuffered_p0_EBX=0, __unbuffered_p2_EAX$flush_delayed=0, __unbuffered_p2_EAX$mem_tmp=0, __unbuffered_p2_EAX$r_buff0_thd0=0, __unbuffered_p2_EAX$r_buff0_thd1=0, __unbuffered_p2_EAX$r_buff0_thd2=0, __unbuffered_p2_EAX$r_buff0_thd3=0, __unbuffered_p2_EAX$r_buff1_thd0=0, __unbuffered_p2_EAX$r_buff1_thd1=0, __unbuffered_p2_EAX$r_buff1_thd2=0, __unbuffered_p2_EAX$r_buff1_thd3=0, __unbuffered_p2_EAX$read_delayed=0, __unbuffered_p2_EAX$read_delayed_var={0:0}, __unbuffered_p2_EAX$w_buff0=0, __unbuffered_p2_EAX$w_buff0_used=0, __unbuffered_p2_EAX$w_buff1=0, __unbuffered_p2_EAX$w_buff1_used=0, __unbuffered_p2_EAX=0, main$tmp_guard0=0, main$tmp_guard1=0, t2052=-2, weak$$choice0=0, weak$$choice1=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={3:0}, z=0] [L852] 0 pthread_t t2053; [L853] FCALL, FORK 0 pthread_create(&t2053, ((void *)0), P1, ((void *)0)) VAL [\old(arg)={0:0}, __unbuffered_cnt=0, __unbuffered_p0_EAX=0, __unbuffered_p0_EBX=0, __unbuffered_p2_EAX$flush_delayed=0, __unbuffered_p2_EAX$mem_tmp=0, __unbuffered_p2_EAX$r_buff0_thd0=0, __unbuffered_p2_EAX$r_buff0_thd1=0, __unbuffered_p2_EAX$r_buff0_thd2=0, __unbuffered_p2_EAX$r_buff0_thd3=0, __unbuffered_p2_EAX$r_buff1_thd0=0, __unbuffered_p2_EAX$r_buff1_thd1=0, __unbuffered_p2_EAX$r_buff1_thd2=0, __unbuffered_p2_EAX$r_buff1_thd3=0, __unbuffered_p2_EAX$read_delayed=0, __unbuffered_p2_EAX$read_delayed_var={0:0}, __unbuffered_p2_EAX$w_buff0=0, __unbuffered_p2_EAX$w_buff0_used=0, __unbuffered_p2_EAX$w_buff1=0, __unbuffered_p2_EAX$w_buff1_used=0, __unbuffered_p2_EAX=0, main$tmp_guard0=0, main$tmp_guard1=0, t2052=-2, t2053=-1, weak$$choice0=0, weak$$choice1=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={3:0}, z=0] [L854] 0 pthread_t t2054; [L855] FCALL, FORK 0 pthread_create(&t2054, ((void *)0), P2, ((void *)0)) VAL [\old(arg)={0:0}, \old(arg)={0:0}, __unbuffered_cnt=0, __unbuffered_p0_EAX=0, __unbuffered_p0_EBX=0, __unbuffered_p2_EAX$flush_delayed=0, __unbuffered_p2_EAX$mem_tmp=0, __unbuffered_p2_EAX$r_buff0_thd0=0, __unbuffered_p2_EAX$r_buff0_thd1=0, __unbuffered_p2_EAX$r_buff0_thd2=0, __unbuffered_p2_EAX$r_buff0_thd3=0, __unbuffered_p2_EAX$r_buff1_thd0=0, __unbuffered_p2_EAX$r_buff1_thd1=0, __unbuffered_p2_EAX$r_buff1_thd2=0, __unbuffered_p2_EAX$r_buff1_thd3=0, __unbuffered_p2_EAX$read_delayed=0, __unbuffered_p2_EAX$read_delayed_var={0:0}, __unbuffered_p2_EAX$w_buff0=0, __unbuffered_p2_EAX$w_buff0_used=0, __unbuffered_p2_EAX$w_buff1=0, __unbuffered_p2_EAX$w_buff1_used=0, __unbuffered_p2_EAX=0, main$tmp_guard0=0, main$tmp_guard1=0, t2052=-2, t2053=-1, t2054=0, weak$$choice0=0, weak$$choice1=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={3:0}, z=0] [L806] 3 weak$$choice0 = __VERIFIER_nondet_bool() [L807] 3 weak$$choice2 = __VERIFIER_nondet_bool() [L808] 3 y$flush_delayed = weak$$choice2 [L809] EXPR 3 \read(y) [L809] 3 y$mem_tmp = y [L810] 3 weak$$choice1 = __VERIFIER_nondet_bool() [L811] EXPR 3 !y$w_buff0_used ? y : (y$w_buff0_used && y$r_buff0_thd3 ? y$w_buff0 : (y$w_buff0_used && !y$r_buff1_thd3 && y$w_buff1_used && !y$r_buff0_thd3 ? (weak$$choice0 ? y : (weak$$choice1 ? y$w_buff0 : y$w_buff1)) : (y$w_buff0_used && y$r_buff1_thd3 && y$w_buff1_used && !y$r_buff0_thd3 ? (weak$$choice0 ? y$w_buff1 : y$w_buff0) : (weak$$choice0 ? y$w_buff0 : y)))) [L811] EXPR 3 \read(y) [L811] EXPR 3 !y$w_buff0_used ? y : (y$w_buff0_used && y$r_buff0_thd3 ? y$w_buff0 : (y$w_buff0_used && !y$r_buff1_thd3 && y$w_buff1_used && !y$r_buff0_thd3 ? (weak$$choice0 ? y : (weak$$choice1 ? y$w_buff0 : y$w_buff1)) : (y$w_buff0_used && y$r_buff1_thd3 && y$w_buff1_used && !y$r_buff0_thd3 ? (weak$$choice0 ? y$w_buff1 : y$w_buff0) : (weak$$choice0 ? y$w_buff0 : y)))) [L811] 3 y = !y$w_buff0_used ? y : (y$w_buff0_used && y$r_buff0_thd3 ? y$w_buff0 : (y$w_buff0_used && !y$r_buff1_thd3 && y$w_buff1_used && !y$r_buff0_thd3 ? (weak$$choice0 ? y : (weak$$choice1 ? y$w_buff0 : y$w_buff1)) : (y$w_buff0_used && y$r_buff1_thd3 && y$w_buff1_used && !y$r_buff0_thd3 ? (weak$$choice0 ? y$w_buff1 : y$w_buff0) : (weak$$choice0 ? y$w_buff0 : y)))) [L812] 3 y$w_buff0 = weak$$choice2 ? y$w_buff0 : (!y$w_buff0_used ? y$w_buff0 : (y$w_buff0_used && y$r_buff0_thd3 ? y$w_buff0 : (y$w_buff0_used && !y$r_buff1_thd3 && y$w_buff1_used && !y$r_buff0_thd3 ? y$w_buff0 : (y$w_buff0_used && y$r_buff1_thd3 && y$w_buff1_used && !y$r_buff0_thd3 ? y$w_buff0 : y$w_buff0)))) [L813] 3 y$w_buff1 = weak$$choice2 ? y$w_buff1 : (!y$w_buff0_used ? y$w_buff1 : (y$w_buff0_used && y$r_buff0_thd3 ? y$w_buff1 : (y$w_buff0_used && !y$r_buff1_thd3 && y$w_buff1_used && !y$r_buff0_thd3 ? y$w_buff1 : (y$w_buff0_used && y$r_buff1_thd3 && y$w_buff1_used && !y$r_buff0_thd3 ? y$w_buff1 : y$w_buff1)))) [L814] 3 y$w_buff0_used = weak$$choice2 ? y$w_buff0_used : (!y$w_buff0_used ? y$w_buff0_used : (y$w_buff0_used && y$r_buff0_thd3 ? (_Bool)0 : (y$w_buff0_used && !y$r_buff1_thd3 && y$w_buff1_used && !y$r_buff0_thd3 ? weak$$choice0 || !weak$$choice1 : (y$w_buff0_used && y$r_buff1_thd3 && y$w_buff1_used && !y$r_buff0_thd3 ? weak$$choice0 : weak$$choice0)))) [L815] 3 y$w_buff1_used = weak$$choice2 ? y$w_buff1_used : (!y$w_buff0_used ? y$w_buff1_used : (y$w_buff0_used && y$r_buff0_thd3 ? (_Bool)0 : (y$w_buff0_used && !y$r_buff1_thd3 && y$w_buff1_used && !y$r_buff0_thd3 ? weak$$choice0 : (y$w_buff0_used && y$r_buff1_thd3 && y$w_buff1_used && !y$r_buff0_thd3 ? (_Bool)0 : (_Bool)0)))) [L816] 3 y$r_buff0_thd3 = weak$$choice2 ? y$r_buff0_thd3 : (!y$w_buff0_used ? y$r_buff0_thd3 : (y$w_buff0_used && y$r_buff0_thd3 ? (_Bool)0 : (y$w_buff0_used && !y$r_buff1_thd3 && y$w_buff1_used && !y$r_buff0_thd3 ? y$r_buff0_thd3 : (y$w_buff0_used && y$r_buff1_thd3 && y$w_buff1_used && !y$r_buff0_thd3 ? (_Bool)0 : (_Bool)0)))) [L817] 3 y$r_buff1_thd3 = weak$$choice2 ? y$r_buff1_thd3 : (!y$w_buff0_used ? y$r_buff1_thd3 : (y$w_buff0_used && y$r_buff0_thd3 ? (_Bool)0 : (y$w_buff0_used && !y$r_buff1_thd3 && y$w_buff1_used && !y$r_buff0_thd3 ? (weak$$choice0 ? y$r_buff1_thd3 : (_Bool)0) : (y$w_buff0_used && y$r_buff1_thd3 && y$w_buff1_used && !y$r_buff0_thd3 ? (_Bool)0 : (_Bool)0)))) [L818] 3 __unbuffered_p2_EAX$read_delayed = (_Bool)1 [L819] 3 __unbuffered_p2_EAX$read_delayed_var = &y [L820] EXPR 3 \read(y) [L820] 3 __unbuffered_p2_EAX = y [L821] EXPR 3 y$flush_delayed ? y$mem_tmp : y [L821] EXPR 3 y$flush_delayed ? y$mem_tmp : y [L821] 3 y = y$flush_delayed ? y$mem_tmp : y [L822] 3 y$flush_delayed = (_Bool)0 VAL [\old(arg)={0:0}, \old(arg)={0:0}, __unbuffered_cnt=0, __unbuffered_p0_EAX=0, __unbuffered_p0_EBX=0, __unbuffered_p2_EAX$flush_delayed=0, __unbuffered_p2_EAX$mem_tmp=0, __unbuffered_p2_EAX$r_buff0_thd0=0, __unbuffered_p2_EAX$r_buff0_thd1=0, __unbuffered_p2_EAX$r_buff0_thd2=0, __unbuffered_p2_EAX$r_buff0_thd3=0, __unbuffered_p2_EAX$r_buff1_thd0=0, __unbuffered_p2_EAX$r_buff1_thd1=0, __unbuffered_p2_EAX$r_buff1_thd2=0, __unbuffered_p2_EAX$r_buff1_thd3=0, __unbuffered_p2_EAX$read_delayed=1, __unbuffered_p2_EAX$read_delayed_var={3:0}, __unbuffered_p2_EAX$w_buff0=0, __unbuffered_p2_EAX$w_buff0_used=0, __unbuffered_p2_EAX$w_buff1=0, __unbuffered_p2_EAX$w_buff1_used=0, __unbuffered_p2_EAX=0, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice1=1, weak$$choice2=1, 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={3:0}, z=0] [L825] 3 z = 1 VAL [\old(arg)={0:0}, \old(arg)={0:0}, __unbuffered_cnt=0, __unbuffered_p0_EAX=0, __unbuffered_p0_EBX=0, __unbuffered_p2_EAX$flush_delayed=0, __unbuffered_p2_EAX$mem_tmp=0, __unbuffered_p2_EAX$r_buff0_thd0=0, __unbuffered_p2_EAX$r_buff0_thd1=0, __unbuffered_p2_EAX$r_buff0_thd2=0, __unbuffered_p2_EAX$r_buff0_thd3=0, __unbuffered_p2_EAX$r_buff1_thd0=0, __unbuffered_p2_EAX$r_buff1_thd1=0, __unbuffered_p2_EAX$r_buff1_thd2=0, __unbuffered_p2_EAX$r_buff1_thd3=0, __unbuffered_p2_EAX$read_delayed=1, __unbuffered_p2_EAX$read_delayed_var={3:0}, __unbuffered_p2_EAX$w_buff0=0, __unbuffered_p2_EAX$w_buff0_used=0, __unbuffered_p2_EAX$w_buff1=0, __unbuffered_p2_EAX$w_buff1_used=0, __unbuffered_p2_EAX=0, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice1=1, weak$$choice2=1, 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={3:0}, z=1] [L762] 1 __unbuffered_p0_EAX = z VAL [\old(arg)={0:0}, \old(arg)={0:0}, __unbuffered_cnt=0, __unbuffered_p0_EAX=1, __unbuffered_p0_EBX=0, __unbuffered_p2_EAX$flush_delayed=0, __unbuffered_p2_EAX$mem_tmp=0, __unbuffered_p2_EAX$r_buff0_thd0=0, __unbuffered_p2_EAX$r_buff0_thd1=0, __unbuffered_p2_EAX$r_buff0_thd2=0, __unbuffered_p2_EAX$r_buff0_thd3=0, __unbuffered_p2_EAX$r_buff1_thd0=0, __unbuffered_p2_EAX$r_buff1_thd1=0, __unbuffered_p2_EAX$r_buff1_thd2=0, __unbuffered_p2_EAX$r_buff1_thd3=0, __unbuffered_p2_EAX$read_delayed=1, __unbuffered_p2_EAX$read_delayed_var={3:0}, __unbuffered_p2_EAX$w_buff0=0, __unbuffered_p2_EAX$w_buff0_used=0, __unbuffered_p2_EAX$w_buff1=0, __unbuffered_p2_EAX$w_buff1_used=0, __unbuffered_p2_EAX=0, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice1=1, weak$$choice2=1, 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={3:0}, z=1] [L765] 1 __unbuffered_p0_EBX = x VAL [\old(arg)={0:0}, \old(arg)={0:0}, __unbuffered_cnt=0, __unbuffered_p0_EAX=1, __unbuffered_p0_EBX=0, __unbuffered_p2_EAX$flush_delayed=0, __unbuffered_p2_EAX$mem_tmp=0, __unbuffered_p2_EAX$r_buff0_thd0=0, __unbuffered_p2_EAX$r_buff0_thd1=0, __unbuffered_p2_EAX$r_buff0_thd2=0, __unbuffered_p2_EAX$r_buff0_thd3=0, __unbuffered_p2_EAX$r_buff1_thd0=0, __unbuffered_p2_EAX$r_buff1_thd1=0, __unbuffered_p2_EAX$r_buff1_thd2=0, __unbuffered_p2_EAX$r_buff1_thd3=0, __unbuffered_p2_EAX$read_delayed=1, __unbuffered_p2_EAX$read_delayed_var={3:0}, __unbuffered_p2_EAX$w_buff0=0, __unbuffered_p2_EAX$w_buff0_used=0, __unbuffered_p2_EAX$w_buff1=0, __unbuffered_p2_EAX$w_buff1_used=0, __unbuffered_p2_EAX=0, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice1=1, weak$$choice2=1, 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={3:0}, z=1] [L828] EXPR 3 y$w_buff0_used && y$r_buff0_thd3 ? y$w_buff0 : (y$w_buff1_used && y$r_buff1_thd3 ? y$w_buff1 : y) [L828] EXPR 3 y$w_buff1_used && y$r_buff1_thd3 ? y$w_buff1 : y [L828] EXPR 3 \read(y) [L828] EXPR 3 y$w_buff1_used && y$r_buff1_thd3 ? y$w_buff1 : y [L828] EXPR 3 y$w_buff0_used && y$r_buff0_thd3 ? y$w_buff0 : (y$w_buff1_used && y$r_buff1_thd3 ? y$w_buff1 : y) [L828] 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) [L829] 3 y$w_buff0_used = y$w_buff0_used && y$r_buff0_thd3 ? (_Bool)0 : y$w_buff0_used [L830] 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 [L831] 3 y$r_buff0_thd3 = y$w_buff0_used && y$r_buff0_thd3 ? (_Bool)0 : y$r_buff0_thd3 [L832] 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 [\old(arg)={0:0}, \old(arg)={0:0}, __unbuffered_cnt=0, __unbuffered_p0_EAX=1, __unbuffered_p0_EBX=0, __unbuffered_p2_EAX$flush_delayed=0, __unbuffered_p2_EAX$mem_tmp=0, __unbuffered_p2_EAX$r_buff0_thd0=0, __unbuffered_p2_EAX$r_buff0_thd1=0, __unbuffered_p2_EAX$r_buff0_thd2=0, __unbuffered_p2_EAX$r_buff0_thd3=0, __unbuffered_p2_EAX$r_buff1_thd0=0, __unbuffered_p2_EAX$r_buff1_thd1=0, __unbuffered_p2_EAX$r_buff1_thd2=0, __unbuffered_p2_EAX$r_buff1_thd3=0, __unbuffered_p2_EAX$read_delayed=1, __unbuffered_p2_EAX$read_delayed_var={3:0}, __unbuffered_p2_EAX$w_buff0=0, __unbuffered_p2_EAX$w_buff0_used=0, __unbuffered_p2_EAX$w_buff1=0, __unbuffered_p2_EAX$w_buff1_used=0, __unbuffered_p2_EAX=0, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice1=1, weak$$choice2=1, 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={3:0}, z=1] [L777] 2 x = 1 VAL [\old(arg)={0:0}, \old(arg)={0:0}, \old(arg)={0:0}, __unbuffered_cnt=0, __unbuffered_p0_EAX=1, __unbuffered_p0_EBX=0, __unbuffered_p2_EAX$flush_delayed=0, __unbuffered_p2_EAX$mem_tmp=0, __unbuffered_p2_EAX$r_buff0_thd0=0, __unbuffered_p2_EAX$r_buff0_thd1=0, __unbuffered_p2_EAX$r_buff0_thd2=0, __unbuffered_p2_EAX$r_buff0_thd3=0, __unbuffered_p2_EAX$r_buff1_thd0=0, __unbuffered_p2_EAX$r_buff1_thd1=0, __unbuffered_p2_EAX$r_buff1_thd2=0, __unbuffered_p2_EAX$r_buff1_thd3=0, __unbuffered_p2_EAX$read_delayed=1, __unbuffered_p2_EAX$read_delayed_var={3:0}, __unbuffered_p2_EAX$w_buff0=0, __unbuffered_p2_EAX$w_buff0_used=0, __unbuffered_p2_EAX$w_buff1=0, __unbuffered_p2_EAX$w_buff1_used=0, __unbuffered_p2_EAX=0, arg={0:0}, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice1=1, 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=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={3:0}, z=1] [L780] 2 y$w_buff1 = y$w_buff0 [L781] 2 y$w_buff0 = 1 [L782] 2 y$w_buff1_used = y$w_buff0_used [L783] 2 y$w_buff0_used = (_Bool)1 [L784] CALL 2 __VERIFIER_assert(!(y$w_buff1_used && y$w_buff0_used)) [L18] COND FALSE 2 !(!expression) [L784] RET 2 __VERIFIER_assert(!(y$w_buff1_used && y$w_buff0_used)) [L785] 2 y$r_buff1_thd0 = y$r_buff0_thd0 [L786] 2 y$r_buff1_thd1 = y$r_buff0_thd1 [L787] 2 y$r_buff1_thd2 = y$r_buff0_thd2 [L788] 2 y$r_buff1_thd3 = y$r_buff0_thd3 [L789] 2 y$r_buff0_thd2 = (_Bool)1 VAL [\old(arg)={0:0}, \old(arg)={0:0}, \old(arg)={0:0}, __unbuffered_cnt=0, __unbuffered_p0_EAX=1, __unbuffered_p0_EBX=0, __unbuffered_p2_EAX$flush_delayed=0, __unbuffered_p2_EAX$mem_tmp=0, __unbuffered_p2_EAX$r_buff0_thd0=0, __unbuffered_p2_EAX$r_buff0_thd1=0, __unbuffered_p2_EAX$r_buff0_thd2=0, __unbuffered_p2_EAX$r_buff0_thd3=0, __unbuffered_p2_EAX$r_buff1_thd0=0, __unbuffered_p2_EAX$r_buff1_thd1=0, __unbuffered_p2_EAX$r_buff1_thd2=0, __unbuffered_p2_EAX$r_buff1_thd3=0, __unbuffered_p2_EAX$read_delayed=1, __unbuffered_p2_EAX$read_delayed_var={3:0}, __unbuffered_p2_EAX$w_buff0=0, __unbuffered_p2_EAX$w_buff0_used=0, __unbuffered_p2_EAX$w_buff1=0, __unbuffered_p2_EAX$w_buff1_used=0, __unbuffered_p2_EAX=0, arg={0:0}, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice1=1, 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=1, 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=1, y$w_buff0_used=1, y$w_buff1=0, y$w_buff1_used=0, y={3:0}, z=1] [L792] EXPR 2 y$w_buff0_used && y$r_buff0_thd2 ? y$w_buff0 : (y$w_buff1_used && y$r_buff1_thd2 ? y$w_buff1 : y) [L792] EXPR 2 y$w_buff0_used && y$r_buff0_thd2 ? y$w_buff0 : (y$w_buff1_used && y$r_buff1_thd2 ? y$w_buff1 : y) [L792] 2 y = y$w_buff0_used && y$r_buff0_thd2 ? y$w_buff0 : (y$w_buff1_used && y$r_buff1_thd2 ? y$w_buff1 : y) [L793] 2 y$w_buff0_used = y$w_buff0_used && y$r_buff0_thd2 ? (_Bool)0 : y$w_buff0_used [L794] 2 y$w_buff1_used = y$w_buff0_used && y$r_buff0_thd2 || y$w_buff1_used && y$r_buff1_thd2 ? (_Bool)0 : y$w_buff1_used [L795] 2 y$r_buff0_thd2 = y$w_buff0_used && y$r_buff0_thd2 ? (_Bool)0 : y$r_buff0_thd2 [L796] 2 y$r_buff1_thd2 = y$w_buff0_used && y$r_buff0_thd2 || y$w_buff1_used && y$r_buff1_thd2 ? (_Bool)0 : y$r_buff1_thd2 VAL [\old(arg)={0:0}, \old(arg)={0:0}, \old(arg)={0:0}, __unbuffered_cnt=0, __unbuffered_p0_EAX=1, __unbuffered_p0_EBX=0, __unbuffered_p2_EAX$flush_delayed=0, __unbuffered_p2_EAX$mem_tmp=0, __unbuffered_p2_EAX$r_buff0_thd0=0, __unbuffered_p2_EAX$r_buff0_thd1=0, __unbuffered_p2_EAX$r_buff0_thd2=0, __unbuffered_p2_EAX$r_buff0_thd3=0, __unbuffered_p2_EAX$r_buff1_thd0=0, __unbuffered_p2_EAX$r_buff1_thd1=0, __unbuffered_p2_EAX$r_buff1_thd2=0, __unbuffered_p2_EAX$r_buff1_thd3=0, __unbuffered_p2_EAX$read_delayed=1, __unbuffered_p2_EAX$read_delayed_var={3:0}, __unbuffered_p2_EAX$w_buff0=0, __unbuffered_p2_EAX$w_buff0_used=0, __unbuffered_p2_EAX$w_buff1=0, __unbuffered_p2_EAX$w_buff1_used=0, __unbuffered_p2_EAX=0, arg={0:0}, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice1=1, 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=1, 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=1, y$w_buff0_used=0, y$w_buff1=0, y$w_buff1_used=0, y={3:0}, z=1] [L799] 2 __unbuffered_cnt = __unbuffered_cnt + 1 VAL [\old(arg)={0:0}, \old(arg)={0:0}, \old(arg)={0:0}, __unbuffered_cnt=1, __unbuffered_p0_EAX=1, __unbuffered_p0_EBX=0, __unbuffered_p2_EAX$flush_delayed=0, __unbuffered_p2_EAX$mem_tmp=0, __unbuffered_p2_EAX$r_buff0_thd0=0, __unbuffered_p2_EAX$r_buff0_thd1=0, __unbuffered_p2_EAX$r_buff0_thd2=0, __unbuffered_p2_EAX$r_buff0_thd3=0, __unbuffered_p2_EAX$r_buff1_thd0=0, __unbuffered_p2_EAX$r_buff1_thd1=0, __unbuffered_p2_EAX$r_buff1_thd2=0, __unbuffered_p2_EAX$r_buff1_thd3=0, __unbuffered_p2_EAX$read_delayed=1, __unbuffered_p2_EAX$read_delayed_var={3:0}, __unbuffered_p2_EAX$w_buff0=0, __unbuffered_p2_EAX$w_buff0_used=0, __unbuffered_p2_EAX$w_buff1=0, __unbuffered_p2_EAX$w_buff1_used=0, __unbuffered_p2_EAX=0, arg={0:0}, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice1=1, 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=1, 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=1, y$w_buff0_used=0, y$w_buff1=0, y$w_buff1_used=0, y={3:0}, z=1] [L770] 1 __unbuffered_cnt = __unbuffered_cnt + 1 VAL [\old(arg)={0:0}, \old(arg)={0:0}, __unbuffered_cnt=2, __unbuffered_p0_EAX=1, __unbuffered_p0_EBX=0, __unbuffered_p2_EAX$flush_delayed=0, __unbuffered_p2_EAX$mem_tmp=0, __unbuffered_p2_EAX$r_buff0_thd0=0, __unbuffered_p2_EAX$r_buff0_thd1=0, __unbuffered_p2_EAX$r_buff0_thd2=0, __unbuffered_p2_EAX$r_buff0_thd3=0, __unbuffered_p2_EAX$r_buff1_thd0=0, __unbuffered_p2_EAX$r_buff1_thd1=0, __unbuffered_p2_EAX$r_buff1_thd2=0, __unbuffered_p2_EAX$r_buff1_thd3=0, __unbuffered_p2_EAX$read_delayed=1, __unbuffered_p2_EAX$read_delayed_var={3:0}, __unbuffered_p2_EAX$w_buff0=0, __unbuffered_p2_EAX$w_buff0_used=0, __unbuffered_p2_EAX$w_buff1=0, __unbuffered_p2_EAX$w_buff1_used=0, __unbuffered_p2_EAX=0, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice1=1, 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=1, 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=1, y$w_buff0_used=0, y$w_buff1=0, y$w_buff1_used=0, y={3:0}, z=1] [L835] 3 __unbuffered_cnt = __unbuffered_cnt + 1 VAL [\old(arg)={0:0}, \old(arg)={0:0}, __unbuffered_cnt=3, __unbuffered_p0_EAX=1, __unbuffered_p0_EBX=0, __unbuffered_p2_EAX$flush_delayed=0, __unbuffered_p2_EAX$mem_tmp=0, __unbuffered_p2_EAX$r_buff0_thd0=0, __unbuffered_p2_EAX$r_buff0_thd1=0, __unbuffered_p2_EAX$r_buff0_thd2=0, __unbuffered_p2_EAX$r_buff0_thd3=0, __unbuffered_p2_EAX$r_buff1_thd0=0, __unbuffered_p2_EAX$r_buff1_thd1=0, __unbuffered_p2_EAX$r_buff1_thd2=0, __unbuffered_p2_EAX$r_buff1_thd3=0, __unbuffered_p2_EAX$read_delayed=1, __unbuffered_p2_EAX$read_delayed_var={3:0}, __unbuffered_p2_EAX$w_buff0=0, __unbuffered_p2_EAX$w_buff0_used=0, __unbuffered_p2_EAX$w_buff1=0, __unbuffered_p2_EAX$w_buff1_used=0, __unbuffered_p2_EAX=0, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice1=1, 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=1, 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=1, y$w_buff0_used=0, y$w_buff1=0, y$w_buff1_used=0, y={3:0}, z=1] [L857] 0 main$tmp_guard0 = __unbuffered_cnt == 3 VAL [\old(arg)={0:0}, \old(arg)={0:0}, __unbuffered_cnt=3, __unbuffered_p0_EAX=1, __unbuffered_p0_EBX=0, __unbuffered_p2_EAX$flush_delayed=0, __unbuffered_p2_EAX$mem_tmp=0, __unbuffered_p2_EAX$r_buff0_thd0=0, __unbuffered_p2_EAX$r_buff0_thd1=0, __unbuffered_p2_EAX$r_buff0_thd2=0, __unbuffered_p2_EAX$r_buff0_thd3=0, __unbuffered_p2_EAX$r_buff1_thd0=0, __unbuffered_p2_EAX$r_buff1_thd1=0, __unbuffered_p2_EAX$r_buff1_thd2=0, __unbuffered_p2_EAX$r_buff1_thd3=0, __unbuffered_p2_EAX$read_delayed=1, __unbuffered_p2_EAX$read_delayed_var={3:0}, __unbuffered_p2_EAX$w_buff0=0, __unbuffered_p2_EAX$w_buff0_used=0, __unbuffered_p2_EAX$w_buff1=0, __unbuffered_p2_EAX$w_buff1_used=0, __unbuffered_p2_EAX=0, arg={0:0}, arg={0:0}, main$tmp_guard0=1, main$tmp_guard1=0, t2052=-2, t2053=-1, t2054=0, weak$$choice0=0, weak$$choice1=1, 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=1, 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=1, y$w_buff0_used=0, y$w_buff1=0, y$w_buff1_used=0, y={3:0}, z=1] [L859] CALL 0 assume_abort_if_not(main$tmp_guard0) [L3] COND FALSE 0 !(!cond) [L859] RET 0 assume_abort_if_not(main$tmp_guard0) [L861] EXPR 0 y$w_buff0_used && y$r_buff0_thd0 ? y$w_buff0 : (y$w_buff1_used && y$r_buff1_thd0 ? y$w_buff1 : y) [L861] EXPR 0 y$w_buff1_used && y$r_buff1_thd0 ? y$w_buff1 : y [L861] EXPR 0 \read(y) [L861] EXPR 0 y$w_buff1_used && y$r_buff1_thd0 ? y$w_buff1 : y [L861] EXPR 0 y$w_buff0_used && y$r_buff0_thd0 ? y$w_buff0 : (y$w_buff1_used && y$r_buff1_thd0 ? y$w_buff1 : y) [L861] 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) [L862] 0 y$w_buff0_used = y$w_buff0_used && y$r_buff0_thd0 ? (_Bool)0 : y$w_buff0_used [L863] 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 [L864] 0 y$r_buff0_thd0 = y$w_buff0_used && y$r_buff0_thd0 ? (_Bool)0 : y$r_buff0_thd0 [L865] 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 [\old(arg)={0:0}, \old(arg)={0:0}, __unbuffered_cnt=3, __unbuffered_p0_EAX=1, __unbuffered_p0_EBX=0, __unbuffered_p2_EAX$flush_delayed=0, __unbuffered_p2_EAX$mem_tmp=0, __unbuffered_p2_EAX$r_buff0_thd0=0, __unbuffered_p2_EAX$r_buff0_thd1=0, __unbuffered_p2_EAX$r_buff0_thd2=0, __unbuffered_p2_EAX$r_buff0_thd3=0, __unbuffered_p2_EAX$r_buff1_thd0=0, __unbuffered_p2_EAX$r_buff1_thd1=0, __unbuffered_p2_EAX$r_buff1_thd2=0, __unbuffered_p2_EAX$r_buff1_thd3=0, __unbuffered_p2_EAX$read_delayed=1, __unbuffered_p2_EAX$read_delayed_var={3:0}, __unbuffered_p2_EAX$w_buff0=0, __unbuffered_p2_EAX$w_buff0_used=0, __unbuffered_p2_EAX$w_buff1=0, __unbuffered_p2_EAX$w_buff1_used=0, __unbuffered_p2_EAX=0, arg={0:0}, arg={0:0}, main$tmp_guard0=1, main$tmp_guard1=0, t2052=-2, t2053=-1, t2054=0, weak$$choice0=0, weak$$choice1=1, 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=1, 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=1, y$w_buff0_used=0, y$w_buff1=0, y$w_buff1_used=0, y={3:0}, z=1] [L868] 0 weak$$choice1 = __VERIFIER_nondet_bool() [L869] EXPR 0 __unbuffered_p2_EAX$read_delayed ? (weak$$choice1 ? *__unbuffered_p2_EAX$read_delayed_var : __unbuffered_p2_EAX) : __unbuffered_p2_EAX [L869] EXPR 0 weak$$choice1 ? *__unbuffered_p2_EAX$read_delayed_var : __unbuffered_p2_EAX [L869] EXPR 0 \read(*__unbuffered_p2_EAX$read_delayed_var) [L869] EXPR 0 weak$$choice1 ? *__unbuffered_p2_EAX$read_delayed_var : __unbuffered_p2_EAX [L869] EXPR 0 __unbuffered_p2_EAX$read_delayed ? (weak$$choice1 ? *__unbuffered_p2_EAX$read_delayed_var : __unbuffered_p2_EAX) : __unbuffered_p2_EAX [L869] 0 __unbuffered_p2_EAX = __unbuffered_p2_EAX$read_delayed ? (weak$$choice1 ? *__unbuffered_p2_EAX$read_delayed_var : __unbuffered_p2_EAX) : __unbuffered_p2_EAX [L870] 0 main$tmp_guard1 = !(__unbuffered_p0_EAX == 1 && __unbuffered_p0_EBX == 0 && __unbuffered_p2_EAX == 1) VAL [\old(arg)={0:0}, \old(arg)={0:0}, __unbuffered_cnt=3, __unbuffered_p0_EAX=1, __unbuffered_p0_EBX=0, __unbuffered_p2_EAX$flush_delayed=0, __unbuffered_p2_EAX$mem_tmp=0, __unbuffered_p2_EAX$r_buff0_thd0=0, __unbuffered_p2_EAX$r_buff0_thd1=0, __unbuffered_p2_EAX$r_buff0_thd2=0, __unbuffered_p2_EAX$r_buff0_thd3=0, __unbuffered_p2_EAX$r_buff1_thd0=0, __unbuffered_p2_EAX$r_buff1_thd1=0, __unbuffered_p2_EAX$r_buff1_thd2=0, __unbuffered_p2_EAX$r_buff1_thd3=0, __unbuffered_p2_EAX$read_delayed=1, __unbuffered_p2_EAX$read_delayed_var={3:0}, __unbuffered_p2_EAX$w_buff0=0, __unbuffered_p2_EAX$w_buff0_used=0, __unbuffered_p2_EAX$w_buff1=0, __unbuffered_p2_EAX$w_buff1_used=0, __unbuffered_p2_EAX=1, arg={0:0}, arg={0:0}, main$tmp_guard0=1, main$tmp_guard1=0, t2052=-2, t2053=-1, t2054=0, weak$$choice0=0, weak$$choice1=1, 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=1, 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=1, y$w_buff0_used=0, y$w_buff1=0, y$w_buff1_used=0, y={3:0}, z=1] [L872] CALL 0 __VERIFIER_assert(main$tmp_guard1) [L18] COND TRUE 0 !expression [L18] CALL 0 reach_error() [L17] COND FALSE 0 !(0) VAL [\old(arg)={0:0}, \old(arg)={0:0}, __unbuffered_cnt=3, __unbuffered_p0_EAX=1, __unbuffered_p0_EBX=0, __unbuffered_p2_EAX$flush_delayed=0, __unbuffered_p2_EAX$mem_tmp=0, __unbuffered_p2_EAX$r_buff0_thd0=0, __unbuffered_p2_EAX$r_buff0_thd1=0, __unbuffered_p2_EAX$r_buff0_thd2=0, __unbuffered_p2_EAX$r_buff0_thd3=0, __unbuffered_p2_EAX$r_buff1_thd0=0, __unbuffered_p2_EAX$r_buff1_thd1=0, __unbuffered_p2_EAX$r_buff1_thd2=0, __unbuffered_p2_EAX$r_buff1_thd3=0, __unbuffered_p2_EAX$read_delayed=1, __unbuffered_p2_EAX$read_delayed_var={3:0}, __unbuffered_p2_EAX$w_buff0=0, __unbuffered_p2_EAX$w_buff0_used=0, __unbuffered_p2_EAX$w_buff1=0, __unbuffered_p2_EAX$w_buff1_used=0, __unbuffered_p2_EAX=1, arg={0:0}, arg={0:0}, main$tmp_guard0=1, main$tmp_guard1=0, weak$$choice0=0, weak$$choice1=1, 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=1, 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=1, y$w_buff0_used=0, y$w_buff1=0, y$w_buff1_used=0, y={3:0}, z=1] [L17] 0 __assert_fail ("0", "safe012_power.opt.c", 8, __extension__ __PRETTY_FUNCTION__) VAL [\old(arg)={0:0}, \old(arg)={0:0}, __unbuffered_cnt=3, __unbuffered_p0_EAX=1, __unbuffered_p0_EBX=0, __unbuffered_p2_EAX$flush_delayed=0, __unbuffered_p2_EAX$mem_tmp=0, __unbuffered_p2_EAX$r_buff0_thd0=0, __unbuffered_p2_EAX$r_buff0_thd1=0, __unbuffered_p2_EAX$r_buff0_thd2=0, __unbuffered_p2_EAX$r_buff0_thd3=0, __unbuffered_p2_EAX$r_buff1_thd0=0, __unbuffered_p2_EAX$r_buff1_thd1=0, __unbuffered_p2_EAX$r_buff1_thd2=0, __unbuffered_p2_EAX$r_buff1_thd3=0, __unbuffered_p2_EAX$read_delayed=1, __unbuffered_p2_EAX$read_delayed_var={3:0}, __unbuffered_p2_EAX$w_buff0=0, __unbuffered_p2_EAX$w_buff0_used=0, __unbuffered_p2_EAX$w_buff1=0, __unbuffered_p2_EAX$w_buff1_used=0, __unbuffered_p2_EAX=1, arg={0:0}, arg={0:0}, main$tmp_guard0=1, main$tmp_guard1=0, weak$$choice0=0, weak$$choice1=1, 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=1, 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=1, y$w_buff0_used=0, y$w_buff1=0, y$w_buff1_used=0, y={3:0}, z=1] - UnprovableResult [Line: 17]: Unable to prove that all allocated memory was freed Unable to prove that all allocated memory was freed Reason: Not analyzed. - UnprovableResult [Line: -1]: Unable to prove that pointer dereference always succeeds Unable to prove that pointer dereference always succeeds Reason: Not analyzed. - UnprovableResult [Line: -1]: Unable to prove that pointer dereference always succeeds Unable to prove that pointer dereference always succeeds Reason: Not analyzed. - UnprovableResult [Line: -1]: Unable to prove that pointer dereference always succeeds Unable to prove that pointer dereference always succeeds Reason: Not analyzed. - UnprovableResult [Line: -1]: Unable to prove that pointer dereference always succeeds Unable to prove that pointer dereference always succeeds Reason: Not analyzed. - UnprovableResult [Line: -1]: Unable to prove that pointer dereference always succeeds Unable to prove that pointer dereference always succeeds Reason: Not analyzed. - UnprovableResult [Line: -1]: Unable to prove that pointer dereference always succeeds Unable to prove that pointer dereference always succeeds Reason: Not analyzed. - UnprovableResult [Line: -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: -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: -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: -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: 848]: Unable to prove that all allocated memory was freed Unable to prove that all allocated memory was freed Reason: Not analyzed. - UnprovableResult [Line: 853]: 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: 851]: 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: 855]: 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, 122 locations, 61 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: 26.7s, OverallIterations: 17, TraceHistogramMax: 1, PathProgramHistogramMax: 2, EmptinessCheckTime: 0.0s, AutomataDifference: 17.5s, DeadEndRemovalTime: 0.0s, HoareAnnotationTime: 0.0s, InitialAbstractionConstructionTime: 0.2s, HoareTripleCheckerStatistics: 0 mSolverCounterUnknown, 607 SdHoareTripleChecker+Valid, 5.0s IncrementalHoareTripleChecker+Time, 0 mSdLazyCounter, 585 mSDsluCounter, 45 SdHoareTripleChecker+Invalid, 4.3s Time, 0 mProtectedAction, 0 SdHoareTripleChecker+Unchecked, 0 IncrementalHoareTripleChecker+Unchecked, 34 mSDsCounter, 94 IncrementalHoareTripleChecker+Valid, 0 mProtectedPredicate, 1485 IncrementalHoareTripleChecker+Invalid, 1579 SdHoareTripleChecker+Unknown, 0 mSolverCounterNotChecked, 94 mSolverCounterUnsat, 11 mSDtfsCounter, 1485 mSolverCounterSat, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Unknown, PredicateUnifierStatistics: 0 DeclaredPredicates, 84 GetRequests, 13 SyntacticMatches, 0 SemanticMatches, 71 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 49 ImplicationChecksByTransitivity, 1.0s Time, 0.0s BasicInterpolantAutomatonTime, BiggestAbstraction: size=307occurred in iteration=14, InterpolantAutomatonStates: 85, 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.8s SatisfiabilityAnalysisTime, 7.2s InterpolantComputationTime, 306 NumberOfCodeBlocks, 306 NumberOfCodeBlocksAsserted, 17 NumberOfCheckSat, 260 ConstructedInterpolants, 0 QuantifiedInterpolants, 1389 SizeOfPredicates, 0 NumberOfNonLiveVariables, 0 ConjunctsInSsa, 0 ConjunctsInUnsatCore, 16 InterpolantComputations, 16 PerfectInterpolantSequences, 0/0 InterpolantCoveringCapability, INVARIANT_SYNTHESIS: No data available, INTERPOLANT_CONSOLIDATION: No data available, ABSTRACT_INTERPRETATION: No data available, PDR: No data available, ACCELERATED_INTERPOLATION: No data available, SIFA: No data available, ReuseStatistics: No data available, ConComCheckerStatistics: No data available RESULT: Ultimate could not prove your program: unable to determine feasibility of some traces [2024-11-28 05:22:31,647 INFO L552 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_8dc03989-dd1e-4552-8a40-46136af171cd/bin/uautomizer-verify-aQ6SnzHsRB/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 (1)] Ended with 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/bin/java -Dosgi.configuration.area=/tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_8dc03989-dd1e-4552-8a40-46136af171cd/bin/uautomizer-verify-aQ6SnzHsRB/data/config -Xmx15G -Xms4m -jar /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_8dc03989-dd1e-4552-8a40-46136af171cd/bin/uautomizer-verify-aQ6SnzHsRB/plugins/org.eclipse.equinox.launcher_1.6.800.v20240513-1750.jar -data @noDefault -ultimatedata /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_8dc03989-dd1e-4552-8a40-46136af171cd/bin/uautomizer-verify-aQ6SnzHsRB/data -tc /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_8dc03989-dd1e-4552-8a40-46136af171cd/bin/uautomizer-verify-aQ6SnzHsRB/config/AutomizerMemDerefMemtrack.xml -i ../../sv-benchmarks/c/pthread-wmm/safe012_power.opt.i -s /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_8dc03989-dd1e-4552-8a40-46136af171cd/bin/uautomizer-verify-aQ6SnzHsRB/config/svcomp-DerefFreeMemtrack-32bit-Automizer_Bitvector.epf --cacsl2boogietranslator.entry.function main --witnessprinter.witness.directory /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_8dc03989-dd1e-4552-8a40-46136af171cd/bin/uautomizer-verify-aQ6SnzHsRB --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 697ff70a4856546a25a8cc2eb04fc80299855e02086960ffcc9a4790310db5da --- Real Ultimate output --- This is Ultimate 0.3.0-dev-d790fec [2024-11-28 05:22:35,050 INFO L188 SettingsManager]: Resetting all preferences to default values... [2024-11-28 05:22:35,216 INFO L114 SettingsManager]: Loading settings from /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_8dc03989-dd1e-4552-8a40-46136af171cd/bin/uautomizer-verify-aQ6SnzHsRB/config/svcomp-DerefFreeMemtrack-32bit-Automizer_Bitvector.epf [2024-11-28 05:22:35,228 WARN L101 SettingsManager]: Preference file contains the following unknown settings: [2024-11-28 05:22:35,228 WARN L103 SettingsManager]: * de.uni_freiburg.informatik.ultimate.core.Log level for class [2024-11-28 05:22:35,280 INFO L130 SettingsManager]: Preferences different from defaults after loading the file: [2024-11-28 05:22:35,282 INFO L151 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2024-11-28 05:22:35,283 INFO L153 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2024-11-28 05:22:35,283 INFO L151 SettingsManager]: Preferences of Boogie Preprocessor differ from their defaults: [2024-11-28 05:22:35,284 INFO L153 SettingsManager]: * Use memory slicer=true [2024-11-28 05:22:35,285 INFO L151 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2024-11-28 05:22:35,285 INFO L153 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2024-11-28 05:22:35,287 INFO L151 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2024-11-28 05:22:35,287 INFO L153 SettingsManager]: * Create parallel compositions if possible=false [2024-11-28 05:22:35,288 INFO L153 SettingsManager]: * Use SBE=true [2024-11-28 05:22:35,288 INFO L151 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2024-11-28 05:22:35,288 INFO L153 SettingsManager]: * sizeof long=4 [2024-11-28 05:22:35,289 INFO L153 SettingsManager]: * Overapproximate operations on floating types=true [2024-11-28 05:22:35,289 INFO L153 SettingsManager]: * sizeof POINTER=4 [2024-11-28 05:22:35,289 INFO L153 SettingsManager]: * Check division by zero=IGNORE [2024-11-28 05:22:35,289 INFO L153 SettingsManager]: * Check for the main procedure if all allocated memory was freed=true [2024-11-28 05:22:35,289 INFO L153 SettingsManager]: * Bitprecise bitfields=true [2024-11-28 05:22:35,289 INFO L153 SettingsManager]: * SV-COMP memtrack compatibility mode=true [2024-11-28 05:22:35,290 INFO L153 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2024-11-28 05:22:35,290 INFO L153 SettingsManager]: * Adapt memory model on pointer casts if necessary=true [2024-11-28 05:22:35,290 INFO L153 SettingsManager]: * Use bitvectors instead of ints=true [2024-11-28 05:22:35,290 INFO L153 SettingsManager]: * Memory model=HoenickeLindenmann_4ByteResolution [2024-11-28 05:22:35,290 INFO L153 SettingsManager]: * Check unreachability of reach_error function=false [2024-11-28 05:22:35,290 INFO L153 SettingsManager]: * sizeof long double=12 [2024-11-28 05:22:35,291 INFO L153 SettingsManager]: * Behaviour of calls to undefined functions=OVERAPPROXIMATE_BEHAVIOUR [2024-11-28 05:22:35,291 INFO L153 SettingsManager]: * Use constant arrays=true [2024-11-28 05:22:35,292 INFO L151 SettingsManager]: Preferences of IcfgBuilder differ from their defaults: [2024-11-28 05:22:35,292 INFO L153 SettingsManager]: * Size of a code block=SequenceOfStatements [2024-11-28 05:22:35,292 INFO L153 SettingsManager]: * Only consider context switches at boundaries of atomic blocks=true [2024-11-28 05:22:35,292 INFO L153 SettingsManager]: * SMT solver=External_DefaultMode [2024-11-28 05:22:35,293 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2024-11-28 05:22:35,293 INFO L151 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2024-11-28 05:22:35,293 INFO L153 SettingsManager]: * Size of a code block=SequenceOfStatements [2024-11-28 05:22:35,293 INFO L153 SettingsManager]: * Only consider context switches at boundaries of atomic blocks=true [2024-11-28 05:22:35,293 INFO L153 SettingsManager]: * SMT solver=External_DefaultMode [2024-11-28 05:22:35,293 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2024-11-28 05:22:35,293 INFO L151 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2024-11-28 05:22:35,293 INFO L153 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2024-11-28 05:22:35,293 INFO L153 SettingsManager]: * Trace refinement strategy=FOX [2024-11-28 05:22:35,294 INFO L153 SettingsManager]: * Command for external solver=cvc4 --incremental --print-success --lang smt [2024-11-28 05:22:35,295 INFO L153 SettingsManager]: * Apply one-shot large block encoding in concurrent analysis=false [2024-11-28 05:22:35,295 INFO L153 SettingsManager]: * Automaton type used in concurrency analysis=PETRI_NET [2024-11-28 05:22:35,295 INFO L153 SettingsManager]: * Order on configurations for Petri net unfoldings=DBO [2024-11-28 05:22:35,295 INFO L153 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2024-11-28 05:22:35,295 INFO L153 SettingsManager]: * Looper check in Petri net analysis=SEMANTIC 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_8dc03989-dd1e-4552-8a40-46136af171cd/bin/uautomizer-verify-aQ6SnzHsRB 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 -> 697ff70a4856546a25a8cc2eb04fc80299855e02086960ffcc9a4790310db5da [2024-11-28 05:22:35,715 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2024-11-28 05:22:35,729 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2024-11-28 05:22:35,733 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2024-11-28 05:22:35,736 INFO L270 PluginConnector]: Initializing CDTParser... [2024-11-28 05:22:35,737 INFO L274 PluginConnector]: CDTParser initialized [2024-11-28 05:22:35,738 INFO L431 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_8dc03989-dd1e-4552-8a40-46136af171cd/bin/uautomizer-verify-aQ6SnzHsRB/../../sv-benchmarks/c/pthread-wmm/safe012_power.opt.i [2024-11-28 05:22:39,687 INFO L533 CDTParser]: Created temporary CDT project at /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_8dc03989-dd1e-4552-8a40-46136af171cd/bin/uautomizer-verify-aQ6SnzHsRB/data/1d6ad09fb/d4d09359b607440997b7849555da54fd/FLAGa2730aced [2024-11-28 05:22:40,198 INFO L384 CDTParser]: Found 1 translation units. [2024-11-28 05:22:40,199 INFO L180 CDTParser]: Scanning /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_8dc03989-dd1e-4552-8a40-46136af171cd/sv-benchmarks/c/pthread-wmm/safe012_power.opt.i [2024-11-28 05:22:40,228 INFO L427 CDTParser]: About to delete temporary CDT project at /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_8dc03989-dd1e-4552-8a40-46136af171cd/bin/uautomizer-verify-aQ6SnzHsRB/data/1d6ad09fb/d4d09359b607440997b7849555da54fd/FLAGa2730aced [2024-11-28 05:22:40,261 INFO L435 CDTParser]: Successfully deleted /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_8dc03989-dd1e-4552-8a40-46136af171cd/bin/uautomizer-verify-aQ6SnzHsRB/data/1d6ad09fb/d4d09359b607440997b7849555da54fd [2024-11-28 05:22:40,264 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2024-11-28 05:22:40,266 INFO L133 ToolchainWalker]: Walking toolchain with 6 elements. [2024-11-28 05:22:40,271 INFO L112 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2024-11-28 05:22:40,273 INFO L270 PluginConnector]: Initializing CACSL2BoogieTranslator... [2024-11-28 05:22:40,279 INFO L274 PluginConnector]: CACSL2BoogieTranslator initialized [2024-11-28 05:22:40,280 INFO L184 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 28.11 05:22:40" (1/1) ... [2024-11-28 05:22:40,281 INFO L204 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@2341dc6e and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 28.11 05:22:40, skipping insertion in model container [2024-11-28 05:22:40,284 INFO L184 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 28.11 05:22:40" (1/1) ... [2024-11-28 05:22:40,352 INFO L175 MainTranslator]: Built tables and reachable declarations [2024-11-28 05:22:40,982 INFO L210 PostProcessor]: Analyzing one entry point: main [2024-11-28 05:22:41,006 INFO L200 MainTranslator]: Completed pre-run [2024-11-28 05:22:41,123 INFO L210 PostProcessor]: Analyzing one entry point: main [2024-11-28 05:22:41,186 INFO L204 MainTranslator]: Completed translation [2024-11-28 05:22:41,187 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 28.11 05:22:41 WrapperNode [2024-11-28 05:22:41,187 INFO L131 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2024-11-28 05:22:41,188 INFO L112 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2024-11-28 05:22:41,188 INFO L270 PluginConnector]: Initializing Boogie Procedure Inliner... [2024-11-28 05:22:41,188 INFO L274 PluginConnector]: Boogie Procedure Inliner initialized [2024-11-28 05:22:41,197 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 28.11 05:22:41" (1/1) ... [2024-11-28 05:22:41,219 INFO L184 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 28.11 05:22:41" (1/1) ... [2024-11-28 05:22:41,253 INFO L138 Inliner]: procedures = 179, calls = 60, calls flagged for inlining = 6, calls inlined = 7, statements flattened = 175 [2024-11-28 05:22:41,253 INFO L131 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2024-11-28 05:22:41,254 INFO L112 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2024-11-28 05:22:41,254 INFO L270 PluginConnector]: Initializing Boogie Preprocessor... [2024-11-28 05:22:41,254 INFO L274 PluginConnector]: Boogie Preprocessor initialized [2024-11-28 05:22:41,267 INFO L184 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 28.11 05:22:41" (1/1) ... [2024-11-28 05:22:41,267 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 28.11 05:22:41" (1/1) ... [2024-11-28 05:22:41,274 INFO L184 PluginConnector]: Executing the observer MemorySlicer from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 28.11 05:22:41" (1/1) ... [2024-11-28 05:22:41,299 INFO L175 MemorySlicer]: Split 18 memory accesses to 2 slices as follows [2, 16]. 89 percent of accesses are in the largest equivalence class. The 3 initializations are split as follows [2, 1]. The 5 writes are split as follows [0, 5]. [2024-11-28 05:22:41,299 INFO L184 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 28.11 05:22:41" (1/1) ... [2024-11-28 05:22:41,300 INFO L184 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 28.11 05:22:41" (1/1) ... [2024-11-28 05:22:41,318 INFO L184 PluginConnector]: Executing the observer ReplaceArrayAssignments from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 28.11 05:22:41" (1/1) ... [2024-11-28 05:22:41,320 INFO L184 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 28.11 05:22:41" (1/1) ... [2024-11-28 05:22:41,324 INFO L184 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 28.11 05:22:41" (1/1) ... [2024-11-28 05:22:41,328 INFO L184 PluginConnector]: Executing the observer LTLStepAnnotator from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 28.11 05:22:41" (1/1) ... [2024-11-28 05:22:41,330 INFO L184 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 28.11 05:22:41" (1/1) ... [2024-11-28 05:22:41,336 INFO L131 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2024-11-28 05:22:41,337 INFO L112 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2024-11-28 05:22:41,337 INFO L270 PluginConnector]: Initializing RCFGBuilder... [2024-11-28 05:22:41,338 INFO L274 PluginConnector]: RCFGBuilder initialized [2024-11-28 05:22:41,339 INFO L184 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 28.11 05:22:41" (1/1) ... [2024-11-28 05:22:41,347 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2024-11-28 05:22:41,373 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_8dc03989-dd1e-4552-8a40-46136af171cd/bin/uautomizer-verify-aQ6SnzHsRB/z3 [2024-11-28 05:22:41,397 INFO L229 MonitoredProcess]: Starting monitored process 1 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_8dc03989-dd1e-4552-8a40-46136af171cd/bin/uautomizer-verify-aQ6SnzHsRB/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 (exit command is (exit), workingDir is null) [2024-11-28 05:22:41,402 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_8dc03989-dd1e-4552-8a40-46136af171cd/bin/uautomizer-verify-aQ6SnzHsRB/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 (1)] Waiting until timeout for monitored process [2024-11-28 05:22:41,439 INFO L130 BoogieDeclarations]: Found specification of procedure read~intINTTYPE4#0 [2024-11-28 05:22:41,439 INFO L130 BoogieDeclarations]: Found specification of procedure read~intINTTYPE4#1 [2024-11-28 05:22:41,439 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_atomic_begin [2024-11-28 05:22:41,439 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2024-11-28 05:22:41,439 INFO L130 BoogieDeclarations]: Found specification of procedure write~intINTTYPE4#0 [2024-11-28 05:22:41,440 INFO L130 BoogieDeclarations]: Found specification of procedure write~intINTTYPE4#1 [2024-11-28 05:22:41,440 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~intINTTYPE1#0 [2024-11-28 05:22:41,440 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~intINTTYPE1#1 [2024-11-28 05:22:41,440 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~intINTTYPE4#0 [2024-11-28 05:22:41,440 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~intINTTYPE4#1 [2024-11-28 05:22:41,441 INFO L130 BoogieDeclarations]: Found specification of procedure P0 [2024-11-28 05:22:41,441 INFO L138 BoogieDeclarations]: Found implementation of procedure P0 [2024-11-28 05:22:41,441 INFO L130 BoogieDeclarations]: Found specification of procedure P1 [2024-11-28 05:22:41,442 INFO L138 BoogieDeclarations]: Found implementation of procedure P1 [2024-11-28 05:22:41,442 INFO L130 BoogieDeclarations]: Found specification of procedure P2 [2024-11-28 05:22:41,443 INFO L138 BoogieDeclarations]: Found implementation of procedure P2 [2024-11-28 05:22:41,443 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_atomic_end [2024-11-28 05:22:41,443 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2024-11-28 05:22:41,443 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2024-11-28 05:22:41,446 WARN L203 CfgBuilder]: User set CodeBlockSize to SequenceOfStatements but program contains fork statements. Overwriting the user preferences and setting CodeBlockSize to OneNontrivialStatement. [2024-11-28 05:22:41,695 INFO L234 CfgBuilder]: Building ICFG [2024-11-28 05:22:41,697 INFO L260 CfgBuilder]: Building CFG for each procedure with an implementation [2024-11-28 05:22:42,662 INFO L279 CfgBuilder]: Omitted future-live optimization because the input is a concurrent program. [2024-11-28 05:22:42,662 INFO L283 CfgBuilder]: Performing block encoding [2024-11-28 05:22:43,547 WARN L170 LargeBlockEncoding]: Complex 4:9 sequential composition. Such compositions can cause exponential blowup and should not occur in structured programs. [2024-11-28 05:22:43,821 INFO L307 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2024-11-28 05:22:43,823 INFO L312 CfgBuilder]: Removed 0 assume(true) statements. [2024-11-28 05:22:43,824 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 28.11 05:22:43 BoogieIcfgContainer [2024-11-28 05:22:43,824 INFO L131 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2024-11-28 05:22:43,827 INFO L112 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2024-11-28 05:22:43,828 INFO L270 PluginConnector]: Initializing TraceAbstraction... [2024-11-28 05:22:43,838 INFO L274 PluginConnector]: TraceAbstraction initialized [2024-11-28 05:22:43,838 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 28.11 05:22:40" (1/3) ... [2024-11-28 05:22:43,839 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@50ac6a73 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 28.11 05:22:43, skipping insertion in model container [2024-11-28 05:22:43,839 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 28.11 05:22:41" (2/3) ... [2024-11-28 05:22:43,839 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@50ac6a73 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 28.11 05:22:43, skipping insertion in model container [2024-11-28 05:22:43,839 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 28.11 05:22:43" (3/3) ... [2024-11-28 05:22:43,841 INFO L128 eAbstractionObserver]: Analyzing ICFG safe012_power.opt.i [2024-11-28 05:22:43,864 INFO L216 ceAbstractionStarter]: Automizer settings: Hoare:None NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2024-11-28 05:22:43,867 INFO L151 ceAbstractionStarter]: Applying trace abstraction to ICFG safe012_power.opt.i that has 4 procedures, 73 locations, 1 initial locations, 0 loop locations, and 33 error locations. [2024-11-28 05:22:43,868 INFO L491 ceAbstractionStarter]: Constructing petrified ICFG for 1 thread instances. [2024-11-28 05:22:44,299 INFO L143 ThreadInstanceAdder]: Constructed 0 joinOtherThreadTransitions. [2024-11-28 05:22:44,354 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 82 places, 101 transitions, 214 flow [2024-11-28 05:22:44,492 INFO L124 PetriNetUnfolderBase]: 29/98 cut-off events. [2024-11-28 05:22:44,495 INFO L125 PetriNetUnfolderBase]: For 0/0 co-relation queries the response was YES. [2024-11-28 05:22:44,503 INFO L83 FinitePrefix]: Finished finitePrefix Result has 108 conditions, 98 events. 29/98 cut-off events. For 0/0 co-relation queries the response was YES. Maximal size of possible extension queue 24. Compared 328 event pairs, 0 based on Foata normal form. 0/36 useless extension candidates. Maximal degree in co-relation 100. Up to 4 conditions per place. [2024-11-28 05:22:44,504 INFO L82 GeneralOperation]: Start removeDead. Operand has 82 places, 101 transitions, 214 flow [2024-11-28 05:22:44,511 INFO L88 GeneralOperation]: Finished RemoveDead, result has has 79 places, 98 transitions, 205 flow [2024-11-28 05:22:44,522 INFO L332 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2024-11-28 05:22:44,539 INFO L333 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, mAutomataTypeConcurrency=PETRI_NET, mHoareTripleChecks=INCREMENTAL, mHoareAnnotationPositions=None, 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;@44eaaaf5, mLbeIndependenceSettings=[IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=false, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2024-11-28 05:22:44,539 INFO L334 AbstractCegarLoop]: Starting to check reachability of 61 error locations. [2024-11-28 05:22:44,554 INFO L185 PetriNetUnfolderBase]: Found word, exiting Unfolder. [2024-11-28 05:22:44,556 INFO L124 PetriNetUnfolderBase]: 0/12 cut-off events. [2024-11-28 05:22:44,556 INFO L125 PetriNetUnfolderBase]: For 0/0 co-relation queries the response was YES. [2024-11-28 05:22:44,556 INFO L198 CegarLoopForPetriNet]: Found error trace [2024-11-28 05:22:44,557 INFO L206 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1] [2024-11-28 05:22:44,558 INFO L396 AbstractCegarLoop]: === Iteration 1 === Targeting P1Err0ASSERT_VIOLATIONMEMORY_LEAK === [P1Err0ASSERT_VIOLATIONMEMORY_LEAK, P1Err1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, P1Err2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 58 more)] === [2024-11-28 05:22:44,564 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-28 05:22:44,565 INFO L85 PathProgramCache]: Analyzing trace with hash 185554318, now seen corresponding path program 1 times [2024-11-28 05:22:44,584 INFO L118 FreeRefinementEngine]: Executing refinement strategy FOX [2024-11-28 05:22:44,585 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleZ3 [1173937149] [2024-11-28 05:22:44,585 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-28 05:22:44,586 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-11-28 05:22:44,586 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_8dc03989-dd1e-4552-8a40-46136af171cd/bin/uautomizer-verify-aQ6SnzHsRB/z3 [2024-11-28 05:22:44,593 INFO L229 MonitoredProcess]: Starting monitored process 2 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_8dc03989-dd1e-4552-8a40-46136af171cd/bin/uautomizer-verify-aQ6SnzHsRB/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2024-11-28 05:22:44,596 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_8dc03989-dd1e-4552-8a40-46136af171cd/bin/uautomizer-verify-aQ6SnzHsRB/z3 -smt2 -in SMTLIB2_COMPLIANT=true (2)] Waiting until timeout for monitored process [2024-11-28 05:22:44,896 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-28 05:22:44,900 INFO L256 TraceCheckSpWp]: Trace formula consists of 87 conjuncts, 5 conjuncts are in the unsatisfiable core [2024-11-28 05:22:44,906 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2024-11-28 05:22:44,971 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-28 05:22:44,972 INFO L308 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2024-11-28 05:22:44,974 INFO L136 FreeRefinementEngine]: Strategy FOX found an infeasible trace [2024-11-28 05:22:44,974 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1173937149] [2024-11-28 05:22:44,978 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1173937149] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-28 05:22:44,978 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-28 05:22:44,978 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [1] imperfect sequences [] total 1 [2024-11-28 05:22:44,981 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2048604357] [2024-11-28 05:22:44,982 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-28 05:22:44,991 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2024-11-28 05:22:44,999 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy FOX [2024-11-28 05:22:45,039 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-11-28 05:22:45,040 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-11-28 05:22:45,043 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 19 out of 101 [2024-11-28 05:22:45,046 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 79 places, 98 transitions, 205 flow. Second operand has 3 states, 3 states have (on average 20.666666666666668) internal successors, (62), 3 states have internal predecessors, (62), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-28 05:22:45,046 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-11-28 05:22:45,047 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 19 of 101 [2024-11-28 05:22:45,048 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-11-28 05:22:50,086 INFO L124 PetriNetUnfolderBase]: 9134/13978 cut-off events. [2024-11-28 05:22:50,086 INFO L125 PetriNetUnfolderBase]: For 14/14 co-relation queries the response was YES. [2024-11-28 05:22:50,144 INFO L83 FinitePrefix]: Finished finitePrefix Result has 27062 conditions, 13978 events. 9134/13978 cut-off events. For 14/14 co-relation queries the response was YES. Maximal size of possible extension queue 1615. Compared 123917 event pairs, 2512 based on Foata normal form. 516/7942 useless extension candidates. Maximal degree in co-relation 27051. Up to 7491 conditions per place. [2024-11-28 05:22:50,288 INFO L140 encePairwiseOnDemand]: 54/101 looper letters, 69 selfloop transitions, 3 changer transitions 0/88 dead transitions. [2024-11-28 05:22:50,288 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 65 places, 88 transitions, 332 flow [2024-11-28 05:22:50,290 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-11-28 05:22:50,294 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2024-11-28 05:22:50,308 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 213 transitions. [2024-11-28 05:22:50,313 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.7029702970297029 [2024-11-28 05:22:50,316 INFO L175 Difference]: Start difference. First operand has 79 places, 98 transitions, 205 flow. Second operand 3 states and 213 transitions. [2024-11-28 05:22:50,317 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 65 places, 88 transitions, 332 flow [2024-11-28 05:22:50,326 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 62 places, 88 transitions, 328 flow, removed 0 selfloop flow, removed 3 redundant places. [2024-11-28 05:22:50,334 INFO L231 Difference]: Finished difference. Result has 64 places, 57 transitions, 140 flow [2024-11-28 05:22:50,338 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=101, PETRI_DIFFERENCE_MINUEND_FLOW=118, PETRI_DIFFERENCE_MINUEND_PLACES=60, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=56, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=2, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=53, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=140, PETRI_PLACES=64, PETRI_TRANSITIONS=57} [2024-11-28 05:22:50,346 INFO L279 CegarLoopForPetriNet]: 79 programPoint places, -15 predicate places. [2024-11-28 05:22:50,346 INFO L471 AbstractCegarLoop]: Abstraction has has 64 places, 57 transitions, 140 flow [2024-11-28 05:22:50,346 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 20.666666666666668) internal successors, (62), 3 states have internal predecessors, (62), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-28 05:22:50,347 INFO L198 CegarLoopForPetriNet]: Found error trace [2024-11-28 05:22:50,347 INFO L206 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1] [2024-11-28 05:22:50,361 INFO L552 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_8dc03989-dd1e-4552-8a40-46136af171cd/bin/uautomizer-verify-aQ6SnzHsRB/z3 -smt2 -in SMTLIB2_COMPLIANT=true (2)] Ended with exit code 0 [2024-11-28 05:22:50,547 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 2 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_8dc03989-dd1e-4552-8a40-46136af171cd/bin/uautomizer-verify-aQ6SnzHsRB/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-11-28 05:22:50,548 INFO L396 AbstractCegarLoop]: === Iteration 2 === Targeting P1Err1REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [P1Err0ASSERT_VIOLATIONMEMORY_LEAK, P1Err1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, P1Err2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 58 more)] === [2024-11-28 05:22:50,549 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-28 05:22:50,549 INFO L85 PathProgramCache]: Analyzing trace with hash 1457217472, now seen corresponding path program 1 times [2024-11-28 05:22:50,550 INFO L118 FreeRefinementEngine]: Executing refinement strategy FOX [2024-11-28 05:22:50,550 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleZ3 [604950282] [2024-11-28 05:22:50,551 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-28 05:22:50,551 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-11-28 05:22:50,551 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_8dc03989-dd1e-4552-8a40-46136af171cd/bin/uautomizer-verify-aQ6SnzHsRB/z3 [2024-11-28 05:22:50,553 INFO L229 MonitoredProcess]: Starting monitored process 3 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_8dc03989-dd1e-4552-8a40-46136af171cd/bin/uautomizer-verify-aQ6SnzHsRB/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2024-11-28 05:22:50,555 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_8dc03989-dd1e-4552-8a40-46136af171cd/bin/uautomizer-verify-aQ6SnzHsRB/z3 -smt2 -in SMTLIB2_COMPLIANT=true (3)] Waiting until timeout for monitored process [2024-11-28 05:22:50,836 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-28 05:22:50,840 INFO L256 TraceCheckSpWp]: Trace formula consists of 95 conjuncts, 3 conjuncts are in the unsatisfiable core [2024-11-28 05:22:50,841 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2024-11-28 05:22:50,969 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-28 05:22:50,970 INFO L308 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2024-11-28 05:22:50,970 INFO L136 FreeRefinementEngine]: Strategy FOX found an infeasible trace [2024-11-28 05:22:50,970 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [604950282] [2024-11-28 05:22:50,970 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [604950282] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-28 05:22:50,970 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-28 05:22:50,970 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [1] imperfect sequences [] total 1 [2024-11-28 05:22:50,970 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [974760659] [2024-11-28 05:22:50,971 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-28 05:22:50,974 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2024-11-28 05:22:50,974 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy FOX [2024-11-28 05:22:50,975 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-11-28 05:22:50,975 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-11-28 05:22:50,981 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 19 out of 101 [2024-11-28 05:22:50,982 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 64 places, 57 transitions, 140 flow. Second operand has 3 states, 3 states have (on average 21.0) internal successors, (63), 3 states have internal predecessors, (63), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-28 05:22:50,983 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-11-28 05:22:50,983 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 19 of 101 [2024-11-28 05:22:50,983 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-11-28 05:22:52,764 INFO L124 PetriNetUnfolderBase]: 4048/6490 cut-off events. [2024-11-28 05:22:52,764 INFO L125 PetriNetUnfolderBase]: For 1100/1100 co-relation queries the response was YES. [2024-11-28 05:22:52,794 INFO L83 FinitePrefix]: Finished finitePrefix Result has 13393 conditions, 6490 events. 4048/6490 cut-off events. For 1100/1100 co-relation queries the response was YES. Maximal size of possible extension queue 721. Compared 53383 event pairs, 3658 based on Foata normal form. 0/4392 useless extension candidates. Maximal degree in co-relation 13381. Up to 5819 conditions per place. [2024-11-28 05:22:52,830 INFO L140 encePairwiseOnDemand]: 93/101 looper letters, 33 selfloop transitions, 1 changer transitions 0/50 dead transitions. [2024-11-28 05:22:52,830 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 59 places, 50 transitions, 194 flow [2024-11-28 05:22:52,831 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-11-28 05:22:52,832 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2024-11-28 05:22:52,832 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 97 transitions. [2024-11-28 05:22:52,833 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.3201320132013201 [2024-11-28 05:22:52,833 INFO L175 Difference]: Start difference. First operand has 64 places, 57 transitions, 140 flow. Second operand 3 states and 97 transitions. [2024-11-28 05:22:52,833 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 59 places, 50 transitions, 194 flow [2024-11-28 05:22:52,835 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 57 places, 50 transitions, 188 flow, removed 0 selfloop flow, removed 2 redundant places. [2024-11-28 05:22:52,837 INFO L231 Difference]: Finished difference. Result has 57 places, 50 transitions, 122 flow [2024-11-28 05:22:52,837 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=101, PETRI_DIFFERENCE_MINUEND_FLOW=120, PETRI_DIFFERENCE_MINUEND_PLACES=55, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=50, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=1, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=49, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=122, PETRI_PLACES=57, PETRI_TRANSITIONS=50} [2024-11-28 05:22:52,838 INFO L279 CegarLoopForPetriNet]: 79 programPoint places, -22 predicate places. [2024-11-28 05:22:52,838 INFO L471 AbstractCegarLoop]: Abstraction has has 57 places, 50 transitions, 122 flow [2024-11-28 05:22:52,839 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 21.0) internal successors, (63), 3 states have internal predecessors, (63), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-28 05:22:52,839 INFO L198 CegarLoopForPetriNet]: Found error trace [2024-11-28 05:22:52,839 INFO L206 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1] [2024-11-28 05:22:52,852 INFO L552 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_8dc03989-dd1e-4552-8a40-46136af171cd/bin/uautomizer-verify-aQ6SnzHsRB/z3 -smt2 -in SMTLIB2_COMPLIANT=true (3)] Ended with exit code 0 [2024-11-28 05:22:53,039 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 3 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_8dc03989-dd1e-4552-8a40-46136af171cd/bin/uautomizer-verify-aQ6SnzHsRB/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-11-28 05:22:53,040 INFO L396 AbstractCegarLoop]: === Iteration 3 === Targeting P1Err2REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [P1Err0ASSERT_VIOLATIONMEMORY_LEAK, P1Err1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, P1Err2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 58 more)] === [2024-11-28 05:22:53,041 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-28 05:22:53,041 INFO L85 PathProgramCache]: Analyzing trace with hash 1457217473, now seen corresponding path program 1 times [2024-11-28 05:22:53,042 INFO L118 FreeRefinementEngine]: Executing refinement strategy FOX [2024-11-28 05:22:53,042 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleZ3 [46711392] [2024-11-28 05:22:53,042 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-28 05:22:53,042 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-11-28 05:22:53,042 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_8dc03989-dd1e-4552-8a40-46136af171cd/bin/uautomizer-verify-aQ6SnzHsRB/z3 [2024-11-28 05:22:53,045 INFO L229 MonitoredProcess]: Starting monitored process 4 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_8dc03989-dd1e-4552-8a40-46136af171cd/bin/uautomizer-verify-aQ6SnzHsRB/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2024-11-28 05:22:53,046 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_8dc03989-dd1e-4552-8a40-46136af171cd/bin/uautomizer-verify-aQ6SnzHsRB/z3 -smt2 -in SMTLIB2_COMPLIANT=true (4)] Waiting until timeout for monitored process [2024-11-28 05:22:53,263 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-28 05:22:53,265 INFO L256 TraceCheckSpWp]: Trace formula consists of 95 conjuncts, 4 conjuncts are in the unsatisfiable core [2024-11-28 05:22:53,267 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2024-11-28 05:22:53,417 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-28 05:22:53,417 INFO L308 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2024-11-28 05:22:53,417 INFO L136 FreeRefinementEngine]: Strategy FOX found an infeasible trace [2024-11-28 05:22:53,418 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [46711392] [2024-11-28 05:22:53,418 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [46711392] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-28 05:22:53,418 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-28 05:22:53,418 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [1] imperfect sequences [] total 1 [2024-11-28 05:22:53,418 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1323818733] [2024-11-28 05:22:53,418 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-28 05:22:53,419 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2024-11-28 05:22:53,419 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy FOX [2024-11-28 05:22:53,419 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-11-28 05:22:53,420 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-11-28 05:22:53,420 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 19 out of 101 [2024-11-28 05:22:53,422 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 57 places, 50 transitions, 122 flow. Second operand has 3 states, 3 states have (on average 21.0) internal successors, (63), 3 states have internal predecessors, (63), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-28 05:22:53,422 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-11-28 05:22:53,422 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 19 of 101 [2024-11-28 05:22:53,422 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-11-28 05:22:54,116 INFO L124 PetriNetUnfolderBase]: 1238/2098 cut-off events. [2024-11-28 05:22:54,117 INFO L125 PetriNetUnfolderBase]: For 178/178 co-relation queries the response was YES. [2024-11-28 05:22:54,122 INFO L83 FinitePrefix]: Finished finitePrefix Result has 4313 conditions, 2098 events. 1238/2098 cut-off events. For 178/178 co-relation queries the response was YES. Maximal size of possible extension queue 208. Compared 14997 event pairs, 1040 based on Foata normal form. 88/1856 useless extension candidates. Maximal degree in co-relation 4305. Up to 1809 conditions per place. [2024-11-28 05:22:54,132 INFO L140 encePairwiseOnDemand]: 93/101 looper letters, 25 selfloop transitions, 1 changer transitions 1/43 dead transitions. [2024-11-28 05:22:54,132 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 52 places, 43 transitions, 162 flow [2024-11-28 05:22:54,133 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-11-28 05:22:54,133 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2024-11-28 05:22:54,134 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 90 transitions. [2024-11-28 05:22:54,134 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.297029702970297 [2024-11-28 05:22:54,136 INFO L175 Difference]: Start difference. First operand has 57 places, 50 transitions, 122 flow. Second operand 3 states and 90 transitions. [2024-11-28 05:22:54,137 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 52 places, 43 transitions, 162 flow [2024-11-28 05:22:54,138 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 51 places, 43 transitions, 161 flow, removed 0 selfloop flow, removed 1 redundant places. [2024-11-28 05:22:54,138 INFO L231 Difference]: Finished difference. Result has 51 places, 42 transitions, 107 flow [2024-11-28 05:22:54,139 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=101, PETRI_DIFFERENCE_MINUEND_FLOW=107, PETRI_DIFFERENCE_MINUEND_PLACES=49, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=43, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=1, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=42, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=107, PETRI_PLACES=51, PETRI_TRANSITIONS=42} [2024-11-28 05:22:54,139 INFO L279 CegarLoopForPetriNet]: 79 programPoint places, -28 predicate places. [2024-11-28 05:22:54,139 INFO L471 AbstractCegarLoop]: Abstraction has has 51 places, 42 transitions, 107 flow [2024-11-28 05:22:54,140 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 21.0) internal successors, (63), 3 states have internal predecessors, (63), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-28 05:22:54,140 INFO L198 CegarLoopForPetriNet]: Found error trace [2024-11-28 05:22:54,140 INFO L206 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-28 05:22:54,154 INFO L552 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_8dc03989-dd1e-4552-8a40-46136af171cd/bin/uautomizer-verify-aQ6SnzHsRB/z3 -smt2 -in SMTLIB2_COMPLIANT=true (4)] Ended with exit code 0 [2024-11-28 05:22:54,344 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 4 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_8dc03989-dd1e-4552-8a40-46136af171cd/bin/uautomizer-verify-aQ6SnzHsRB/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-11-28 05:22:54,345 INFO L396 AbstractCegarLoop]: === Iteration 4 === Targeting ULTIMATE.startErr4REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [P1Err0ASSERT_VIOLATIONMEMORY_LEAK, P1Err1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, P1Err2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 58 more)] === [2024-11-28 05:22:54,345 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-28 05:22:54,345 INFO L85 PathProgramCache]: Analyzing trace with hash 781327504, now seen corresponding path program 1 times [2024-11-28 05:22:54,346 INFO L118 FreeRefinementEngine]: Executing refinement strategy FOX [2024-11-28 05:22:54,346 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleZ3 [269858832] [2024-11-28 05:22:54,346 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-28 05:22:54,346 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-11-28 05:22:54,346 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_8dc03989-dd1e-4552-8a40-46136af171cd/bin/uautomizer-verify-aQ6SnzHsRB/z3 [2024-11-28 05:22:54,349 INFO L229 MonitoredProcess]: Starting monitored process 5 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_8dc03989-dd1e-4552-8a40-46136af171cd/bin/uautomizer-verify-aQ6SnzHsRB/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2024-11-28 05:22:54,351 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_8dc03989-dd1e-4552-8a40-46136af171cd/bin/uautomizer-verify-aQ6SnzHsRB/z3 -smt2 -in SMTLIB2_COMPLIANT=true (5)] Waiting until timeout for monitored process [2024-11-28 05:22:54,561 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-28 05:22:54,563 INFO L256 TraceCheckSpWp]: Trace formula consists of 106 conjuncts, 2 conjuncts are in the unsatisfiable core [2024-11-28 05:22:54,565 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2024-11-28 05:22:54,607 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-28 05:22:54,607 INFO L308 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2024-11-28 05:22:54,608 INFO L136 FreeRefinementEngine]: Strategy FOX found an infeasible trace [2024-11-28 05:22:54,608 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [269858832] [2024-11-28 05:22:54,608 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [269858832] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-28 05:22:54,608 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-28 05:22:54,608 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [1] imperfect sequences [] total 1 [2024-11-28 05:22:54,608 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [396732032] [2024-11-28 05:22:54,608 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-28 05:22:54,608 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2024-11-28 05:22:54,609 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy FOX [2024-11-28 05:22:54,609 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-11-28 05:22:54,609 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-11-28 05:22:54,609 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 19 out of 101 [2024-11-28 05:22:54,610 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 51 places, 42 transitions, 107 flow. Second operand has 3 states, 3 states have (on average 22.333333333333332) internal successors, (67), 3 states have internal predecessors, (67), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-28 05:22:54,610 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-11-28 05:22:54,610 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 19 of 101 [2024-11-28 05:22:54,610 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-11-28 05:22:55,202 INFO L124 PetriNetUnfolderBase]: 1051/1839 cut-off events. [2024-11-28 05:22:55,203 INFO L125 PetriNetUnfolderBase]: For 128/128 co-relation queries the response was YES. [2024-11-28 05:22:55,208 INFO L83 FinitePrefix]: Finished finitePrefix Result has 3712 conditions, 1839 events. 1051/1839 cut-off events. For 128/128 co-relation queries the response was YES. Maximal size of possible extension queue 191. Compared 12906 event pairs, 151 based on Foata normal form. 0/1603 useless extension candidates. Maximal degree in co-relation 3703. Up to 1377 conditions per place. [2024-11-28 05:22:55,217 INFO L140 encePairwiseOnDemand]: 94/101 looper letters, 31 selfloop transitions, 6 changer transitions 0/53 dead transitions. [2024-11-28 05:22:55,218 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 52 places, 53 transitions, 205 flow [2024-11-28 05:22:55,218 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-11-28 05:22:55,218 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2024-11-28 05:22:55,219 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 95 transitions. [2024-11-28 05:22:55,221 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.31353135313531355 [2024-11-28 05:22:55,223 INFO L175 Difference]: Start difference. First operand has 51 places, 42 transitions, 107 flow. Second operand 3 states and 95 transitions. [2024-11-28 05:22:55,223 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 52 places, 53 transitions, 205 flow [2024-11-28 05:22:55,224 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 51 places, 53 transitions, 204 flow, removed 0 selfloop flow, removed 1 redundant places. [2024-11-28 05:22:55,225 INFO L231 Difference]: Finished difference. Result has 52 places, 42 transitions, 128 flow [2024-11-28 05:22:55,226 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=101, PETRI_DIFFERENCE_MINUEND_FLOW=106, PETRI_DIFFERENCE_MINUEND_PLACES=49, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=42, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=6, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=36, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=128, PETRI_PLACES=52, PETRI_TRANSITIONS=42} [2024-11-28 05:22:55,227 INFO L279 CegarLoopForPetriNet]: 79 programPoint places, -27 predicate places. [2024-11-28 05:22:55,228 INFO L471 AbstractCegarLoop]: Abstraction has has 52 places, 42 transitions, 128 flow [2024-11-28 05:22:55,229 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 22.333333333333332) internal successors, (67), 3 states have internal predecessors, (67), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-28 05:22:55,229 INFO L198 CegarLoopForPetriNet]: Found error trace [2024-11-28 05:22:55,229 INFO L206 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-28 05:22:55,242 INFO L552 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_8dc03989-dd1e-4552-8a40-46136af171cd/bin/uautomizer-verify-aQ6SnzHsRB/z3 -smt2 -in SMTLIB2_COMPLIANT=true (5)] Ended with exit code 0 [2024-11-28 05:22:55,429 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 5 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_8dc03989-dd1e-4552-8a40-46136af171cd/bin/uautomizer-verify-aQ6SnzHsRB/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-11-28 05:22:55,430 INFO L396 AbstractCegarLoop]: === Iteration 5 === Targeting ULTIMATE.startErr5REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [P1Err0ASSERT_VIOLATIONMEMORY_LEAK, P1Err1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, P1Err2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 58 more)] === [2024-11-28 05:22:55,431 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-28 05:22:55,432 INFO L85 PathProgramCache]: Analyzing trace with hash -763413856, now seen corresponding path program 1 times [2024-11-28 05:22:55,432 INFO L118 FreeRefinementEngine]: Executing refinement strategy FOX [2024-11-28 05:22:55,435 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleZ3 [1740968495] [2024-11-28 05:22:55,436 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-28 05:22:55,436 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-11-28 05:22:55,436 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_8dc03989-dd1e-4552-8a40-46136af171cd/bin/uautomizer-verify-aQ6SnzHsRB/z3 [2024-11-28 05:22:55,442 INFO L229 MonitoredProcess]: Starting monitored process 6 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_8dc03989-dd1e-4552-8a40-46136af171cd/bin/uautomizer-verify-aQ6SnzHsRB/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2024-11-28 05:22:55,445 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_8dc03989-dd1e-4552-8a40-46136af171cd/bin/uautomizer-verify-aQ6SnzHsRB/z3 -smt2 -in SMTLIB2_COMPLIANT=true (6)] Waiting until timeout for monitored process [2024-11-28 05:22:55,665 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-28 05:22:55,668 INFO L256 TraceCheckSpWp]: Trace formula consists of 135 conjuncts, 6 conjuncts are in the unsatisfiable core [2024-11-28 05:22:55,670 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2024-11-28 05:22:55,926 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-28 05:22:55,927 INFO L308 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2024-11-28 05:22:55,927 INFO L136 FreeRefinementEngine]: Strategy FOX found an infeasible trace [2024-11-28 05:22:55,927 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1740968495] [2024-11-28 05:22:55,927 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1740968495] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-28 05:22:55,927 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-28 05:22:55,928 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2024-11-28 05:22:55,928 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1151684159] [2024-11-28 05:22:55,928 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-28 05:22:55,928 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2024-11-28 05:22:55,929 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy FOX [2024-11-28 05:22:55,929 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2024-11-28 05:22:55,930 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2024-11-28 05:22:55,930 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 19 out of 101 [2024-11-28 05:22:55,931 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 52 places, 42 transitions, 128 flow. Second operand has 4 states, 4 states have (on average 21.75) internal successors, (87), 4 states have internal predecessors, (87), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-28 05:22:55,931 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-11-28 05:22:55,931 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 19 of 101 [2024-11-28 05:22:55,931 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-11-28 05:22:56,761 INFO L124 PetriNetUnfolderBase]: 972/1718 cut-off events. [2024-11-28 05:22:56,761 INFO L125 PetriNetUnfolderBase]: For 278/278 co-relation queries the response was YES. [2024-11-28 05:22:56,767 INFO L83 FinitePrefix]: Finished finitePrefix Result has 3924 conditions, 1718 events. 972/1718 cut-off events. For 278/278 co-relation queries the response was YES. Maximal size of possible extension queue 173. Compared 11856 event pairs, 123 based on Foata normal form. 0/1566 useless extension candidates. Maximal degree in co-relation 3913. Up to 1255 conditions per place. [2024-11-28 05:22:56,778 INFO L140 encePairwiseOnDemand]: 95/101 looper letters, 30 selfloop transitions, 6 changer transitions 0/52 dead transitions. [2024-11-28 05:22:56,778 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 54 places, 52 transitions, 220 flow [2024-11-28 05:22:56,778 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2024-11-28 05:22:56,779 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 4 states. [2024-11-28 05:22:56,780 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 112 transitions. [2024-11-28 05:22:56,782 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.27722772277227725 [2024-11-28 05:22:56,782 INFO L175 Difference]: Start difference. First operand has 52 places, 42 transitions, 128 flow. Second operand 4 states and 112 transitions. [2024-11-28 05:22:56,782 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 54 places, 52 transitions, 220 flow [2024-11-28 05:22:56,784 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 52 places, 52 transitions, 208 flow, removed 0 selfloop flow, removed 2 redundant places. [2024-11-28 05:22:56,787 INFO L231 Difference]: Finished difference. Result has 52 places, 41 transitions, 124 flow [2024-11-28 05:22:56,788 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=101, PETRI_DIFFERENCE_MINUEND_FLOW=112, PETRI_DIFFERENCE_MINUEND_PLACES=49, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=41, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=6, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=35, PETRI_DIFFERENCE_SUBTRAHEND_STATES=4, PETRI_FLOW=124, PETRI_PLACES=52, PETRI_TRANSITIONS=41} [2024-11-28 05:22:56,789 INFO L279 CegarLoopForPetriNet]: 79 programPoint places, -27 predicate places. [2024-11-28 05:22:56,790 INFO L471 AbstractCegarLoop]: Abstraction has has 52 places, 41 transitions, 124 flow [2024-11-28 05:22:56,791 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 21.75) internal successors, (87), 4 states have internal predecessors, (87), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-28 05:22:56,791 INFO L198 CegarLoopForPetriNet]: Found error trace [2024-11-28 05:22:56,791 INFO L206 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-28 05:22:56,806 INFO L540 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_8dc03989-dd1e-4552-8a40-46136af171cd/bin/uautomizer-verify-aQ6SnzHsRB/z3 -smt2 -in SMTLIB2_COMPLIANT=true (6)] Forceful destruction successful, exit code 0 [2024-11-28 05:22:56,992 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 6 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_8dc03989-dd1e-4552-8a40-46136af171cd/bin/uautomizer-verify-aQ6SnzHsRB/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-11-28 05:22:56,992 INFO L396 AbstractCegarLoop]: === Iteration 6 === Targeting ULTIMATE.startErr4REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [P1Err0ASSERT_VIOLATIONMEMORY_LEAK, P1Err1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, P1Err2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 58 more)] === [2024-11-28 05:22:56,993 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-28 05:22:56,993 INFO L85 PathProgramCache]: Analyzing trace with hash -151894119, now seen corresponding path program 1 times [2024-11-28 05:22:56,994 INFO L118 FreeRefinementEngine]: Executing refinement strategy FOX [2024-11-28 05:22:56,994 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleZ3 [289798435] [2024-11-28 05:22:56,994 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-28 05:22:56,994 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-11-28 05:22:56,994 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_8dc03989-dd1e-4552-8a40-46136af171cd/bin/uautomizer-verify-aQ6SnzHsRB/z3 [2024-11-28 05:22:56,996 INFO L229 MonitoredProcess]: Starting monitored process 7 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_8dc03989-dd1e-4552-8a40-46136af171cd/bin/uautomizer-verify-aQ6SnzHsRB/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2024-11-28 05:22:56,998 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_8dc03989-dd1e-4552-8a40-46136af171cd/bin/uautomizer-verify-aQ6SnzHsRB/z3 -smt2 -in SMTLIB2_COMPLIANT=true (7)] Waiting until timeout for monitored process [2024-11-28 05:22:57,216 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-28 05:22:57,219 INFO L256 TraceCheckSpWp]: Trace formula consists of 135 conjuncts, 4 conjuncts are in the unsatisfiable core [2024-11-28 05:22:57,221 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2024-11-28 05:22:57,366 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-28 05:22:57,366 INFO L308 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2024-11-28 05:22:57,366 INFO L136 FreeRefinementEngine]: Strategy FOX found an infeasible trace [2024-11-28 05:22:57,367 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [289798435] [2024-11-28 05:22:57,367 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [289798435] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-28 05:22:57,367 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-28 05:22:57,367 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2024-11-28 05:22:57,367 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [417344848] [2024-11-28 05:22:57,367 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-28 05:22:57,368 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2024-11-28 05:22:57,368 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy FOX [2024-11-28 05:22:57,369 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2024-11-28 05:22:57,369 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2024-11-28 05:22:57,375 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 19 out of 101 [2024-11-28 05:22:57,375 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 52 places, 41 transitions, 124 flow. Second operand has 4 states, 4 states have (on average 21.75) internal successors, (87), 4 states have internal predecessors, (87), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-28 05:22:57,375 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-11-28 05:22:57,376 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 19 of 101 [2024-11-28 05:22:57,376 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-11-28 05:22:58,123 INFO L124 PetriNetUnfolderBase]: 893/1597 cut-off events. [2024-11-28 05:22:58,124 INFO L125 PetriNetUnfolderBase]: For 272/272 co-relation queries the response was YES. [2024-11-28 05:22:58,128 INFO L83 FinitePrefix]: Finished finitePrefix Result has 3634 conditions, 1597 events. 893/1597 cut-off events. For 272/272 co-relation queries the response was YES. Maximal size of possible extension queue 155. Compared 10813 event pairs, 95 based on Foata normal form. 42/1487 useless extension candidates. Maximal degree in co-relation 3623. Up to 1134 conditions per place. [2024-11-28 05:22:58,136 INFO L140 encePairwiseOnDemand]: 95/101 looper letters, 29 selfloop transitions, 6 changer transitions 0/51 dead transitions. [2024-11-28 05:22:58,137 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 54 places, 51 transitions, 214 flow [2024-11-28 05:22:58,137 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2024-11-28 05:22:58,138 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 4 states. [2024-11-28 05:22:58,138 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 111 transitions. [2024-11-28 05:22:58,139 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.2747524752475248 [2024-11-28 05:22:58,139 INFO L175 Difference]: Start difference. First operand has 52 places, 41 transitions, 124 flow. Second operand 4 states and 111 transitions. [2024-11-28 05:22:58,139 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 54 places, 51 transitions, 214 flow [2024-11-28 05:22:58,141 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 51 places, 51 transitions, 201 flow, removed 0 selfloop flow, removed 3 redundant places. [2024-11-28 05:22:58,142 INFO L231 Difference]: Finished difference. Result has 51 places, 40 transitions, 119 flow [2024-11-28 05:22:58,143 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=101, PETRI_DIFFERENCE_MINUEND_FLOW=107, PETRI_DIFFERENCE_MINUEND_PLACES=48, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=40, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=6, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=34, PETRI_DIFFERENCE_SUBTRAHEND_STATES=4, PETRI_FLOW=119, PETRI_PLACES=51, PETRI_TRANSITIONS=40} [2024-11-28 05:22:58,144 INFO L279 CegarLoopForPetriNet]: 79 programPoint places, -28 predicate places. [2024-11-28 05:22:58,144 INFO L471 AbstractCegarLoop]: Abstraction has has 51 places, 40 transitions, 119 flow [2024-11-28 05:22:58,145 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 21.75) internal successors, (87), 4 states have internal predecessors, (87), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-28 05:22:58,145 INFO L198 CegarLoopForPetriNet]: Found error trace [2024-11-28 05:22:58,145 INFO L206 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-28 05:22:58,158 INFO L552 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_8dc03989-dd1e-4552-8a40-46136af171cd/bin/uautomizer-verify-aQ6SnzHsRB/z3 -smt2 -in SMTLIB2_COMPLIANT=true (7)] Ended with exit code 0 [2024-11-28 05:22:58,346 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 7 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_8dc03989-dd1e-4552-8a40-46136af171cd/bin/uautomizer-verify-aQ6SnzHsRB/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-11-28 05:22:58,346 INFO L396 AbstractCegarLoop]: === Iteration 7 === Targeting ULTIMATE.startErr7ASSERT_VIOLATIONMEMORY_LEAK === [P1Err0ASSERT_VIOLATIONMEMORY_LEAK, P1Err1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, P1Err2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 58 more)] === [2024-11-28 05:22:58,347 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-28 05:22:58,347 INFO L85 PathProgramCache]: Analyzing trace with hash 700218234, now seen corresponding path program 1 times [2024-11-28 05:22:58,347 INFO L118 FreeRefinementEngine]: Executing refinement strategy FOX [2024-11-28 05:22:58,348 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleZ3 [1774904222] [2024-11-28 05:22:58,348 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-28 05:22:58,348 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-11-28 05:22:58,348 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_8dc03989-dd1e-4552-8a40-46136af171cd/bin/uautomizer-verify-aQ6SnzHsRB/z3 [2024-11-28 05:22:58,352 INFO L229 MonitoredProcess]: Starting monitored process 8 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_8dc03989-dd1e-4552-8a40-46136af171cd/bin/uautomizer-verify-aQ6SnzHsRB/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2024-11-28 05:22:58,355 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_8dc03989-dd1e-4552-8a40-46136af171cd/bin/uautomizer-verify-aQ6SnzHsRB/z3 -smt2 -in SMTLIB2_COMPLIANT=true (8)] Waiting until timeout for monitored process [2024-11-28 05:22:58,542 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-28 05:22:58,545 INFO L256 TraceCheckSpWp]: Trace formula consists of 110 conjuncts, 2 conjuncts are in the unsatisfiable core [2024-11-28 05:22:58,547 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2024-11-28 05:22:58,598 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-28 05:22:58,598 INFO L308 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2024-11-28 05:22:58,599 INFO L136 FreeRefinementEngine]: Strategy FOX found an infeasible trace [2024-11-28 05:22:58,599 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1774904222] [2024-11-28 05:22:58,599 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1774904222] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-28 05:22:58,599 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-28 05:22:58,599 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [1] imperfect sequences [] total 1 [2024-11-28 05:22:58,599 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2055962914] [2024-11-28 05:22:58,599 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-28 05:22:58,599 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2024-11-28 05:22:58,600 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy FOX [2024-11-28 05:22:58,600 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-11-28 05:22:58,600 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-11-28 05:22:58,604 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 18 out of 101 [2024-11-28 05:22:58,605 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 51 places, 40 transitions, 119 flow. Second operand has 3 states, 3 states have (on average 22.333333333333332) internal successors, (67), 3 states have internal predecessors, (67), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-28 05:22:58,605 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-11-28 05:22:58,605 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 18 of 101 [2024-11-28 05:22:58,605 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-11-28 05:22:59,036 INFO L124 PetriNetUnfolderBase]: 893/1553 cut-off events. [2024-11-28 05:22:59,037 INFO L125 PetriNetUnfolderBase]: For 258/258 co-relation queries the response was YES. [2024-11-28 05:22:59,040 INFO L83 FinitePrefix]: Finished finitePrefix Result has 3589 conditions, 1553 events. 893/1553 cut-off events. For 258/258 co-relation queries the response was YES. Maximal size of possible extension queue 152. Compared 10686 event pairs, 749 based on Foata normal form. 50/1427 useless extension candidates. Maximal degree in co-relation 3579. Up to 1314 conditions per place. [2024-11-28 05:22:59,047 INFO L140 encePairwiseOnDemand]: 99/101 looper letters, 22 selfloop transitions, 1 changer transitions 1/39 dead transitions. [2024-11-28 05:22:59,047 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 52 places, 39 transitions, 165 flow [2024-11-28 05:22:59,048 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-11-28 05:22:59,048 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2024-11-28 05:22:59,049 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 78 transitions. [2024-11-28 05:22:59,049 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.25742574257425743 [2024-11-28 05:22:59,049 INFO L175 Difference]: Start difference. First operand has 51 places, 40 transitions, 119 flow. Second operand 3 states and 78 transitions. [2024-11-28 05:22:59,049 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 52 places, 39 transitions, 165 flow [2024-11-28 05:22:59,051 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 50 places, 39 transitions, 158 flow, removed 0 selfloop flow, removed 2 redundant places. [2024-11-28 05:22:59,053 INFO L231 Difference]: Finished difference. Result has 50 places, 38 transitions, 110 flow [2024-11-28 05:22:59,053 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=101, PETRI_DIFFERENCE_MINUEND_FLOW=110, PETRI_DIFFERENCE_MINUEND_PLACES=48, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=39, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=1, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=38, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=110, PETRI_PLACES=50, PETRI_TRANSITIONS=38} [2024-11-28 05:22:59,055 INFO L279 CegarLoopForPetriNet]: 79 programPoint places, -29 predicate places. [2024-11-28 05:22:59,055 INFO L471 AbstractCegarLoop]: Abstraction has has 50 places, 38 transitions, 110 flow [2024-11-28 05:22:59,055 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 22.333333333333332) internal successors, (67), 3 states have internal predecessors, (67), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-28 05:22:59,055 INFO L198 CegarLoopForPetriNet]: Found error trace [2024-11-28 05:22:59,055 INFO L206 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-28 05:22:59,068 INFO L540 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_8dc03989-dd1e-4552-8a40-46136af171cd/bin/uautomizer-verify-aQ6SnzHsRB/z3 -smt2 -in SMTLIB2_COMPLIANT=true (8)] Forceful destruction successful, exit code 0 [2024-11-28 05:22:59,256 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 8 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_8dc03989-dd1e-4552-8a40-46136af171cd/bin/uautomizer-verify-aQ6SnzHsRB/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-11-28 05:22:59,257 INFO L396 AbstractCegarLoop]: === Iteration 8 === Targeting ULTIMATE.startErr6ASSERT_VIOLATIONMEMORY_LEAK === [P1Err0ASSERT_VIOLATIONMEMORY_LEAK, P1Err1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, P1Err2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 58 more)] === [2024-11-28 05:22:59,257 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-28 05:22:59,257 INFO L85 PathProgramCache]: Analyzing trace with hash 700219493, now seen corresponding path program 1 times [2024-11-28 05:22:59,258 INFO L118 FreeRefinementEngine]: Executing refinement strategy FOX [2024-11-28 05:22:59,258 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleZ3 [1662560654] [2024-11-28 05:22:59,258 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-28 05:22:59,258 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-11-28 05:22:59,258 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_8dc03989-dd1e-4552-8a40-46136af171cd/bin/uautomizer-verify-aQ6SnzHsRB/z3 [2024-11-28 05:22:59,263 INFO L229 MonitoredProcess]: Starting monitored process 9 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_8dc03989-dd1e-4552-8a40-46136af171cd/bin/uautomizer-verify-aQ6SnzHsRB/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2024-11-28 05:22:59,270 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_8dc03989-dd1e-4552-8a40-46136af171cd/bin/uautomizer-verify-aQ6SnzHsRB/z3 -smt2 -in SMTLIB2_COMPLIANT=true (9)] Waiting until timeout for monitored process [2024-11-28 05:22:59,454 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-28 05:22:59,458 INFO L256 TraceCheckSpWp]: Trace formula consists of 110 conjuncts, 3 conjuncts are in the unsatisfiable core [2024-11-28 05:22:59,459 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2024-11-28 05:22:59,495 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-28 05:22:59,496 INFO L308 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2024-11-28 05:22:59,496 INFO L136 FreeRefinementEngine]: Strategy FOX found an infeasible trace [2024-11-28 05:22:59,496 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1662560654] [2024-11-28 05:22:59,496 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1662560654] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-28 05:22:59,496 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-28 05:22:59,496 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2024-11-28 05:22:59,497 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [378199921] [2024-11-28 05:22:59,497 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-28 05:22:59,497 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2024-11-28 05:22:59,497 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy FOX [2024-11-28 05:22:59,498 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2024-11-28 05:22:59,498 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2024-11-28 05:22:59,512 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 15 out of 101 [2024-11-28 05:22:59,513 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 50 places, 38 transitions, 110 flow. Second operand has 4 states, 4 states have (on average 18.25) internal successors, (73), 4 states have internal predecessors, (73), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-28 05:22:59,513 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-11-28 05:22:59,513 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 15 of 101 [2024-11-28 05:22:59,513 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-11-28 05:23:00,427 INFO L124 PetriNetUnfolderBase]: 2336/3742 cut-off events. [2024-11-28 05:23:00,428 INFO L125 PetriNetUnfolderBase]: For 239/239 co-relation queries the response was YES. [2024-11-28 05:23:00,434 INFO L83 FinitePrefix]: Finished finitePrefix Result has 8528 conditions, 3742 events. 2336/3742 cut-off events. For 239/239 co-relation queries the response was YES. Maximal size of possible extension queue 275. Compared 23636 event pairs, 188 based on Foata normal form. 123/3570 useless extension candidates. Maximal degree in co-relation 8518. Up to 2251 conditions per place. [2024-11-28 05:23:00,448 INFO L140 encePairwiseOnDemand]: 95/101 looper letters, 52 selfloop transitions, 5 changer transitions 1/69 dead transitions. [2024-11-28 05:23:00,448 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 52 places, 69 transitions, 336 flow [2024-11-28 05:23:00,449 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2024-11-28 05:23:00,449 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 4 states. [2024-11-28 05:23:00,450 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 117 transitions. [2024-11-28 05:23:00,450 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.2896039603960396 [2024-11-28 05:23:00,450 INFO L175 Difference]: Start difference. First operand has 50 places, 38 transitions, 110 flow. Second operand 4 states and 117 transitions. [2024-11-28 05:23:00,450 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 52 places, 69 transitions, 336 flow [2024-11-28 05:23:00,451 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 51 places, 69 transitions, 335 flow, removed 0 selfloop flow, removed 1 redundant places. [2024-11-28 05:23:00,452 INFO L231 Difference]: Finished difference. Result has 53 places, 41 transitions, 143 flow [2024-11-28 05:23:00,453 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=101, PETRI_DIFFERENCE_MINUEND_FLOW=109, PETRI_DIFFERENCE_MINUEND_PLACES=48, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=38, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=2, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=33, PETRI_DIFFERENCE_SUBTRAHEND_STATES=4, PETRI_FLOW=143, PETRI_PLACES=53, PETRI_TRANSITIONS=41} [2024-11-28 05:23:00,454 INFO L279 CegarLoopForPetriNet]: 79 programPoint places, -26 predicate places. [2024-11-28 05:23:00,454 INFO L471 AbstractCegarLoop]: Abstraction has has 53 places, 41 transitions, 143 flow [2024-11-28 05:23:00,454 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 18.25) internal successors, (73), 4 states have internal predecessors, (73), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-28 05:23:00,455 INFO L198 CegarLoopForPetriNet]: Found error trace [2024-11-28 05:23:00,455 INFO L206 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-28 05:23:00,468 INFO L552 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_8dc03989-dd1e-4552-8a40-46136af171cd/bin/uautomizer-verify-aQ6SnzHsRB/z3 -smt2 -in SMTLIB2_COMPLIANT=true (9)] Ended with exit code 0 [2024-11-28 05:23:00,659 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 9 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_8dc03989-dd1e-4552-8a40-46136af171cd/bin/uautomizer-verify-aQ6SnzHsRB/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-11-28 05:23:00,659 INFO L396 AbstractCegarLoop]: === Iteration 9 === Targeting ULTIMATE.startErr6ASSERT_VIOLATIONMEMORY_LEAK === [P1Err0ASSERT_VIOLATIONMEMORY_LEAK, P1Err1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, P1Err2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 58 more)] === [2024-11-28 05:23:00,660 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-28 05:23:00,660 INFO L85 PathProgramCache]: Analyzing trace with hash -881489896, now seen corresponding path program 1 times [2024-11-28 05:23:00,660 INFO L118 FreeRefinementEngine]: Executing refinement strategy FOX [2024-11-28 05:23:00,660 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleZ3 [1776970681] [2024-11-28 05:23:00,660 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-28 05:23:00,660 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-11-28 05:23:00,660 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_8dc03989-dd1e-4552-8a40-46136af171cd/bin/uautomizer-verify-aQ6SnzHsRB/z3 [2024-11-28 05:23:00,666 INFO L229 MonitoredProcess]: Starting monitored process 10 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_8dc03989-dd1e-4552-8a40-46136af171cd/bin/uautomizer-verify-aQ6SnzHsRB/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2024-11-28 05:23:00,667 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_8dc03989-dd1e-4552-8a40-46136af171cd/bin/uautomizer-verify-aQ6SnzHsRB/z3 -smt2 -in SMTLIB2_COMPLIANT=true (10)] Waiting until timeout for monitored process [2024-11-28 05:23:00,862 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-28 05:23:00,865 INFO L256 TraceCheckSpWp]: Trace formula consists of 116 conjuncts, 4 conjuncts are in the unsatisfiable core [2024-11-28 05:23:00,867 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2024-11-28 05:23:00,930 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-28 05:23:00,931 INFO L308 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2024-11-28 05:23:00,931 INFO L136 FreeRefinementEngine]: Strategy FOX found an infeasible trace [2024-11-28 05:23:00,931 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1776970681] [2024-11-28 05:23:00,932 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1776970681] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-28 05:23:00,933 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-28 05:23:00,933 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2024-11-28 05:23:00,933 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [992096745] [2024-11-28 05:23:00,933 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-28 05:23:00,933 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2024-11-28 05:23:00,934 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy FOX [2024-11-28 05:23:00,934 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2024-11-28 05:23:00,934 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2024-11-28 05:23:00,954 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 15 out of 101 [2024-11-28 05:23:00,955 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 53 places, 41 transitions, 143 flow. Second operand has 5 states, 5 states have (on average 17.8) internal successors, (89), 5 states have internal predecessors, (89), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-28 05:23:00,955 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-11-28 05:23:00,955 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 15 of 101 [2024-11-28 05:23:00,955 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-11-28 05:23:01,639 INFO L124 PetriNetUnfolderBase]: 1539/2518 cut-off events. [2024-11-28 05:23:01,639 INFO L125 PetriNetUnfolderBase]: For 748/748 co-relation queries the response was YES. [2024-11-28 05:23:01,645 INFO L83 FinitePrefix]: Finished finitePrefix Result has 6503 conditions, 2518 events. 1539/2518 cut-off events. For 748/748 co-relation queries the response was YES. Maximal size of possible extension queue 142. Compared 14328 event pairs, 71 based on Foata normal form. 110/2447 useless extension candidates. Maximal degree in co-relation 6490. Up to 1177 conditions per place. [2024-11-28 05:23:01,652 INFO L140 encePairwiseOnDemand]: 95/101 looper letters, 64 selfloop transitions, 8 changer transitions 1/84 dead transitions. [2024-11-28 05:23:01,652 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 57 places, 84 transitions, 454 flow [2024-11-28 05:23:01,652 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2024-11-28 05:23:01,653 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 5 states. [2024-11-28 05:23:01,655 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 148 transitions. [2024-11-28 05:23:01,655 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.29306930693069305 [2024-11-28 05:23:01,656 INFO L175 Difference]: Start difference. First operand has 53 places, 41 transitions, 143 flow. Second operand 5 states and 148 transitions. [2024-11-28 05:23:01,656 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 57 places, 84 transitions, 454 flow [2024-11-28 05:23:01,658 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 55 places, 84 transitions, 444 flow, removed 1 selfloop flow, removed 2 redundant places. [2024-11-28 05:23:01,663 INFO L231 Difference]: Finished difference. Result has 57 places, 44 transitions, 183 flow [2024-11-28 05:23:01,663 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=101, PETRI_DIFFERENCE_MINUEND_FLOW=135, PETRI_DIFFERENCE_MINUEND_PLACES=51, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=41, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=5, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=33, PETRI_DIFFERENCE_SUBTRAHEND_STATES=5, PETRI_FLOW=183, PETRI_PLACES=57, PETRI_TRANSITIONS=44} [2024-11-28 05:23:01,664 INFO L279 CegarLoopForPetriNet]: 79 programPoint places, -22 predicate places. [2024-11-28 05:23:01,668 INFO L471 AbstractCegarLoop]: Abstraction has has 57 places, 44 transitions, 183 flow [2024-11-28 05:23:01,668 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 17.8) internal successors, (89), 5 states have internal predecessors, (89), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-28 05:23:01,668 INFO L198 CegarLoopForPetriNet]: Found error trace [2024-11-28 05:23:01,668 INFO L206 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] [2024-11-28 05:23:01,690 INFO L552 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_8dc03989-dd1e-4552-8a40-46136af171cd/bin/uautomizer-verify-aQ6SnzHsRB/z3 -smt2 -in SMTLIB2_COMPLIANT=true (10)] Ended with exit code 0 [2024-11-28 05:23:01,868 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 10 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_8dc03989-dd1e-4552-8a40-46136af171cd/bin/uautomizer-verify-aQ6SnzHsRB/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-11-28 05:23:01,869 INFO L396 AbstractCegarLoop]: === Iteration 10 === Targeting ULTIMATE.startErr6ASSERT_VIOLATIONMEMORY_LEAK === [P1Err0ASSERT_VIOLATIONMEMORY_LEAK, P1Err1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, P1Err2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 58 more)] === [2024-11-28 05:23:01,869 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-28 05:23:01,869 INFO L85 PathProgramCache]: Analyzing trace with hash 1736490434, now seen corresponding path program 1 times [2024-11-28 05:23:01,870 INFO L118 FreeRefinementEngine]: Executing refinement strategy FOX [2024-11-28 05:23:01,870 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleZ3 [2073235627] [2024-11-28 05:23:01,870 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-28 05:23:01,870 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-11-28 05:23:01,870 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_8dc03989-dd1e-4552-8a40-46136af171cd/bin/uautomizer-verify-aQ6SnzHsRB/z3 [2024-11-28 05:23:01,872 INFO L229 MonitoredProcess]: Starting monitored process 11 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_8dc03989-dd1e-4552-8a40-46136af171cd/bin/uautomizer-verify-aQ6SnzHsRB/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2024-11-28 05:23:01,876 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_8dc03989-dd1e-4552-8a40-46136af171cd/bin/uautomizer-verify-aQ6SnzHsRB/z3 -smt2 -in SMTLIB2_COMPLIANT=true (11)] Waiting until timeout for monitored process [2024-11-28 05:23:02,085 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-28 05:23:02,088 INFO L256 TraceCheckSpWp]: Trace formula consists of 144 conjuncts, 5 conjuncts are in the unsatisfiable core [2024-11-28 05:23:02,090 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2024-11-28 05:23:02,176 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-28 05:23:02,176 INFO L308 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2024-11-28 05:23:02,176 INFO L136 FreeRefinementEngine]: Strategy FOX found an infeasible trace [2024-11-28 05:23:02,177 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [2073235627] [2024-11-28 05:23:02,177 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [2073235627] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-28 05:23:02,177 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-28 05:23:02,177 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2024-11-28 05:23:02,177 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2053789028] [2024-11-28 05:23:02,177 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-28 05:23:02,178 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2024-11-28 05:23:02,178 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy FOX [2024-11-28 05:23:02,179 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2024-11-28 05:23:02,180 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2024-11-28 05:23:02,205 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 15 out of 101 [2024-11-28 05:23:02,206 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 57 places, 44 transitions, 183 flow. Second operand has 6 states, 6 states have (on average 17.833333333333332) internal successors, (107), 6 states have internal predecessors, (107), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-28 05:23:02,206 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-11-28 05:23:02,206 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 15 of 101 [2024-11-28 05:23:02,206 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-11-28 05:23:02,876 INFO L124 PetriNetUnfolderBase]: 806/1307 cut-off events. [2024-11-28 05:23:02,876 INFO L125 PetriNetUnfolderBase]: For 1139/1139 co-relation queries the response was YES. [2024-11-28 05:23:02,878 INFO L83 FinitePrefix]: Finished finitePrefix Result has 3801 conditions, 1307 events. 806/1307 cut-off events. For 1139/1139 co-relation queries the response was YES. Maximal size of possible extension queue 84. Compared 6152 event pairs, 48 based on Foata normal form. 64/1280 useless extension candidates. Maximal degree in co-relation 3786. Up to 468 conditions per place. [2024-11-28 05:23:02,881 INFO L140 encePairwiseOnDemand]: 95/101 looper letters, 55 selfloop transitions, 11 changer transitions 1/78 dead transitions. [2024-11-28 05:23:02,881 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 62 places, 78 transitions, 435 flow [2024-11-28 05:23:02,881 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2024-11-28 05:23:02,882 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 6 states. [2024-11-28 05:23:02,882 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6 states to 6 states and 157 transitions. [2024-11-28 05:23:02,883 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.2590759075907591 [2024-11-28 05:23:02,883 INFO L175 Difference]: Start difference. First operand has 57 places, 44 transitions, 183 flow. Second operand 6 states and 157 transitions. [2024-11-28 05:23:02,883 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 62 places, 78 transitions, 435 flow [2024-11-28 05:23:02,888 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 58 places, 78 transitions, 410 flow, removed 4 selfloop flow, removed 4 redundant places. [2024-11-28 05:23:02,890 INFO L231 Difference]: Finished difference. Result has 60 places, 44 transitions, 197 flow [2024-11-28 05:23:02,890 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=101, PETRI_DIFFERENCE_MINUEND_FLOW=161, PETRI_DIFFERENCE_MINUEND_PLACES=53, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=44, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=11, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=33, PETRI_DIFFERENCE_SUBTRAHEND_STATES=6, PETRI_FLOW=197, PETRI_PLACES=60, PETRI_TRANSITIONS=44} [2024-11-28 05:23:02,891 INFO L279 CegarLoopForPetriNet]: 79 programPoint places, -19 predicate places. [2024-11-28 05:23:02,891 INFO L471 AbstractCegarLoop]: Abstraction has has 60 places, 44 transitions, 197 flow [2024-11-28 05:23:02,891 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 17.833333333333332) internal successors, (107), 6 states have internal predecessors, (107), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-28 05:23:02,891 INFO L198 CegarLoopForPetriNet]: Found error trace [2024-11-28 05:23:02,891 INFO L206 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] [2024-11-28 05:23:02,905 INFO L552 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_8dc03989-dd1e-4552-8a40-46136af171cd/bin/uautomizer-verify-aQ6SnzHsRB/z3 -smt2 -in SMTLIB2_COMPLIANT=true (11)] Ended with exit code 0 [2024-11-28 05:23:03,091 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 11 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_8dc03989-dd1e-4552-8a40-46136af171cd/bin/uautomizer-verify-aQ6SnzHsRB/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-11-28 05:23:03,092 INFO L396 AbstractCegarLoop]: === Iteration 11 === Targeting ULTIMATE.startErr6ASSERT_VIOLATIONMEMORY_LEAK === [P1Err0ASSERT_VIOLATIONMEMORY_LEAK, P1Err1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, P1Err2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 58 more)] === [2024-11-28 05:23:03,092 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-28 05:23:03,092 INFO L85 PathProgramCache]: Analyzing trace with hash 862853619, now seen corresponding path program 1 times [2024-11-28 05:23:03,093 INFO L118 FreeRefinementEngine]: Executing refinement strategy FOX [2024-11-28 05:23:03,093 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleZ3 [1357749945] [2024-11-28 05:23:03,093 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-28 05:23:03,093 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-11-28 05:23:03,094 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_8dc03989-dd1e-4552-8a40-46136af171cd/bin/uautomizer-verify-aQ6SnzHsRB/z3 [2024-11-28 05:23:03,096 INFO L229 MonitoredProcess]: Starting monitored process 12 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_8dc03989-dd1e-4552-8a40-46136af171cd/bin/uautomizer-verify-aQ6SnzHsRB/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2024-11-28 05:23:03,101 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_8dc03989-dd1e-4552-8a40-46136af171cd/bin/uautomizer-verify-aQ6SnzHsRB/z3 -smt2 -in SMTLIB2_COMPLIANT=true (12)] Waiting until timeout for monitored process [2024-11-28 05:23:03,326 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-28 05:23:03,329 INFO L256 TraceCheckSpWp]: Trace formula consists of 187 conjuncts, 11 conjuncts are in the unsatisfiable core [2024-11-28 05:23:03,332 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2024-11-28 05:23:03,632 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-28 05:23:03,633 INFO L308 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2024-11-28 05:23:03,633 INFO L136 FreeRefinementEngine]: Strategy FOX found an infeasible trace [2024-11-28 05:23:03,633 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1357749945] [2024-11-28 05:23:03,633 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1357749945] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-28 05:23:03,633 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-28 05:23:03,633 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2024-11-28 05:23:03,633 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [343432008] [2024-11-28 05:23:03,633 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-28 05:23:03,634 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 9 states [2024-11-28 05:23:03,634 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy FOX [2024-11-28 05:23:03,634 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2024-11-28 05:23:03,634 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=19, Invalid=53, Unknown=0, NotChecked=0, Total=72 [2024-11-28 05:23:03,712 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 13 out of 101 [2024-11-28 05:23:03,712 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 60 places, 44 transitions, 197 flow. Second operand has 9 states, 9 states have (on average 15.444444444444445) internal successors, (139), 9 states have internal predecessors, (139), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-28 05:23:03,712 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-11-28 05:23:03,713 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 13 of 101 [2024-11-28 05:23:03,713 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-11-28 05:23:04,726 INFO L124 PetriNetUnfolderBase]: 1660/2650 cut-off events. [2024-11-28 05:23:04,726 INFO L125 PetriNetUnfolderBase]: For 2524/2524 co-relation queries the response was YES. [2024-11-28 05:23:04,731 INFO L83 FinitePrefix]: Finished finitePrefix Result has 7815 conditions, 2650 events. 1660/2650 cut-off events. For 2524/2524 co-relation queries the response was YES. Maximal size of possible extension queue 138. Compared 13625 event pairs, 345 based on Foata normal form. 16/2494 useless extension candidates. Maximal degree in co-relation 7799. Up to 1305 conditions per place. [2024-11-28 05:23:04,737 INFO L140 encePairwiseOnDemand]: 91/101 looper letters, 50 selfloop transitions, 7 changer transitions 49/115 dead transitions. [2024-11-28 05:23:04,737 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 68 places, 115 transitions, 715 flow [2024-11-28 05:23:04,738 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2024-11-28 05:23:04,738 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 9 states. [2024-11-28 05:23:04,739 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 9 states to 9 states and 214 transitions. [2024-11-28 05:23:04,739 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.23542354235423543 [2024-11-28 05:23:04,739 INFO L175 Difference]: Start difference. First operand has 60 places, 44 transitions, 197 flow. Second operand 9 states and 214 transitions. [2024-11-28 05:23:04,740 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 68 places, 115 transitions, 715 flow [2024-11-28 05:23:04,759 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 60 places, 115 transitions, 598 flow, removed 20 selfloop flow, removed 8 redundant places. [2024-11-28 05:23:04,761 INFO L231 Difference]: Finished difference. Result has 66 places, 47 transitions, 185 flow [2024-11-28 05:23:04,761 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=101, PETRI_DIFFERENCE_MINUEND_FLOW=141, PETRI_DIFFERENCE_MINUEND_PLACES=52, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=44, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=4, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=39, PETRI_DIFFERENCE_SUBTRAHEND_STATES=9, PETRI_FLOW=185, PETRI_PLACES=66, PETRI_TRANSITIONS=47} [2024-11-28 05:23:04,762 INFO L279 CegarLoopForPetriNet]: 79 programPoint places, -13 predicate places. [2024-11-28 05:23:04,762 INFO L471 AbstractCegarLoop]: Abstraction has has 66 places, 47 transitions, 185 flow [2024-11-28 05:23:04,762 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 9 states, 9 states have (on average 15.444444444444445) internal successors, (139), 9 states have internal predecessors, (139), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-28 05:23:04,763 INFO L198 CegarLoopForPetriNet]: Found error trace [2024-11-28 05:23:04,763 INFO L206 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] [2024-11-28 05:23:04,777 INFO L552 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_8dc03989-dd1e-4552-8a40-46136af171cd/bin/uautomizer-verify-aQ6SnzHsRB/z3 -smt2 -in SMTLIB2_COMPLIANT=true (12)] Ended with exit code 0 [2024-11-28 05:23:04,963 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 12 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_8dc03989-dd1e-4552-8a40-46136af171cd/bin/uautomizer-verify-aQ6SnzHsRB/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-11-28 05:23:04,964 INFO L396 AbstractCegarLoop]: === Iteration 12 === Targeting ULTIMATE.startErr6ASSERT_VIOLATIONMEMORY_LEAK === [P1Err0ASSERT_VIOLATIONMEMORY_LEAK, P1Err1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, P1Err2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 58 more)] === [2024-11-28 05:23:04,964 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-28 05:23:04,964 INFO L85 PathProgramCache]: Analyzing trace with hash -1726530921, now seen corresponding path program 2 times [2024-11-28 05:23:04,965 INFO L118 FreeRefinementEngine]: Executing refinement strategy FOX [2024-11-28 05:23:04,965 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleZ3 [1964401999] [2024-11-28 05:23:04,965 INFO L95 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2024-11-28 05:23:04,966 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-11-28 05:23:04,966 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_8dc03989-dd1e-4552-8a40-46136af171cd/bin/uautomizer-verify-aQ6SnzHsRB/z3 [2024-11-28 05:23:04,968 INFO L229 MonitoredProcess]: Starting monitored process 13 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_8dc03989-dd1e-4552-8a40-46136af171cd/bin/uautomizer-verify-aQ6SnzHsRB/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2024-11-28 05:23:04,973 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_8dc03989-dd1e-4552-8a40-46136af171cd/bin/uautomizer-verify-aQ6SnzHsRB/z3 -smt2 -in SMTLIB2_COMPLIANT=true (13)] Waiting until timeout for monitored process [2024-11-28 05:23:05,195 INFO L229 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 1 check-sat command(s) [2024-11-28 05:23:05,195 INFO L230 tOrderPrioritization]: Conjunction of SSA is unsat [2024-11-28 05:23:05,199 INFO L256 TraceCheckSpWp]: Trace formula consists of 187 conjuncts, 11 conjuncts are in the unsatisfiable core [2024-11-28 05:23:05,201 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2024-11-28 05:23:05,451 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-28 05:23:05,452 INFO L308 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2024-11-28 05:23:05,452 INFO L136 FreeRefinementEngine]: Strategy FOX found an infeasible trace [2024-11-28 05:23:05,452 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1964401999] [2024-11-28 05:23:05,452 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1964401999] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-28 05:23:05,452 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-28 05:23:05,452 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2024-11-28 05:23:05,452 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1988377168] [2024-11-28 05:23:05,452 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-28 05:23:05,453 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 8 states [2024-11-28 05:23:05,453 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy FOX [2024-11-28 05:23:05,453 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2024-11-28 05:23:05,453 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=15, Invalid=41, Unknown=0, NotChecked=0, Total=56 [2024-11-28 05:23:05,514 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 13 out of 101 [2024-11-28 05:23:05,515 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 66 places, 47 transitions, 185 flow. Second operand has 8 states, 8 states have (on average 15.75) internal successors, (126), 8 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) [2024-11-28 05:23:05,515 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-11-28 05:23:05,515 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 13 of 101 [2024-11-28 05:23:05,515 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-11-28 05:23:06,350 INFO L124 PetriNetUnfolderBase]: 1849/3083 cut-off events. [2024-11-28 05:23:06,351 INFO L125 PetriNetUnfolderBase]: For 879/887 co-relation queries the response was YES. [2024-11-28 05:23:06,355 INFO L83 FinitePrefix]: Finished finitePrefix Result has 7872 conditions, 3083 events. 1849/3083 cut-off events. For 879/887 co-relation queries the response was YES. Maximal size of possible extension queue 161. Compared 16971 event pairs, 463 based on Foata normal form. 17/2908 useless extension candidates. Maximal degree in co-relation 7854. Up to 1370 conditions per place. [2024-11-28 05:23:06,359 INFO L140 encePairwiseOnDemand]: 92/101 looper letters, 63 selfloop transitions, 8 changer transitions 24/105 dead transitions. [2024-11-28 05:23:06,359 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 67 places, 105 transitions, 598 flow [2024-11-28 05:23:06,359 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2024-11-28 05:23:06,360 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 7 states. [2024-11-28 05:23:06,361 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 7 states to 7 states and 171 transitions. [2024-11-28 05:23:06,361 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.24186704384724186 [2024-11-28 05:23:06,361 INFO L175 Difference]: Start difference. First operand has 66 places, 47 transitions, 185 flow. Second operand 7 states and 171 transitions. [2024-11-28 05:23:06,361 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 67 places, 105 transitions, 598 flow [2024-11-28 05:23:06,363 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 61 places, 105 transitions, 556 flow, removed 7 selfloop flow, removed 6 redundant places. [2024-11-28 05:23:06,365 INFO L231 Difference]: Finished difference. Result has 66 places, 53 transitions, 240 flow [2024-11-28 05:23:06,365 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=101, PETRI_DIFFERENCE_MINUEND_FLOW=165, PETRI_DIFFERENCE_MINUEND_PLACES=55, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=47, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=3, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=41, PETRI_DIFFERENCE_SUBTRAHEND_STATES=7, PETRI_FLOW=240, PETRI_PLACES=66, PETRI_TRANSITIONS=53} [2024-11-28 05:23:06,366 INFO L279 CegarLoopForPetriNet]: 79 programPoint places, -13 predicate places. [2024-11-28 05:23:06,366 INFO L471 AbstractCegarLoop]: Abstraction has has 66 places, 53 transitions, 240 flow [2024-11-28 05:23:06,367 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 8 states, 8 states have (on average 15.75) internal successors, (126), 8 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) [2024-11-28 05:23:06,367 INFO L198 CegarLoopForPetriNet]: Found error trace [2024-11-28 05:23:06,367 INFO L206 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] [2024-11-28 05:23:06,381 INFO L552 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_8dc03989-dd1e-4552-8a40-46136af171cd/bin/uautomizer-verify-aQ6SnzHsRB/z3 -smt2 -in SMTLIB2_COMPLIANT=true (13)] Ended with exit code 0 [2024-11-28 05:23:06,571 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 13 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_8dc03989-dd1e-4552-8a40-46136af171cd/bin/uautomizer-verify-aQ6SnzHsRB/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-11-28 05:23:06,571 INFO L396 AbstractCegarLoop]: === Iteration 13 === Targeting ULTIMATE.startErr6ASSERT_VIOLATIONMEMORY_LEAK === [P1Err0ASSERT_VIOLATIONMEMORY_LEAK, P1Err1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, P1Err2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 58 more)] === [2024-11-28 05:23:06,572 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-28 05:23:06,572 INFO L85 PathProgramCache]: Analyzing trace with hash 1963750155, now seen corresponding path program 3 times [2024-11-28 05:23:06,572 INFO L118 FreeRefinementEngine]: Executing refinement strategy FOX [2024-11-28 05:23:06,572 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleZ3 [821954002] [2024-11-28 05:23:06,572 INFO L95 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST2 [2024-11-28 05:23:06,572 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-11-28 05:23:06,573 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_8dc03989-dd1e-4552-8a40-46136af171cd/bin/uautomizer-verify-aQ6SnzHsRB/z3 [2024-11-28 05:23:06,575 INFO L229 MonitoredProcess]: Starting monitored process 14 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_8dc03989-dd1e-4552-8a40-46136af171cd/bin/uautomizer-verify-aQ6SnzHsRB/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2024-11-28 05:23:06,576 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_8dc03989-dd1e-4552-8a40-46136af171cd/bin/uautomizer-verify-aQ6SnzHsRB/z3 -smt2 -in SMTLIB2_COMPLIANT=true (14)] Waiting until timeout for monitored process [2024-11-28 05:23:06,789 INFO L229 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued 1 check-sat command(s) [2024-11-28 05:23:06,790 INFO L230 tOrderPrioritization]: Conjunction of SSA is unsat [2024-11-28 05:23:06,793 INFO L256 TraceCheckSpWp]: Trace formula consists of 187 conjuncts, 11 conjuncts are in the unsatisfiable core [2024-11-28 05:23:06,795 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2024-11-28 05:23:06,982 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-28 05:23:06,983 INFO L308 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2024-11-28 05:23:06,983 INFO L136 FreeRefinementEngine]: Strategy FOX found an infeasible trace [2024-11-28 05:23:06,983 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [821954002] [2024-11-28 05:23:06,983 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [821954002] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-28 05:23:06,983 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-28 05:23:06,984 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2024-11-28 05:23:06,984 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1415848272] [2024-11-28 05:23:06,984 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-28 05:23:06,984 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 9 states [2024-11-28 05:23:06,984 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy FOX [2024-11-28 05:23:06,985 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2024-11-28 05:23:06,985 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=18, Invalid=54, Unknown=0, NotChecked=0, Total=72 [2024-11-28 05:23:07,045 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 13 out of 101 [2024-11-28 05:23:07,046 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 66 places, 53 transitions, 240 flow. Second operand has 9 states, 9 states have (on average 15.444444444444445) internal successors, (139), 9 states have internal predecessors, (139), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-28 05:23:07,046 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-11-28 05:23:07,046 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 13 of 101 [2024-11-28 05:23:07,046 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-11-28 05:23:07,854 INFO L124 PetriNetUnfolderBase]: 1073/1836 cut-off events. [2024-11-28 05:23:07,855 INFO L125 PetriNetUnfolderBase]: For 649/661 co-relation queries the response was YES. [2024-11-28 05:23:07,861 INFO L83 FinitePrefix]: Finished finitePrefix Result has 4629 conditions, 1836 events. 1073/1836 cut-off events. For 649/661 co-relation queries the response was YES. Maximal size of possible extension queue 109. Compared 9199 event pairs, 164 based on Foata normal form. 20/1763 useless extension candidates. Maximal degree in co-relation 4610. Up to 672 conditions per place. [2024-11-28 05:23:07,863 INFO L140 encePairwiseOnDemand]: 91/101 looper letters, 39 selfloop transitions, 9 changer transitions 51/109 dead transitions. [2024-11-28 05:23:07,863 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 72 places, 109 transitions, 619 flow [2024-11-28 05:23:07,864 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2024-11-28 05:23:07,864 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 9 states. [2024-11-28 05:23:07,865 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 9 states to 9 states and 205 transitions. [2024-11-28 05:23:07,866 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.22552255225522552 [2024-11-28 05:23:07,866 INFO L175 Difference]: Start difference. First operand has 66 places, 53 transitions, 240 flow. Second operand 9 states and 205 transitions. [2024-11-28 05:23:07,866 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 72 places, 109 transitions, 619 flow [2024-11-28 05:23:07,869 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 69 places, 109 transitions, 604 flow, removed 5 selfloop flow, removed 3 redundant places. [2024-11-28 05:23:07,870 INFO L231 Difference]: Finished difference. Result has 74 places, 45 transitions, 209 flow [2024-11-28 05:23:07,870 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=101, PETRI_DIFFERENCE_MINUEND_FLOW=229, PETRI_DIFFERENCE_MINUEND_PLACES=61, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=53, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=9, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=44, PETRI_DIFFERENCE_SUBTRAHEND_STATES=9, PETRI_FLOW=209, PETRI_PLACES=74, PETRI_TRANSITIONS=45} [2024-11-28 05:23:07,871 INFO L279 CegarLoopForPetriNet]: 79 programPoint places, -5 predicate places. [2024-11-28 05:23:07,871 INFO L471 AbstractCegarLoop]: Abstraction has has 74 places, 45 transitions, 209 flow [2024-11-28 05:23:07,871 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 9 states, 9 states have (on average 15.444444444444445) internal successors, (139), 9 states have internal predecessors, (139), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-28 05:23:07,871 INFO L198 CegarLoopForPetriNet]: Found error trace [2024-11-28 05:23:07,871 INFO L206 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] [2024-11-28 05:23:07,880 INFO L540 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_8dc03989-dd1e-4552-8a40-46136af171cd/bin/uautomizer-verify-aQ6SnzHsRB/z3 -smt2 -in SMTLIB2_COMPLIANT=true (14)] Forceful destruction successful, exit code 0 [2024-11-28 05:23:08,072 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 14 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_8dc03989-dd1e-4552-8a40-46136af171cd/bin/uautomizer-verify-aQ6SnzHsRB/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-11-28 05:23:08,072 INFO L396 AbstractCegarLoop]: === Iteration 14 === Targeting ULTIMATE.startErr6ASSERT_VIOLATIONMEMORY_LEAK === [P1Err0ASSERT_VIOLATIONMEMORY_LEAK, P1Err1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, P1Err2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 58 more)] === [2024-11-28 05:23:08,072 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-28 05:23:08,073 INFO L85 PathProgramCache]: Analyzing trace with hash -1526457623, now seen corresponding path program 4 times [2024-11-28 05:23:08,073 INFO L118 FreeRefinementEngine]: Executing refinement strategy FOX [2024-11-28 05:23:08,073 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleZ3 [65390390] [2024-11-28 05:23:08,073 INFO L95 rtionOrderModulation]: Changing assertion order to TERMS_WITH_SMALL_CONSTANTS_FIRST [2024-11-28 05:23:08,073 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-11-28 05:23:08,074 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_8dc03989-dd1e-4552-8a40-46136af171cd/bin/uautomizer-verify-aQ6SnzHsRB/z3 [2024-11-28 05:23:08,078 INFO L229 MonitoredProcess]: Starting monitored process 15 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_8dc03989-dd1e-4552-8a40-46136af171cd/bin/uautomizer-verify-aQ6SnzHsRB/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2024-11-28 05:23:08,081 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_8dc03989-dd1e-4552-8a40-46136af171cd/bin/uautomizer-verify-aQ6SnzHsRB/z3 -smt2 -in SMTLIB2_COMPLIANT=true (15)] Waiting until timeout for monitored process [2024-11-28 05:23:08,343 INFO L229 tOrderPrioritization]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 0 check-sat command(s) [2024-11-28 05:23:08,343 INFO L230 tOrderPrioritization]: Conjunction of SSA is sat [2024-11-28 05:23:08,343 INFO L357 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2024-11-28 05:23:08,420 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-11-28 05:23:08,521 INFO L130 FreeRefinementEngine]: Strategy FOX found a feasible trace [2024-11-28 05:23:08,521 INFO L340 BasicCegarLoop]: Counterexample is feasible [2024-11-28 05:23:08,522 INFO L782 garLoopResultBuilder]: Registering result UNSAFE for location ULTIMATE.startErr6ASSERT_VIOLATIONMEMORY_LEAK (60 of 61 remaining) [2024-11-28 05:23:08,524 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location P1Err0ASSERT_VIOLATIONMEMORY_LEAK (59 of 61 remaining) [2024-11-28 05:23:08,525 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location P1Err1REQUIRES_VIOLATIONMEMORY_DEREFERENCE (58 of 61 remaining) [2024-11-28 05:23:08,525 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location P1Err2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (57 of 61 remaining) [2024-11-28 05:23:08,525 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location P1Err3REQUIRES_VIOLATIONMEMORY_DEREFERENCE (56 of 61 remaining) [2024-11-28 05:23:08,525 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location P1Err4REQUIRES_VIOLATIONMEMORY_DEREFERENCE (55 of 61 remaining) [2024-11-28 05:23:08,526 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location P2Err0REQUIRES_VIOLATIONMEMORY_DEREFERENCE (54 of 61 remaining) [2024-11-28 05:23:08,526 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location P2Err1REQUIRES_VIOLATIONMEMORY_DEREFERENCE (53 of 61 remaining) [2024-11-28 05:23:08,526 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location P2Err2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (52 of 61 remaining) [2024-11-28 05:23:08,526 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location P2Err3REQUIRES_VIOLATIONMEMORY_DEREFERENCE (51 of 61 remaining) [2024-11-28 05:23:08,526 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location P2Err4REQUIRES_VIOLATIONMEMORY_DEREFERENCE (50 of 61 remaining) [2024-11-28 05:23:08,526 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location P2Err5REQUIRES_VIOLATIONMEMORY_DEREFERENCE (49 of 61 remaining) [2024-11-28 05:23:08,526 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location P2Err6REQUIRES_VIOLATIONMEMORY_DEREFERENCE (48 of 61 remaining) [2024-11-28 05:23:08,527 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location P2Err7REQUIRES_VIOLATIONMEMORY_DEREFERENCE (47 of 61 remaining) [2024-11-28 05:23:08,527 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location P2Err8REQUIRES_VIOLATIONMEMORY_DEREFERENCE (46 of 61 remaining) [2024-11-28 05:23:08,527 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location P2Err9REQUIRES_VIOLATIONMEMORY_DEREFERENCE (45 of 61 remaining) [2024-11-28 05:23:08,527 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location P2Err10REQUIRES_VIOLATIONMEMORY_DEREFERENCE (44 of 61 remaining) [2024-11-28 05:23:08,527 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location P2Err11REQUIRES_VIOLATIONMEMORY_DEREFERENCE (43 of 61 remaining) [2024-11-28 05:23:08,527 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location P2Err12REQUIRES_VIOLATIONMEMORY_DEREFERENCE (42 of 61 remaining) [2024-11-28 05:23:08,527 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location P2Err13REQUIRES_VIOLATIONMEMORY_DEREFERENCE (41 of 61 remaining) [2024-11-28 05:23:08,527 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location P2Err14REQUIRES_VIOLATIONMEMORY_DEREFERENCE (40 of 61 remaining) [2024-11-28 05:23:08,527 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location P2Err15REQUIRES_VIOLATIONMEMORY_DEREFERENCE (39 of 61 remaining) [2024-11-28 05:23:08,527 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location P2Err16REQUIRES_VIOLATIONMEMORY_DEREFERENCE (38 of 61 remaining) [2024-11-28 05:23:08,528 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location P2Err17REQUIRES_VIOLATIONMEMORY_DEREFERENCE (37 of 61 remaining) [2024-11-28 05:23:08,528 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location P2Err18REQUIRES_VIOLATIONMEMORY_DEREFERENCE (36 of 61 remaining) [2024-11-28 05:23:08,528 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location P2Err19REQUIRES_VIOLATIONMEMORY_DEREFERENCE (35 of 61 remaining) [2024-11-28 05:23:08,528 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE (34 of 61 remaining) [2024-11-28 05:23:08,528 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE (33 of 61 remaining) [2024-11-28 05:23:08,528 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (32 of 61 remaining) [2024-11-28 05:23:08,528 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr3REQUIRES_VIOLATIONMEMORY_DEREFERENCE (31 of 61 remaining) [2024-11-28 05:23:08,528 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr4REQUIRES_VIOLATIONMEMORY_DEREFERENCE (30 of 61 remaining) [2024-11-28 05:23:08,528 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr5REQUIRES_VIOLATIONMEMORY_DEREFERENCE (29 of 61 remaining) [2024-11-28 05:23:08,528 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr7ASSERT_VIOLATIONMEMORY_LEAK (28 of 61 remaining) [2024-11-28 05:23:08,528 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (27 of 61 remaining) [2024-11-28 05:23:08,528 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (26 of 61 remaining) [2024-11-28 05:23:08,528 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr2INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (25 of 61 remaining) [2024-11-28 05:23:08,528 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location P1Err0ASSERT_VIOLATIONMEMORY_LEAK (24 of 61 remaining) [2024-11-28 05:23:08,529 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location P1Err1REQUIRES_VIOLATIONMEMORY_DEREFERENCE (23 of 61 remaining) [2024-11-28 05:23:08,529 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location P1Err2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (22 of 61 remaining) [2024-11-28 05:23:08,529 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location P1Err3REQUIRES_VIOLATIONMEMORY_DEREFERENCE (21 of 61 remaining) [2024-11-28 05:23:08,530 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location P1Err4REQUIRES_VIOLATIONMEMORY_DEREFERENCE (20 of 61 remaining) [2024-11-28 05:23:08,530 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location P2Err0REQUIRES_VIOLATIONMEMORY_DEREFERENCE (19 of 61 remaining) [2024-11-28 05:23:08,530 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location P2Err1REQUIRES_VIOLATIONMEMORY_DEREFERENCE (18 of 61 remaining) [2024-11-28 05:23:08,530 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location P2Err2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (17 of 61 remaining) [2024-11-28 05:23:08,530 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location P2Err3REQUIRES_VIOLATIONMEMORY_DEREFERENCE (16 of 61 remaining) [2024-11-28 05:23:08,530 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location P2Err4REQUIRES_VIOLATIONMEMORY_DEREFERENCE (15 of 61 remaining) [2024-11-28 05:23:08,530 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location P2Err5REQUIRES_VIOLATIONMEMORY_DEREFERENCE (14 of 61 remaining) [2024-11-28 05:23:08,531 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location P2Err6REQUIRES_VIOLATIONMEMORY_DEREFERENCE (13 of 61 remaining) [2024-11-28 05:23:08,531 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location P2Err7REQUIRES_VIOLATIONMEMORY_DEREFERENCE (12 of 61 remaining) [2024-11-28 05:23:08,531 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location P2Err8REQUIRES_VIOLATIONMEMORY_DEREFERENCE (11 of 61 remaining) [2024-11-28 05:23:08,531 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location P2Err9REQUIRES_VIOLATIONMEMORY_DEREFERENCE (10 of 61 remaining) [2024-11-28 05:23:08,531 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location P2Err10REQUIRES_VIOLATIONMEMORY_DEREFERENCE (9 of 61 remaining) [2024-11-28 05:23:08,531 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location P2Err11REQUIRES_VIOLATIONMEMORY_DEREFERENCE (8 of 61 remaining) [2024-11-28 05:23:08,531 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location P2Err12REQUIRES_VIOLATIONMEMORY_DEREFERENCE (7 of 61 remaining) [2024-11-28 05:23:08,532 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location P2Err13REQUIRES_VIOLATIONMEMORY_DEREFERENCE (6 of 61 remaining) [2024-11-28 05:23:08,532 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location P2Err14REQUIRES_VIOLATIONMEMORY_DEREFERENCE (5 of 61 remaining) [2024-11-28 05:23:08,532 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location P2Err15REQUIRES_VIOLATIONMEMORY_DEREFERENCE (4 of 61 remaining) [2024-11-28 05:23:08,532 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location P2Err16REQUIRES_VIOLATIONMEMORY_DEREFERENCE (3 of 61 remaining) [2024-11-28 05:23:08,532 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location P2Err17REQUIRES_VIOLATIONMEMORY_DEREFERENCE (2 of 61 remaining) [2024-11-28 05:23:08,532 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location P2Err18REQUIRES_VIOLATIONMEMORY_DEREFERENCE (1 of 61 remaining) [2024-11-28 05:23:08,532 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location P2Err19REQUIRES_VIOLATIONMEMORY_DEREFERENCE (0 of 61 remaining) [2024-11-28 05:23:08,548 INFO L552 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_8dc03989-dd1e-4552-8a40-46136af171cd/bin/uautomizer-verify-aQ6SnzHsRB/z3 -smt2 -in SMTLIB2_COMPLIANT=true (15)] Ended with exit code 0 [2024-11-28 05:23:08,737 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 15 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_8dc03989-dd1e-4552-8a40-46136af171cd/bin/uautomizer-verify-aQ6SnzHsRB/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-11-28 05:23:08,738 INFO L422 BasicCegarLoop]: Path program histogram: [4, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-28 05:23:08,854 INFO L241 ceAbstractionStarter]: Analysis of concurrent program completed with 1 thread instances [2024-11-28 05:23:08,854 INFO L170 ceAbstractionStarter]: Computing trace abstraction results [2024-11-28 05:23:08,865 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 28.11 05:23:08 BasicIcfg [2024-11-28 05:23:08,865 INFO L131 PluginConnector]: ------------------------ END TraceAbstraction---------------------------- [2024-11-28 05:23:08,866 INFO L112 PluginConnector]: ------------------------Witness Printer---------------------------- [2024-11-28 05:23:08,866 INFO L270 PluginConnector]: Initializing Witness Printer... [2024-11-28 05:23:08,867 INFO L274 PluginConnector]: Witness Printer initialized [2024-11-28 05:23:08,868 INFO L184 PluginConnector]: Executing the observer RCFGCatcher from plugin Witness Printer for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 28.11 05:22:43" (3/4) ... [2024-11-28 05:23:08,870 INFO L149 WitnessPrinter]: No result that supports witness generation found [2024-11-28 05:23:08,871 INFO L131 PluginConnector]: ------------------------ END Witness Printer---------------------------- [2024-11-28 05:23:08,872 INFO L158 Benchmark]: Toolchain (without parser) took 28606.72ms. Allocated memory was 117.4MB in the beginning and 1.1GB in the end (delta: 998.2MB). Free memory was 91.5MB in the beginning and 762.0MB in the end (delta: -670.5MB). Peak memory consumption was 328.4MB. Max. memory is 16.1GB. [2024-11-28 05:23:08,873 INFO L158 Benchmark]: CDTParser took 0.41ms. Allocated memory is still 83.9MB. Free memory is still 64.1MB. There was no memory consumed. Max. memory is 16.1GB. [2024-11-28 05:23:08,873 INFO L158 Benchmark]: CACSL2BoogieTranslator took 916.45ms. Allocated memory is still 117.4MB. Free memory was 91.0MB in the beginning and 67.0MB in the end (delta: 24.1MB). Peak memory consumption was 25.2MB. Max. memory is 16.1GB. [2024-11-28 05:23:08,874 INFO L158 Benchmark]: Boogie Procedure Inliner took 65.33ms. Allocated memory is still 117.4MB. Free memory was 67.0MB in the beginning and 64.6MB in the end (delta: 2.4MB). There was no memory consumed. Max. memory is 16.1GB. [2024-11-28 05:23:08,874 INFO L158 Benchmark]: Boogie Preprocessor took 82.08ms. Allocated memory is still 117.4MB. Free memory was 64.6MB in the beginning and 61.0MB in the end (delta: 3.6MB). Peak memory consumption was 8.4MB. Max. memory is 16.1GB. [2024-11-28 05:23:08,874 INFO L158 Benchmark]: RCFGBuilder took 2487.02ms. Allocated memory is still 117.4MB. Free memory was 61.0MB in the beginning and 32.0MB in the end (delta: 28.9MB). Peak memory consumption was 38.8MB. Max. memory is 16.1GB. [2024-11-28 05:23:08,875 INFO L158 Benchmark]: TraceAbstraction took 25038.85ms. Allocated memory was 117.4MB in the beginning and 1.1GB in the end (delta: 998.2MB). Free memory was 32.0MB in the beginning and 762.1MB in the end (delta: -730.0MB). Peak memory consumption was 267.6MB. Max. memory is 16.1GB. [2024-11-28 05:23:08,875 INFO L158 Benchmark]: Witness Printer took 5.20ms. Allocated memory is still 1.1GB. Free memory was 762.1MB in the beginning and 762.0MB in the end (delta: 63.4kB). There was no memory consumed. Max. memory is 16.1GB. [2024-11-28 05:23:08,878 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.41ms. Allocated memory is still 83.9MB. Free memory is still 64.1MB. There was no memory consumed. Max. memory is 16.1GB. * CACSL2BoogieTranslator took 916.45ms. Allocated memory is still 117.4MB. Free memory was 91.0MB in the beginning and 67.0MB in the end (delta: 24.1MB). Peak memory consumption was 25.2MB. Max. memory is 16.1GB. * Boogie Procedure Inliner took 65.33ms. Allocated memory is still 117.4MB. Free memory was 67.0MB in the beginning and 64.6MB in the end (delta: 2.4MB). There was no memory consumed. Max. memory is 16.1GB. * Boogie Preprocessor took 82.08ms. Allocated memory is still 117.4MB. Free memory was 64.6MB in the beginning and 61.0MB in the end (delta: 3.6MB). Peak memory consumption was 8.4MB. Max. memory is 16.1GB. * RCFGBuilder took 2487.02ms. Allocated memory is still 117.4MB. Free memory was 61.0MB in the beginning and 32.0MB in the end (delta: 28.9MB). Peak memory consumption was 38.8MB. Max. memory is 16.1GB. * TraceAbstraction took 25038.85ms. Allocated memory was 117.4MB in the beginning and 1.1GB in the end (delta: 998.2MB). Free memory was 32.0MB in the beginning and 762.1MB in the end (delta: -730.0MB). Peak memory consumption was 267.6MB. Max. memory is 16.1GB. * Witness Printer took 5.20ms. Allocated memory is still 1.1GB. Free memory was 762.1MB in the beginning and 762.0MB in the end (delta: 63.4kB). There was no memory consumed. Max. memory is 16.1GB. * Results from de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: - UnprovableResult [Line: 17]: Unable to prove that all allocated memory was freed Unable to prove that all allocated memory was freed Reason: overapproximation of memtrack at line 17. Possible FailurePath: [L709] 0 int __unbuffered_cnt = 0; [L711] 0 int __unbuffered_p0_EAX = 0; [L713] 0 int __unbuffered_p0_EBX = 0; [L715] 0 int __unbuffered_p2_EAX = 0; [L716] 0 _Bool __unbuffered_p2_EAX$flush_delayed; [L717] 0 int __unbuffered_p2_EAX$mem_tmp; [L718] 0 _Bool __unbuffered_p2_EAX$r_buff0_thd0; [L719] 0 _Bool __unbuffered_p2_EAX$r_buff0_thd1; [L720] 0 _Bool __unbuffered_p2_EAX$r_buff0_thd2; [L721] 0 _Bool __unbuffered_p2_EAX$r_buff0_thd3; [L722] 0 _Bool __unbuffered_p2_EAX$r_buff1_thd0; [L723] 0 _Bool __unbuffered_p2_EAX$r_buff1_thd1; [L724] 0 _Bool __unbuffered_p2_EAX$r_buff1_thd2; [L725] 0 _Bool __unbuffered_p2_EAX$r_buff1_thd3; [L726] 0 _Bool __unbuffered_p2_EAX$read_delayed; [L727] 0 int *__unbuffered_p2_EAX$read_delayed_var; [L728] 0 int __unbuffered_p2_EAX$w_buff0; [L729] 0 _Bool __unbuffered_p2_EAX$w_buff0_used; [L730] 0 int __unbuffered_p2_EAX$w_buff1; [L731] 0 _Bool __unbuffered_p2_EAX$w_buff1_used; [L732] 0 _Bool main$tmp_guard0; [L733] 0 _Bool main$tmp_guard1; [L735] 0 int x = 0; [L737] 0 int y = 0; [L737] 0 int y = 0; [L738] 0 _Bool y$flush_delayed; [L739] 0 int y$mem_tmp; [L740] 0 _Bool y$r_buff0_thd0; [L741] 0 _Bool y$r_buff0_thd1; [L742] 0 _Bool y$r_buff0_thd2; [L743] 0 _Bool y$r_buff0_thd3; [L744] 0 _Bool y$r_buff1_thd0; [L745] 0 _Bool y$r_buff1_thd1; [L746] 0 _Bool y$r_buff1_thd2; [L747] 0 _Bool y$r_buff1_thd3; [L748] 0 _Bool y$read_delayed; [L749] 0 int *y$read_delayed_var; [L750] 0 int y$w_buff0; [L751] 0 _Bool y$w_buff0_used; [L752] 0 int y$w_buff1; [L753] 0 _Bool y$w_buff1_used; [L755] 0 int z = 0; [L756] 0 _Bool weak$$choice0; [L757] 0 _Bool weak$$choice1; [L758] 0 _Bool weak$$choice2; [L850] 0 pthread_t t2052; [L851] FCALL, FORK 0 pthread_create(&t2052, ((void *)0), P0, ((void *)0)) VAL [\old(arg)={0:0}, __unbuffered_cnt=0, __unbuffered_p0_EAX=0, __unbuffered_p0_EBX=0, __unbuffered_p2_EAX$flush_delayed=0, __unbuffered_p2_EAX$mem_tmp=0, __unbuffered_p2_EAX$r_buff0_thd0=0, __unbuffered_p2_EAX$r_buff0_thd1=0, __unbuffered_p2_EAX$r_buff0_thd2=0, __unbuffered_p2_EAX$r_buff0_thd3=0, __unbuffered_p2_EAX$r_buff1_thd0=0, __unbuffered_p2_EAX$r_buff1_thd1=0, __unbuffered_p2_EAX$r_buff1_thd2=0, __unbuffered_p2_EAX$r_buff1_thd3=0, __unbuffered_p2_EAX$read_delayed=0, __unbuffered_p2_EAX$read_delayed_var={0:0}, __unbuffered_p2_EAX$w_buff0=0, __unbuffered_p2_EAX$w_buff0_used=0, __unbuffered_p2_EAX$w_buff1=0, __unbuffered_p2_EAX$w_buff1_used=0, __unbuffered_p2_EAX=0, main$tmp_guard0=0, main$tmp_guard1=0, t2052=-1, weak$$choice0=0, weak$$choice1=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={3:0}, z=0] [L852] 0 pthread_t t2053; [L853] FCALL, FORK 0 pthread_create(&t2053, ((void *)0), P1, ((void *)0)) VAL [\old(arg)={0:0}, __unbuffered_cnt=0, __unbuffered_p0_EAX=0, __unbuffered_p0_EBX=0, __unbuffered_p2_EAX$flush_delayed=0, __unbuffered_p2_EAX$mem_tmp=0, __unbuffered_p2_EAX$r_buff0_thd0=0, __unbuffered_p2_EAX$r_buff0_thd1=0, __unbuffered_p2_EAX$r_buff0_thd2=0, __unbuffered_p2_EAX$r_buff0_thd3=0, __unbuffered_p2_EAX$r_buff1_thd0=0, __unbuffered_p2_EAX$r_buff1_thd1=0, __unbuffered_p2_EAX$r_buff1_thd2=0, __unbuffered_p2_EAX$r_buff1_thd3=0, __unbuffered_p2_EAX$read_delayed=0, __unbuffered_p2_EAX$read_delayed_var={0:0}, __unbuffered_p2_EAX$w_buff0=0, __unbuffered_p2_EAX$w_buff0_used=0, __unbuffered_p2_EAX$w_buff1=0, __unbuffered_p2_EAX$w_buff1_used=0, __unbuffered_p2_EAX=0, main$tmp_guard0=0, main$tmp_guard1=0, t2052=-1, t2053=0, weak$$choice0=0, weak$$choice1=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={3:0}, z=0] [L854] 0 pthread_t t2054; [L855] FCALL, FORK 0 pthread_create(&t2054, ((void *)0), P2, ((void *)0)) VAL [\old(arg)={0:0}, \old(arg)={0:0}, __unbuffered_cnt=0, __unbuffered_p0_EAX=0, __unbuffered_p0_EBX=0, __unbuffered_p2_EAX$flush_delayed=0, __unbuffered_p2_EAX$mem_tmp=0, __unbuffered_p2_EAX$r_buff0_thd0=0, __unbuffered_p2_EAX$r_buff0_thd1=0, __unbuffered_p2_EAX$r_buff0_thd2=0, __unbuffered_p2_EAX$r_buff0_thd3=0, __unbuffered_p2_EAX$r_buff1_thd0=0, __unbuffered_p2_EAX$r_buff1_thd1=0, __unbuffered_p2_EAX$r_buff1_thd2=0, __unbuffered_p2_EAX$r_buff1_thd3=0, __unbuffered_p2_EAX$read_delayed=0, __unbuffered_p2_EAX$read_delayed_var={0:0}, __unbuffered_p2_EAX$w_buff0=0, __unbuffered_p2_EAX$w_buff0_used=0, __unbuffered_p2_EAX$w_buff1=0, __unbuffered_p2_EAX$w_buff1_used=0, __unbuffered_p2_EAX=0, main$tmp_guard0=0, main$tmp_guard1=0, t2052=-1, t2053=0, t2054=1, weak$$choice0=0, weak$$choice1=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={3:0}, z=0] [L806] 3 weak$$choice0 = __VERIFIER_nondet_bool() [L807] 3 weak$$choice2 = __VERIFIER_nondet_bool() [L808] 3 y$flush_delayed = weak$$choice2 [L809] EXPR 3 \read(y) [L809] 3 y$mem_tmp = y [L810] 3 weak$$choice1 = __VERIFIER_nondet_bool() [L811] EXPR 3 !y$w_buff0_used ? y : (y$w_buff0_used && y$r_buff0_thd3 ? y$w_buff0 : (y$w_buff0_used && !y$r_buff1_thd3 && y$w_buff1_used && !y$r_buff0_thd3 ? (weak$$choice0 ? y : (weak$$choice1 ? y$w_buff0 : y$w_buff1)) : (y$w_buff0_used && y$r_buff1_thd3 && y$w_buff1_used && !y$r_buff0_thd3 ? (weak$$choice0 ? y$w_buff1 : y$w_buff0) : (weak$$choice0 ? y$w_buff0 : y)))) [L811] EXPR 3 \read(y) [L811] EXPR 3 !y$w_buff0_used ? y : (y$w_buff0_used && y$r_buff0_thd3 ? y$w_buff0 : (y$w_buff0_used && !y$r_buff1_thd3 && y$w_buff1_used && !y$r_buff0_thd3 ? (weak$$choice0 ? y : (weak$$choice1 ? y$w_buff0 : y$w_buff1)) : (y$w_buff0_used && y$r_buff1_thd3 && y$w_buff1_used && !y$r_buff0_thd3 ? (weak$$choice0 ? y$w_buff1 : y$w_buff0) : (weak$$choice0 ? y$w_buff0 : y)))) [L811] 3 y = !y$w_buff0_used ? y : (y$w_buff0_used && y$r_buff0_thd3 ? y$w_buff0 : (y$w_buff0_used && !y$r_buff1_thd3 && y$w_buff1_used && !y$r_buff0_thd3 ? (weak$$choice0 ? y : (weak$$choice1 ? y$w_buff0 : y$w_buff1)) : (y$w_buff0_used && y$r_buff1_thd3 && y$w_buff1_used && !y$r_buff0_thd3 ? (weak$$choice0 ? y$w_buff1 : y$w_buff0) : (weak$$choice0 ? y$w_buff0 : y)))) [L812] 3 y$w_buff0 = weak$$choice2 ? y$w_buff0 : (!y$w_buff0_used ? y$w_buff0 : (y$w_buff0_used && y$r_buff0_thd3 ? y$w_buff0 : (y$w_buff0_used && !y$r_buff1_thd3 && y$w_buff1_used && !y$r_buff0_thd3 ? y$w_buff0 : (y$w_buff0_used && y$r_buff1_thd3 && y$w_buff1_used && !y$r_buff0_thd3 ? y$w_buff0 : y$w_buff0)))) [L813] 3 y$w_buff1 = weak$$choice2 ? y$w_buff1 : (!y$w_buff0_used ? y$w_buff1 : (y$w_buff0_used && y$r_buff0_thd3 ? y$w_buff1 : (y$w_buff0_used && !y$r_buff1_thd3 && y$w_buff1_used && !y$r_buff0_thd3 ? y$w_buff1 : (y$w_buff0_used && y$r_buff1_thd3 && y$w_buff1_used && !y$r_buff0_thd3 ? y$w_buff1 : y$w_buff1)))) [L814] 3 y$w_buff0_used = weak$$choice2 ? y$w_buff0_used : (!y$w_buff0_used ? y$w_buff0_used : (y$w_buff0_used && y$r_buff0_thd3 ? (_Bool)0 : (y$w_buff0_used && !y$r_buff1_thd3 && y$w_buff1_used && !y$r_buff0_thd3 ? weak$$choice0 || !weak$$choice1 : (y$w_buff0_used && y$r_buff1_thd3 && y$w_buff1_used && !y$r_buff0_thd3 ? weak$$choice0 : weak$$choice0)))) [L815] 3 y$w_buff1_used = weak$$choice2 ? y$w_buff1_used : (!y$w_buff0_used ? y$w_buff1_used : (y$w_buff0_used && y$r_buff0_thd3 ? (_Bool)0 : (y$w_buff0_used && !y$r_buff1_thd3 && y$w_buff1_used && !y$r_buff0_thd3 ? weak$$choice0 : (y$w_buff0_used && y$r_buff1_thd3 && y$w_buff1_used && !y$r_buff0_thd3 ? (_Bool)0 : (_Bool)0)))) [L816] 3 y$r_buff0_thd3 = weak$$choice2 ? y$r_buff0_thd3 : (!y$w_buff0_used ? y$r_buff0_thd3 : (y$w_buff0_used && y$r_buff0_thd3 ? (_Bool)0 : (y$w_buff0_used && !y$r_buff1_thd3 && y$w_buff1_used && !y$r_buff0_thd3 ? y$r_buff0_thd3 : (y$w_buff0_used && y$r_buff1_thd3 && y$w_buff1_used && !y$r_buff0_thd3 ? (_Bool)0 : (_Bool)0)))) [L817] 3 y$r_buff1_thd3 = weak$$choice2 ? y$r_buff1_thd3 : (!y$w_buff0_used ? y$r_buff1_thd3 : (y$w_buff0_used && y$r_buff0_thd3 ? (_Bool)0 : (y$w_buff0_used && !y$r_buff1_thd3 && y$w_buff1_used && !y$r_buff0_thd3 ? (weak$$choice0 ? y$r_buff1_thd3 : (_Bool)0) : (y$w_buff0_used && y$r_buff1_thd3 && y$w_buff1_used && !y$r_buff0_thd3 ? (_Bool)0 : (_Bool)0)))) [L818] 3 __unbuffered_p2_EAX$read_delayed = (_Bool)1 [L819] 3 __unbuffered_p2_EAX$read_delayed_var = &y [L820] EXPR 3 \read(y) [L820] 3 __unbuffered_p2_EAX = y [L821] EXPR 3 y$flush_delayed ? y$mem_tmp : y [L821] EXPR 3 \read(y) [L821] EXPR 3 y$flush_delayed ? y$mem_tmp : y [L821] 3 y = y$flush_delayed ? y$mem_tmp : y [L822] 3 y$flush_delayed = (_Bool)0 VAL [\old(arg)={0:0}, \old(arg)={0:0}, __unbuffered_cnt=0, __unbuffered_p0_EAX=0, __unbuffered_p0_EBX=0, __unbuffered_p2_EAX$flush_delayed=0, __unbuffered_p2_EAX$mem_tmp=0, __unbuffered_p2_EAX$r_buff0_thd0=0, __unbuffered_p2_EAX$r_buff0_thd1=0, __unbuffered_p2_EAX$r_buff0_thd2=0, __unbuffered_p2_EAX$r_buff0_thd3=0, __unbuffered_p2_EAX$r_buff1_thd0=0, __unbuffered_p2_EAX$r_buff1_thd1=0, __unbuffered_p2_EAX$r_buff1_thd2=0, __unbuffered_p2_EAX$r_buff1_thd3=0, __unbuffered_p2_EAX$read_delayed=1, __unbuffered_p2_EAX$read_delayed_var={3:0}, __unbuffered_p2_EAX$w_buff0=0, __unbuffered_p2_EAX$w_buff0_used=0, __unbuffered_p2_EAX$w_buff1=0, __unbuffered_p2_EAX$w_buff1_used=0, __unbuffered_p2_EAX=0, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice1=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={3:0}, z=0] [L825] 3 z = 1 VAL [\old(arg)={0:0}, \old(arg)={0:0}, __unbuffered_cnt=0, __unbuffered_p0_EAX=0, __unbuffered_p0_EBX=0, __unbuffered_p2_EAX$flush_delayed=0, __unbuffered_p2_EAX$mem_tmp=0, __unbuffered_p2_EAX$r_buff0_thd0=0, __unbuffered_p2_EAX$r_buff0_thd1=0, __unbuffered_p2_EAX$r_buff0_thd2=0, __unbuffered_p2_EAX$r_buff0_thd3=0, __unbuffered_p2_EAX$r_buff1_thd0=0, __unbuffered_p2_EAX$r_buff1_thd1=0, __unbuffered_p2_EAX$r_buff1_thd2=0, __unbuffered_p2_EAX$r_buff1_thd3=0, __unbuffered_p2_EAX$read_delayed=1, __unbuffered_p2_EAX$read_delayed_var={3:0}, __unbuffered_p2_EAX$w_buff0=0, __unbuffered_p2_EAX$w_buff0_used=0, __unbuffered_p2_EAX$w_buff1=0, __unbuffered_p2_EAX$w_buff1_used=0, __unbuffered_p2_EAX=0, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice1=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={3:0}, z=1] [L762] 1 __unbuffered_p0_EAX = z VAL [\old(arg)={0:0}, \old(arg)={0:0}, __unbuffered_cnt=0, __unbuffered_p0_EAX=1, __unbuffered_p0_EBX=0, __unbuffered_p2_EAX$flush_delayed=0, __unbuffered_p2_EAX$mem_tmp=0, __unbuffered_p2_EAX$r_buff0_thd0=0, __unbuffered_p2_EAX$r_buff0_thd1=0, __unbuffered_p2_EAX$r_buff0_thd2=0, __unbuffered_p2_EAX$r_buff0_thd3=0, __unbuffered_p2_EAX$r_buff1_thd0=0, __unbuffered_p2_EAX$r_buff1_thd1=0, __unbuffered_p2_EAX$r_buff1_thd2=0, __unbuffered_p2_EAX$r_buff1_thd3=0, __unbuffered_p2_EAX$read_delayed=1, __unbuffered_p2_EAX$read_delayed_var={3:0}, __unbuffered_p2_EAX$w_buff0=0, __unbuffered_p2_EAX$w_buff0_used=0, __unbuffered_p2_EAX$w_buff1=0, __unbuffered_p2_EAX$w_buff1_used=0, __unbuffered_p2_EAX=0, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice1=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={3:0}, z=1] [L765] 1 __unbuffered_p0_EBX = x VAL [\old(arg)={0:0}, \old(arg)={0:0}, __unbuffered_cnt=0, __unbuffered_p0_EAX=1, __unbuffered_p0_EBX=0, __unbuffered_p2_EAX$flush_delayed=0, __unbuffered_p2_EAX$mem_tmp=0, __unbuffered_p2_EAX$r_buff0_thd0=0, __unbuffered_p2_EAX$r_buff0_thd1=0, __unbuffered_p2_EAX$r_buff0_thd2=0, __unbuffered_p2_EAX$r_buff0_thd3=0, __unbuffered_p2_EAX$r_buff1_thd0=0, __unbuffered_p2_EAX$r_buff1_thd1=0, __unbuffered_p2_EAX$r_buff1_thd2=0, __unbuffered_p2_EAX$r_buff1_thd3=0, __unbuffered_p2_EAX$read_delayed=1, __unbuffered_p2_EAX$read_delayed_var={3:0}, __unbuffered_p2_EAX$w_buff0=0, __unbuffered_p2_EAX$w_buff0_used=0, __unbuffered_p2_EAX$w_buff1=0, __unbuffered_p2_EAX$w_buff1_used=0, __unbuffered_p2_EAX=0, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice1=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={3:0}, z=1] [L828] EXPR 3 y$w_buff0_used && y$r_buff0_thd3 ? y$w_buff0 : (y$w_buff1_used && y$r_buff1_thd3 ? y$w_buff1 : y) [L828] EXPR 3 y$w_buff1_used && y$r_buff1_thd3 ? y$w_buff1 : y [L828] EXPR 3 \read(y) [L828] EXPR 3 y$w_buff1_used && y$r_buff1_thd3 ? y$w_buff1 : y [L828] EXPR 3 y$w_buff0_used && y$r_buff0_thd3 ? y$w_buff0 : (y$w_buff1_used && y$r_buff1_thd3 ? y$w_buff1 : y) [L828] 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) [L829] 3 y$w_buff0_used = y$w_buff0_used && y$r_buff0_thd3 ? (_Bool)0 : y$w_buff0_used [L830] 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 [L831] 3 y$r_buff0_thd3 = y$w_buff0_used && y$r_buff0_thd3 ? (_Bool)0 : y$r_buff0_thd3 [L832] 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 [\old(arg)={0:0}, \old(arg)={0:0}, __unbuffered_cnt=0, __unbuffered_p0_EAX=1, __unbuffered_p0_EBX=0, __unbuffered_p2_EAX$flush_delayed=0, __unbuffered_p2_EAX$mem_tmp=0, __unbuffered_p2_EAX$r_buff0_thd0=0, __unbuffered_p2_EAX$r_buff0_thd1=0, __unbuffered_p2_EAX$r_buff0_thd2=0, __unbuffered_p2_EAX$r_buff0_thd3=0, __unbuffered_p2_EAX$r_buff1_thd0=0, __unbuffered_p2_EAX$r_buff1_thd1=0, __unbuffered_p2_EAX$r_buff1_thd2=0, __unbuffered_p2_EAX$r_buff1_thd3=0, __unbuffered_p2_EAX$read_delayed=1, __unbuffered_p2_EAX$read_delayed_var={3:0}, __unbuffered_p2_EAX$w_buff0=0, __unbuffered_p2_EAX$w_buff0_used=0, __unbuffered_p2_EAX$w_buff1=0, __unbuffered_p2_EAX$w_buff1_used=0, __unbuffered_p2_EAX=0, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice1=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={3:0}, z=1] [L777] 2 x = 1 VAL [\old(arg)={0:0}, \old(arg)={0:0}, \old(arg)={0:0}, __unbuffered_cnt=0, __unbuffered_p0_EAX=1, __unbuffered_p0_EBX=0, __unbuffered_p2_EAX$flush_delayed=0, __unbuffered_p2_EAX$mem_tmp=0, __unbuffered_p2_EAX$r_buff0_thd0=0, __unbuffered_p2_EAX$r_buff0_thd1=0, __unbuffered_p2_EAX$r_buff0_thd2=0, __unbuffered_p2_EAX$r_buff0_thd3=0, __unbuffered_p2_EAX$r_buff1_thd0=0, __unbuffered_p2_EAX$r_buff1_thd1=0, __unbuffered_p2_EAX$r_buff1_thd2=0, __unbuffered_p2_EAX$r_buff1_thd3=0, __unbuffered_p2_EAX$read_delayed=1, __unbuffered_p2_EAX$read_delayed_var={3:0}, __unbuffered_p2_EAX$w_buff0=0, __unbuffered_p2_EAX$w_buff0_used=0, __unbuffered_p2_EAX$w_buff1=0, __unbuffered_p2_EAX$w_buff1_used=0, __unbuffered_p2_EAX=0, arg={0:0}, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice1=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=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={3:0}, z=1] [L780] 2 y$w_buff1 = y$w_buff0 [L781] 2 y$w_buff0 = 1 [L782] 2 y$w_buff1_used = y$w_buff0_used [L783] 2 y$w_buff0_used = (_Bool)1 [L784] CALL 2 __VERIFIER_assert(!(y$w_buff1_used && y$w_buff0_used)) [L18] COND FALSE 2 !(!expression) [L784] RET 2 __VERIFIER_assert(!(y$w_buff1_used && y$w_buff0_used)) [L785] 2 y$r_buff1_thd0 = y$r_buff0_thd0 [L786] 2 y$r_buff1_thd1 = y$r_buff0_thd1 [L787] 2 y$r_buff1_thd2 = y$r_buff0_thd2 [L788] 2 y$r_buff1_thd3 = y$r_buff0_thd3 [L789] 2 y$r_buff0_thd2 = (_Bool)1 VAL [\old(arg)={0:0}, \old(arg)={0:0}, \old(arg)={0:0}, __unbuffered_cnt=0, __unbuffered_p0_EAX=1, __unbuffered_p0_EBX=0, __unbuffered_p2_EAX$flush_delayed=0, __unbuffered_p2_EAX$mem_tmp=0, __unbuffered_p2_EAX$r_buff0_thd0=0, __unbuffered_p2_EAX$r_buff0_thd1=0, __unbuffered_p2_EAX$r_buff0_thd2=0, __unbuffered_p2_EAX$r_buff0_thd3=0, __unbuffered_p2_EAX$r_buff1_thd0=0, __unbuffered_p2_EAX$r_buff1_thd1=0, __unbuffered_p2_EAX$r_buff1_thd2=0, __unbuffered_p2_EAX$r_buff1_thd3=0, __unbuffered_p2_EAX$read_delayed=1, __unbuffered_p2_EAX$read_delayed_var={3:0}, __unbuffered_p2_EAX$w_buff0=0, __unbuffered_p2_EAX$w_buff0_used=0, __unbuffered_p2_EAX$w_buff1=0, __unbuffered_p2_EAX$w_buff1_used=0, __unbuffered_p2_EAX=0, arg={0:0}, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice1=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=1, 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=1, y$w_buff0_used=1, y$w_buff1=0, y$w_buff1_used=0, y={3:0}, z=1] [L792] EXPR 2 y$w_buff0_used && y$r_buff0_thd2 ? y$w_buff0 : (y$w_buff1_used && y$r_buff1_thd2 ? y$w_buff1 : y) [L792] EXPR 2 y$w_buff0_used && y$r_buff0_thd2 ? y$w_buff0 : (y$w_buff1_used && y$r_buff1_thd2 ? y$w_buff1 : y) [L792] 2 y = y$w_buff0_used && y$r_buff0_thd2 ? y$w_buff0 : (y$w_buff1_used && y$r_buff1_thd2 ? y$w_buff1 : y) [L793] 2 y$w_buff0_used = y$w_buff0_used && y$r_buff0_thd2 ? (_Bool)0 : y$w_buff0_used [L794] 2 y$w_buff1_used = y$w_buff0_used && y$r_buff0_thd2 || y$w_buff1_used && y$r_buff1_thd2 ? (_Bool)0 : y$w_buff1_used [L795] 2 y$r_buff0_thd2 = y$w_buff0_used && y$r_buff0_thd2 ? (_Bool)0 : y$r_buff0_thd2 [L796] 2 y$r_buff1_thd2 = y$w_buff0_used && y$r_buff0_thd2 || y$w_buff1_used && y$r_buff1_thd2 ? (_Bool)0 : y$r_buff1_thd2 VAL [\old(arg)={0:0}, \old(arg)={0:0}, \old(arg)={0:0}, __unbuffered_cnt=0, __unbuffered_p0_EAX=1, __unbuffered_p0_EBX=0, __unbuffered_p2_EAX$flush_delayed=0, __unbuffered_p2_EAX$mem_tmp=0, __unbuffered_p2_EAX$r_buff0_thd0=0, __unbuffered_p2_EAX$r_buff0_thd1=0, __unbuffered_p2_EAX$r_buff0_thd2=0, __unbuffered_p2_EAX$r_buff0_thd3=0, __unbuffered_p2_EAX$r_buff1_thd0=0, __unbuffered_p2_EAX$r_buff1_thd1=0, __unbuffered_p2_EAX$r_buff1_thd2=0, __unbuffered_p2_EAX$r_buff1_thd3=0, __unbuffered_p2_EAX$read_delayed=1, __unbuffered_p2_EAX$read_delayed_var={3:0}, __unbuffered_p2_EAX$w_buff0=0, __unbuffered_p2_EAX$w_buff0_used=0, __unbuffered_p2_EAX$w_buff1=0, __unbuffered_p2_EAX$w_buff1_used=0, __unbuffered_p2_EAX=0, arg={0:0}, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice1=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=1, 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=1, y$w_buff0_used=0, y$w_buff1=0, y$w_buff1_used=0, y={3:0}, z=1] [L799] 2 __unbuffered_cnt = __unbuffered_cnt + 1 VAL [\old(arg)={0:0}, \old(arg)={0:0}, \old(arg)={0:0}, __unbuffered_cnt=1, __unbuffered_p0_EAX=1, __unbuffered_p0_EBX=0, __unbuffered_p2_EAX$flush_delayed=0, __unbuffered_p2_EAX$mem_tmp=0, __unbuffered_p2_EAX$r_buff0_thd0=0, __unbuffered_p2_EAX$r_buff0_thd1=0, __unbuffered_p2_EAX$r_buff0_thd2=0, __unbuffered_p2_EAX$r_buff0_thd3=0, __unbuffered_p2_EAX$r_buff1_thd0=0, __unbuffered_p2_EAX$r_buff1_thd1=0, __unbuffered_p2_EAX$r_buff1_thd2=0, __unbuffered_p2_EAX$r_buff1_thd3=0, __unbuffered_p2_EAX$read_delayed=1, __unbuffered_p2_EAX$read_delayed_var={3:0}, __unbuffered_p2_EAX$w_buff0=0, __unbuffered_p2_EAX$w_buff0_used=0, __unbuffered_p2_EAX$w_buff1=0, __unbuffered_p2_EAX$w_buff1_used=0, __unbuffered_p2_EAX=0, arg={0:0}, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice1=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=1, 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=1, y$w_buff0_used=0, y$w_buff1=0, y$w_buff1_used=0, y={3:0}, z=1] [L835] 3 __unbuffered_cnt = __unbuffered_cnt + 1 VAL [\old(arg)={0:0}, \old(arg)={0:0}, __unbuffered_cnt=2, __unbuffered_p0_EAX=1, __unbuffered_p0_EBX=0, __unbuffered_p2_EAX$flush_delayed=0, __unbuffered_p2_EAX$mem_tmp=0, __unbuffered_p2_EAX$r_buff0_thd0=0, __unbuffered_p2_EAX$r_buff0_thd1=0, __unbuffered_p2_EAX$r_buff0_thd2=0, __unbuffered_p2_EAX$r_buff0_thd3=0, __unbuffered_p2_EAX$r_buff1_thd0=0, __unbuffered_p2_EAX$r_buff1_thd1=0, __unbuffered_p2_EAX$r_buff1_thd2=0, __unbuffered_p2_EAX$r_buff1_thd3=0, __unbuffered_p2_EAX$read_delayed=1, __unbuffered_p2_EAX$read_delayed_var={3:0}, __unbuffered_p2_EAX$w_buff0=0, __unbuffered_p2_EAX$w_buff0_used=0, __unbuffered_p2_EAX$w_buff1=0, __unbuffered_p2_EAX$w_buff1_used=0, __unbuffered_p2_EAX=0, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice1=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=1, 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=1, y$w_buff0_used=0, y$w_buff1=0, y$w_buff1_used=0, y={3:0}, z=1] [L770] 1 __unbuffered_cnt = __unbuffered_cnt + 1 VAL [\old(arg)={0:0}, \old(arg)={0:0}, __unbuffered_cnt=3, __unbuffered_p0_EAX=1, __unbuffered_p0_EBX=0, __unbuffered_p2_EAX$flush_delayed=0, __unbuffered_p2_EAX$mem_tmp=0, __unbuffered_p2_EAX$r_buff0_thd0=0, __unbuffered_p2_EAX$r_buff0_thd1=0, __unbuffered_p2_EAX$r_buff0_thd2=0, __unbuffered_p2_EAX$r_buff0_thd3=0, __unbuffered_p2_EAX$r_buff1_thd0=0, __unbuffered_p2_EAX$r_buff1_thd1=0, __unbuffered_p2_EAX$r_buff1_thd2=0, __unbuffered_p2_EAX$r_buff1_thd3=0, __unbuffered_p2_EAX$read_delayed=1, __unbuffered_p2_EAX$read_delayed_var={3:0}, __unbuffered_p2_EAX$w_buff0=0, __unbuffered_p2_EAX$w_buff0_used=0, __unbuffered_p2_EAX$w_buff1=0, __unbuffered_p2_EAX$w_buff1_used=0, __unbuffered_p2_EAX=0, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice1=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=1, 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=1, y$w_buff0_used=0, y$w_buff1=0, y$w_buff1_used=0, y={3:0}, z=1] [L857] 0 main$tmp_guard0 = __unbuffered_cnt == 3 VAL [\old(arg)={0:0}, \old(arg)={0:0}, __unbuffered_cnt=3, __unbuffered_p0_EAX=1, __unbuffered_p0_EBX=0, __unbuffered_p2_EAX$flush_delayed=0, __unbuffered_p2_EAX$mem_tmp=0, __unbuffered_p2_EAX$r_buff0_thd0=0, __unbuffered_p2_EAX$r_buff0_thd1=0, __unbuffered_p2_EAX$r_buff0_thd2=0, __unbuffered_p2_EAX$r_buff0_thd3=0, __unbuffered_p2_EAX$r_buff1_thd0=0, __unbuffered_p2_EAX$r_buff1_thd1=0, __unbuffered_p2_EAX$r_buff1_thd2=0, __unbuffered_p2_EAX$r_buff1_thd3=0, __unbuffered_p2_EAX$read_delayed=1, __unbuffered_p2_EAX$read_delayed_var={3:0}, __unbuffered_p2_EAX$w_buff0=0, __unbuffered_p2_EAX$w_buff0_used=0, __unbuffered_p2_EAX$w_buff1=0, __unbuffered_p2_EAX$w_buff1_used=0, __unbuffered_p2_EAX=0, arg={0:0}, arg={0:0}, main$tmp_guard0=1, main$tmp_guard1=0, t2052=-1, t2053=0, t2054=1, weak$$choice0=0, weak$$choice1=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=1, 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=1, y$w_buff0_used=0, y$w_buff1=0, y$w_buff1_used=0, y={3:0}, z=1] [L859] CALL 0 assume_abort_if_not(main$tmp_guard0) [L3] COND FALSE 0 !(!cond) [L859] RET 0 assume_abort_if_not(main$tmp_guard0) [L861] EXPR 0 y$w_buff0_used && y$r_buff0_thd0 ? y$w_buff0 : (y$w_buff1_used && y$r_buff1_thd0 ? y$w_buff1 : y) [L861] EXPR 0 y$w_buff1_used && y$r_buff1_thd0 ? y$w_buff1 : y [L861] EXPR 0 \read(y) [L861] EXPR 0 y$w_buff1_used && y$r_buff1_thd0 ? y$w_buff1 : y [L861] EXPR 0 y$w_buff0_used && y$r_buff0_thd0 ? y$w_buff0 : (y$w_buff1_used && y$r_buff1_thd0 ? y$w_buff1 : y) [L861] 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) [L862] 0 y$w_buff0_used = y$w_buff0_used && y$r_buff0_thd0 ? (_Bool)0 : y$w_buff0_used [L863] 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 [L864] 0 y$r_buff0_thd0 = y$w_buff0_used && y$r_buff0_thd0 ? (_Bool)0 : y$r_buff0_thd0 [L865] 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 [\old(arg)={0:0}, \old(arg)={0:0}, __unbuffered_cnt=3, __unbuffered_p0_EAX=1, __unbuffered_p0_EBX=0, __unbuffered_p2_EAX$flush_delayed=0, __unbuffered_p2_EAX$mem_tmp=0, __unbuffered_p2_EAX$r_buff0_thd0=0, __unbuffered_p2_EAX$r_buff0_thd1=0, __unbuffered_p2_EAX$r_buff0_thd2=0, __unbuffered_p2_EAX$r_buff0_thd3=0, __unbuffered_p2_EAX$r_buff1_thd0=0, __unbuffered_p2_EAX$r_buff1_thd1=0, __unbuffered_p2_EAX$r_buff1_thd2=0, __unbuffered_p2_EAX$r_buff1_thd3=0, __unbuffered_p2_EAX$read_delayed=1, __unbuffered_p2_EAX$read_delayed_var={3:0}, __unbuffered_p2_EAX$w_buff0=0, __unbuffered_p2_EAX$w_buff0_used=0, __unbuffered_p2_EAX$w_buff1=0, __unbuffered_p2_EAX$w_buff1_used=0, __unbuffered_p2_EAX=0, arg={0:0}, arg={0:0}, main$tmp_guard0=1, main$tmp_guard1=0, t2052=-1, t2053=0, t2054=1, weak$$choice0=0, weak$$choice1=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=1, 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=1, y$w_buff0_used=0, y$w_buff1=0, y$w_buff1_used=0, y={3:0}, z=1] [L868] 0 weak$$choice1 = __VERIFIER_nondet_bool() [L869] EXPR 0 __unbuffered_p2_EAX$read_delayed ? (weak$$choice1 ? *__unbuffered_p2_EAX$read_delayed_var : __unbuffered_p2_EAX) : __unbuffered_p2_EAX [L869] EXPR 0 weak$$choice1 ? *__unbuffered_p2_EAX$read_delayed_var : __unbuffered_p2_EAX [L869] EXPR 0 \read(*__unbuffered_p2_EAX$read_delayed_var) [L869] EXPR 0 weak$$choice1 ? *__unbuffered_p2_EAX$read_delayed_var : __unbuffered_p2_EAX [L869] EXPR 0 __unbuffered_p2_EAX$read_delayed ? (weak$$choice1 ? *__unbuffered_p2_EAX$read_delayed_var : __unbuffered_p2_EAX) : __unbuffered_p2_EAX [L869] 0 __unbuffered_p2_EAX = __unbuffered_p2_EAX$read_delayed ? (weak$$choice1 ? *__unbuffered_p2_EAX$read_delayed_var : __unbuffered_p2_EAX) : __unbuffered_p2_EAX [L870] 0 main$tmp_guard1 = !(__unbuffered_p0_EAX == 1 && __unbuffered_p0_EBX == 0 && __unbuffered_p2_EAX == 1) VAL [\old(arg)={0:0}, \old(arg)={0:0}, __unbuffered_cnt=3, __unbuffered_p0_EAX=1, __unbuffered_p0_EBX=0, __unbuffered_p2_EAX$flush_delayed=0, __unbuffered_p2_EAX$mem_tmp=0, __unbuffered_p2_EAX$r_buff0_thd0=0, __unbuffered_p2_EAX$r_buff0_thd1=0, __unbuffered_p2_EAX$r_buff0_thd2=0, __unbuffered_p2_EAX$r_buff0_thd3=0, __unbuffered_p2_EAX$r_buff1_thd0=0, __unbuffered_p2_EAX$r_buff1_thd1=0, __unbuffered_p2_EAX$r_buff1_thd2=0, __unbuffered_p2_EAX$r_buff1_thd3=0, __unbuffered_p2_EAX$read_delayed=1, __unbuffered_p2_EAX$read_delayed_var={3:0}, __unbuffered_p2_EAX$w_buff0=0, __unbuffered_p2_EAX$w_buff0_used=0, __unbuffered_p2_EAX$w_buff1=0, __unbuffered_p2_EAX$w_buff1_used=0, __unbuffered_p2_EAX=1, arg={0:0}, arg={0:0}, main$tmp_guard0=1, main$tmp_guard1=0, t2052=-1, t2053=0, t2054=1, weak$$choice0=0, weak$$choice1=1, 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=1, 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=1, y$w_buff0_used=0, y$w_buff1=0, y$w_buff1_used=0, y={3:0}, z=1] [L872] CALL 0 __VERIFIER_assert(main$tmp_guard1) [L18] COND TRUE 0 !expression [L18] CALL 0 reach_error() [L17] COND FALSE 0 !(0) VAL [\old(arg)={0:0}, \old(arg)={0:0}, __unbuffered_cnt=3, __unbuffered_p0_EAX=1, __unbuffered_p0_EBX=0, __unbuffered_p2_EAX$flush_delayed=0, __unbuffered_p2_EAX$mem_tmp=0, __unbuffered_p2_EAX$r_buff0_thd0=0, __unbuffered_p2_EAX$r_buff0_thd1=0, __unbuffered_p2_EAX$r_buff0_thd2=0, __unbuffered_p2_EAX$r_buff0_thd3=0, __unbuffered_p2_EAX$r_buff1_thd0=0, __unbuffered_p2_EAX$r_buff1_thd1=0, __unbuffered_p2_EAX$r_buff1_thd2=0, __unbuffered_p2_EAX$r_buff1_thd3=0, __unbuffered_p2_EAX$read_delayed=1, __unbuffered_p2_EAX$read_delayed_var={3:0}, __unbuffered_p2_EAX$w_buff0=0, __unbuffered_p2_EAX$w_buff0_used=0, __unbuffered_p2_EAX$w_buff1=0, __unbuffered_p2_EAX$w_buff1_used=0, __unbuffered_p2_EAX=1, arg={0:0}, arg={0:0}, main$tmp_guard0=1, main$tmp_guard1=0, weak$$choice0=0, weak$$choice1=1, 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=1, 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=1, y$w_buff0_used=0, y$w_buff1=0, y$w_buff1_used=0, y={3:0}, z=1] [L17] 0 __assert_fail ("0", "safe012_power.opt.c", 8, __extension__ __PRETTY_FUNCTION__) VAL [\old(arg)={0:0}, \old(arg)={0:0}, __unbuffered_cnt=3, __unbuffered_p0_EAX=1, __unbuffered_p0_EBX=0, __unbuffered_p2_EAX$flush_delayed=0, __unbuffered_p2_EAX$mem_tmp=0, __unbuffered_p2_EAX$r_buff0_thd0=0, __unbuffered_p2_EAX$r_buff0_thd1=0, __unbuffered_p2_EAX$r_buff0_thd2=0, __unbuffered_p2_EAX$r_buff0_thd3=0, __unbuffered_p2_EAX$r_buff1_thd0=0, __unbuffered_p2_EAX$r_buff1_thd1=0, __unbuffered_p2_EAX$r_buff1_thd2=0, __unbuffered_p2_EAX$r_buff1_thd3=0, __unbuffered_p2_EAX$read_delayed=1, __unbuffered_p2_EAX$read_delayed_var={3:0}, __unbuffered_p2_EAX$w_buff0=0, __unbuffered_p2_EAX$w_buff0_used=0, __unbuffered_p2_EAX$w_buff1=0, __unbuffered_p2_EAX$w_buff1_used=0, __unbuffered_p2_EAX=1, arg={0:0}, arg={0:0}, main$tmp_guard0=1, main$tmp_guard1=0, weak$$choice0=0, weak$$choice1=1, 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=1, 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=1, y$w_buff0_used=0, y$w_buff1=0, y$w_buff1_used=0, y={3:0}, z=1] - UnprovableResult [Line: 17]: Unable to prove that all allocated memory was freed Unable to prove that all allocated memory was freed Reason: Not analyzed. - UnprovableResult [Line: -1]: Unable to prove that pointer dereference always succeeds Unable to prove that pointer dereference always succeeds Reason: Not analyzed. - UnprovableResult [Line: -1]: Unable to prove that pointer dereference always succeeds Unable to prove that pointer dereference always succeeds Reason: Not analyzed. - UnprovableResult [Line: -1]: Unable to prove that pointer dereference always succeeds Unable to prove that pointer dereference always succeeds Reason: Not analyzed. - UnprovableResult [Line: -1]: Unable to prove that pointer dereference always succeeds Unable to prove that pointer dereference always succeeds Reason: Not analyzed. - UnprovableResult [Line: -1]: Unable to prove that pointer dereference always succeeds Unable to prove that pointer dereference always succeeds Reason: Not analyzed. - UnprovableResult [Line: -1]: Unable to prove that pointer dereference always succeeds Unable to prove that pointer dereference always succeeds Reason: Not analyzed. - UnprovableResult [Line: -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: -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: -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: -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: 848]: Unable to prove that all allocated memory was freed Unable to prove that all allocated memory was freed Reason: Not analyzed. - UnprovableResult [Line: 853]: 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: 851]: 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: 855]: 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, 122 locations, 61 error locations. Started 1 CEGAR loops. EmptinessCheckTime: 0.0s, RemoveRedundantFlowTime: 0.0s, RemoveRedundantFlowUnfoldingTime: 0.0s, BackfoldingTime: 0.0s, BackfoldingUnfoldingTime: 0.0s, FlowIncreaseByBackfolding: 0, BasicCegarLoop: OverallTime: 24.4s, OverallIterations: 14, TraceHistogramMax: 1, PathProgramHistogramMax: 4, EmptinessCheckTime: 0.0s, AutomataDifference: 15.9s, DeadEndRemovalTime: 0.0s, HoareAnnotationTime: 0.0s, InitialAbstractionConstructionTime: 0.2s, HoareTripleCheckerStatistics: 0 mSolverCounterUnknown, 661 SdHoareTripleChecker+Valid, 4.5s IncrementalHoareTripleChecker+Time, 0 mSdLazyCounter, 616 mSDsluCounter, 255 SdHoareTripleChecker+Invalid, 3.8s Time, 0 mProtectedAction, 0 SdHoareTripleChecker+Unchecked, 0 IncrementalHoareTripleChecker+Unchecked, 222 mSDsCounter, 80 IncrementalHoareTripleChecker+Valid, 0 mProtectedPredicate, 1646 IncrementalHoareTripleChecker+Invalid, 1726 SdHoareTripleChecker+Unknown, 0 mSolverCounterNotChecked, 80 mSolverCounterUnsat, 33 mSDtfsCounter, 1646 mSolverCounterSat, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Unknown, PredicateUnifierStatistics: 0 DeclaredPredicates, 231 GetRequests, 174 SyntacticMatches, 0 SemanticMatches, 57 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 48 ImplicationChecksByTransitivity, 0.6s Time, 0.0s BasicInterpolantAutomatonTime, BiggestAbstraction: size=240occurred in iteration=12, InterpolantAutomatonStates: 63, 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.5s SsaConstructionTime, 0.5s SatisfiabilityAnalysisTime, 1.8s InterpolantComputationTime, 255 NumberOfCodeBlocks, 255 NumberOfCodeBlocksAsserted, 15 NumberOfCheckSat, 212 ConstructedInterpolants, 0 QuantifiedInterpolants, 1083 SizeOfPredicates, 30 NumberOfNonLiveVariables, 1694 ConjunctsInSsa, 71 ConjunctsInUnsatCore, 13 InterpolantComputations, 13 PerfectInterpolantSequences, 0/0 InterpolantCoveringCapability, INVARIANT_SYNTHESIS: No data available, INTERPOLANT_CONSOLIDATION: No data available, ABSTRACT_INTERPRETATION: No data available, PDR: No data available, ACCELERATED_INTERPOLATION: No data available, SIFA: No data available, ReuseStatistics: No data available, ConComCheckerStatistics: No data available RESULT: Ultimate could not prove your program: unable to determine feasibility of some traces [2024-11-28 05:23:08,913 INFO L552 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_8dc03989-dd1e-4552-8a40-46136af171cd/bin/uautomizer-verify-aQ6SnzHsRB/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 (1)] Ended with exit code 0 Received shutdown request... --- End real Ultimate output --- Execution finished normally Writing output log to file Ultimate.log Result: UNKNOWN: Overapproximated counterexample