./Ultimate.py --spec ../../sv-benchmarks/c/properties/valid-memsafety.prp --file ../../sv-benchmarks/c/pthread-wmm/safe002_power.oepc.i --full-output --architecture 32bit -------------------------------------------------------------------------------- Checking for memory safety (deref-memtrack) Using default analysis Version 826ab2ba Calling Ultimate with: /usr/bin/java -Dosgi.configuration.area=/tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_d6c6bbac-8b87-4a12-bfcd-06c657a41f19/bin/uautomizer-verify-qhAvR1uOyd/data/config -Xmx15G -Xms4m -jar /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_d6c6bbac-8b87-4a12-bfcd-06c657a41f19/bin/uautomizer-verify-qhAvR1uOyd/plugins/org.eclipse.equinox.launcher_1.6.800.v20240513-1750.jar -data @noDefault -ultimatedata /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_d6c6bbac-8b87-4a12-bfcd-06c657a41f19/bin/uautomizer-verify-qhAvR1uOyd/data -tc /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_d6c6bbac-8b87-4a12-bfcd-06c657a41f19/bin/uautomizer-verify-qhAvR1uOyd/config/AutomizerMemDerefMemtrack.xml -i ../../sv-benchmarks/c/pthread-wmm/safe002_power.oepc.i -s /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_d6c6bbac-8b87-4a12-bfcd-06c657a41f19/bin/uautomizer-verify-qhAvR1uOyd/config/svcomp-DerefFreeMemtrack-32bit-Automizer_Default.epf --cacsl2boogietranslator.entry.function main --witnessprinter.witness.directory /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_d6c6bbac-8b87-4a12-bfcd-06c657a41f19/bin/uautomizer-verify-qhAvR1uOyd --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 7a9379df521a7077d18fd2276dc35da388f77854d23421e689a681d711c31769 --- Real Ultimate output --- This is Ultimate 0.3.0-dev-826ab2b [2024-11-13 14:07:42,078 INFO L188 SettingsManager]: Resetting all preferences to default values... [2024-11-13 14:07:42,171 INFO L114 SettingsManager]: Loading settings from /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_d6c6bbac-8b87-4a12-bfcd-06c657a41f19/bin/uautomizer-verify-qhAvR1uOyd/config/svcomp-DerefFreeMemtrack-32bit-Automizer_Default.epf [2024-11-13 14:07:42,184 WARN L101 SettingsManager]: Preference file contains the following unknown settings: [2024-11-13 14:07:42,184 WARN L103 SettingsManager]: * de.uni_freiburg.informatik.ultimate.core.Log level for class [2024-11-13 14:07:42,234 INFO L130 SettingsManager]: Preferences different from defaults after loading the file: [2024-11-13 14:07:42,234 INFO L151 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2024-11-13 14:07:42,235 INFO L153 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2024-11-13 14:07:42,237 INFO L151 SettingsManager]: Preferences of Boogie Preprocessor differ from their defaults: [2024-11-13 14:07:42,237 INFO L153 SettingsManager]: * Use memory slicer=true [2024-11-13 14:07:42,239 INFO L151 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2024-11-13 14:07:42,239 INFO L153 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2024-11-13 14:07:42,239 INFO L151 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2024-11-13 14:07:42,240 INFO L153 SettingsManager]: * Create parallel compositions if possible=false [2024-11-13 14:07:42,241 INFO L153 SettingsManager]: * Use SBE=true [2024-11-13 14:07:42,241 INFO L151 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2024-11-13 14:07:42,241 INFO L153 SettingsManager]: * sizeof long=4 [2024-11-13 14:07:42,242 INFO L153 SettingsManager]: * Overapproximate operations on floating types=true [2024-11-13 14:07:42,242 INFO L153 SettingsManager]: * sizeof POINTER=4 [2024-11-13 14:07:42,242 INFO L153 SettingsManager]: * Check division by zero=IGNORE [2024-11-13 14:07:42,242 INFO L153 SettingsManager]: * Check for the main procedure if all allocated memory was freed=true [2024-11-13 14:07:42,242 INFO L153 SettingsManager]: * Bitprecise bitfields=true [2024-11-13 14:07:42,242 INFO L153 SettingsManager]: * SV-COMP memtrack compatibility mode=true [2024-11-13 14:07:42,242 INFO L153 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2024-11-13 14:07:42,243 INFO L153 SettingsManager]: * Adapt memory model on pointer casts if necessary=true [2024-11-13 14:07:42,243 INFO L153 SettingsManager]: * Allow undefined functions=false [2024-11-13 14:07:42,243 INFO L153 SettingsManager]: * Check unreachability of reach_error function=false [2024-11-13 14:07:42,243 INFO L153 SettingsManager]: * sizeof long double=12 [2024-11-13 14:07:42,243 INFO L153 SettingsManager]: * Use constant arrays=true [2024-11-13 14:07:42,244 INFO L151 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2024-11-13 14:07:42,244 INFO L153 SettingsManager]: * Size of a code block=SequenceOfStatements [2024-11-13 14:07:42,244 INFO L153 SettingsManager]: * Only consider context switches at boundaries of atomic blocks=true [2024-11-13 14:07:42,245 INFO L153 SettingsManager]: * SMT solver=External_DefaultMode [2024-11-13 14:07:42,245 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2024-11-13 14:07:42,245 INFO L151 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2024-11-13 14:07:42,245 INFO L153 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2024-11-13 14:07:42,246 INFO L153 SettingsManager]: * Trace refinement strategy=CAMEL [2024-11-13 14:07:42,246 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2024-11-13 14:07:42,247 INFO L153 SettingsManager]: * Apply one-shot large block encoding in concurrent analysis=false [2024-11-13 14:07:42,247 INFO L153 SettingsManager]: * Automaton type used in concurrency analysis=PETRI_NET [2024-11-13 14:07:42,247 INFO L153 SettingsManager]: * Order on configurations for Petri net unfoldings=DBO [2024-11-13 14:07:42,247 INFO L153 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2024-11-13 14:07:42,247 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_d6c6bbac-8b87-4a12-bfcd-06c657a41f19/bin/uautomizer-verify-qhAvR1uOyd 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 -> 7a9379df521a7077d18fd2276dc35da388f77854d23421e689a681d711c31769 [2024-11-13 14:07:42,655 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2024-11-13 14:07:42,665 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2024-11-13 14:07:42,668 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2024-11-13 14:07:42,669 INFO L270 PluginConnector]: Initializing CDTParser... [2024-11-13 14:07:42,670 INFO L274 PluginConnector]: CDTParser initialized [2024-11-13 14:07:42,671 INFO L431 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_d6c6bbac-8b87-4a12-bfcd-06c657a41f19/bin/uautomizer-verify-qhAvR1uOyd/../../sv-benchmarks/c/pthread-wmm/safe002_power.oepc.i Unable to find full path for "g++" [2024-11-13 14:07:44,668 INFO L533 CDTParser]: Created temporary CDT project at NULL [2024-11-13 14:07:45,011 INFO L384 CDTParser]: Found 1 translation units. [2024-11-13 14:07:45,015 INFO L180 CDTParser]: Scanning /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_d6c6bbac-8b87-4a12-bfcd-06c657a41f19/sv-benchmarks/c/pthread-wmm/safe002_power.oepc.i [2024-11-13 14:07:45,039 INFO L427 CDTParser]: About to delete temporary CDT project at /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_d6c6bbac-8b87-4a12-bfcd-06c657a41f19/bin/uautomizer-verify-qhAvR1uOyd/data/d8f383a2b/802fa8db0a2c4e5e85c038fbf149f94e/FLAG12f5a2cc9 [2024-11-13 14:07:45,051 INFO L435 CDTParser]: Successfully deleted /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_d6c6bbac-8b87-4a12-bfcd-06c657a41f19/bin/uautomizer-verify-qhAvR1uOyd/data/d8f383a2b/802fa8db0a2c4e5e85c038fbf149f94e [2024-11-13 14:07:45,053 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2024-11-13 14:07:45,054 INFO L133 ToolchainWalker]: Walking toolchain with 6 elements. [2024-11-13 14:07:45,055 INFO L112 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2024-11-13 14:07:45,055 INFO L270 PluginConnector]: Initializing CACSL2BoogieTranslator... [2024-11-13 14:07:45,058 INFO L274 PluginConnector]: CACSL2BoogieTranslator initialized [2024-11-13 14:07:45,059 INFO L184 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 13.11 02:07:45" (1/1) ... [2024-11-13 14:07:45,060 INFO L204 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@f38a58f and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.11 02:07:45, skipping insertion in model container [2024-11-13 14:07:45,060 INFO L184 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 13.11 02:07:45" (1/1) ... [2024-11-13 14:07:45,096 INFO L175 MainTranslator]: Built tables and reachable declarations [2024-11-13 14:07:45,482 INFO L210 PostProcessor]: Analyzing one entry point: main [2024-11-13 14:07:45,495 INFO L200 MainTranslator]: Completed pre-run [2024-11-13 14:07:45,640 INFO L210 PostProcessor]: Analyzing one entry point: main [2024-11-13 14:07:45,695 INFO L204 MainTranslator]: Completed translation [2024-11-13 14:07:45,696 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.11 02:07:45 WrapperNode [2024-11-13 14:07:45,697 INFO L131 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2024-11-13 14:07:45,698 INFO L112 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2024-11-13 14:07:45,698 INFO L270 PluginConnector]: Initializing Boogie Procedure Inliner... [2024-11-13 14:07:45,700 INFO L274 PluginConnector]: Boogie Procedure Inliner initialized [2024-11-13 14:07:45,707 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.11 02:07:45" (1/1) ... [2024-11-13 14:07:45,731 INFO L184 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.11 02:07:45" (1/1) ... [2024-11-13 14:07:45,782 INFO L138 Inliner]: procedures = 175, calls = 73, calls flagged for inlining = 5, calls inlined = 5, statements flattened = 162 [2024-11-13 14:07:45,786 INFO L131 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2024-11-13 14:07:45,787 INFO L112 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2024-11-13 14:07:45,787 INFO L270 PluginConnector]: Initializing Boogie Preprocessor... [2024-11-13 14:07:45,787 INFO L274 PluginConnector]: Boogie Preprocessor initialized [2024-11-13 14:07:45,800 INFO L184 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.11 02:07:45" (1/1) ... [2024-11-13 14:07:45,801 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.11 02:07:45" (1/1) ... [2024-11-13 14:07:45,808 INFO L184 PluginConnector]: Executing the observer MemorySlicer from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.11 02:07:45" (1/1) ... [2024-11-13 14:07:45,851 INFO L175 MemorySlicer]: Split 32 memory accesses to 2 slices as follows [2, 30]. 94 percent of accesses are in the largest equivalence class. The 3 initializations are split as follows [2, 1]. The 11 writes are split as follows [0, 11]. [2024-11-13 14:07:45,851 INFO L184 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.11 02:07:45" (1/1) ... [2024-11-13 14:07:45,851 INFO L184 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.11 02:07:45" (1/1) ... [2024-11-13 14:07:45,874 INFO L184 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.11 02:07:45" (1/1) ... [2024-11-13 14:07:45,882 INFO L184 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.11 02:07:45" (1/1) ... [2024-11-13 14:07:45,887 INFO L184 PluginConnector]: Executing the observer LTLStepAnnotator from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.11 02:07:45" (1/1) ... [2024-11-13 14:07:45,890 INFO L184 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.11 02:07:45" (1/1) ... [2024-11-13 14:07:45,901 INFO L131 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2024-11-13 14:07:45,902 INFO L112 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2024-11-13 14:07:45,906 INFO L270 PluginConnector]: Initializing RCFGBuilder... [2024-11-13 14:07:45,906 INFO L274 PluginConnector]: RCFGBuilder initialized [2024-11-13 14:07:45,907 INFO L184 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.11 02:07:45" (1/1) ... [2024-11-13 14:07:45,917 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2024-11-13 14:07:45,934 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_d6c6bbac-8b87-4a12-bfcd-06c657a41f19/bin/uautomizer-verify-qhAvR1uOyd/z3 [2024-11-13 14:07:45,950 INFO L229 MonitoredProcess]: Starting monitored process 1 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_d6c6bbac-8b87-4a12-bfcd-06c657a41f19/bin/uautomizer-verify-qhAvR1uOyd/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 (exit command is (exit), workingDir is null) [2024-11-13 14:07:45,954 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_d6c6bbac-8b87-4a12-bfcd-06c657a41f19/bin/uautomizer-verify-qhAvR1uOyd/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 (1)] Waiting until timeout for monitored process [2024-11-13 14:07:45,990 INFO L130 BoogieDeclarations]: Found specification of procedure read~int#0 [2024-11-13 14:07:45,990 INFO L130 BoogieDeclarations]: Found specification of procedure read~int#1 [2024-11-13 14:07:45,990 INFO L130 BoogieDeclarations]: Found specification of procedure write~int#0 [2024-11-13 14:07:45,990 INFO L130 BoogieDeclarations]: Found specification of procedure write~int#1 [2024-11-13 14:07:45,991 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_atomic_begin [2024-11-13 14:07:45,991 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2024-11-13 14:07:45,991 INFO L130 BoogieDeclarations]: Found specification of procedure P0 [2024-11-13 14:07:45,991 INFO L138 BoogieDeclarations]: Found implementation of procedure P0 [2024-11-13 14:07:45,991 INFO L130 BoogieDeclarations]: Found specification of procedure P1 [2024-11-13 14:07:45,991 INFO L138 BoogieDeclarations]: Found implementation of procedure P1 [2024-11-13 14:07:45,992 INFO L130 BoogieDeclarations]: Found specification of procedure P2 [2024-11-13 14:07:45,992 INFO L138 BoogieDeclarations]: Found implementation of procedure P2 [2024-11-13 14:07:45,992 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#0 [2024-11-13 14:07:45,992 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#1 [2024-11-13 14:07:45,992 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_atomic_end [2024-11-13 14:07:45,993 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2024-11-13 14:07:45,993 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2024-11-13 14:07:45,994 WARN L207 CfgBuilder]: User set CodeBlockSize to SequenceOfStatements but program contains fork statements. Overwriting the user preferences and setting CodeBlockSize to OneNontrivialStatement. [2024-11-13 14:07:46,205 INFO L238 CfgBuilder]: Building ICFG [2024-11-13 14:07:46,207 INFO L264 CfgBuilder]: Building CFG for each procedure with an implementation [2024-11-13 14:07:47,270 INFO L283 CfgBuilder]: Omitted future-live optimization because the input is a concurrent program. [2024-11-13 14:07:47,270 INFO L287 CfgBuilder]: Performing block encoding [2024-11-13 14:07:48,655 INFO L311 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2024-11-13 14:07:48,657 INFO L316 CfgBuilder]: Removed 0 assume(true) statements. [2024-11-13 14:07:48,658 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 13.11 02:07:48 BoogieIcfgContainer [2024-11-13 14:07:48,658 INFO L131 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2024-11-13 14:07:48,663 INFO L112 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2024-11-13 14:07:48,663 INFO L270 PluginConnector]: Initializing TraceAbstraction... [2024-11-13 14:07:48,670 INFO L274 PluginConnector]: TraceAbstraction initialized [2024-11-13 14:07:48,670 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 13.11 02:07:45" (1/3) ... [2024-11-13 14:07:48,671 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@faab3fb and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 13.11 02:07:48, skipping insertion in model container [2024-11-13 14:07:48,672 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.11 02:07:45" (2/3) ... [2024-11-13 14:07:48,672 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@faab3fb and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 13.11 02:07:48, skipping insertion in model container [2024-11-13 14:07:48,673 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 13.11 02:07:48" (3/3) ... [2024-11-13 14:07:48,675 INFO L112 eAbstractionObserver]: Analyzing ICFG safe002_power.oepc.i [2024-11-13 14:07:48,698 INFO L217 ceAbstractionStarter]: Automizer settings: Hoare:None NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2024-11-13 14:07:48,701 INFO L154 ceAbstractionStarter]: Applying trace abstraction to ICFG safe002_power.oepc.i that has 4 procedures, 100 locations, 1 initial locations, 0 loop locations, and 60 error locations. [2024-11-13 14:07:48,702 INFO L492 ceAbstractionStarter]: Constructing petrified ICFG for 1 thread instances. [2024-11-13 14:07:49,177 INFO L143 ThreadInstanceAdder]: Constructed 0 joinOtherThreadTransitions. [2024-11-13 14:07:49,238 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 109 places, 101 transitions, 214 flow [2024-11-13 14:07:49,353 INFO L124 PetriNetUnfolderBase]: 2/98 cut-off events. [2024-11-13 14:07:49,358 INFO L125 PetriNetUnfolderBase]: For 0/0 co-relation queries the response was YES. [2024-11-13 14:07:49,366 INFO L83 FinitePrefix]: Finished finitePrefix Result has 108 conditions, 98 events. 2/98 cut-off events. For 0/0 co-relation queries the response was YES. Maximal size of possible extension queue 20. Compared 439 event pairs, 0 based on Foata normal form. 0/36 useless extension candidates. Maximal degree in co-relation 100. Up to 2 conditions per place. [2024-11-13 14:07:49,367 INFO L82 GeneralOperation]: Start removeDead. Operand has 109 places, 101 transitions, 214 flow [2024-11-13 14:07:49,376 INFO L88 GeneralOperation]: Finished RemoveDead, result has has 106 places, 98 transitions, 205 flow [2024-11-13 14:07:49,389 INFO L332 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2024-11-13 14:07:49,409 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;@3e6346ed, mLbeIndependenceSettings=[IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=false, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2024-11-13 14:07:49,409 INFO L334 AbstractCegarLoop]: Starting to check reachability of 103 error locations. [2024-11-13 14:07:49,416 INFO L185 PetriNetUnfolderBase]: Found word, exiting Unfolder. [2024-11-13 14:07:49,417 INFO L124 PetriNetUnfolderBase]: 0/4 cut-off events. [2024-11-13 14:07:49,417 INFO L125 PetriNetUnfolderBase]: For 0/0 co-relation queries the response was YES. [2024-11-13 14:07:49,417 INFO L196 CegarLoopForPetriNet]: Found error trace [2024-11-13 14:07:49,418 INFO L204 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1] [2024-11-13 14:07:49,418 INFO L396 AbstractCegarLoop]: === Iteration 1 === Targeting P0Err0REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [P0Err0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, P0Err1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, P0Err6REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 100 more)] === [2024-11-13 14:07:49,424 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-13 14:07:49,425 INFO L85 PathProgramCache]: Analyzing trace with hash 31873324, now seen corresponding path program 1 times [2024-11-13 14:07:49,434 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-13 14:07:49,435 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1120196133] [2024-11-13 14:07:49,435 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-13 14:07:49,436 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-13 14:07:49,586 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-13 14:07:49,940 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-13 14:07:49,941 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-13 14:07:49,941 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1120196133] [2024-11-13 14:07:49,942 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1120196133] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-13 14:07:49,945 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-13 14:07:49,946 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [1] imperfect sequences [] total 1 [2024-11-13 14:07:49,948 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [627197003] [2024-11-13 14:07:49,949 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-13 14:07:49,958 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2024-11-13 14:07:49,964 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-13 14:07:49,999 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-11-13 14:07:50,000 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-11-13 14:07:50,018 INFO L467 CegarLoopForPetriNet]: Number of universal loopers: 17 out of 101 [2024-11-13 14:07:50,024 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 106 places, 98 transitions, 205 flow. Second operand has 3 states, 3 states have (on average 18.0) internal successors, (54), 3 states have internal predecessors, (54), 0 states have call successors, (0), 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-13 14:07:50,025 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-11-13 14:07:50,026 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 17 of 101 [2024-11-13 14:07:50,027 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-11-13 14:07:55,291 INFO L124 PetriNetUnfolderBase]: 8651/13524 cut-off events. [2024-11-13 14:07:55,291 INFO L125 PetriNetUnfolderBase]: For 16/16 co-relation queries the response was YES. [2024-11-13 14:07:55,337 INFO L83 FinitePrefix]: Finished finitePrefix Result has 25839 conditions, 13524 events. 8651/13524 cut-off events. For 16/16 co-relation queries the response was YES. Maximal size of possible extension queue 1026. Compared 105108 event pairs, 8651 based on Foata normal form. 504/8606 useless extension candidates. Maximal degree in co-relation 25828. Up to 12244 conditions per place. [2024-11-13 14:07:55,460 INFO L140 encePairwiseOnDemand]: 53/101 looper letters, 35 selfloop transitions, 1 changer transitions 0/50 dead transitions. [2024-11-13 14:07:55,463 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 62 places, 50 transitions, 181 flow [2024-11-13 14:07:55,465 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-11-13 14:07:55,468 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2024-11-13 14:07:55,482 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 134 transitions. [2024-11-13 14:07:55,487 INFO L512 CegarLoopForPetriNet]: DFA transition density 0.44224422442244227 [2024-11-13 14:07:55,489 INFO L175 Difference]: Start difference. First operand has 106 places, 98 transitions, 205 flow. Second operand 3 states and 134 transitions. [2024-11-13 14:07:55,491 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 62 places, 50 transitions, 181 flow [2024-11-13 14:07:55,503 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 59 places, 50 transitions, 178 flow, removed 0 selfloop flow, removed 3 redundant places. [2024-11-13 14:07:55,508 INFO L231 Difference]: Finished difference. Result has 59 places, 50 transitions, 108 flow [2024-11-13 14:07:55,514 INFO L260 CegarLoopForPetriNet]: {PETRI_ALPHABET=101, PETRI_DIFFERENCE_MINUEND_FLOW=106, PETRI_DIFFERENCE_MINUEND_PLACES=57, 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=108, PETRI_PLACES=59, PETRI_TRANSITIONS=50} [2024-11-13 14:07:55,519 INFO L277 CegarLoopForPetriNet]: 106 programPoint places, -47 predicate places. [2024-11-13 14:07:55,522 INFO L471 AbstractCegarLoop]: Abstraction has has 59 places, 50 transitions, 108 flow [2024-11-13 14:07:55,522 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 18.0) internal successors, (54), 3 states have internal predecessors, (54), 0 states have call successors, (0), 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-13 14:07:55,522 INFO L196 CegarLoopForPetriNet]: Found error trace [2024-11-13 14:07:55,523 INFO L204 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1] [2024-11-13 14:07:55,523 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable0 [2024-11-13 14:07:55,523 INFO L396 AbstractCegarLoop]: === Iteration 2 === Targeting P0Err1REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [P0Err0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, P0Err1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, P0Err6REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 100 more)] === [2024-11-13 14:07:55,524 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-13 14:07:55,525 INFO L85 PathProgramCache]: Analyzing trace with hash 31873325, now seen corresponding path program 1 times [2024-11-13 14:07:55,526 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-13 14:07:55,526 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1078576234] [2024-11-13 14:07:55,526 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-13 14:07:55,527 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-13 14:07:55,585 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-13 14:07:55,875 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-13 14:07:55,876 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-13 14:07:55,876 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1078576234] [2024-11-13 14:07:55,876 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1078576234] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-13 14:07:55,876 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-13 14:07:55,877 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [1] imperfect sequences [] total 1 [2024-11-13 14:07:55,877 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [511597330] [2024-11-13 14:07:55,877 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-13 14:07:55,878 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2024-11-13 14:07:55,878 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-13 14:07:55,879 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-11-13 14:07:55,879 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-11-13 14:07:55,880 INFO L467 CegarLoopForPetriNet]: Number of universal loopers: 17 out of 101 [2024-11-13 14:07:55,880 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 59 places, 50 transitions, 108 flow. Second operand has 3 states, 3 states have (on average 18.0) internal successors, (54), 3 states have internal predecessors, (54), 0 states have call successors, (0), 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-13 14:07:55,880 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-11-13 14:07:55,880 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 17 of 101 [2024-11-13 14:07:55,880 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-11-13 14:07:57,209 INFO L124 PetriNetUnfolderBase]: 1442/2473 cut-off events. [2024-11-13 14:07:57,209 INFO L125 PetriNetUnfolderBase]: For 0/0 co-relation queries the response was YES. [2024-11-13 14:07:57,219 INFO L83 FinitePrefix]: Finished finitePrefix Result has 4642 conditions, 2473 events. 1442/2473 cut-off events. For 0/0 co-relation queries the response was YES. Maximal size of possible extension queue 187. Compared 16651 event pairs, 1442 based on Foata normal form. 0/2292 useless extension candidates. Maximal degree in co-relation 4636. Up to 2133 conditions per place. [2024-11-13 14:07:57,236 INFO L140 encePairwiseOnDemand]: 89/101 looper letters, 23 selfloop transitions, 1 changer transitions 1/39 dead transitions. [2024-11-13 14:07:57,236 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 50 places, 39 transitions, 136 flow [2024-11-13 14:07:57,236 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-11-13 14:07:57,237 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2024-11-13 14:07:57,237 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 87 transitions. [2024-11-13 14:07:57,238 INFO L512 CegarLoopForPetriNet]: DFA transition density 0.2871287128712871 [2024-11-13 14:07:57,238 INFO L175 Difference]: Start difference. First operand has 59 places, 50 transitions, 108 flow. Second operand 3 states and 87 transitions. [2024-11-13 14:07:57,238 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 50 places, 39 transitions, 136 flow [2024-11-13 14:07:57,239 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 49 places, 39 transitions, 135 flow, removed 0 selfloop flow, removed 1 redundant places. [2024-11-13 14:07:57,243 INFO L231 Difference]: Finished difference. Result has 49 places, 38 transitions, 85 flow [2024-11-13 14:07:57,243 INFO L260 CegarLoopForPetriNet]: {PETRI_ALPHABET=101, PETRI_DIFFERENCE_MINUEND_FLOW=85, PETRI_DIFFERENCE_MINUEND_PLACES=47, 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=85, PETRI_PLACES=49, PETRI_TRANSITIONS=38} [2024-11-13 14:07:57,244 INFO L277 CegarLoopForPetriNet]: 106 programPoint places, -57 predicate places. [2024-11-13 14:07:57,244 INFO L471 AbstractCegarLoop]: Abstraction has has 49 places, 38 transitions, 85 flow [2024-11-13 14:07:57,245 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 18.0) internal successors, (54), 3 states have internal predecessors, (54), 0 states have call successors, (0), 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-13 14:07:57,245 INFO L196 CegarLoopForPetriNet]: Found error trace [2024-11-13 14:07:57,245 INFO L204 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-13 14:07:57,245 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1 [2024-11-13 14:07:57,246 INFO L396 AbstractCegarLoop]: === Iteration 3 === Targeting ULTIMATE.startErr10REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [P0Err0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, P0Err1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, P0Err6REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 100 more)] === [2024-11-13 14:07:57,247 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-13 14:07:57,247 INFO L85 PathProgramCache]: Analyzing trace with hash -1129884754, now seen corresponding path program 1 times [2024-11-13 14:07:57,248 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-13 14:07:57,248 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [940971147] [2024-11-13 14:07:57,251 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-13 14:07:57,251 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-13 14:07:57,332 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-13 14:07:57,753 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-13 14:07:57,753 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-13 14:07:57,754 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [940971147] [2024-11-13 14:07:57,754 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [940971147] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-13 14:07:57,754 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-13 14:07:57,755 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [1] imperfect sequences [] total 1 [2024-11-13 14:07:57,755 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [153914363] [2024-11-13 14:07:57,755 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-13 14:07:57,755 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2024-11-13 14:07:57,756 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-13 14:07:57,756 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-11-13 14:07:57,756 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-11-13 14:07:57,757 INFO L467 CegarLoopForPetriNet]: Number of universal loopers: 17 out of 101 [2024-11-13 14:07:57,757 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 49 places, 38 transitions, 85 flow. Second operand has 3 states, 3 states have (on average 20.333333333333332) internal successors, (61), 3 states have internal predecessors, (61), 0 states have call successors, (0), 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-13 14:07:57,757 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-11-13 14:07:57,758 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 17 of 101 [2024-11-13 14:07:57,758 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-11-13 14:07:58,674 INFO L124 PetriNetUnfolderBase]: 1207/2421 cut-off events. [2024-11-13 14:07:58,675 INFO L125 PetriNetUnfolderBase]: For 0/0 co-relation queries the response was YES. [2024-11-13 14:07:58,685 INFO L83 FinitePrefix]: Finished finitePrefix Result has 4256 conditions, 2421 events. 1207/2421 cut-off events. For 0/0 co-relation queries the response was YES. Maximal size of possible extension queue 158. Compared 17203 event pairs, 275 based on Foata normal form. 0/2289 useless extension candidates. Maximal degree in co-relation 4249. Up to 1393 conditions per place. [2024-11-13 14:07:58,696 INFO L140 encePairwiseOnDemand]: 97/101 looper letters, 40 selfloop transitions, 2 changer transitions 0/56 dead transitions. [2024-11-13 14:07:58,697 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 50 places, 56 transitions, 209 flow [2024-11-13 14:07:58,697 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-11-13 14:07:58,697 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2024-11-13 14:07:58,698 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 95 transitions. [2024-11-13 14:07:58,698 INFO L512 CegarLoopForPetriNet]: DFA transition density 0.31353135313531355 [2024-11-13 14:07:58,698 INFO L175 Difference]: Start difference. First operand has 49 places, 38 transitions, 85 flow. Second operand 3 states and 95 transitions. [2024-11-13 14:07:58,698 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 50 places, 56 transitions, 209 flow [2024-11-13 14:07:58,699 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 49 places, 56 transitions, 208 flow, removed 0 selfloop flow, removed 1 redundant places. [2024-11-13 14:07:58,702 INFO L231 Difference]: Finished difference. Result has 50 places, 38 transitions, 94 flow [2024-11-13 14:07:58,703 INFO L260 CegarLoopForPetriNet]: {PETRI_ALPHABET=101, PETRI_DIFFERENCE_MINUEND_FLOW=84, PETRI_DIFFERENCE_MINUEND_PLACES=47, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=38, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=2, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=36, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=94, PETRI_PLACES=50, PETRI_TRANSITIONS=38} [2024-11-13 14:07:58,705 INFO L277 CegarLoopForPetriNet]: 106 programPoint places, -56 predicate places. [2024-11-13 14:07:58,705 INFO L471 AbstractCegarLoop]: Abstraction has has 50 places, 38 transitions, 94 flow [2024-11-13 14:07:58,705 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 20.333333333333332) internal successors, (61), 3 states have internal predecessors, (61), 0 states have call successors, (0), 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-13 14:07:58,706 INFO L196 CegarLoopForPetriNet]: Found error trace [2024-11-13 14:07:58,706 INFO L204 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-13 14:07:58,706 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2 [2024-11-13 14:07:58,706 INFO L396 AbstractCegarLoop]: === Iteration 4 === Targeting ULTIMATE.startErr10REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [P0Err0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, P0Err1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, P0Err6REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 100 more)] === [2024-11-13 14:07:58,707 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-13 14:07:58,708 INFO L85 PathProgramCache]: Analyzing trace with hash 807563133, now seen corresponding path program 1 times [2024-11-13 14:07:58,708 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-13 14:07:58,708 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [761115968] [2024-11-13 14:07:58,708 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-13 14:07:58,708 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-13 14:07:58,778 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-13 14:07:59,052 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-13 14:07:59,052 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-13 14:07:59,052 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [761115968] [2024-11-13 14:07:59,052 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [761115968] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-13 14:07:59,052 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-13 14:07:59,053 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2024-11-13 14:07:59,053 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [733089417] [2024-11-13 14:07:59,053 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-13 14:07:59,053 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2024-11-13 14:07:59,054 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-13 14:07:59,054 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2024-11-13 14:07:59,054 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2024-11-13 14:07:59,061 INFO L467 CegarLoopForPetriNet]: Number of universal loopers: 17 out of 101 [2024-11-13 14:07:59,061 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 50 places, 38 transitions, 94 flow. Second operand has 4 states, 4 states have (on average 19.75) internal successors, (79), 4 states have internal predecessors, (79), 0 states have call successors, (0), 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-13 14:07:59,064 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-11-13 14:07:59,064 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 17 of 101 [2024-11-13 14:07:59,064 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-11-13 14:07:59,867 INFO L124 PetriNetUnfolderBase]: 1125/2299 cut-off events. [2024-11-13 14:07:59,867 INFO L125 PetriNetUnfolderBase]: For 190/190 co-relation queries the response was YES. [2024-11-13 14:07:59,877 INFO L83 FinitePrefix]: Finished finitePrefix Result has 4394 conditions, 2299 events. 1125/2299 cut-off events. For 190/190 co-relation queries the response was YES. Maximal size of possible extension queue 149. Compared 16298 event pairs, 255 based on Foata normal form. 0/2267 useless extension candidates. Maximal degree in co-relation 4385. Up to 1270 conditions per place. [2024-11-13 14:07:59,887 INFO L140 encePairwiseOnDemand]: 98/101 looper letters, 39 selfloop transitions, 2 changer transitions 0/55 dead transitions. [2024-11-13 14:07:59,887 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 52 places, 55 transitions, 212 flow [2024-11-13 14:07:59,888 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2024-11-13 14:07:59,888 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 4 states. [2024-11-13 14:07:59,892 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 110 transitions. [2024-11-13 14:07:59,893 INFO L512 CegarLoopForPetriNet]: DFA transition density 0.2722772277227723 [2024-11-13 14:07:59,894 INFO L175 Difference]: Start difference. First operand has 50 places, 38 transitions, 94 flow. Second operand 4 states and 110 transitions. [2024-11-13 14:07:59,895 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 52 places, 55 transitions, 212 flow [2024-11-13 14:07:59,895 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 50 places, 55 transitions, 208 flow, removed 0 selfloop flow, removed 2 redundant places. [2024-11-13 14:07:59,898 INFO L231 Difference]: Finished difference. Result has 50 places, 37 transitions, 90 flow [2024-11-13 14:07:59,899 INFO L260 CegarLoopForPetriNet]: {PETRI_ALPHABET=101, PETRI_DIFFERENCE_MINUEND_FLOW=86, PETRI_DIFFERENCE_MINUEND_PLACES=47, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=37, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=2, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=35, PETRI_DIFFERENCE_SUBTRAHEND_STATES=4, PETRI_FLOW=90, PETRI_PLACES=50, PETRI_TRANSITIONS=37} [2024-11-13 14:07:59,900 INFO L277 CegarLoopForPetriNet]: 106 programPoint places, -56 predicate places. [2024-11-13 14:07:59,900 INFO L471 AbstractCegarLoop]: Abstraction has has 50 places, 37 transitions, 90 flow [2024-11-13 14:07:59,900 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 19.75) internal successors, (79), 4 states have internal predecessors, (79), 0 states have call successors, (0), 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-13 14:07:59,900 INFO L196 CegarLoopForPetriNet]: Found error trace [2024-11-13 14:07:59,900 INFO L204 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-13 14:07:59,900 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable3 [2024-11-13 14:07:59,901 INFO L396 AbstractCegarLoop]: === Iteration 5 === Targeting ULTIMATE.startErr11REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [P0Err0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, P0Err1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, P0Err6REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 100 more)] === [2024-11-13 14:07:59,902 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-13 14:07:59,902 INFO L85 PathProgramCache]: Analyzing trace with hash 807563134, now seen corresponding path program 1 times [2024-11-13 14:07:59,904 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-13 14:07:59,904 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1032960981] [2024-11-13 14:07:59,904 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-13 14:07:59,905 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-13 14:07:59,974 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-13 14:08:00,748 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-13 14:08:00,748 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-13 14:08:00,748 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1032960981] [2024-11-13 14:08:00,749 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1032960981] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-13 14:08:00,749 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-13 14:08:00,749 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2024-11-13 14:08:00,749 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [133163524] [2024-11-13 14:08:00,749 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-13 14:08:00,749 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2024-11-13 14:08:00,750 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-13 14:08:00,750 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2024-11-13 14:08:00,750 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2024-11-13 14:08:00,750 INFO L467 CegarLoopForPetriNet]: Number of universal loopers: 17 out of 101 [2024-11-13 14:08:00,751 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 50 places, 37 transitions, 90 flow. Second operand has 4 states, 4 states have (on average 19.75) internal successors, (79), 4 states have internal predecessors, (79), 0 states have call successors, (0), 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-13 14:08:00,751 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-11-13 14:08:00,751 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 17 of 101 [2024-11-13 14:08:00,751 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-11-13 14:08:01,498 INFO L124 PetriNetUnfolderBase]: 1043/1883 cut-off events. [2024-11-13 14:08:01,499 INFO L125 PetriNetUnfolderBase]: For 205/205 co-relation queries the response was YES. [2024-11-13 14:08:01,507 INFO L83 FinitePrefix]: Finished finitePrefix Result has 3816 conditions, 1883 events. 1043/1883 cut-off events. For 205/205 co-relation queries the response was YES. Maximal size of possible extension queue 134. Compared 11887 event pairs, 361 based on Foata normal form. 40/1869 useless extension candidates. Maximal degree in co-relation 3807. Up to 1148 conditions per place. [2024-11-13 14:08:01,515 INFO L140 encePairwiseOnDemand]: 98/101 looper letters, 38 selfloop transitions, 2 changer transitions 0/54 dead transitions. [2024-11-13 14:08:01,516 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 52 places, 54 transitions, 206 flow [2024-11-13 14:08:01,516 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2024-11-13 14:08:01,516 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 4 states. [2024-11-13 14:08:01,517 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 109 transitions. [2024-11-13 14:08:01,517 INFO L512 CegarLoopForPetriNet]: DFA transition density 0.2698019801980198 [2024-11-13 14:08:01,518 INFO L175 Difference]: Start difference. First operand has 50 places, 37 transitions, 90 flow. Second operand 4 states and 109 transitions. [2024-11-13 14:08:01,518 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 52 places, 54 transitions, 206 flow [2024-11-13 14:08:01,519 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 49 places, 54 transitions, 201 flow, removed 0 selfloop flow, removed 3 redundant places. [2024-11-13 14:08:01,519 INFO L231 Difference]: Finished difference. Result has 49 places, 36 transitions, 85 flow [2024-11-13 14:08:01,520 INFO L260 CegarLoopForPetriNet]: {PETRI_ALPHABET=101, PETRI_DIFFERENCE_MINUEND_FLOW=81, PETRI_DIFFERENCE_MINUEND_PLACES=46, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=36, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=2, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=34, PETRI_DIFFERENCE_SUBTRAHEND_STATES=4, PETRI_FLOW=85, PETRI_PLACES=49, PETRI_TRANSITIONS=36} [2024-11-13 14:08:01,525 INFO L277 CegarLoopForPetriNet]: 106 programPoint places, -57 predicate places. [2024-11-13 14:08:01,525 INFO L471 AbstractCegarLoop]: Abstraction has has 49 places, 36 transitions, 85 flow [2024-11-13 14:08:01,526 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 19.75) internal successors, (79), 4 states have internal predecessors, (79), 0 states have call successors, (0), 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-13 14:08:01,526 INFO L196 CegarLoopForPetriNet]: Found error trace [2024-11-13 14:08:01,526 INFO L204 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-13 14:08:01,527 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable4 [2024-11-13 14:08:01,527 INFO L396 AbstractCegarLoop]: === Iteration 6 === Targeting ULTIMATE.startErr19ASSERT_VIOLATIONMEMORY_LEAK === [P0Err0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, P0Err1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, P0Err6REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 100 more)] === [2024-11-13 14:08:01,527 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-13 14:08:01,531 INFO L85 PathProgramCache]: Analyzing trace with hash -1362931959, now seen corresponding path program 1 times [2024-11-13 14:08:01,531 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-13 14:08:01,531 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [907550533] [2024-11-13 14:08:01,531 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-13 14:08:01,532 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-13 14:08:01,572 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-13 14:08:01,643 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-13 14:08:01,643 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-13 14:08:01,647 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [907550533] [2024-11-13 14:08:01,647 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [907550533] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-13 14:08:01,647 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-13 14:08:01,647 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [1] imperfect sequences [] total 1 [2024-11-13 14:08:01,648 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1600044347] [2024-11-13 14:08:01,648 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-13 14:08:01,648 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2024-11-13 14:08:01,648 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-13 14:08:01,648 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-11-13 14:08:01,649 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-11-13 14:08:01,652 INFO L467 CegarLoopForPetriNet]: Number of universal loopers: 16 out of 101 [2024-11-13 14:08:01,653 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 49 places, 36 transitions, 85 flow. Second operand has 3 states, 3 states have (on average 20.333333333333332) internal successors, (61), 3 states have internal predecessors, (61), 0 states have call successors, (0), 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-13 14:08:01,653 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-11-13 14:08:01,653 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 16 of 101 [2024-11-13 14:08:01,653 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-11-13 14:08:02,346 INFO L124 PetriNetUnfolderBase]: 1043/1834 cut-off events. [2024-11-13 14:08:02,347 INFO L125 PetriNetUnfolderBase]: For 170/170 co-relation queries the response was YES. [2024-11-13 14:08:02,352 INFO L83 FinitePrefix]: Finished finitePrefix Result has 3766 conditions, 1834 events. 1043/1834 cut-off events. For 170/170 co-relation queries the response was YES. Maximal size of possible extension queue 136. Compared 11891 event pairs, 1043 based on Foata normal form. 60/1857 useless extension candidates. Maximal degree in co-relation 3758. Up to 1554 conditions per place. [2024-11-13 14:08:02,358 INFO L140 encePairwiseOnDemand]: 99/101 looper letters, 20 selfloop transitions, 1 changer transitions 1/35 dead transitions. [2024-11-13 14:08:02,359 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 50 places, 35 transitions, 127 flow [2024-11-13 14:08:02,359 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-11-13 14:08:02,359 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2024-11-13 14:08:02,360 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 71 transitions. [2024-11-13 14:08:02,362 INFO L512 CegarLoopForPetriNet]: DFA transition density 0.23432343234323433 [2024-11-13 14:08:02,362 INFO L175 Difference]: Start difference. First operand has 49 places, 36 transitions, 85 flow. Second operand 3 states and 71 transitions. [2024-11-13 14:08:02,362 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 50 places, 35 transitions, 127 flow [2024-11-13 14:08:02,363 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 48 places, 35 transitions, 124 flow, removed 0 selfloop flow, removed 2 redundant places. [2024-11-13 14:08:02,364 INFO L231 Difference]: Finished difference. Result has 48 places, 34 transitions, 80 flow [2024-11-13 14:08:02,364 INFO L260 CegarLoopForPetriNet]: {PETRI_ALPHABET=101, PETRI_DIFFERENCE_MINUEND_FLOW=80, PETRI_DIFFERENCE_MINUEND_PLACES=46, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=35, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=1, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=34, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=80, PETRI_PLACES=48, PETRI_TRANSITIONS=34} [2024-11-13 14:08:02,367 INFO L277 CegarLoopForPetriNet]: 106 programPoint places, -58 predicate places. [2024-11-13 14:08:02,367 INFO L471 AbstractCegarLoop]: Abstraction has has 48 places, 34 transitions, 80 flow [2024-11-13 14:08:02,367 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 20.333333333333332) internal successors, (61), 3 states have internal predecessors, (61), 0 states have call successors, (0), 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-13 14:08:02,367 INFO L196 CegarLoopForPetriNet]: Found error trace [2024-11-13 14:08:02,367 INFO L204 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-13 14:08:02,368 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable5 [2024-11-13 14:08:02,368 INFO L396 AbstractCegarLoop]: === Iteration 7 === Targeting ULTIMATE.startErr18ASSERT_VIOLATIONMEMORY_LEAK === [P0Err0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, P0Err1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, P0Err6REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 100 more)] === [2024-11-13 14:08:02,369 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-13 14:08:02,369 INFO L85 PathProgramCache]: Analyzing trace with hash -1362930338, now seen corresponding path program 1 times [2024-11-13 14:08:02,369 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-13 14:08:02,369 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1879968001] [2024-11-13 14:08:02,369 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-13 14:08:02,370 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-13 14:08:02,480 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-13 14:08:02,790 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-13 14:08:02,790 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-13 14:08:02,790 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1879968001] [2024-11-13 14:08:02,790 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1879968001] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-13 14:08:02,790 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-13 14:08:02,791 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2024-11-13 14:08:02,791 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1135161155] [2024-11-13 14:08:02,791 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-13 14:08:02,791 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2024-11-13 14:08:02,792 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-13 14:08:02,792 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2024-11-13 14:08:02,792 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2024-11-13 14:08:02,803 INFO L467 CegarLoopForPetriNet]: Number of universal loopers: 13 out of 101 [2024-11-13 14:08:02,803 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 48 places, 34 transitions, 80 flow. Second operand has 4 states, 4 states have (on average 16.25) internal successors, (65), 4 states have internal predecessors, (65), 0 states have call successors, (0), 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-13 14:08:02,803 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-11-13 14:08:02,804 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 13 of 101 [2024-11-13 14:08:02,804 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-11-13 14:08:03,753 INFO L124 PetriNetUnfolderBase]: 1995/3279 cut-off events. [2024-11-13 14:08:03,753 INFO L125 PetriNetUnfolderBase]: For 0/0 co-relation queries the response was YES. [2024-11-13 14:08:03,768 INFO L83 FinitePrefix]: Finished finitePrefix Result has 6735 conditions, 3279 events. 1995/3279 cut-off events. For 0/0 co-relation queries the response was YES. Maximal size of possible extension queue 189. Compared 19843 event pairs, 225 based on Foata normal form. 120/3388 useless extension candidates. Maximal degree in co-relation 6727. Up to 1861 conditions per place. [2024-11-13 14:08:03,781 INFO L140 encePairwiseOnDemand]: 95/101 looper letters, 46 selfloop transitions, 5 changer transitions 1/61 dead transitions. [2024-11-13 14:08:03,781 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 50 places, 61 transitions, 246 flow [2024-11-13 14:08:03,782 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2024-11-13 14:08:03,782 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 4 states. [2024-11-13 14:08:03,783 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 106 transitions. [2024-11-13 14:08:03,784 INFO L512 CegarLoopForPetriNet]: DFA transition density 0.2623762376237624 [2024-11-13 14:08:03,784 INFO L175 Difference]: Start difference. First operand has 48 places, 34 transitions, 80 flow. Second operand 4 states and 106 transitions. [2024-11-13 14:08:03,784 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 50 places, 61 transitions, 246 flow [2024-11-13 14:08:03,785 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 49 places, 61 transitions, 245 flow, removed 0 selfloop flow, removed 1 redundant places. [2024-11-13 14:08:03,787 INFO L231 Difference]: Finished difference. Result has 51 places, 37 transitions, 113 flow [2024-11-13 14:08:03,788 INFO L260 CegarLoopForPetriNet]: {PETRI_ALPHABET=101, PETRI_DIFFERENCE_MINUEND_FLOW=79, PETRI_DIFFERENCE_MINUEND_PLACES=46, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=34, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=2, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=29, PETRI_DIFFERENCE_SUBTRAHEND_STATES=4, PETRI_FLOW=113, PETRI_PLACES=51, PETRI_TRANSITIONS=37} [2024-11-13 14:08:03,788 INFO L277 CegarLoopForPetriNet]: 106 programPoint places, -55 predicate places. [2024-11-13 14:08:03,791 INFO L471 AbstractCegarLoop]: Abstraction has has 51 places, 37 transitions, 113 flow [2024-11-13 14:08:03,791 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 16.25) internal successors, (65), 4 states have internal predecessors, (65), 0 states have call successors, (0), 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-13 14:08:03,791 INFO L196 CegarLoopForPetriNet]: Found error trace [2024-11-13 14:08:03,791 INFO L204 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-13 14:08:03,791 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable6 [2024-11-13 14:08:03,792 INFO L396 AbstractCegarLoop]: === Iteration 8 === Targeting ULTIMATE.startErr18ASSERT_VIOLATIONMEMORY_LEAK === [P0Err0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, P0Err1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, P0Err6REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 100 more)] === [2024-11-13 14:08:03,792 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-13 14:08:03,792 INFO L85 PathProgramCache]: Analyzing trace with hash -1181637066, now seen corresponding path program 1 times [2024-11-13 14:08:03,792 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-13 14:08:03,792 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [893560304] [2024-11-13 14:08:03,793 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-13 14:08:03,793 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-13 14:08:03,960 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-13 14:08:04,369 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-13 14:08:04,369 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-13 14:08:04,370 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [893560304] [2024-11-13 14:08:04,370 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [893560304] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-13 14:08:04,370 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-13 14:08:04,370 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2024-11-13 14:08:04,370 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1107791294] [2024-11-13 14:08:04,370 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-13 14:08:04,371 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2024-11-13 14:08:04,371 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-13 14:08:04,371 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2024-11-13 14:08:04,371 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=8, Invalid=12, Unknown=0, NotChecked=0, Total=20 [2024-11-13 14:08:04,377 INFO L467 CegarLoopForPetriNet]: Number of universal loopers: 13 out of 101 [2024-11-13 14:08:04,378 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 51 places, 37 transitions, 113 flow. Second operand has 5 states, 5 states have (on average 16.0) internal successors, (80), 5 states have internal predecessors, (80), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-13 14:08:04,378 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-11-13 14:08:04,378 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 13 of 101 [2024-11-13 14:08:04,378 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-11-13 14:08:05,362 INFO L124 PetriNetUnfolderBase]: 1195/1987 cut-off events. [2024-11-13 14:08:05,364 INFO L125 PetriNetUnfolderBase]: For 456/456 co-relation queries the response was YES. [2024-11-13 14:08:05,373 INFO L83 FinitePrefix]: Finished finitePrefix Result has 4750 conditions, 1987 events. 1195/1987 cut-off events. For 456/456 co-relation queries the response was YES. Maximal size of possible extension queue 84. Compared 10402 event pairs, 123 based on Foata normal form. 96/2072 useless extension candidates. Maximal degree in co-relation 4739. Up to 769 conditions per place. [2024-11-13 14:08:05,381 INFO L140 encePairwiseOnDemand]: 95/101 looper letters, 58 selfloop transitions, 8 changer transitions 1/76 dead transitions. [2024-11-13 14:08:05,382 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 55 places, 76 transitions, 352 flow [2024-11-13 14:08:05,382 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2024-11-13 14:08:05,382 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 5 states. [2024-11-13 14:08:05,383 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 134 transitions. [2024-11-13 14:08:05,383 INFO L512 CegarLoopForPetriNet]: DFA transition density 0.26534653465346536 [2024-11-13 14:08:05,383 INFO L175 Difference]: Start difference. First operand has 51 places, 37 transitions, 113 flow. Second operand 5 states and 134 transitions. [2024-11-13 14:08:05,384 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 55 places, 76 transitions, 352 flow [2024-11-13 14:08:05,386 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 53 places, 76 transitions, 342 flow, removed 1 selfloop flow, removed 2 redundant places. [2024-11-13 14:08:05,390 INFO L231 Difference]: Finished difference. Result has 55 places, 40 transitions, 153 flow [2024-11-13 14:08:05,394 INFO L260 CegarLoopForPetriNet]: {PETRI_ALPHABET=101, PETRI_DIFFERENCE_MINUEND_FLOW=105, PETRI_DIFFERENCE_MINUEND_PLACES=49, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=37, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=5, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=29, PETRI_DIFFERENCE_SUBTRAHEND_STATES=5, PETRI_FLOW=153, PETRI_PLACES=55, PETRI_TRANSITIONS=40} [2024-11-13 14:08:05,395 INFO L277 CegarLoopForPetriNet]: 106 programPoint places, -51 predicate places. [2024-11-13 14:08:05,395 INFO L471 AbstractCegarLoop]: Abstraction has has 55 places, 40 transitions, 153 flow [2024-11-13 14:08:05,395 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 16.0) internal successors, (80), 5 states have internal predecessors, (80), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-13 14:08:05,396 INFO L196 CegarLoopForPetriNet]: Found error trace [2024-11-13 14:08:05,396 INFO L204 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-13 14:08:05,396 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable7 [2024-11-13 14:08:05,396 INFO L396 AbstractCegarLoop]: === Iteration 9 === Targeting ULTIMATE.startErr18ASSERT_VIOLATIONMEMORY_LEAK === [P0Err0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, P0Err1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, P0Err6REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 100 more)] === [2024-11-13 14:08:05,397 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-13 14:08:05,397 INFO L85 PathProgramCache]: Analyzing trace with hash -1494029096, now seen corresponding path program 1 times [2024-11-13 14:08:05,397 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-13 14:08:05,397 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1947187596] [2024-11-13 14:08:05,397 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-13 14:08:05,397 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-13 14:08:05,651 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-13 14:08:06,169 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-13 14:08:06,169 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-13 14:08:06,169 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1947187596] [2024-11-13 14:08:06,169 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1947187596] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-13 14:08:06,170 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-13 14:08:06,170 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2024-11-13 14:08:06,170 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [258616232] [2024-11-13 14:08:06,170 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-13 14:08:06,170 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2024-11-13 14:08:06,171 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-13 14:08:06,172 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2024-11-13 14:08:06,172 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=12, Invalid=18, Unknown=0, NotChecked=0, Total=30 [2024-11-13 14:08:06,193 INFO L467 CegarLoopForPetriNet]: Number of universal loopers: 13 out of 101 [2024-11-13 14:08:06,195 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 55 places, 40 transitions, 153 flow. Second operand has 6 states, 6 states have (on average 16.0) internal successors, (96), 6 states have internal predecessors, (96), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-13 14:08:06,195 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-11-13 14:08:06,195 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 13 of 101 [2024-11-13 14:08:06,195 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-11-13 14:08:06,946 INFO L124 PetriNetUnfolderBase]: 669/1085 cut-off events. [2024-11-13 14:08:06,946 INFO L125 PetriNetUnfolderBase]: For 832/832 co-relation queries the response was YES. [2024-11-13 14:08:06,951 INFO L83 FinitePrefix]: Finished finitePrefix Result has 2964 conditions, 1085 events. 669/1085 cut-off events. For 832/832 co-relation queries the response was YES. Maximal size of possible extension queue 53. Compared 4791 event pairs, 103 based on Foata normal form. 44/1118 useless extension candidates. Maximal degree in co-relation 2951. Up to 352 conditions per place. [2024-11-13 14:08:06,955 INFO L140 encePairwiseOnDemand]: 95/101 looper letters, 50 selfloop transitions, 11 changer transitions 1/71 dead transitions. [2024-11-13 14:08:06,955 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 60 places, 71 transitions, 353 flow [2024-11-13 14:08:06,956 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2024-11-13 14:08:06,956 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 6 states. [2024-11-13 14:08:06,957 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6 states to 6 states and 142 transitions. [2024-11-13 14:08:06,957 INFO L512 CegarLoopForPetriNet]: DFA transition density 0.23432343234323433 [2024-11-13 14:08:06,958 INFO L175 Difference]: Start difference. First operand has 55 places, 40 transitions, 153 flow. Second operand 6 states and 142 transitions. [2024-11-13 14:08:06,958 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 60 places, 71 transitions, 353 flow [2024-11-13 14:08:06,965 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 56 places, 71 transitions, 328 flow, removed 4 selfloop flow, removed 4 redundant places. [2024-11-13 14:08:06,967 INFO L231 Difference]: Finished difference. Result has 58 places, 40 transitions, 167 flow [2024-11-13 14:08:06,967 INFO L260 CegarLoopForPetriNet]: {PETRI_ALPHABET=101, PETRI_DIFFERENCE_MINUEND_FLOW=131, PETRI_DIFFERENCE_MINUEND_PLACES=51, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=40, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=11, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=29, PETRI_DIFFERENCE_SUBTRAHEND_STATES=6, PETRI_FLOW=167, PETRI_PLACES=58, PETRI_TRANSITIONS=40} [2024-11-13 14:08:06,968 INFO L277 CegarLoopForPetriNet]: 106 programPoint places, -48 predicate places. [2024-11-13 14:08:06,968 INFO L471 AbstractCegarLoop]: Abstraction has has 58 places, 40 transitions, 167 flow [2024-11-13 14:08:06,968 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 16.0) internal successors, (96), 6 states have internal predecessors, (96), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-13 14:08:06,968 INFO L196 CegarLoopForPetriNet]: Found error trace [2024-11-13 14:08:06,969 INFO L204 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-13 14:08:06,969 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable8 [2024-11-13 14:08:06,969 INFO L396 AbstractCegarLoop]: === Iteration 10 === Targeting ULTIMATE.startErr18ASSERT_VIOLATIONMEMORY_LEAK === [P0Err0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, P0Err1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, P0Err6REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 100 more)] === [2024-11-13 14:08:06,970 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-13 14:08:06,970 INFO L85 PathProgramCache]: Analyzing trace with hash -728241092, now seen corresponding path program 1 times [2024-11-13 14:08:06,970 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-13 14:08:06,970 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2035088851] [2024-11-13 14:08:06,970 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-13 14:08:06,970 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-13 14:08:07,328 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-11-13 14:08:07,330 INFO L356 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2024-11-13 14:08:07,638 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-11-13 14:08:07,692 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2024-11-13 14:08:07,692 INFO L325 BasicCegarLoop]: Counterexample is feasible [2024-11-13 14:08:07,694 INFO L782 garLoopResultBuilder]: Registering result UNSAFE for location ULTIMATE.startErr18ASSERT_VIOLATIONMEMORY_LEAK (102 of 103 remaining) [2024-11-13 14:08:07,696 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location P0Err0REQUIRES_VIOLATIONMEMORY_DEREFERENCE (101 of 103 remaining) [2024-11-13 14:08:07,697 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location P0Err1REQUIRES_VIOLATIONMEMORY_DEREFERENCE (100 of 103 remaining) [2024-11-13 14:08:07,697 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location P0Err6REQUIRES_VIOLATIONMEMORY_DEREFERENCE (99 of 103 remaining) [2024-11-13 14:08:07,697 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location P0Err7REQUIRES_VIOLATIONMEMORY_DEREFERENCE (98 of 103 remaining) [2024-11-13 14:08:07,697 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location P0Err4REQUIRES_VIOLATIONMEMORY_DEREFERENCE (97 of 103 remaining) [2024-11-13 14:08:07,697 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location P0Err5REQUIRES_VIOLATIONMEMORY_DEREFERENCE (96 of 103 remaining) [2024-11-13 14:08:07,698 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location P0Err2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (95 of 103 remaining) [2024-11-13 14:08:07,698 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location P0Err3REQUIRES_VIOLATIONMEMORY_DEREFERENCE (94 of 103 remaining) [2024-11-13 14:08:07,698 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location P0Err8REQUIRES_VIOLATIONMEMORY_DEREFERENCE (93 of 103 remaining) [2024-11-13 14:08:07,698 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location P0Err9REQUIRES_VIOLATIONMEMORY_DEREFERENCE (92 of 103 remaining) [2024-11-13 14:08:07,698 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location P0Err10REQUIRES_VIOLATIONMEMORY_DEREFERENCE (91 of 103 remaining) [2024-11-13 14:08:07,698 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location P0Err11REQUIRES_VIOLATIONMEMORY_DEREFERENCE (90 of 103 remaining) [2024-11-13 14:08:07,698 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location P0Err12REQUIRES_VIOLATIONMEMORY_DEREFERENCE (89 of 103 remaining) [2024-11-13 14:08:07,699 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location P0Err13REQUIRES_VIOLATIONMEMORY_DEREFERENCE (88 of 103 remaining) [2024-11-13 14:08:07,699 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location P0Err14REQUIRES_VIOLATIONMEMORY_DEREFERENCE (87 of 103 remaining) [2024-11-13 14:08:07,699 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location P0Err15REQUIRES_VIOLATIONMEMORY_DEREFERENCE (86 of 103 remaining) [2024-11-13 14:08:07,699 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location P1Err0REQUIRES_VIOLATIONMEMORY_DEREFERENCE (85 of 103 remaining) [2024-11-13 14:08:07,699 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location P1Err1REQUIRES_VIOLATIONMEMORY_DEREFERENCE (84 of 103 remaining) [2024-11-13 14:08:07,699 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location P1Err2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (83 of 103 remaining) [2024-11-13 14:08:07,700 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location P1Err3REQUIRES_VIOLATIONMEMORY_DEREFERENCE (82 of 103 remaining) [2024-11-13 14:08:07,700 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location P1Err4REQUIRES_VIOLATIONMEMORY_DEREFERENCE (81 of 103 remaining) [2024-11-13 14:08:07,700 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location P1Err5REQUIRES_VIOLATIONMEMORY_DEREFERENCE (80 of 103 remaining) [2024-11-13 14:08:07,700 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location P2Err0REQUIRES_VIOLATIONMEMORY_DEREFERENCE (79 of 103 remaining) [2024-11-13 14:08:07,700 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location P2Err1REQUIRES_VIOLATIONMEMORY_DEREFERENCE (78 of 103 remaining) [2024-11-13 14:08:07,700 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location P2Err2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (77 of 103 remaining) [2024-11-13 14:08:07,700 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location P2Err3REQUIRES_VIOLATIONMEMORY_DEREFERENCE (76 of 103 remaining) [2024-11-13 14:08:07,701 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location P2Err4REQUIRES_VIOLATIONMEMORY_DEREFERENCE (75 of 103 remaining) [2024-11-13 14:08:07,701 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location P2Err5REQUIRES_VIOLATIONMEMORY_DEREFERENCE (74 of 103 remaining) [2024-11-13 14:08:07,701 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location P2Err6REQUIRES_VIOLATIONMEMORY_DEREFERENCE (73 of 103 remaining) [2024-11-13 14:08:07,701 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location P2Err7REQUIRES_VIOLATIONMEMORY_DEREFERENCE (72 of 103 remaining) [2024-11-13 14:08:07,701 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location P2Err8REQUIRES_VIOLATIONMEMORY_DEREFERENCE (71 of 103 remaining) [2024-11-13 14:08:07,701 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location P2Err9REQUIRES_VIOLATIONMEMORY_DEREFERENCE (70 of 103 remaining) [2024-11-13 14:08:07,702 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location P2Err10REQUIRES_VIOLATIONMEMORY_DEREFERENCE (69 of 103 remaining) [2024-11-13 14:08:07,702 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location P2Err11REQUIRES_VIOLATIONMEMORY_DEREFERENCE (68 of 103 remaining) [2024-11-13 14:08:07,702 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location P2Err12REQUIRES_VIOLATIONMEMORY_DEREFERENCE (67 of 103 remaining) [2024-11-13 14:08:07,702 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location P2Err13REQUIRES_VIOLATIONMEMORY_DEREFERENCE (66 of 103 remaining) [2024-11-13 14:08:07,702 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location P2Err14REQUIRES_VIOLATIONMEMORY_DEREFERENCE (65 of 103 remaining) [2024-11-13 14:08:07,702 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location P2Err15REQUIRES_VIOLATIONMEMORY_DEREFERENCE (64 of 103 remaining) [2024-11-13 14:08:07,703 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location P2Err16REQUIRES_VIOLATIONMEMORY_DEREFERENCE (63 of 103 remaining) [2024-11-13 14:08:07,703 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location P2Err17REQUIRES_VIOLATIONMEMORY_DEREFERENCE (62 of 103 remaining) [2024-11-13 14:08:07,703 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE (61 of 103 remaining) [2024-11-13 14:08:07,703 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE (60 of 103 remaining) [2024-11-13 14:08:07,703 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (59 of 103 remaining) [2024-11-13 14:08:07,703 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr3REQUIRES_VIOLATIONMEMORY_DEREFERENCE (58 of 103 remaining) [2024-11-13 14:08:07,704 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr4REQUIRES_VIOLATIONMEMORY_DEREFERENCE (57 of 103 remaining) [2024-11-13 14:08:07,704 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr5REQUIRES_VIOLATIONMEMORY_DEREFERENCE (56 of 103 remaining) [2024-11-13 14:08:07,704 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr6REQUIRES_VIOLATIONMEMORY_DEREFERENCE (55 of 103 remaining) [2024-11-13 14:08:07,704 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr7REQUIRES_VIOLATIONMEMORY_DEREFERENCE (54 of 103 remaining) [2024-11-13 14:08:07,704 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr8REQUIRES_VIOLATIONMEMORY_DEREFERENCE (53 of 103 remaining) [2024-11-13 14:08:07,704 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr9REQUIRES_VIOLATIONMEMORY_DEREFERENCE (52 of 103 remaining) [2024-11-13 14:08:07,704 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr10REQUIRES_VIOLATIONMEMORY_DEREFERENCE (51 of 103 remaining) [2024-11-13 14:08:07,704 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr11REQUIRES_VIOLATIONMEMORY_DEREFERENCE (50 of 103 remaining) [2024-11-13 14:08:07,704 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr12REQUIRES_VIOLATIONMEMORY_DEREFERENCE (49 of 103 remaining) [2024-11-13 14:08:07,704 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr13REQUIRES_VIOLATIONMEMORY_DEREFERENCE (48 of 103 remaining) [2024-11-13 14:08:07,704 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr14REQUIRES_VIOLATIONMEMORY_DEREFERENCE (47 of 103 remaining) [2024-11-13 14:08:07,705 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr15REQUIRES_VIOLATIONMEMORY_DEREFERENCE (46 of 103 remaining) [2024-11-13 14:08:07,705 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr16REQUIRES_VIOLATIONMEMORY_DEREFERENCE (45 of 103 remaining) [2024-11-13 14:08:07,705 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr17REQUIRES_VIOLATIONMEMORY_DEREFERENCE (44 of 103 remaining) [2024-11-13 14:08:07,705 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr19ASSERT_VIOLATIONMEMORY_LEAK (43 of 103 remaining) [2024-11-13 14:08:07,705 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (42 of 103 remaining) [2024-11-13 14:08:07,705 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (41 of 103 remaining) [2024-11-13 14:08:07,705 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr2INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (40 of 103 remaining) [2024-11-13 14:08:07,705 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location P0Err0REQUIRES_VIOLATIONMEMORY_DEREFERENCE (39 of 103 remaining) [2024-11-13 14:08:07,705 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location P0Err1REQUIRES_VIOLATIONMEMORY_DEREFERENCE (38 of 103 remaining) [2024-11-13 14:08:07,705 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location P0Err6REQUIRES_VIOLATIONMEMORY_DEREFERENCE (37 of 103 remaining) [2024-11-13 14:08:07,705 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location P0Err7REQUIRES_VIOLATIONMEMORY_DEREFERENCE (36 of 103 remaining) [2024-11-13 14:08:07,706 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location P0Err4REQUIRES_VIOLATIONMEMORY_DEREFERENCE (35 of 103 remaining) [2024-11-13 14:08:07,706 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location P0Err5REQUIRES_VIOLATIONMEMORY_DEREFERENCE (34 of 103 remaining) [2024-11-13 14:08:07,706 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location P0Err2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (33 of 103 remaining) [2024-11-13 14:08:07,706 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location P0Err3REQUIRES_VIOLATIONMEMORY_DEREFERENCE (32 of 103 remaining) [2024-11-13 14:08:07,706 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location P0Err8REQUIRES_VIOLATIONMEMORY_DEREFERENCE (31 of 103 remaining) [2024-11-13 14:08:07,706 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location P0Err9REQUIRES_VIOLATIONMEMORY_DEREFERENCE (30 of 103 remaining) [2024-11-13 14:08:07,706 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location P0Err10REQUIRES_VIOLATIONMEMORY_DEREFERENCE (29 of 103 remaining) [2024-11-13 14:08:07,706 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location P0Err11REQUIRES_VIOLATIONMEMORY_DEREFERENCE (28 of 103 remaining) [2024-11-13 14:08:07,706 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location P0Err12REQUIRES_VIOLATIONMEMORY_DEREFERENCE (27 of 103 remaining) [2024-11-13 14:08:07,706 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location P0Err13REQUIRES_VIOLATIONMEMORY_DEREFERENCE (26 of 103 remaining) [2024-11-13 14:08:07,707 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location P0Err14REQUIRES_VIOLATIONMEMORY_DEREFERENCE (25 of 103 remaining) [2024-11-13 14:08:07,707 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location P0Err15REQUIRES_VIOLATIONMEMORY_DEREFERENCE (24 of 103 remaining) [2024-11-13 14:08:07,707 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location P1Err0REQUIRES_VIOLATIONMEMORY_DEREFERENCE (23 of 103 remaining) [2024-11-13 14:08:07,707 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location P1Err1REQUIRES_VIOLATIONMEMORY_DEREFERENCE (22 of 103 remaining) [2024-11-13 14:08:07,708 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location P1Err2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (21 of 103 remaining) [2024-11-13 14:08:07,708 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location P1Err3REQUIRES_VIOLATIONMEMORY_DEREFERENCE (20 of 103 remaining) [2024-11-13 14:08:07,708 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location P1Err4REQUIRES_VIOLATIONMEMORY_DEREFERENCE (19 of 103 remaining) [2024-11-13 14:08:07,708 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location P1Err5REQUIRES_VIOLATIONMEMORY_DEREFERENCE (18 of 103 remaining) [2024-11-13 14:08:07,708 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location P2Err0REQUIRES_VIOLATIONMEMORY_DEREFERENCE (17 of 103 remaining) [2024-11-13 14:08:07,709 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location P2Err1REQUIRES_VIOLATIONMEMORY_DEREFERENCE (16 of 103 remaining) [2024-11-13 14:08:07,709 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location P2Err2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (15 of 103 remaining) [2024-11-13 14:08:07,709 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location P2Err3REQUIRES_VIOLATIONMEMORY_DEREFERENCE (14 of 103 remaining) [2024-11-13 14:08:07,709 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location P2Err4REQUIRES_VIOLATIONMEMORY_DEREFERENCE (13 of 103 remaining) [2024-11-13 14:08:07,709 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location P2Err5REQUIRES_VIOLATIONMEMORY_DEREFERENCE (12 of 103 remaining) [2024-11-13 14:08:07,709 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location P2Err6REQUIRES_VIOLATIONMEMORY_DEREFERENCE (11 of 103 remaining) [2024-11-13 14:08:07,710 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location P2Err7REQUIRES_VIOLATIONMEMORY_DEREFERENCE (10 of 103 remaining) [2024-11-13 14:08:07,710 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location P2Err8REQUIRES_VIOLATIONMEMORY_DEREFERENCE (9 of 103 remaining) [2024-11-13 14:08:07,710 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location P2Err9REQUIRES_VIOLATIONMEMORY_DEREFERENCE (8 of 103 remaining) [2024-11-13 14:08:07,710 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location P2Err10REQUIRES_VIOLATIONMEMORY_DEREFERENCE (7 of 103 remaining) [2024-11-13 14:08:07,710 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location P2Err11REQUIRES_VIOLATIONMEMORY_DEREFERENCE (6 of 103 remaining) [2024-11-13 14:08:07,710 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location P2Err12REQUIRES_VIOLATIONMEMORY_DEREFERENCE (5 of 103 remaining) [2024-11-13 14:08:07,710 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location P2Err13REQUIRES_VIOLATIONMEMORY_DEREFERENCE (4 of 103 remaining) [2024-11-13 14:08:07,711 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location P2Err14REQUIRES_VIOLATIONMEMORY_DEREFERENCE (3 of 103 remaining) [2024-11-13 14:08:07,711 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location P2Err15REQUIRES_VIOLATIONMEMORY_DEREFERENCE (2 of 103 remaining) [2024-11-13 14:08:07,711 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location P2Err16REQUIRES_VIOLATIONMEMORY_DEREFERENCE (1 of 103 remaining) [2024-11-13 14:08:07,711 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location P2Err17REQUIRES_VIOLATIONMEMORY_DEREFERENCE (0 of 103 remaining) [2024-11-13 14:08:07,711 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable9 [2024-11-13 14:08:07,712 INFO L407 BasicCegarLoop]: Path program histogram: [1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-13 14:08:07,892 INFO L242 ceAbstractionStarter]: Analysis of concurrent program completed with 1 thread instances [2024-11-13 14:08:07,892 INFO L173 ceAbstractionStarter]: Computing trace abstraction results [2024-11-13 14:08:07,904 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 13.11 02:08:07 BasicIcfg [2024-11-13 14:08:07,904 INFO L131 PluginConnector]: ------------------------ END TraceAbstraction---------------------------- [2024-11-13 14:08:07,905 INFO L112 PluginConnector]: ------------------------Witness Printer---------------------------- [2024-11-13 14:08:07,905 INFO L270 PluginConnector]: Initializing Witness Printer... [2024-11-13 14:08:07,905 INFO L274 PluginConnector]: Witness Printer initialized [2024-11-13 14:08:07,908 INFO L184 PluginConnector]: Executing the observer RCFGCatcher from plugin Witness Printer for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 13.11 02:07:48" (3/4) ... [2024-11-13 14:08:07,911 INFO L145 WitnessPrinter]: No result that supports witness generation found [2024-11-13 14:08:07,912 INFO L131 PluginConnector]: ------------------------ END Witness Printer---------------------------- [2024-11-13 14:08:07,915 INFO L158 Benchmark]: Toolchain (without parser) took 22859.20ms. Allocated memory was 142.6MB in the beginning and 1.9GB in the end (delta: 1.7GB). Free memory was 105.5MB in the beginning and 1.2GB in the end (delta: -1.1GB). Peak memory consumption was 654.3MB. Max. memory is 16.1GB. [2024-11-13 14:08:07,916 INFO L158 Benchmark]: CDTParser took 0.47ms. Allocated memory is still 167.8MB. Free memory is still 105.3MB. There was no memory consumed. Max. memory is 16.1GB. [2024-11-13 14:08:07,916 INFO L158 Benchmark]: CACSL2BoogieTranslator took 642.73ms. Allocated memory is still 142.6MB. Free memory was 105.2MB in the beginning and 78.9MB in the end (delta: 26.2MB). Peak memory consumption was 25.2MB. Max. memory is 16.1GB. [2024-11-13 14:08:07,916 INFO L158 Benchmark]: Boogie Procedure Inliner took 88.12ms. Allocated memory is still 142.6MB. Free memory was 78.9MB in the beginning and 76.2MB in the end (delta: 2.7MB). There was no memory consumed. Max. memory is 16.1GB. [2024-11-13 14:08:07,917 INFO L158 Benchmark]: Boogie Preprocessor took 114.81ms. Allocated memory is still 142.6MB. Free memory was 76.2MB in the beginning and 71.5MB in the end (delta: 4.8MB). Peak memory consumption was 8.4MB. Max. memory is 16.1GB. [2024-11-13 14:08:07,917 INFO L158 Benchmark]: RCFGBuilder took 2755.73ms. Allocated memory was 142.6MB in the beginning and 360.7MB in the end (delta: 218.1MB). Free memory was 71.5MB in the beginning and 191.3MB in the end (delta: -119.9MB). Peak memory consumption was 108.1MB. Max. memory is 16.1GB. [2024-11-13 14:08:07,918 INFO L158 Benchmark]: TraceAbstraction took 19241.95ms. Allocated memory was 360.7MB in the beginning and 1.9GB in the end (delta: 1.5GB). Free memory was 190.6MB in the beginning and 1.2GB in the end (delta: -1.0GB). Peak memory consumption was 511.8MB. Max. memory is 16.1GB. [2024-11-13 14:08:07,919 INFO L158 Benchmark]: Witness Printer took 7.16ms. Allocated memory is still 1.9GB. Free memory was 1.2GB in the beginning and 1.2GB in the end (delta: 161.7kB). Peak memory consumption was 8.4MB. Max. memory is 16.1GB. [2024-11-13 14:08:07,922 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.47ms. Allocated memory is still 167.8MB. Free memory is still 105.3MB. There was no memory consumed. Max. memory is 16.1GB. * CACSL2BoogieTranslator took 642.73ms. Allocated memory is still 142.6MB. Free memory was 105.2MB in the beginning and 78.9MB in the end (delta: 26.2MB). Peak memory consumption was 25.2MB. Max. memory is 16.1GB. * Boogie Procedure Inliner took 88.12ms. Allocated memory is still 142.6MB. Free memory was 78.9MB in the beginning and 76.2MB in the end (delta: 2.7MB). There was no memory consumed. Max. memory is 16.1GB. * Boogie Preprocessor took 114.81ms. Allocated memory is still 142.6MB. Free memory was 76.2MB in the beginning and 71.5MB in the end (delta: 4.8MB). Peak memory consumption was 8.4MB. Max. memory is 16.1GB. * RCFGBuilder took 2755.73ms. Allocated memory was 142.6MB in the beginning and 360.7MB in the end (delta: 218.1MB). Free memory was 71.5MB in the beginning and 191.3MB in the end (delta: -119.9MB). Peak memory consumption was 108.1MB. Max. memory is 16.1GB. * TraceAbstraction took 19241.95ms. Allocated memory was 360.7MB in the beginning and 1.9GB in the end (delta: 1.5GB). Free memory was 190.6MB in the beginning and 1.2GB in the end (delta: -1.0GB). Peak memory consumption was 511.8MB. Max. memory is 16.1GB. * Witness Printer took 7.16ms. Allocated memory is still 1.9GB. Free memory was 1.2GB in the beginning and 1.2GB in the end (delta: 161.7kB). Peak memory consumption was 8.4MB. Max. memory is 16.1GB. * Results from de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: - UnprovableResult [Line: 18]: Unable to prove that all allocated memory was freed Unable to prove that all allocated memory was freed Reason: overapproximation of memtrack at line 18. Possible FailurePath: [L710] 0 int __unbuffered_cnt = 0; [L712] 0 int __unbuffered_p0_EAX = 0; [L713] 0 _Bool __unbuffered_p0_EAX$flush_delayed; [L714] 0 int __unbuffered_p0_EAX$mem_tmp; [L715] 0 _Bool __unbuffered_p0_EAX$r_buff0_thd0; [L716] 0 _Bool __unbuffered_p0_EAX$r_buff0_thd1; [L717] 0 _Bool __unbuffered_p0_EAX$r_buff0_thd2; [L718] 0 _Bool __unbuffered_p0_EAX$r_buff0_thd3; [L719] 0 _Bool __unbuffered_p0_EAX$r_buff1_thd0; [L720] 0 _Bool __unbuffered_p0_EAX$r_buff1_thd1; [L721] 0 _Bool __unbuffered_p0_EAX$r_buff1_thd2; [L722] 0 _Bool __unbuffered_p0_EAX$r_buff1_thd3; [L723] 0 _Bool __unbuffered_p0_EAX$read_delayed; [L724] 0 int *__unbuffered_p0_EAX$read_delayed_var; [L725] 0 int __unbuffered_p0_EAX$w_buff0; [L726] 0 _Bool __unbuffered_p0_EAX$w_buff0_used; [L727] 0 int __unbuffered_p0_EAX$w_buff1; [L728] 0 _Bool __unbuffered_p0_EAX$w_buff1_used; [L730] 0 int __unbuffered_p0_EBX = 0; [L732] 0 int __unbuffered_p2_EAX = 0; [L733] 0 _Bool main$tmp_guard0; [L734] 0 _Bool main$tmp_guard1; [L736] 0 int x = 0; [L738] 0 int y = 0; [L738] 0 int y = 0; [L739] 0 _Bool y$flush_delayed; [L740] 0 int y$mem_tmp; [L741] 0 _Bool y$r_buff0_thd0; [L742] 0 _Bool y$r_buff0_thd1; [L743] 0 _Bool y$r_buff0_thd2; [L744] 0 _Bool y$r_buff0_thd3; [L745] 0 _Bool y$r_buff1_thd0; [L746] 0 _Bool y$r_buff1_thd1; [L747] 0 _Bool y$r_buff1_thd2; [L748] 0 _Bool y$r_buff1_thd3; [L749] 0 _Bool y$read_delayed; [L750] 0 int *y$read_delayed_var; [L751] 0 int y$w_buff0; [L752] 0 _Bool y$w_buff0_used; [L753] 0 int y$w_buff1; [L754] 0 _Bool y$w_buff1_used; [L755] 0 _Bool weak$$choice0; [L756] 0 _Bool weak$$choice1; [L757] 0 _Bool weak$$choice2; [L853] 0 pthread_t t1825; [L854] FCALL, FORK 0 pthread_create(&t1825, ((void *)0), P0, ((void *)0)) VAL [\old(arg)={0:0}, __unbuffered_cnt=0, __unbuffered_p0_EAX$flush_delayed=0, __unbuffered_p0_EAX$mem_tmp=0, __unbuffered_p0_EAX$r_buff0_thd0=0, __unbuffered_p0_EAX$r_buff0_thd1=0, __unbuffered_p0_EAX$r_buff0_thd2=0, __unbuffered_p0_EAX$r_buff0_thd3=0, __unbuffered_p0_EAX$r_buff1_thd0=0, __unbuffered_p0_EAX$r_buff1_thd1=0, __unbuffered_p0_EAX$r_buff1_thd2=0, __unbuffered_p0_EAX$r_buff1_thd3=0, __unbuffered_p0_EAX$read_delayed=0, __unbuffered_p0_EAX$read_delayed_var={0:0}, __unbuffered_p0_EAX$w_buff0=0, __unbuffered_p0_EAX$w_buff0_used=0, __unbuffered_p0_EAX$w_buff1=0, __unbuffered_p0_EAX$w_buff1_used=0, __unbuffered_p0_EAX=0, __unbuffered_p0_EBX=0, __unbuffered_p2_EAX=0, main$tmp_guard0=0, main$tmp_guard1=0, t1825=-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}] [L761] 1 weak$$choice0 = __VERIFIER_nondet_bool() [L762] 1 weak$$choice2 = __VERIFIER_nondet_bool() [L763] 1 y$flush_delayed = weak$$choice2 [L764] EXPR 1 \read(y) [L764] 1 y$mem_tmp = y [L765] 1 weak$$choice1 = __VERIFIER_nondet_bool() [L766] EXPR 1 !y$w_buff0_used ? y : (y$w_buff0_used && y$r_buff0_thd1 ? y$w_buff0 : (y$w_buff0_used && !y$r_buff1_thd1 && y$w_buff1_used && !y$r_buff0_thd1 ? (weak$$choice0 ? y : (weak$$choice1 ? y$w_buff0 : y$w_buff1)) : (y$w_buff0_used && y$r_buff1_thd1 && y$w_buff1_used && !y$r_buff0_thd1 ? (weak$$choice0 ? y$w_buff1 : y$w_buff0) : (weak$$choice0 ? y$w_buff0 : y)))) [L766] EXPR 1 \read(y) [L766] EXPR 1 !y$w_buff0_used ? y : (y$w_buff0_used && y$r_buff0_thd1 ? y$w_buff0 : (y$w_buff0_used && !y$r_buff1_thd1 && y$w_buff1_used && !y$r_buff0_thd1 ? (weak$$choice0 ? y : (weak$$choice1 ? y$w_buff0 : y$w_buff1)) : (y$w_buff0_used && y$r_buff1_thd1 && y$w_buff1_used && !y$r_buff0_thd1 ? (weak$$choice0 ? y$w_buff1 : y$w_buff0) : (weak$$choice0 ? y$w_buff0 : y)))) [L766] 1 y = !y$w_buff0_used ? y : (y$w_buff0_used && y$r_buff0_thd1 ? y$w_buff0 : (y$w_buff0_used && !y$r_buff1_thd1 && y$w_buff1_used && !y$r_buff0_thd1 ? (weak$$choice0 ? y : (weak$$choice1 ? y$w_buff0 : y$w_buff1)) : (y$w_buff0_used && y$r_buff1_thd1 && y$w_buff1_used && !y$r_buff0_thd1 ? (weak$$choice0 ? y$w_buff1 : y$w_buff0) : (weak$$choice0 ? y$w_buff0 : y)))) [L767] 1 y$w_buff0 = weak$$choice2 ? y$w_buff0 : (!y$w_buff0_used ? y$w_buff0 : (y$w_buff0_used && y$r_buff0_thd1 ? y$w_buff0 : (y$w_buff0_used && !y$r_buff1_thd1 && y$w_buff1_used && !y$r_buff0_thd1 ? y$w_buff0 : (y$w_buff0_used && y$r_buff1_thd1 && y$w_buff1_used && !y$r_buff0_thd1 ? y$w_buff0 : y$w_buff0)))) [L768] 1 y$w_buff1 = weak$$choice2 ? y$w_buff1 : (!y$w_buff0_used ? y$w_buff1 : (y$w_buff0_used && y$r_buff0_thd1 ? y$w_buff1 : (y$w_buff0_used && !y$r_buff1_thd1 && y$w_buff1_used && !y$r_buff0_thd1 ? y$w_buff1 : (y$w_buff0_used && y$r_buff1_thd1 && y$w_buff1_used && !y$r_buff0_thd1 ? y$w_buff1 : y$w_buff1)))) [L769] 1 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_thd1 ? (_Bool)0 : (y$w_buff0_used && !y$r_buff1_thd1 && y$w_buff1_used && !y$r_buff0_thd1 ? weak$$choice0 || !weak$$choice1 : (y$w_buff0_used && y$r_buff1_thd1 && y$w_buff1_used && !y$r_buff0_thd1 ? weak$$choice0 : weak$$choice0)))) [L770] 1 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_thd1 ? (_Bool)0 : (y$w_buff0_used && !y$r_buff1_thd1 && y$w_buff1_used && !y$r_buff0_thd1 ? weak$$choice0 : (y$w_buff0_used && y$r_buff1_thd1 && y$w_buff1_used && !y$r_buff0_thd1 ? (_Bool)0 : (_Bool)0)))) [L771] 1 y$r_buff0_thd1 = weak$$choice2 ? y$r_buff0_thd1 : (!y$w_buff0_used ? y$r_buff0_thd1 : (y$w_buff0_used && y$r_buff0_thd1 ? (_Bool)0 : (y$w_buff0_used && !y$r_buff1_thd1 && y$w_buff1_used && !y$r_buff0_thd1 ? y$r_buff0_thd1 : (y$w_buff0_used && y$r_buff1_thd1 && y$w_buff1_used && !y$r_buff0_thd1 ? (_Bool)0 : (_Bool)0)))) [L772] 1 y$r_buff1_thd1 = weak$$choice2 ? y$r_buff1_thd1 : (!y$w_buff0_used ? y$r_buff1_thd1 : (y$w_buff0_used && y$r_buff0_thd1 ? (_Bool)0 : (y$w_buff0_used && !y$r_buff1_thd1 && y$w_buff1_used && !y$r_buff0_thd1 ? (weak$$choice0 ? y$r_buff1_thd1 : (_Bool)0) : (y$w_buff0_used && y$r_buff1_thd1 && y$w_buff1_used && !y$r_buff0_thd1 ? (_Bool)0 : (_Bool)0)))) [L773] 1 __unbuffered_p0_EAX$read_delayed = (_Bool)1 [L774] 1 __unbuffered_p0_EAX$read_delayed_var = &y [L775] EXPR 1 \read(y) [L775] 1 __unbuffered_p0_EAX = y [L776] EXPR 1 y$flush_delayed ? y$mem_tmp : y [L776] EXPR 1 y$flush_delayed ? y$mem_tmp : y [L776] 1 y = y$flush_delayed ? y$mem_tmp : y [L777] 1 y$flush_delayed = (_Bool)0 VAL [\old(arg)={0:0}, __unbuffered_cnt=0, __unbuffered_p0_EAX$flush_delayed=0, __unbuffered_p0_EAX$mem_tmp=0, __unbuffered_p0_EAX$r_buff0_thd0=0, __unbuffered_p0_EAX$r_buff0_thd1=0, __unbuffered_p0_EAX$r_buff0_thd2=0, __unbuffered_p0_EAX$r_buff0_thd3=0, __unbuffered_p0_EAX$r_buff1_thd0=0, __unbuffered_p0_EAX$r_buff1_thd1=0, __unbuffered_p0_EAX$r_buff1_thd2=0, __unbuffered_p0_EAX$r_buff1_thd3=0, __unbuffered_p0_EAX$read_delayed=1, __unbuffered_p0_EAX$read_delayed_var={3:0}, __unbuffered_p0_EAX$w_buff0=0, __unbuffered_p0_EAX$w_buff0_used=0, __unbuffered_p0_EAX$w_buff1=0, __unbuffered_p0_EAX$w_buff1_used=0, __unbuffered_p0_EAX=0, __unbuffered_p0_EBX=0, __unbuffered_p2_EAX=0, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice1=0, 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}] [L780] 1 __unbuffered_p0_EBX = x VAL [\old(arg)={0:0}, __unbuffered_cnt=0, __unbuffered_p0_EAX$flush_delayed=0, __unbuffered_p0_EAX$mem_tmp=0, __unbuffered_p0_EAX$r_buff0_thd0=0, __unbuffered_p0_EAX$r_buff0_thd1=0, __unbuffered_p0_EAX$r_buff0_thd2=0, __unbuffered_p0_EAX$r_buff0_thd3=0, __unbuffered_p0_EAX$r_buff1_thd0=0, __unbuffered_p0_EAX$r_buff1_thd1=0, __unbuffered_p0_EAX$r_buff1_thd2=0, __unbuffered_p0_EAX$r_buff1_thd3=0, __unbuffered_p0_EAX$read_delayed=1, __unbuffered_p0_EAX$read_delayed_var={3:0}, __unbuffered_p0_EAX$w_buff0=0, __unbuffered_p0_EAX$w_buff0_used=0, __unbuffered_p0_EAX$w_buff1=0, __unbuffered_p0_EAX$w_buff1_used=0, __unbuffered_p0_EAX=0, __unbuffered_p0_EBX=0, __unbuffered_p2_EAX=0, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice1=0, 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}] [L855] 0 pthread_t t1826; [L856] FCALL, FORK 0 pthread_create(&t1826, ((void *)0), P1, ((void *)0)) VAL [\old(arg)={0:0}, \old(arg)={0:0}, __unbuffered_cnt=0, __unbuffered_p0_EAX$flush_delayed=0, __unbuffered_p0_EAX$mem_tmp=0, __unbuffered_p0_EAX$r_buff0_thd0=0, __unbuffered_p0_EAX$r_buff0_thd1=0, __unbuffered_p0_EAX$r_buff0_thd2=0, __unbuffered_p0_EAX$r_buff0_thd3=0, __unbuffered_p0_EAX$r_buff1_thd0=0, __unbuffered_p0_EAX$r_buff1_thd1=0, __unbuffered_p0_EAX$r_buff1_thd2=0, __unbuffered_p0_EAX$r_buff1_thd3=0, __unbuffered_p0_EAX$read_delayed=1, __unbuffered_p0_EAX$read_delayed_var={3:0}, __unbuffered_p0_EAX$w_buff0=0, __unbuffered_p0_EAX$w_buff0_used=0, __unbuffered_p0_EAX$w_buff1=0, __unbuffered_p0_EAX$w_buff1_used=0, __unbuffered_p0_EAX=0, __unbuffered_p0_EBX=0, __unbuffered_p2_EAX=0, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, t1825=-2, t1826=-1, weak$$choice0=0, weak$$choice1=0, 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}] [L792] 2 x = 1 VAL [\old(arg)={0:0}, \old(arg)={0:0}, __unbuffered_cnt=0, __unbuffered_p0_EAX$flush_delayed=0, __unbuffered_p0_EAX$mem_tmp=0, __unbuffered_p0_EAX$r_buff0_thd0=0, __unbuffered_p0_EAX$r_buff0_thd1=0, __unbuffered_p0_EAX$r_buff0_thd2=0, __unbuffered_p0_EAX$r_buff0_thd3=0, __unbuffered_p0_EAX$r_buff1_thd0=0, __unbuffered_p0_EAX$r_buff1_thd1=0, __unbuffered_p0_EAX$r_buff1_thd2=0, __unbuffered_p0_EAX$r_buff1_thd3=0, __unbuffered_p0_EAX$read_delayed=1, __unbuffered_p0_EAX$read_delayed_var={3:0}, __unbuffered_p0_EAX$w_buff0=0, __unbuffered_p0_EAX$w_buff0_used=0, __unbuffered_p0_EAX$w_buff1=0, __unbuffered_p0_EAX$w_buff1_used=0, __unbuffered_p0_EAX=0, __unbuffered_p0_EBX=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=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}] [L795] 2 y = 1 VAL [\old(arg)={0:0}, \old(arg)={0:0}, __unbuffered_cnt=0, __unbuffered_p0_EAX$flush_delayed=0, __unbuffered_p0_EAX$mem_tmp=0, __unbuffered_p0_EAX$r_buff0_thd0=0, __unbuffered_p0_EAX$r_buff0_thd1=0, __unbuffered_p0_EAX$r_buff0_thd2=0, __unbuffered_p0_EAX$r_buff0_thd3=0, __unbuffered_p0_EAX$r_buff1_thd0=0, __unbuffered_p0_EAX$r_buff1_thd1=0, __unbuffered_p0_EAX$r_buff1_thd2=0, __unbuffered_p0_EAX$r_buff1_thd3=0, __unbuffered_p0_EAX$read_delayed=1, __unbuffered_p0_EAX$read_delayed_var={3:0}, __unbuffered_p0_EAX$w_buff0=0, __unbuffered_p0_EAX$w_buff0_used=0, __unbuffered_p0_EAX$w_buff1=0, __unbuffered_p0_EAX$w_buff1_used=0, __unbuffered_p0_EAX=0, __unbuffered_p0_EBX=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=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}] [L857] 0 pthread_t t1827; [L858] FCALL, FORK 0 pthread_create(&t1827, ((void *)0), P2, ((void *)0)) VAL [\old(arg)={0:0}, \old(arg)={0:0}, \old(arg)={0:0}, __unbuffered_cnt=0, __unbuffered_p0_EAX$flush_delayed=0, __unbuffered_p0_EAX$mem_tmp=0, __unbuffered_p0_EAX$r_buff0_thd0=0, __unbuffered_p0_EAX$r_buff0_thd1=0, __unbuffered_p0_EAX$r_buff0_thd2=0, __unbuffered_p0_EAX$r_buff0_thd3=0, __unbuffered_p0_EAX$r_buff1_thd0=0, __unbuffered_p0_EAX$r_buff1_thd1=0, __unbuffered_p0_EAX$r_buff1_thd2=0, __unbuffered_p0_EAX$r_buff1_thd3=0, __unbuffered_p0_EAX$read_delayed=1, __unbuffered_p0_EAX$read_delayed_var={3:0}, __unbuffered_p0_EAX$w_buff0=0, __unbuffered_p0_EAX$w_buff0_used=0, __unbuffered_p0_EAX$w_buff1=0, __unbuffered_p0_EAX$w_buff1_used=0, __unbuffered_p0_EAX=0, __unbuffered_p0_EBX=0, __unbuffered_p2_EAX=0, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, t1825=-2, t1826=-1, t1827=0, weak$$choice0=0, weak$$choice1=0, weak$$choice2=1, x=1, y$flush_delayed=0, y$mem_tmp=0, y$r_buff0_thd0=0, y$r_buff0_thd1=0, y$r_buff0_thd2=0, y$r_buff0_thd3=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}] [L812] 3 weak$$choice0 = __VERIFIER_nondet_bool() [L813] 3 weak$$choice2 = __VERIFIER_nondet_bool() [L814] 3 y$flush_delayed = weak$$choice2 [L815] EXPR 3 \read(y) [L815] 3 y$mem_tmp = y [L816] EXPR 3 !y$w_buff0_used || !y$r_buff0_thd3 && !y$w_buff1_used || !y$r_buff0_thd3 && !y$r_buff1_thd3 ? y : (y$w_buff0_used && y$r_buff0_thd3 ? y$w_buff0 : y$w_buff1) [L816] EXPR 3 \read(y) [L816] EXPR 3 !y$w_buff0_used || !y$r_buff0_thd3 && !y$w_buff1_used || !y$r_buff0_thd3 && !y$r_buff1_thd3 ? y : (y$w_buff0_used && y$r_buff0_thd3 ? y$w_buff0 : y$w_buff1) [L816] 3 y = !y$w_buff0_used || !y$r_buff0_thd3 && !y$w_buff1_used || !y$r_buff0_thd3 && !y$r_buff1_thd3 ? y : (y$w_buff0_used && y$r_buff0_thd3 ? y$w_buff0 : y$w_buff1) [L817] 3 y$w_buff0 = weak$$choice2 ? y$w_buff0 : (!y$w_buff0_used || !y$r_buff0_thd3 && !y$w_buff1_used || !y$r_buff0_thd3 && !y$r_buff1_thd3 ? y$w_buff0 : (y$w_buff0_used && y$r_buff0_thd3 ? y$w_buff0 : y$w_buff0)) [L818] 3 y$w_buff1 = weak$$choice2 ? y$w_buff1 : (!y$w_buff0_used || !y$r_buff0_thd3 && !y$w_buff1_used || !y$r_buff0_thd3 && !y$r_buff1_thd3 ? y$w_buff1 : (y$w_buff0_used && y$r_buff0_thd3 ? y$w_buff1 : y$w_buff1)) [L819] 3 y$w_buff0_used = weak$$choice2 ? y$w_buff0_used : (!y$w_buff0_used || !y$r_buff0_thd3 && !y$w_buff1_used || !y$r_buff0_thd3 && !y$r_buff1_thd3 ? y$w_buff0_used : (y$w_buff0_used && y$r_buff0_thd3 ? (_Bool)0 : y$w_buff0_used)) [L820] 3 y$w_buff1_used = weak$$choice2 ? y$w_buff1_used : (!y$w_buff0_used || !y$r_buff0_thd3 && !y$w_buff1_used || !y$r_buff0_thd3 && !y$r_buff1_thd3 ? y$w_buff1_used : (y$w_buff0_used && y$r_buff0_thd3 ? (_Bool)0 : (_Bool)0)) [L821] 3 y$r_buff0_thd3 = weak$$choice2 ? y$r_buff0_thd3 : (!y$w_buff0_used || !y$r_buff0_thd3 && !y$w_buff1_used || !y$r_buff0_thd3 && !y$r_buff1_thd3 ? y$r_buff0_thd3 : (y$w_buff0_used && y$r_buff0_thd3 ? (_Bool)0 : y$r_buff0_thd3)) [L822] 3 y$r_buff1_thd3 = weak$$choice2 ? y$r_buff1_thd3 : (!y$w_buff0_used || !y$r_buff0_thd3 && !y$w_buff1_used || !y$r_buff0_thd3 && !y$r_buff1_thd3 ? y$r_buff1_thd3 : (y$w_buff0_used && y$r_buff0_thd3 ? (_Bool)0 : (_Bool)0)) [L823] EXPR 3 \read(y) [L823] 3 __unbuffered_p2_EAX = y [L824] EXPR 3 y$flush_delayed ? y$mem_tmp : y [L824] EXPR 3 y$flush_delayed ? y$mem_tmp : y [L824] 3 y = y$flush_delayed ? y$mem_tmp : y [L825] 3 y$flush_delayed = (_Bool)0 VAL [\old(arg)={0:0}, \old(arg)={0:0}, \old(arg)={0:0}, __unbuffered_cnt=0, __unbuffered_p0_EAX$flush_delayed=0, __unbuffered_p0_EAX$mem_tmp=0, __unbuffered_p0_EAX$r_buff0_thd0=0, __unbuffered_p0_EAX$r_buff0_thd1=0, __unbuffered_p0_EAX$r_buff0_thd2=0, __unbuffered_p0_EAX$r_buff0_thd3=0, __unbuffered_p0_EAX$r_buff1_thd0=0, __unbuffered_p0_EAX$r_buff1_thd1=0, __unbuffered_p0_EAX$r_buff1_thd2=0, __unbuffered_p0_EAX$r_buff1_thd3=0, __unbuffered_p0_EAX$read_delayed=1, __unbuffered_p0_EAX$read_delayed_var={3:0}, __unbuffered_p0_EAX$w_buff0=0, __unbuffered_p0_EAX$w_buff0_used=0, __unbuffered_p0_EAX$w_buff1=0, __unbuffered_p0_EAX$w_buff1_used=0, __unbuffered_p0_EAX=0, __unbuffered_p0_EBX=0, __unbuffered_p2_EAX=1, arg={0:0}, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=1, weak$$choice1=0, weak$$choice2=1, x=1, y$flush_delayed=0, y$mem_tmp=1, 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}] [L798] 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) [L798] EXPR 2 y$w_buff1_used && y$r_buff1_thd2 ? y$w_buff1 : y [L798] EXPR 2 \read(y) [L798] EXPR 2 y$w_buff1_used && y$r_buff1_thd2 ? y$w_buff1 : y [L798] 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) [L798] 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) [L799] 2 y$w_buff0_used = y$w_buff0_used && y$r_buff0_thd2 ? (_Bool)0 : y$w_buff0_used [L800] 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 [L801] 2 y$r_buff0_thd2 = y$w_buff0_used && y$r_buff0_thd2 ? (_Bool)0 : y$r_buff0_thd2 [L802] 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$flush_delayed=0, __unbuffered_p0_EAX$mem_tmp=0, __unbuffered_p0_EAX$r_buff0_thd0=0, __unbuffered_p0_EAX$r_buff0_thd1=0, __unbuffered_p0_EAX$r_buff0_thd2=0, __unbuffered_p0_EAX$r_buff0_thd3=0, __unbuffered_p0_EAX$r_buff1_thd0=0, __unbuffered_p0_EAX$r_buff1_thd1=0, __unbuffered_p0_EAX$r_buff1_thd2=0, __unbuffered_p0_EAX$r_buff1_thd3=0, __unbuffered_p0_EAX$read_delayed=1, __unbuffered_p0_EAX$read_delayed_var={3:0}, __unbuffered_p0_EAX$w_buff0=0, __unbuffered_p0_EAX$w_buff0_used=0, __unbuffered_p0_EAX$w_buff1=0, __unbuffered_p0_EAX$w_buff1_used=0, __unbuffered_p0_EAX=0, __unbuffered_p0_EBX=0, __unbuffered_p2_EAX=1, arg={0:0}, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=1, weak$$choice1=0, weak$$choice2=1, x=1, y$flush_delayed=0, y$mem_tmp=1, 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}] [L828] 3 y = 2 VAL [\old(arg)={0:0}, \old(arg)={0:0}, \old(arg)={0:0}, __unbuffered_cnt=0, __unbuffered_p0_EAX$flush_delayed=0, __unbuffered_p0_EAX$mem_tmp=0, __unbuffered_p0_EAX$r_buff0_thd0=0, __unbuffered_p0_EAX$r_buff0_thd1=0, __unbuffered_p0_EAX$r_buff0_thd2=0, __unbuffered_p0_EAX$r_buff0_thd3=0, __unbuffered_p0_EAX$r_buff1_thd0=0, __unbuffered_p0_EAX$r_buff1_thd1=0, __unbuffered_p0_EAX$r_buff1_thd2=0, __unbuffered_p0_EAX$r_buff1_thd3=0, __unbuffered_p0_EAX$read_delayed=1, __unbuffered_p0_EAX$read_delayed_var={3:0}, __unbuffered_p0_EAX$w_buff0=0, __unbuffered_p0_EAX$w_buff0_used=0, __unbuffered_p0_EAX$w_buff1=0, __unbuffered_p0_EAX$w_buff1_used=0, __unbuffered_p0_EAX=0, __unbuffered_p0_EBX=0, __unbuffered_p2_EAX=1, arg={0:0}, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=1, weak$$choice1=0, weak$$choice2=1, x=1, y$flush_delayed=0, y$mem_tmp=1, 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}] [L831] 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) [L831] EXPR 3 y$w_buff1_used && y$r_buff1_thd3 ? y$w_buff1 : y [L831] EXPR 3 \read(y) [L831] EXPR 3 y$w_buff1_used && y$r_buff1_thd3 ? y$w_buff1 : y [L831] 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) [L831] 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) [L832] 3 y$w_buff0_used = y$w_buff0_used && y$r_buff0_thd3 ? (_Bool)0 : y$w_buff0_used [L833] 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 [L834] 3 y$r_buff0_thd3 = y$w_buff0_used && y$r_buff0_thd3 ? (_Bool)0 : y$r_buff0_thd3 [L835] 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}, \old(arg)={0:0}, __unbuffered_cnt=0, __unbuffered_p0_EAX$flush_delayed=0, __unbuffered_p0_EAX$mem_tmp=0, __unbuffered_p0_EAX$r_buff0_thd0=0, __unbuffered_p0_EAX$r_buff0_thd1=0, __unbuffered_p0_EAX$r_buff0_thd2=0, __unbuffered_p0_EAX$r_buff0_thd3=0, __unbuffered_p0_EAX$r_buff1_thd0=0, __unbuffered_p0_EAX$r_buff1_thd1=0, __unbuffered_p0_EAX$r_buff1_thd2=0, __unbuffered_p0_EAX$r_buff1_thd3=0, __unbuffered_p0_EAX$read_delayed=1, __unbuffered_p0_EAX$read_delayed_var={3:0}, __unbuffered_p0_EAX$w_buff0=0, __unbuffered_p0_EAX$w_buff0_used=0, __unbuffered_p0_EAX$w_buff1=0, __unbuffered_p0_EAX$w_buff1_used=0, __unbuffered_p0_EAX=0, __unbuffered_p0_EBX=0, __unbuffered_p2_EAX=1, arg={0:0}, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=1, weak$$choice1=0, weak$$choice2=1, x=1, y$flush_delayed=0, y$mem_tmp=1, 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}] [L785] 1 __unbuffered_cnt = __unbuffered_cnt + 1 VAL [\old(arg)={0:0}, \old(arg)={0:0}, \old(arg)={0:0}, __unbuffered_cnt=1, __unbuffered_p0_EAX$flush_delayed=0, __unbuffered_p0_EAX$mem_tmp=0, __unbuffered_p0_EAX$r_buff0_thd0=0, __unbuffered_p0_EAX$r_buff0_thd1=0, __unbuffered_p0_EAX$r_buff0_thd2=0, __unbuffered_p0_EAX$r_buff0_thd3=0, __unbuffered_p0_EAX$r_buff1_thd0=0, __unbuffered_p0_EAX$r_buff1_thd1=0, __unbuffered_p0_EAX$r_buff1_thd2=0, __unbuffered_p0_EAX$r_buff1_thd3=0, __unbuffered_p0_EAX$read_delayed=1, __unbuffered_p0_EAX$read_delayed_var={3:0}, __unbuffered_p0_EAX$w_buff0=0, __unbuffered_p0_EAX$w_buff0_used=0, __unbuffered_p0_EAX$w_buff1=0, __unbuffered_p0_EAX$w_buff1_used=0, __unbuffered_p0_EAX=0, __unbuffered_p0_EBX=0, __unbuffered_p2_EAX=1, arg={0:0}, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=1, weak$$choice1=0, weak$$choice2=1, x=1, y$flush_delayed=0, y$mem_tmp=1, 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}] [L805] 2 __unbuffered_cnt = __unbuffered_cnt + 1 VAL [\old(arg)={0:0}, \old(arg)={0:0}, \old(arg)={0:0}, __unbuffered_cnt=2, __unbuffered_p0_EAX$flush_delayed=0, __unbuffered_p0_EAX$mem_tmp=0, __unbuffered_p0_EAX$r_buff0_thd0=0, __unbuffered_p0_EAX$r_buff0_thd1=0, __unbuffered_p0_EAX$r_buff0_thd2=0, __unbuffered_p0_EAX$r_buff0_thd3=0, __unbuffered_p0_EAX$r_buff1_thd0=0, __unbuffered_p0_EAX$r_buff1_thd1=0, __unbuffered_p0_EAX$r_buff1_thd2=0, __unbuffered_p0_EAX$r_buff1_thd3=0, __unbuffered_p0_EAX$read_delayed=1, __unbuffered_p0_EAX$read_delayed_var={3:0}, __unbuffered_p0_EAX$w_buff0=0, __unbuffered_p0_EAX$w_buff0_used=0, __unbuffered_p0_EAX$w_buff1=0, __unbuffered_p0_EAX$w_buff1_used=0, __unbuffered_p0_EAX=0, __unbuffered_p0_EBX=0, __unbuffered_p2_EAX=1, arg={0:0}, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=1, weak$$choice1=0, weak$$choice2=1, x=1, y$flush_delayed=0, y$mem_tmp=1, 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}] [L838] 3 __unbuffered_cnt = __unbuffered_cnt + 1 VAL [\old(arg)={0:0}, \old(arg)={0:0}, \old(arg)={0:0}, __unbuffered_cnt=3, __unbuffered_p0_EAX$flush_delayed=0, __unbuffered_p0_EAX$mem_tmp=0, __unbuffered_p0_EAX$r_buff0_thd0=0, __unbuffered_p0_EAX$r_buff0_thd1=0, __unbuffered_p0_EAX$r_buff0_thd2=0, __unbuffered_p0_EAX$r_buff0_thd3=0, __unbuffered_p0_EAX$r_buff1_thd0=0, __unbuffered_p0_EAX$r_buff1_thd1=0, __unbuffered_p0_EAX$r_buff1_thd2=0, __unbuffered_p0_EAX$r_buff1_thd3=0, __unbuffered_p0_EAX$read_delayed=1, __unbuffered_p0_EAX$read_delayed_var={3:0}, __unbuffered_p0_EAX$w_buff0=0, __unbuffered_p0_EAX$w_buff0_used=0, __unbuffered_p0_EAX$w_buff1=0, __unbuffered_p0_EAX$w_buff1_used=0, __unbuffered_p0_EAX=0, __unbuffered_p0_EBX=0, __unbuffered_p2_EAX=1, arg={0:0}, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=1, weak$$choice1=0, weak$$choice2=1, x=1, y$flush_delayed=0, y$mem_tmp=1, 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}] [L860] 0 main$tmp_guard0 = __unbuffered_cnt == 3 VAL [\old(arg)={0:0}, \old(arg)={0:0}, \old(arg)={0:0}, __unbuffered_cnt=3, __unbuffered_p0_EAX$flush_delayed=0, __unbuffered_p0_EAX$mem_tmp=0, __unbuffered_p0_EAX$r_buff0_thd0=0, __unbuffered_p0_EAX$r_buff0_thd1=0, __unbuffered_p0_EAX$r_buff0_thd2=0, __unbuffered_p0_EAX$r_buff0_thd3=0, __unbuffered_p0_EAX$r_buff1_thd0=0, __unbuffered_p0_EAX$r_buff1_thd1=0, __unbuffered_p0_EAX$r_buff1_thd2=0, __unbuffered_p0_EAX$r_buff1_thd3=0, __unbuffered_p0_EAX$read_delayed=1, __unbuffered_p0_EAX$read_delayed_var={3:0}, __unbuffered_p0_EAX$w_buff0=0, __unbuffered_p0_EAX$w_buff0_used=0, __unbuffered_p0_EAX$w_buff1=0, __unbuffered_p0_EAX$w_buff1_used=0, __unbuffered_p0_EAX=0, __unbuffered_p0_EBX=0, __unbuffered_p2_EAX=1, arg={0:0}, arg={0:0}, arg={0:0}, main$tmp_guard0=1, main$tmp_guard1=0, t1825=-2, t1826=-1, t1827=0, weak$$choice0=1, weak$$choice1=0, weak$$choice2=1, x=1, y$flush_delayed=0, y$mem_tmp=1, 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}] [L862] CALL 0 assume_abort_if_not(main$tmp_guard0) [L4] COND FALSE 0 !(!cond) [L862] RET 0 assume_abort_if_not(main$tmp_guard0) [L864] 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) [L864] EXPR 0 y$w_buff1_used && y$r_buff1_thd0 ? y$w_buff1 : y [L864] EXPR 0 \read(y) [L864] EXPR 0 y$w_buff1_used && y$r_buff1_thd0 ? y$w_buff1 : y [L864] 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) [L864] 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) [L865] 0 y$w_buff0_used = y$w_buff0_used && y$r_buff0_thd0 ? (_Bool)0 : y$w_buff0_used [L866] 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 [L867] 0 y$r_buff0_thd0 = y$w_buff0_used && y$r_buff0_thd0 ? (_Bool)0 : y$r_buff0_thd0 [L868] 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}, \old(arg)={0:0}, __unbuffered_cnt=3, __unbuffered_p0_EAX$flush_delayed=0, __unbuffered_p0_EAX$mem_tmp=0, __unbuffered_p0_EAX$r_buff0_thd0=0, __unbuffered_p0_EAX$r_buff0_thd1=0, __unbuffered_p0_EAX$r_buff0_thd2=0, __unbuffered_p0_EAX$r_buff0_thd3=0, __unbuffered_p0_EAX$r_buff1_thd0=0, __unbuffered_p0_EAX$r_buff1_thd1=0, __unbuffered_p0_EAX$r_buff1_thd2=0, __unbuffered_p0_EAX$r_buff1_thd3=0, __unbuffered_p0_EAX$read_delayed=1, __unbuffered_p0_EAX$read_delayed_var={3:0}, __unbuffered_p0_EAX$w_buff0=0, __unbuffered_p0_EAX$w_buff0_used=0, __unbuffered_p0_EAX$w_buff1=0, __unbuffered_p0_EAX$w_buff1_used=0, __unbuffered_p0_EAX=0, __unbuffered_p0_EBX=0, __unbuffered_p2_EAX=1, arg={0:0}, arg={0:0}, arg={0:0}, main$tmp_guard0=1, main$tmp_guard1=0, t1825=-2, t1826=-1, t1827=0, weak$$choice0=1, weak$$choice1=0, weak$$choice2=1, x=1, y$flush_delayed=0, y$mem_tmp=1, 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}] [L871] 0 weak$$choice0 = __VERIFIER_nondet_bool() [L872] 0 weak$$choice2 = __VERIFIER_nondet_bool() [L873] 0 y$flush_delayed = weak$$choice2 [L874] EXPR 0 \read(y) [L874] 0 y$mem_tmp = y [L875] EXPR 0 !y$w_buff0_used || !y$r_buff0_thd0 && !y$w_buff1_used || !y$r_buff0_thd0 && !y$r_buff1_thd0 ? y : (y$w_buff0_used && y$r_buff0_thd0 ? y$w_buff0 : y$w_buff1) [L875] EXPR 0 \read(y) [L875] EXPR 0 !y$w_buff0_used || !y$r_buff0_thd0 && !y$w_buff1_used || !y$r_buff0_thd0 && !y$r_buff1_thd0 ? y : (y$w_buff0_used && y$r_buff0_thd0 ? y$w_buff0 : y$w_buff1) [L875] 0 y = !y$w_buff0_used || !y$r_buff0_thd0 && !y$w_buff1_used || !y$r_buff0_thd0 && !y$r_buff1_thd0 ? y : (y$w_buff0_used && y$r_buff0_thd0 ? y$w_buff0 : y$w_buff1) [L876] 0 y$w_buff0 = weak$$choice2 ? y$w_buff0 : (!y$w_buff0_used || !y$r_buff0_thd0 && !y$w_buff1_used || !y$r_buff0_thd0 && !y$r_buff1_thd0 ? y$w_buff0 : (y$w_buff0_used && y$r_buff0_thd0 ? y$w_buff0 : y$w_buff0)) [L877] 0 y$w_buff1 = weak$$choice2 ? y$w_buff1 : (!y$w_buff0_used || !y$r_buff0_thd0 && !y$w_buff1_used || !y$r_buff0_thd0 && !y$r_buff1_thd0 ? y$w_buff1 : (y$w_buff0_used && y$r_buff0_thd0 ? y$w_buff1 : y$w_buff1)) [L878] 0 y$w_buff0_used = weak$$choice2 ? y$w_buff0_used : (!y$w_buff0_used || !y$r_buff0_thd0 && !y$w_buff1_used || !y$r_buff0_thd0 && !y$r_buff1_thd0 ? y$w_buff0_used : (y$w_buff0_used && y$r_buff0_thd0 ? (_Bool)0 : y$w_buff0_used)) [L879] 0 y$w_buff1_used = weak$$choice2 ? y$w_buff1_used : (!y$w_buff0_used || !y$r_buff0_thd0 && !y$w_buff1_used || !y$r_buff0_thd0 && !y$r_buff1_thd0 ? y$w_buff1_used : (y$w_buff0_used && y$r_buff0_thd0 ? (_Bool)0 : (_Bool)0)) [L880] 0 y$r_buff0_thd0 = weak$$choice2 ? y$r_buff0_thd0 : (!y$w_buff0_used || !y$r_buff0_thd0 && !y$w_buff1_used || !y$r_buff0_thd0 && !y$r_buff1_thd0 ? y$r_buff0_thd0 : (y$w_buff0_used && y$r_buff0_thd0 ? (_Bool)0 : y$r_buff0_thd0)) [L881] 0 y$r_buff1_thd0 = weak$$choice2 ? y$r_buff1_thd0 : (!y$w_buff0_used || !y$r_buff0_thd0 && !y$w_buff1_used || !y$r_buff0_thd0 && !y$r_buff1_thd0 ? y$r_buff1_thd0 : (y$w_buff0_used && y$r_buff0_thd0 ? (_Bool)0 : (_Bool)0)) [L882] 0 weak$$choice1 = __VERIFIER_nondet_bool() [L883] EXPR 0 __unbuffered_p0_EAX$read_delayed ? (weak$$choice1 ? *__unbuffered_p0_EAX$read_delayed_var : __unbuffered_p0_EAX) : __unbuffered_p0_EAX [L883] EXPR 0 weak$$choice1 ? *__unbuffered_p0_EAX$read_delayed_var : __unbuffered_p0_EAX [L883] EXPR 0 \read(*__unbuffered_p0_EAX$read_delayed_var) [L883] EXPR 0 weak$$choice1 ? *__unbuffered_p0_EAX$read_delayed_var : __unbuffered_p0_EAX [L883] EXPR 0 __unbuffered_p0_EAX$read_delayed ? (weak$$choice1 ? *__unbuffered_p0_EAX$read_delayed_var : __unbuffered_p0_EAX) : __unbuffered_p0_EAX [L883] 0 __unbuffered_p0_EAX = __unbuffered_p0_EAX$read_delayed ? (weak$$choice1 ? *__unbuffered_p0_EAX$read_delayed_var : __unbuffered_p0_EAX) : __unbuffered_p0_EAX [L884] EXPR 0 \read(y) [L884] 0 main$tmp_guard1 = !(y == 2 && __unbuffered_p0_EAX == 2 && __unbuffered_p0_EBX == 0 && __unbuffered_p2_EAX == 1) [L885] EXPR 0 y$flush_delayed ? y$mem_tmp : y [L885] EXPR 0 y$flush_delayed ? y$mem_tmp : y [L885] 0 y = y$flush_delayed ? y$mem_tmp : y [L886] 0 y$flush_delayed = (_Bool)0 VAL [\old(arg)={0:0}, \old(arg)={0:0}, \old(arg)={0:0}, __unbuffered_cnt=3, __unbuffered_p0_EAX$flush_delayed=0, __unbuffered_p0_EAX$mem_tmp=0, __unbuffered_p0_EAX$r_buff0_thd0=0, __unbuffered_p0_EAX$r_buff0_thd1=0, __unbuffered_p0_EAX$r_buff0_thd2=0, __unbuffered_p0_EAX$r_buff0_thd3=0, __unbuffered_p0_EAX$r_buff1_thd0=0, __unbuffered_p0_EAX$r_buff1_thd1=0, __unbuffered_p0_EAX$r_buff1_thd2=0, __unbuffered_p0_EAX$r_buff1_thd3=0, __unbuffered_p0_EAX$read_delayed=1, __unbuffered_p0_EAX$read_delayed_var={3:0}, __unbuffered_p0_EAX$w_buff0=0, __unbuffered_p0_EAX$w_buff0_used=0, __unbuffered_p0_EAX$w_buff1=0, __unbuffered_p0_EAX$w_buff1_used=0, __unbuffered_p0_EAX=2, __unbuffered_p0_EBX=0, __unbuffered_p2_EAX=1, arg={0:0}, arg={0:0}, arg={0:0}, main$tmp_guard0=1, main$tmp_guard1=0, t1825=-2, t1826=-1, t1827=0, weak$$choice0=1, weak$$choice1=1, weak$$choice2=1, x=1, y$flush_delayed=0, y$mem_tmp=2, y$r_buff0_thd0=0, y$r_buff0_thd1=0, y$r_buff0_thd2=0, y$r_buff0_thd3=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}] [L888] CALL 0 __VERIFIER_assert(main$tmp_guard1) [L19] COND TRUE 0 !expression [L19] CALL 0 reach_error() [L18] COND FALSE 0 !(0) VAL [\old(arg)={0:0}, \old(arg)={0:0}, \old(arg)={0:0}, __unbuffered_cnt=3, __unbuffered_p0_EAX$flush_delayed=0, __unbuffered_p0_EAX$mem_tmp=0, __unbuffered_p0_EAX$r_buff0_thd0=0, __unbuffered_p0_EAX$r_buff0_thd1=0, __unbuffered_p0_EAX$r_buff0_thd2=0, __unbuffered_p0_EAX$r_buff0_thd3=0, __unbuffered_p0_EAX$r_buff1_thd0=0, __unbuffered_p0_EAX$r_buff1_thd1=0, __unbuffered_p0_EAX$r_buff1_thd2=0, __unbuffered_p0_EAX$r_buff1_thd3=0, __unbuffered_p0_EAX$read_delayed=1, __unbuffered_p0_EAX$read_delayed_var={3:0}, __unbuffered_p0_EAX$w_buff0=0, __unbuffered_p0_EAX$w_buff0_used=0, __unbuffered_p0_EAX$w_buff1=0, __unbuffered_p0_EAX$w_buff1_used=0, __unbuffered_p0_EAX=2, __unbuffered_p0_EBX=0, __unbuffered_p2_EAX=1, arg={0:0}, arg={0:0}, arg={0:0}, main$tmp_guard0=1, main$tmp_guard1=0, weak$$choice0=1, weak$$choice1=1, weak$$choice2=1, x=1, y$flush_delayed=0, y$mem_tmp=2, y$r_buff0_thd0=0, y$r_buff0_thd1=0, y$r_buff0_thd2=0, y$r_buff0_thd3=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}] [L18] 0 __assert_fail ("0", "safe002_power.oepc.c", 9, __extension__ __PRETTY_FUNCTION__) VAL [\old(arg)={0:0}, \old(arg)={0:0}, \old(arg)={0:0}, __unbuffered_cnt=3, __unbuffered_p0_EAX$flush_delayed=0, __unbuffered_p0_EAX$mem_tmp=0, __unbuffered_p0_EAX$r_buff0_thd0=0, __unbuffered_p0_EAX$r_buff0_thd1=0, __unbuffered_p0_EAX$r_buff0_thd2=0, __unbuffered_p0_EAX$r_buff0_thd3=0, __unbuffered_p0_EAX$r_buff1_thd0=0, __unbuffered_p0_EAX$r_buff1_thd1=0, __unbuffered_p0_EAX$r_buff1_thd2=0, __unbuffered_p0_EAX$r_buff1_thd3=0, __unbuffered_p0_EAX$read_delayed=1, __unbuffered_p0_EAX$read_delayed_var={3:0}, __unbuffered_p0_EAX$w_buff0=0, __unbuffered_p0_EAX$w_buff0_used=0, __unbuffered_p0_EAX$w_buff1=0, __unbuffered_p0_EAX$w_buff1_used=0, __unbuffered_p0_EAX=2, __unbuffered_p0_EBX=0, __unbuffered_p2_EAX=1, arg={0:0}, arg={0:0}, arg={0:0}, main$tmp_guard0=1, main$tmp_guard1=0, weak$$choice0=1, weak$$choice1=1, weak$$choice2=1, x=1, y$flush_delayed=0, y$mem_tmp=2, y$r_buff0_thd0=0, y$r_buff0_thd1=0, y$r_buff0_thd2=0, y$r_buff0_thd3=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}] - 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: -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: 851]: Unable to prove that all allocated memory was freed Unable to prove that all allocated memory was freed Reason: Not analyzed. - UnprovableResult [Line: 858]: 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: 854]: 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: 856]: 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, 164 locations, 103 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: 18.5s, OverallIterations: 10, TraceHistogramMax: 1, PathProgramHistogramMax: 1, EmptinessCheckTime: 0.0s, AutomataDifference: 13.0s, DeadEndRemovalTime: 0.0s, HoareAnnotationTime: 0.0s, InitialAbstractionConstructionTime: 0.2s, HoareTripleCheckerStatistics: 0 mSolverCounterUnknown, 360 SdHoareTripleChecker+Valid, 1.9s IncrementalHoareTripleChecker+Time, 0 mSdLazyCounter, 347 mSDsluCounter, 10 SdHoareTripleChecker+Invalid, 1.6s Time, 0 mProtectedAction, 0 SdHoareTripleChecker+Unchecked, 0 IncrementalHoareTripleChecker+Unchecked, 9 mSDsCounter, 48 IncrementalHoareTripleChecker+Valid, 0 mProtectedPredicate, 512 IncrementalHoareTripleChecker+Invalid, 560 SdHoareTripleChecker+Unknown, 0 mSolverCounterNotChecked, 48 mSolverCounterUnsat, 1 mSDtfsCounter, 512 mSolverCounterSat, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Unknown, PredicateUnifierStatistics: 0 DeclaredPredicates, 28 GetRequests, 4 SyntacticMatches, 0 SemanticMatches, 24 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 7 ImplicationChecksByTransitivity, 0.2s Time, 0.0s BasicInterpolantAutomatonTime, BiggestAbstraction: size=205occurred in iteration=0, InterpolantAutomatonStates: 35, 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, 1.0s SatisfiabilityAnalysisTime, 3.4s InterpolantComputationTime, 150 NumberOfCodeBlocks, 150 NumberOfCodeBlocksAsserted, 10 NumberOfCheckSat, 111 ConstructedInterpolants, 0 QuantifiedInterpolants, 452 SizeOfPredicates, 0 NumberOfNonLiveVariables, 0 ConjunctsInSsa, 0 ConjunctsInUnsatCore, 9 InterpolantComputations, 9 PerfectInterpolantSequences, 0/0 InterpolantCoveringCapability, INVARIANT_SYNTHESIS: No data available, INTERPOLANT_CONSOLIDATION: No data available, ABSTRACT_INTERPRETATION: No data available, PDR: No data available, ACCELERATED_INTERPOLATION: No data available, SIFA: No data available, ReuseStatistics: No data available RESULT: Ultimate could not prove your program: unable to determine feasibility of some traces [2024-11-13 14:08:07,975 INFO L552 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_d6c6bbac-8b87-4a12-bfcd-06c657a41f19/bin/uautomizer-verify-qhAvR1uOyd/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_d6c6bbac-8b87-4a12-bfcd-06c657a41f19/bin/uautomizer-verify-qhAvR1uOyd/data/config -Xmx15G -Xms4m -jar /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_d6c6bbac-8b87-4a12-bfcd-06c657a41f19/bin/uautomizer-verify-qhAvR1uOyd/plugins/org.eclipse.equinox.launcher_1.6.800.v20240513-1750.jar -data @noDefault -ultimatedata /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_d6c6bbac-8b87-4a12-bfcd-06c657a41f19/bin/uautomizer-verify-qhAvR1uOyd/data -tc /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_d6c6bbac-8b87-4a12-bfcd-06c657a41f19/bin/uautomizer-verify-qhAvR1uOyd/config/AutomizerMemDerefMemtrack.xml -i ../../sv-benchmarks/c/pthread-wmm/safe002_power.oepc.i -s /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_d6c6bbac-8b87-4a12-bfcd-06c657a41f19/bin/uautomizer-verify-qhAvR1uOyd/config/svcomp-DerefFreeMemtrack-32bit-Automizer_Bitvector.epf --cacsl2boogietranslator.entry.function main --witnessprinter.witness.directory /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_d6c6bbac-8b87-4a12-bfcd-06c657a41f19/bin/uautomizer-verify-qhAvR1uOyd --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 7a9379df521a7077d18fd2276dc35da388f77854d23421e689a681d711c31769 --- Real Ultimate output --- This is Ultimate 0.3.0-dev-826ab2b [2024-11-13 14:08:11,733 INFO L188 SettingsManager]: Resetting all preferences to default values... [2024-11-13 14:08:11,889 INFO L114 SettingsManager]: Loading settings from /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_d6c6bbac-8b87-4a12-bfcd-06c657a41f19/bin/uautomizer-verify-qhAvR1uOyd/config/svcomp-DerefFreeMemtrack-32bit-Automizer_Bitvector.epf [2024-11-13 14:08:11,896 WARN L101 SettingsManager]: Preference file contains the following unknown settings: [2024-11-13 14:08:11,896 WARN L103 SettingsManager]: * de.uni_freiburg.informatik.ultimate.core.Log level for class [2024-11-13 14:08:11,928 INFO L130 SettingsManager]: Preferences different from defaults after loading the file: [2024-11-13 14:08:11,929 INFO L151 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2024-11-13 14:08:11,929 INFO L153 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2024-11-13 14:08:11,929 INFO L151 SettingsManager]: Preferences of Boogie Preprocessor differ from their defaults: [2024-11-13 14:08:11,929 INFO L153 SettingsManager]: * Use memory slicer=true [2024-11-13 14:08:11,930 INFO L151 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2024-11-13 14:08:11,930 INFO L153 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2024-11-13 14:08:11,930 INFO L151 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2024-11-13 14:08:11,930 INFO L153 SettingsManager]: * Create parallel compositions if possible=false [2024-11-13 14:08:11,931 INFO L153 SettingsManager]: * Use SBE=true [2024-11-13 14:08:11,931 INFO L151 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2024-11-13 14:08:11,931 INFO L153 SettingsManager]: * sizeof long=4 [2024-11-13 14:08:11,931 INFO L153 SettingsManager]: * Overapproximate operations on floating types=true [2024-11-13 14:08:11,931 INFO L153 SettingsManager]: * sizeof POINTER=4 [2024-11-13 14:08:11,931 INFO L153 SettingsManager]: * Check division by zero=IGNORE [2024-11-13 14:08:11,932 INFO L153 SettingsManager]: * Check for the main procedure if all allocated memory was freed=true [2024-11-13 14:08:11,932 INFO L153 SettingsManager]: * Bitprecise bitfields=true [2024-11-13 14:08:11,932 INFO L153 SettingsManager]: * SV-COMP memtrack compatibility mode=true [2024-11-13 14:08:11,932 INFO L153 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2024-11-13 14:08:11,932 INFO L153 SettingsManager]: * Adapt memory model on pointer casts if necessary=true [2024-11-13 14:08:11,932 INFO L153 SettingsManager]: * Use bitvectors instead of ints=true [2024-11-13 14:08:11,932 INFO L153 SettingsManager]: * Allow undefined functions=false [2024-11-13 14:08:11,933 INFO L153 SettingsManager]: * Memory model=HoenickeLindenmann_4ByteResolution [2024-11-13 14:08:11,933 INFO L153 SettingsManager]: * Check unreachability of reach_error function=false [2024-11-13 14:08:11,933 INFO L153 SettingsManager]: * sizeof long double=12 [2024-11-13 14:08:11,933 INFO L153 SettingsManager]: * Use constant arrays=true [2024-11-13 14:08:11,933 INFO L151 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2024-11-13 14:08:11,933 INFO L153 SettingsManager]: * Size of a code block=SequenceOfStatements [2024-11-13 14:08:11,934 INFO L153 SettingsManager]: * Only consider context switches at boundaries of atomic blocks=true [2024-11-13 14:08:11,934 INFO L153 SettingsManager]: * SMT solver=External_DefaultMode [2024-11-13 14:08:11,934 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2024-11-13 14:08:11,934 INFO L151 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2024-11-13 14:08:11,934 INFO L153 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2024-11-13 14:08:11,934 INFO L153 SettingsManager]: * Trace refinement strategy=FOX [2024-11-13 14:08:11,935 INFO L153 SettingsManager]: * Command for external solver=cvc4 --incremental --print-success --lang smt [2024-11-13 14:08:11,935 INFO L153 SettingsManager]: * Apply one-shot large block encoding in concurrent analysis=false [2024-11-13 14:08:11,935 INFO L153 SettingsManager]: * Automaton type used in concurrency analysis=PETRI_NET [2024-11-13 14:08:11,935 INFO L153 SettingsManager]: * Order on configurations for Petri net unfoldings=DBO [2024-11-13 14:08:11,935 INFO L153 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2024-11-13 14:08:11,935 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_d6c6bbac-8b87-4a12-bfcd-06c657a41f19/bin/uautomizer-verify-qhAvR1uOyd 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 -> 7a9379df521a7077d18fd2276dc35da388f77854d23421e689a681d711c31769 [2024-11-13 14:08:12,375 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2024-11-13 14:08:12,387 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2024-11-13 14:08:12,392 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2024-11-13 14:08:12,395 INFO L270 PluginConnector]: Initializing CDTParser... [2024-11-13 14:08:12,396 INFO L274 PluginConnector]: CDTParser initialized [2024-11-13 14:08:12,398 INFO L431 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_d6c6bbac-8b87-4a12-bfcd-06c657a41f19/bin/uautomizer-verify-qhAvR1uOyd/../../sv-benchmarks/c/pthread-wmm/safe002_power.oepc.i Unable to find full path for "g++" [2024-11-13 14:08:14,987 INFO L533 CDTParser]: Created temporary CDT project at NULL [2024-11-13 14:08:15,432 INFO L384 CDTParser]: Found 1 translation units. [2024-11-13 14:08:15,433 INFO L180 CDTParser]: Scanning /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_d6c6bbac-8b87-4a12-bfcd-06c657a41f19/sv-benchmarks/c/pthread-wmm/safe002_power.oepc.i [2024-11-13 14:08:15,452 INFO L427 CDTParser]: About to delete temporary CDT project at /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_d6c6bbac-8b87-4a12-bfcd-06c657a41f19/bin/uautomizer-verify-qhAvR1uOyd/data/ea01c6b35/7356e99fc8ca4c2991d81de7bd5134a9/FLAGfea38a1a6 [2024-11-13 14:08:15,472 INFO L435 CDTParser]: Successfully deleted /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_d6c6bbac-8b87-4a12-bfcd-06c657a41f19/bin/uautomizer-verify-qhAvR1uOyd/data/ea01c6b35/7356e99fc8ca4c2991d81de7bd5134a9 [2024-11-13 14:08:15,475 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2024-11-13 14:08:15,477 INFO L133 ToolchainWalker]: Walking toolchain with 6 elements. [2024-11-13 14:08:15,479 INFO L112 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2024-11-13 14:08:15,481 INFO L270 PluginConnector]: Initializing CACSL2BoogieTranslator... [2024-11-13 14:08:15,487 INFO L274 PluginConnector]: CACSL2BoogieTranslator initialized [2024-11-13 14:08:15,488 INFO L184 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 13.11 02:08:15" (1/1) ... [2024-11-13 14:08:15,489 INFO L204 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@59dc791a and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.11 02:08:15, skipping insertion in model container [2024-11-13 14:08:15,492 INFO L184 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 13.11 02:08:15" (1/1) ... [2024-11-13 14:08:15,565 INFO L175 MainTranslator]: Built tables and reachable declarations [2024-11-13 14:08:16,295 INFO L210 PostProcessor]: Analyzing one entry point: main [2024-11-13 14:08:16,331 INFO L200 MainTranslator]: Completed pre-run [2024-11-13 14:08:16,494 INFO L210 PostProcessor]: Analyzing one entry point: main [2024-11-13 14:08:16,553 INFO L204 MainTranslator]: Completed translation [2024-11-13 14:08:16,554 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.11 02:08:16 WrapperNode [2024-11-13 14:08:16,555 INFO L131 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2024-11-13 14:08:16,558 INFO L112 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2024-11-13 14:08:16,558 INFO L270 PluginConnector]: Initializing Boogie Procedure Inliner... [2024-11-13 14:08:16,558 INFO L274 PluginConnector]: Boogie Procedure Inliner initialized [2024-11-13 14:08:16,572 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.11 02:08:16" (1/1) ... [2024-11-13 14:08:16,611 INFO L184 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.11 02:08:16" (1/1) ... [2024-11-13 14:08:16,653 INFO L138 Inliner]: procedures = 179, calls = 73, calls flagged for inlining = 5, calls inlined = 5, statements flattened = 163 [2024-11-13 14:08:16,653 INFO L131 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2024-11-13 14:08:16,654 INFO L112 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2024-11-13 14:08:16,654 INFO L270 PluginConnector]: Initializing Boogie Preprocessor... [2024-11-13 14:08:16,654 INFO L274 PluginConnector]: Boogie Preprocessor initialized [2024-11-13 14:08:16,666 INFO L184 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.11 02:08:16" (1/1) ... [2024-11-13 14:08:16,666 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.11 02:08:16" (1/1) ... [2024-11-13 14:08:16,673 INFO L184 PluginConnector]: Executing the observer MemorySlicer from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.11 02:08:16" (1/1) ... [2024-11-13 14:08:16,699 INFO L175 MemorySlicer]: Split 32 memory accesses to 2 slices as follows [2, 30]. 94 percent of accesses are in the largest equivalence class. The 3 initializations are split as follows [2, 1]. The 11 writes are split as follows [0, 11]. [2024-11-13 14:08:16,699 INFO L184 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.11 02:08:16" (1/1) ... [2024-11-13 14:08:16,700 INFO L184 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.11 02:08:16" (1/1) ... [2024-11-13 14:08:16,734 INFO L184 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.11 02:08:16" (1/1) ... [2024-11-13 14:08:16,746 INFO L184 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.11 02:08:16" (1/1) ... [2024-11-13 14:08:16,751 INFO L184 PluginConnector]: Executing the observer LTLStepAnnotator from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.11 02:08:16" (1/1) ... [2024-11-13 14:08:16,757 INFO L184 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.11 02:08:16" (1/1) ... [2024-11-13 14:08:16,770 INFO L131 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2024-11-13 14:08:16,772 INFO L112 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2024-11-13 14:08:16,772 INFO L270 PluginConnector]: Initializing RCFGBuilder... [2024-11-13 14:08:16,772 INFO L274 PluginConnector]: RCFGBuilder initialized [2024-11-13 14:08:16,777 INFO L184 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.11 02:08:16" (1/1) ... [2024-11-13 14:08:16,793 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2024-11-13 14:08:16,816 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_d6c6bbac-8b87-4a12-bfcd-06c657a41f19/bin/uautomizer-verify-qhAvR1uOyd/z3 [2024-11-13 14:08:16,833 INFO L229 MonitoredProcess]: Starting monitored process 1 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_d6c6bbac-8b87-4a12-bfcd-06c657a41f19/bin/uautomizer-verify-qhAvR1uOyd/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 (exit command is (exit), workingDir is null) [2024-11-13 14:08:16,841 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_d6c6bbac-8b87-4a12-bfcd-06c657a41f19/bin/uautomizer-verify-qhAvR1uOyd/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 (1)] Waiting until timeout for monitored process [2024-11-13 14:08:16,895 INFO L130 BoogieDeclarations]: Found specification of procedure read~intINTTYPE4#0 [2024-11-13 14:08:16,895 INFO L130 BoogieDeclarations]: Found specification of procedure read~intINTTYPE4#1 [2024-11-13 14:08:16,895 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_atomic_begin [2024-11-13 14:08:16,895 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2024-11-13 14:08:16,895 INFO L130 BoogieDeclarations]: Found specification of procedure write~intINTTYPE4#0 [2024-11-13 14:08:16,896 INFO L130 BoogieDeclarations]: Found specification of procedure write~intINTTYPE4#1 [2024-11-13 14:08:16,898 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~intINTTYPE1#0 [2024-11-13 14:08:16,898 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~intINTTYPE1#1 [2024-11-13 14:08:16,898 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~intINTTYPE4#0 [2024-11-13 14:08:16,898 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~intINTTYPE4#1 [2024-11-13 14:08:16,899 INFO L130 BoogieDeclarations]: Found specification of procedure P0 [2024-11-13 14:08:16,899 INFO L138 BoogieDeclarations]: Found implementation of procedure P0 [2024-11-13 14:08:16,899 INFO L130 BoogieDeclarations]: Found specification of procedure P1 [2024-11-13 14:08:16,899 INFO L138 BoogieDeclarations]: Found implementation of procedure P1 [2024-11-13 14:08:16,899 INFO L130 BoogieDeclarations]: Found specification of procedure P2 [2024-11-13 14:08:16,899 INFO L138 BoogieDeclarations]: Found implementation of procedure P2 [2024-11-13 14:08:16,899 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_atomic_end [2024-11-13 14:08:16,899 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2024-11-13 14:08:16,899 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2024-11-13 14:08:16,901 WARN L207 CfgBuilder]: User set CodeBlockSize to SequenceOfStatements but program contains fork statements. Overwriting the user preferences and setting CodeBlockSize to OneNontrivialStatement. [2024-11-13 14:08:17,106 INFO L238 CfgBuilder]: Building ICFG [2024-11-13 14:08:17,108 INFO L264 CfgBuilder]: Building CFG for each procedure with an implementation [2024-11-13 14:08:18,092 INFO L283 CfgBuilder]: Omitted future-live optimization because the input is a concurrent program. [2024-11-13 14:08:18,093 INFO L287 CfgBuilder]: Performing block encoding [2024-11-13 14:08:19,310 INFO L311 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2024-11-13 14:08:19,310 INFO L316 CfgBuilder]: Removed 0 assume(true) statements. [2024-11-13 14:08:19,311 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 13.11 02:08:19 BoogieIcfgContainer [2024-11-13 14:08:19,311 INFO L131 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2024-11-13 14:08:19,313 INFO L112 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2024-11-13 14:08:19,313 INFO L270 PluginConnector]: Initializing TraceAbstraction... [2024-11-13 14:08:19,318 INFO L274 PluginConnector]: TraceAbstraction initialized [2024-11-13 14:08:19,318 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 13.11 02:08:15" (1/3) ... [2024-11-13 14:08:19,319 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@e282f1f and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 13.11 02:08:19, skipping insertion in model container [2024-11-13 14:08:19,319 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.11 02:08:16" (2/3) ... [2024-11-13 14:08:19,319 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@e282f1f and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 13.11 02:08:19, skipping insertion in model container [2024-11-13 14:08:19,319 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 13.11 02:08:19" (3/3) ... [2024-11-13 14:08:19,320 INFO L112 eAbstractionObserver]: Analyzing ICFG safe002_power.oepc.i [2024-11-13 14:08:19,336 INFO L217 ceAbstractionStarter]: Automizer settings: Hoare:None NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2024-11-13 14:08:19,339 INFO L154 ceAbstractionStarter]: Applying trace abstraction to ICFG safe002_power.oepc.i that has 4 procedures, 100 locations, 1 initial locations, 0 loop locations, and 60 error locations. [2024-11-13 14:08:19,339 INFO L492 ceAbstractionStarter]: Constructing petrified ICFG for 1 thread instances. [2024-11-13 14:08:19,679 INFO L143 ThreadInstanceAdder]: Constructed 0 joinOtherThreadTransitions. [2024-11-13 14:08:19,715 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 109 places, 101 transitions, 214 flow [2024-11-13 14:08:19,803 INFO L124 PetriNetUnfolderBase]: 2/98 cut-off events. [2024-11-13 14:08:19,806 INFO L125 PetriNetUnfolderBase]: For 0/0 co-relation queries the response was YES. [2024-11-13 14:08:19,810 INFO L83 FinitePrefix]: Finished finitePrefix Result has 108 conditions, 98 events. 2/98 cut-off events. For 0/0 co-relation queries the response was YES. Maximal size of possible extension queue 20. Compared 432 event pairs, 0 based on Foata normal form. 0/36 useless extension candidates. Maximal degree in co-relation 100. Up to 2 conditions per place. [2024-11-13 14:08:19,811 INFO L82 GeneralOperation]: Start removeDead. Operand has 109 places, 101 transitions, 214 flow [2024-11-13 14:08:19,817 INFO L88 GeneralOperation]: Finished RemoveDead, result has has 106 places, 98 transitions, 205 flow [2024-11-13 14:08:19,826 INFO L332 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2024-11-13 14:08:19,839 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;@5666e1b0, mLbeIndependenceSettings=[IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=false, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2024-11-13 14:08:19,839 INFO L334 AbstractCegarLoop]: Starting to check reachability of 103 error locations. [2024-11-13 14:08:19,849 INFO L185 PetriNetUnfolderBase]: Found word, exiting Unfolder. [2024-11-13 14:08:19,851 INFO L124 PetriNetUnfolderBase]: 0/5 cut-off events. [2024-11-13 14:08:19,851 INFO L125 PetriNetUnfolderBase]: For 0/0 co-relation queries the response was YES. [2024-11-13 14:08:19,851 INFO L196 CegarLoopForPetriNet]: Found error trace [2024-11-13 14:08:19,854 INFO L204 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1] [2024-11-13 14:08:19,854 INFO L396 AbstractCegarLoop]: === Iteration 1 === Targeting P0Err0REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [P0Err0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, P0Err1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, P0Err6REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 100 more)] === [2024-11-13 14:08:19,859 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-13 14:08:19,860 INFO L85 PathProgramCache]: Analyzing trace with hash 31931048, now seen corresponding path program 1 times [2024-11-13 14:08:19,873 INFO L118 FreeRefinementEngine]: Executing refinement strategy FOX [2024-11-13 14:08:19,873 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleZ3 [789926945] [2024-11-13 14:08:19,873 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-13 14:08:19,874 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-11-13 14:08:19,874 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_d6c6bbac-8b87-4a12-bfcd-06c657a41f19/bin/uautomizer-verify-qhAvR1uOyd/z3 [2024-11-13 14:08:19,877 INFO L229 MonitoredProcess]: Starting monitored process 2 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_d6c6bbac-8b87-4a12-bfcd-06c657a41f19/bin/uautomizer-verify-qhAvR1uOyd/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2024-11-13 14:08:19,879 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_d6c6bbac-8b87-4a12-bfcd-06c657a41f19/bin/uautomizer-verify-qhAvR1uOyd/z3 -smt2 -in SMTLIB2_COMPLIANT=true (2)] Waiting until timeout for monitored process [2024-11-13 14:08:20,116 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-13 14:08:20,119 INFO L255 TraceCheckSpWp]: Trace formula consists of 76 conjuncts, 3 conjuncts are in the unsatisfiable core [2024-11-13 14:08:20,123 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-11-13 14:08:20,186 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-13 14:08:20,186 INFO L307 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2024-11-13 14:08:20,187 INFO L136 FreeRefinementEngine]: Strategy FOX found an infeasible trace [2024-11-13 14:08:20,187 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [789926945] [2024-11-13 14:08:20,188 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [789926945] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-13 14:08:20,188 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-13 14:08:20,188 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [1] imperfect sequences [] total 1 [2024-11-13 14:08:20,191 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2135468392] [2024-11-13 14:08:20,192 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-13 14:08:20,198 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2024-11-13 14:08:20,203 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy FOX [2024-11-13 14:08:20,229 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-11-13 14:08:20,230 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-11-13 14:08:20,236 INFO L467 CegarLoopForPetriNet]: Number of universal loopers: 17 out of 101 [2024-11-13 14:08:20,238 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 106 places, 98 transitions, 205 flow. Second operand has 3 states, 3 states have (on average 18.0) internal successors, (54), 3 states have internal predecessors, (54), 0 states have call successors, (0), 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-13 14:08:20,238 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-11-13 14:08:20,238 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 17 of 101 [2024-11-13 14:08:20,240 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-11-13 14:08:24,461 INFO L124 PetriNetUnfolderBase]: 8651/13524 cut-off events. [2024-11-13 14:08:24,462 INFO L125 PetriNetUnfolderBase]: For 16/16 co-relation queries the response was YES. [2024-11-13 14:08:24,497 INFO L83 FinitePrefix]: Finished finitePrefix Result has 25839 conditions, 13524 events. 8651/13524 cut-off events. For 16/16 co-relation queries the response was YES. Maximal size of possible extension queue 1028. Compared 105520 event pairs, 8651 based on Foata normal form. 504/8598 useless extension candidates. Maximal degree in co-relation 25828. Up to 12244 conditions per place. [2024-11-13 14:08:24,582 INFO L140 encePairwiseOnDemand]: 53/101 looper letters, 35 selfloop transitions, 1 changer transitions 0/50 dead transitions. [2024-11-13 14:08:24,582 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 62 places, 50 transitions, 181 flow [2024-11-13 14:08:24,584 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-11-13 14:08:24,586 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2024-11-13 14:08:24,596 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 134 transitions. [2024-11-13 14:08:24,598 INFO L512 CegarLoopForPetriNet]: DFA transition density 0.44224422442244227 [2024-11-13 14:08:24,600 INFO L175 Difference]: Start difference. First operand has 106 places, 98 transitions, 205 flow. Second operand 3 states and 134 transitions. [2024-11-13 14:08:24,601 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 62 places, 50 transitions, 181 flow [2024-11-13 14:08:24,608 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 59 places, 50 transitions, 178 flow, removed 0 selfloop flow, removed 3 redundant places. [2024-11-13 14:08:24,610 INFO L231 Difference]: Finished difference. Result has 59 places, 50 transitions, 108 flow [2024-11-13 14:08:24,613 INFO L260 CegarLoopForPetriNet]: {PETRI_ALPHABET=101, PETRI_DIFFERENCE_MINUEND_FLOW=106, PETRI_DIFFERENCE_MINUEND_PLACES=57, 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=108, PETRI_PLACES=59, PETRI_TRANSITIONS=50} [2024-11-13 14:08:24,617 INFO L277 CegarLoopForPetriNet]: 106 programPoint places, -47 predicate places. [2024-11-13 14:08:24,617 INFO L471 AbstractCegarLoop]: Abstraction has has 59 places, 50 transitions, 108 flow [2024-11-13 14:08:24,617 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 18.0) internal successors, (54), 3 states have internal predecessors, (54), 0 states have call successors, (0), 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-13 14:08:24,617 INFO L196 CegarLoopForPetriNet]: Found error trace [2024-11-13 14:08:24,618 INFO L204 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1] [2024-11-13 14:08:24,639 INFO L552 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_d6c6bbac-8b87-4a12-bfcd-06c657a41f19/bin/uautomizer-verify-qhAvR1uOyd/z3 -smt2 -in SMTLIB2_COMPLIANT=true (2)] Ended with exit code 0 [2024-11-13 14:08:24,818 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 2 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_d6c6bbac-8b87-4a12-bfcd-06c657a41f19/bin/uautomizer-verify-qhAvR1uOyd/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-11-13 14:08:24,819 INFO L396 AbstractCegarLoop]: === Iteration 2 === Targeting P0Err1REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [P0Err0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, P0Err1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, P0Err6REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 100 more)] === [2024-11-13 14:08:24,819 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-13 14:08:24,819 INFO L85 PathProgramCache]: Analyzing trace with hash 31931049, now seen corresponding path program 1 times [2024-11-13 14:08:24,820 INFO L118 FreeRefinementEngine]: Executing refinement strategy FOX [2024-11-13 14:08:24,821 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleZ3 [732860600] [2024-11-13 14:08:24,821 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-13 14:08:24,821 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-11-13 14:08:24,821 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_d6c6bbac-8b87-4a12-bfcd-06c657a41f19/bin/uautomizer-verify-qhAvR1uOyd/z3 [2024-11-13 14:08:24,824 INFO L229 MonitoredProcess]: Starting monitored process 3 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_d6c6bbac-8b87-4a12-bfcd-06c657a41f19/bin/uautomizer-verify-qhAvR1uOyd/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2024-11-13 14:08:24,826 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_d6c6bbac-8b87-4a12-bfcd-06c657a41f19/bin/uautomizer-verify-qhAvR1uOyd/z3 -smt2 -in SMTLIB2_COMPLIANT=true (3)] Waiting until timeout for monitored process [2024-11-13 14:08:25,066 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-13 14:08:25,068 INFO L255 TraceCheckSpWp]: Trace formula consists of 76 conjuncts, 4 conjuncts are in the unsatisfiable core [2024-11-13 14:08:25,069 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-11-13 14:08:25,129 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-13 14:08:25,130 INFO L307 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2024-11-13 14:08:25,131 INFO L136 FreeRefinementEngine]: Strategy FOX found an infeasible trace [2024-11-13 14:08:25,131 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [732860600] [2024-11-13 14:08:25,131 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [732860600] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-13 14:08:25,131 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-13 14:08:25,131 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [1] imperfect sequences [] total 1 [2024-11-13 14:08:25,131 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [495166043] [2024-11-13 14:08:25,131 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-13 14:08:25,132 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2024-11-13 14:08:25,133 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy FOX [2024-11-13 14:08:25,134 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-11-13 14:08:25,134 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-11-13 14:08:25,135 INFO L467 CegarLoopForPetriNet]: Number of universal loopers: 17 out of 101 [2024-11-13 14:08:25,135 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 59 places, 50 transitions, 108 flow. Second operand has 3 states, 3 states have (on average 18.0) internal successors, (54), 3 states have internal predecessors, (54), 0 states have call successors, (0), 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-13 14:08:25,135 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-11-13 14:08:25,135 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 17 of 101 [2024-11-13 14:08:25,135 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-11-13 14:08:26,065 INFO L124 PetriNetUnfolderBase]: 1442/2473 cut-off events. [2024-11-13 14:08:26,066 INFO L125 PetriNetUnfolderBase]: For 0/0 co-relation queries the response was YES. [2024-11-13 14:08:26,071 INFO L83 FinitePrefix]: Finished finitePrefix Result has 4642 conditions, 2473 events. 1442/2473 cut-off events. For 0/0 co-relation queries the response was YES. Maximal size of possible extension queue 184. Compared 16561 event pairs, 1442 based on Foata normal form. 0/2298 useless extension candidates. Maximal degree in co-relation 4636. Up to 2133 conditions per place. [2024-11-13 14:08:26,082 INFO L140 encePairwiseOnDemand]: 89/101 looper letters, 23 selfloop transitions, 1 changer transitions 1/39 dead transitions. [2024-11-13 14:08:26,082 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 50 places, 39 transitions, 136 flow [2024-11-13 14:08:26,083 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-11-13 14:08:26,083 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2024-11-13 14:08:26,085 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 87 transitions. [2024-11-13 14:08:26,085 INFO L512 CegarLoopForPetriNet]: DFA transition density 0.2871287128712871 [2024-11-13 14:08:26,085 INFO L175 Difference]: Start difference. First operand has 59 places, 50 transitions, 108 flow. Second operand 3 states and 87 transitions. [2024-11-13 14:08:26,085 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 50 places, 39 transitions, 136 flow [2024-11-13 14:08:26,086 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 49 places, 39 transitions, 135 flow, removed 0 selfloop flow, removed 1 redundant places. [2024-11-13 14:08:26,087 INFO L231 Difference]: Finished difference. Result has 49 places, 38 transitions, 85 flow [2024-11-13 14:08:26,088 INFO L260 CegarLoopForPetriNet]: {PETRI_ALPHABET=101, PETRI_DIFFERENCE_MINUEND_FLOW=85, PETRI_DIFFERENCE_MINUEND_PLACES=47, 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=85, PETRI_PLACES=49, PETRI_TRANSITIONS=38} [2024-11-13 14:08:26,088 INFO L277 CegarLoopForPetriNet]: 106 programPoint places, -57 predicate places. [2024-11-13 14:08:26,088 INFO L471 AbstractCegarLoop]: Abstraction has has 49 places, 38 transitions, 85 flow [2024-11-13 14:08:26,089 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 18.0) internal successors, (54), 3 states have internal predecessors, (54), 0 states have call successors, (0), 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-13 14:08:26,089 INFO L196 CegarLoopForPetriNet]: Found error trace [2024-11-13 14:08:26,089 INFO L204 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-13 14:08:26,111 INFO L552 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_d6c6bbac-8b87-4a12-bfcd-06c657a41f19/bin/uautomizer-verify-qhAvR1uOyd/z3 -smt2 -in SMTLIB2_COMPLIANT=true (3)] Ended with exit code 0 [2024-11-13 14:08:26,294 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 3 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_d6c6bbac-8b87-4a12-bfcd-06c657a41f19/bin/uautomizer-verify-qhAvR1uOyd/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-11-13 14:08:26,295 INFO L396 AbstractCegarLoop]: === Iteration 3 === Targeting ULTIMATE.startErr10REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [P0Err0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, P0Err1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, P0Err6REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 100 more)] === [2024-11-13 14:08:26,295 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-13 14:08:26,295 INFO L85 PathProgramCache]: Analyzing trace with hash 917004528, now seen corresponding path program 1 times [2024-11-13 14:08:26,296 INFO L118 FreeRefinementEngine]: Executing refinement strategy FOX [2024-11-13 14:08:26,296 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleZ3 [1269477987] [2024-11-13 14:08:26,296 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-13 14:08:26,296 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-11-13 14:08:26,296 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_d6c6bbac-8b87-4a12-bfcd-06c657a41f19/bin/uautomizer-verify-qhAvR1uOyd/z3 [2024-11-13 14:08:26,299 INFO L229 MonitoredProcess]: Starting monitored process 4 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_d6c6bbac-8b87-4a12-bfcd-06c657a41f19/bin/uautomizer-verify-qhAvR1uOyd/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2024-11-13 14:08:26,301 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_d6c6bbac-8b87-4a12-bfcd-06c657a41f19/bin/uautomizer-verify-qhAvR1uOyd/z3 -smt2 -in SMTLIB2_COMPLIANT=true (4)] Waiting until timeout for monitored process [2024-11-13 14:08:26,569 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-13 14:08:26,571 INFO L255 TraceCheckSpWp]: Trace formula consists of 125 conjuncts, 2 conjuncts are in the unsatisfiable core [2024-11-13 14:08:26,574 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-11-13 14:08:26,611 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-13 14:08:26,611 INFO L307 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2024-11-13 14:08:26,611 INFO L136 FreeRefinementEngine]: Strategy FOX found an infeasible trace [2024-11-13 14:08:26,612 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1269477987] [2024-11-13 14:08:26,612 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1269477987] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-13 14:08:26,612 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-13 14:08:26,612 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [1] imperfect sequences [] total 1 [2024-11-13 14:08:26,612 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [688196026] [2024-11-13 14:08:26,612 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-13 14:08:26,613 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2024-11-13 14:08:26,613 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy FOX [2024-11-13 14:08:26,613 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-11-13 14:08:26,613 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-11-13 14:08:26,614 INFO L467 CegarLoopForPetriNet]: Number of universal loopers: 17 out of 101 [2024-11-13 14:08:26,614 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 49 places, 38 transitions, 85 flow. Second operand has 3 states, 3 states have (on average 20.333333333333332) internal successors, (61), 3 states have internal predecessors, (61), 0 states have call successors, (0), 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-13 14:08:26,614 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-11-13 14:08:26,614 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 17 of 101 [2024-11-13 14:08:26,614 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-11-13 14:08:27,687 INFO L124 PetriNetUnfolderBase]: 1207/2127 cut-off events. [2024-11-13 14:08:27,687 INFO L125 PetriNetUnfolderBase]: For 0/0 co-relation queries the response was YES. [2024-11-13 14:08:27,695 INFO L83 FinitePrefix]: Finished finitePrefix Result has 3962 conditions, 2127 events. 1207/2127 cut-off events. For 0/0 co-relation queries the response was YES. Maximal size of possible extension queue 157. Compared 13646 event pairs, 461 based on Foata normal form. 0/1985 useless extension candidates. Maximal degree in co-relation 3955. Up to 1393 conditions per place. [2024-11-13 14:08:27,705 INFO L140 encePairwiseOnDemand]: 97/101 looper letters, 40 selfloop transitions, 2 changer transitions 0/56 dead transitions. [2024-11-13 14:08:27,705 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 50 places, 56 transitions, 209 flow [2024-11-13 14:08:27,706 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-11-13 14:08:27,706 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2024-11-13 14:08:27,707 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 95 transitions. [2024-11-13 14:08:27,708 INFO L512 CegarLoopForPetriNet]: DFA transition density 0.31353135313531355 [2024-11-13 14:08:27,708 INFO L175 Difference]: Start difference. First operand has 49 places, 38 transitions, 85 flow. Second operand 3 states and 95 transitions. [2024-11-13 14:08:27,708 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 50 places, 56 transitions, 209 flow [2024-11-13 14:08:27,709 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 49 places, 56 transitions, 208 flow, removed 0 selfloop flow, removed 1 redundant places. [2024-11-13 14:08:27,711 INFO L231 Difference]: Finished difference. Result has 50 places, 38 transitions, 94 flow [2024-11-13 14:08:27,711 INFO L260 CegarLoopForPetriNet]: {PETRI_ALPHABET=101, PETRI_DIFFERENCE_MINUEND_FLOW=84, PETRI_DIFFERENCE_MINUEND_PLACES=47, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=38, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=2, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=36, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=94, PETRI_PLACES=50, PETRI_TRANSITIONS=38} [2024-11-13 14:08:27,712 INFO L277 CegarLoopForPetriNet]: 106 programPoint places, -56 predicate places. [2024-11-13 14:08:27,712 INFO L471 AbstractCegarLoop]: Abstraction has has 50 places, 38 transitions, 94 flow [2024-11-13 14:08:27,713 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 20.333333333333332) internal successors, (61), 3 states have internal predecessors, (61), 0 states have call successors, (0), 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-13 14:08:27,713 INFO L196 CegarLoopForPetriNet]: Found error trace [2024-11-13 14:08:27,713 INFO L204 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-13 14:08:27,738 INFO L552 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_d6c6bbac-8b87-4a12-bfcd-06c657a41f19/bin/uautomizer-verify-qhAvR1uOyd/z3 -smt2 -in SMTLIB2_COMPLIANT=true (4)] Ended with exit code 0 [2024-11-13 14:08:27,913 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 4 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_d6c6bbac-8b87-4a12-bfcd-06c657a41f19/bin/uautomizer-verify-qhAvR1uOyd/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-11-13 14:08:27,914 INFO L396 AbstractCegarLoop]: === Iteration 4 === Targeting ULTIMATE.startErr10REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [P0Err0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, P0Err1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, P0Err6REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 100 more)] === [2024-11-13 14:08:27,914 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-13 14:08:27,914 INFO L85 PathProgramCache]: Analyzing trace with hash 773141631, now seen corresponding path program 1 times [2024-11-13 14:08:27,915 INFO L118 FreeRefinementEngine]: Executing refinement strategy FOX [2024-11-13 14:08:27,915 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleZ3 [1204556168] [2024-11-13 14:08:27,915 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-13 14:08:27,915 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-11-13 14:08:27,915 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_d6c6bbac-8b87-4a12-bfcd-06c657a41f19/bin/uautomizer-verify-qhAvR1uOyd/z3 [2024-11-13 14:08:27,918 INFO L229 MonitoredProcess]: Starting monitored process 5 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_d6c6bbac-8b87-4a12-bfcd-06c657a41f19/bin/uautomizer-verify-qhAvR1uOyd/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2024-11-13 14:08:27,920 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_d6c6bbac-8b87-4a12-bfcd-06c657a41f19/bin/uautomizer-verify-qhAvR1uOyd/z3 -smt2 -in SMTLIB2_COMPLIANT=true (5)] Waiting until timeout for monitored process [2024-11-13 14:08:28,188 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-13 14:08:28,191 INFO L255 TraceCheckSpWp]: Trace formula consists of 153 conjuncts, 4 conjuncts are in the unsatisfiable core [2024-11-13 14:08:28,193 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-11-13 14:08:28,371 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-13 14:08:28,371 INFO L307 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2024-11-13 14:08:28,371 INFO L136 FreeRefinementEngine]: Strategy FOX found an infeasible trace [2024-11-13 14:08:28,371 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1204556168] [2024-11-13 14:08:28,372 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1204556168] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-13 14:08:28,372 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-13 14:08:28,372 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2024-11-13 14:08:28,372 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1532879220] [2024-11-13 14:08:28,372 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-13 14:08:28,373 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2024-11-13 14:08:28,373 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy FOX [2024-11-13 14:08:28,373 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2024-11-13 14:08:28,373 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2024-11-13 14:08:28,388 INFO L467 CegarLoopForPetriNet]: Number of universal loopers: 17 out of 101 [2024-11-13 14:08:28,389 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 50 places, 38 transitions, 94 flow. Second operand has 4 states, 4 states have (on average 19.75) internal successors, (79), 4 states have internal predecessors, (79), 0 states have call successors, (0), 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-13 14:08:28,389 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-11-13 14:08:28,389 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 17 of 101 [2024-11-13 14:08:28,389 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-11-13 14:08:29,327 INFO L124 PetriNetUnfolderBase]: 1125/2005 cut-off events. [2024-11-13 14:08:29,328 INFO L125 PetriNetUnfolderBase]: For 205/205 co-relation queries the response was YES. [2024-11-13 14:08:29,333 INFO L83 FinitePrefix]: Finished finitePrefix Result has 4100 conditions, 2005 events. 1125/2005 cut-off events. For 205/205 co-relation queries the response was YES. Maximal size of possible extension queue 145. Compared 12786 event pairs, 411 based on Foata normal form. 0/1948 useless extension candidates. Maximal degree in co-relation 4091. Up to 1270 conditions per place. [2024-11-13 14:08:29,340 INFO L140 encePairwiseOnDemand]: 98/101 looper letters, 39 selfloop transitions, 2 changer transitions 0/55 dead transitions. [2024-11-13 14:08:29,340 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 52 places, 55 transitions, 212 flow [2024-11-13 14:08:29,341 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2024-11-13 14:08:29,341 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 4 states. [2024-11-13 14:08:29,342 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 110 transitions. [2024-11-13 14:08:29,343 INFO L512 CegarLoopForPetriNet]: DFA transition density 0.2722772277227723 [2024-11-13 14:08:29,343 INFO L175 Difference]: Start difference. First operand has 50 places, 38 transitions, 94 flow. Second operand 4 states and 110 transitions. [2024-11-13 14:08:29,343 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 52 places, 55 transitions, 212 flow [2024-11-13 14:08:29,344 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 50 places, 55 transitions, 208 flow, removed 0 selfloop flow, removed 2 redundant places. [2024-11-13 14:08:29,345 INFO L231 Difference]: Finished difference. Result has 50 places, 37 transitions, 90 flow [2024-11-13 14:08:29,345 INFO L260 CegarLoopForPetriNet]: {PETRI_ALPHABET=101, PETRI_DIFFERENCE_MINUEND_FLOW=86, PETRI_DIFFERENCE_MINUEND_PLACES=47, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=37, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=2, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=35, PETRI_DIFFERENCE_SUBTRAHEND_STATES=4, PETRI_FLOW=90, PETRI_PLACES=50, PETRI_TRANSITIONS=37} [2024-11-13 14:08:29,346 INFO L277 CegarLoopForPetriNet]: 106 programPoint places, -56 predicate places. [2024-11-13 14:08:29,346 INFO L471 AbstractCegarLoop]: Abstraction has has 50 places, 37 transitions, 90 flow [2024-11-13 14:08:29,346 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 19.75) internal successors, (79), 4 states have internal predecessors, (79), 0 states have call successors, (0), 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-13 14:08:29,346 INFO L196 CegarLoopForPetriNet]: Found error trace [2024-11-13 14:08:29,346 INFO L204 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-13 14:08:29,372 INFO L552 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_d6c6bbac-8b87-4a12-bfcd-06c657a41f19/bin/uautomizer-verify-qhAvR1uOyd/z3 -smt2 -in SMTLIB2_COMPLIANT=true (5)] Ended with exit code 0 [2024-11-13 14:08:29,547 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 5 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_d6c6bbac-8b87-4a12-bfcd-06c657a41f19/bin/uautomizer-verify-qhAvR1uOyd/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-11-13 14:08:29,547 INFO L396 AbstractCegarLoop]: === Iteration 5 === Targeting ULTIMATE.startErr11REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [P0Err0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, P0Err1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, P0Err6REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 100 more)] === [2024-11-13 14:08:29,549 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-13 14:08:29,550 INFO L85 PathProgramCache]: Analyzing trace with hash 773141632, now seen corresponding path program 1 times [2024-11-13 14:08:29,550 INFO L118 FreeRefinementEngine]: Executing refinement strategy FOX [2024-11-13 14:08:29,551 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleZ3 [819331454] [2024-11-13 14:08:29,551 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-13 14:08:29,551 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-11-13 14:08:29,551 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_d6c6bbac-8b87-4a12-bfcd-06c657a41f19/bin/uautomizer-verify-qhAvR1uOyd/z3 [2024-11-13 14:08:29,553 INFO L229 MonitoredProcess]: Starting monitored process 6 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_d6c6bbac-8b87-4a12-bfcd-06c657a41f19/bin/uautomizer-verify-qhAvR1uOyd/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2024-11-13 14:08:29,554 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_d6c6bbac-8b87-4a12-bfcd-06c657a41f19/bin/uautomizer-verify-qhAvR1uOyd/z3 -smt2 -in SMTLIB2_COMPLIANT=true (6)] Waiting until timeout for monitored process [2024-11-13 14:08:29,805 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-13 14:08:29,809 INFO L255 TraceCheckSpWp]: Trace formula consists of 153 conjuncts, 6 conjuncts are in the unsatisfiable core [2024-11-13 14:08:29,811 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-11-13 14:08:30,007 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-13 14:08:30,008 INFO L307 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2024-11-13 14:08:30,008 INFO L136 FreeRefinementEngine]: Strategy FOX found an infeasible trace [2024-11-13 14:08:30,008 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [819331454] [2024-11-13 14:08:30,008 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [819331454] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-13 14:08:30,008 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-13 14:08:30,009 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2024-11-13 14:08:30,009 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [483553927] [2024-11-13 14:08:30,009 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-13 14:08:30,009 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2024-11-13 14:08:30,010 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy FOX [2024-11-13 14:08:30,010 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2024-11-13 14:08:30,010 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2024-11-13 14:08:30,011 INFO L467 CegarLoopForPetriNet]: Number of universal loopers: 17 out of 101 [2024-11-13 14:08:30,011 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 50 places, 37 transitions, 90 flow. Second operand has 4 states, 4 states have (on average 19.75) internal successors, (79), 4 states have internal predecessors, (79), 0 states have call successors, (0), 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-13 14:08:30,011 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-11-13 14:08:30,011 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 17 of 101 [2024-11-13 14:08:30,012 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-11-13 14:08:30,742 INFO L124 PetriNetUnfolderBase]: 1043/1883 cut-off events. [2024-11-13 14:08:30,743 INFO L125 PetriNetUnfolderBase]: For 205/205 co-relation queries the response was YES. [2024-11-13 14:08:30,748 INFO L83 FinitePrefix]: Finished finitePrefix Result has 3816 conditions, 1883 events. 1043/1883 cut-off events. For 205/205 co-relation queries the response was YES. Maximal size of possible extension queue 133. Compared 11876 event pairs, 361 based on Foata normal form. 40/1871 useless extension candidates. Maximal degree in co-relation 3807. Up to 1148 conditions per place. [2024-11-13 14:08:30,756 INFO L140 encePairwiseOnDemand]: 98/101 looper letters, 38 selfloop transitions, 2 changer transitions 0/54 dead transitions. [2024-11-13 14:08:30,756 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 52 places, 54 transitions, 206 flow [2024-11-13 14:08:30,757 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2024-11-13 14:08:30,757 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 4 states. [2024-11-13 14:08:30,758 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 109 transitions. [2024-11-13 14:08:30,759 INFO L512 CegarLoopForPetriNet]: DFA transition density 0.2698019801980198 [2024-11-13 14:08:30,759 INFO L175 Difference]: Start difference. First operand has 50 places, 37 transitions, 90 flow. Second operand 4 states and 109 transitions. [2024-11-13 14:08:30,759 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 52 places, 54 transitions, 206 flow [2024-11-13 14:08:30,760 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 49 places, 54 transitions, 201 flow, removed 0 selfloop flow, removed 3 redundant places. [2024-11-13 14:08:30,761 INFO L231 Difference]: Finished difference. Result has 49 places, 36 transitions, 85 flow [2024-11-13 14:08:30,761 INFO L260 CegarLoopForPetriNet]: {PETRI_ALPHABET=101, PETRI_DIFFERENCE_MINUEND_FLOW=81, PETRI_DIFFERENCE_MINUEND_PLACES=46, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=36, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=2, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=34, PETRI_DIFFERENCE_SUBTRAHEND_STATES=4, PETRI_FLOW=85, PETRI_PLACES=49, PETRI_TRANSITIONS=36} [2024-11-13 14:08:30,762 INFO L277 CegarLoopForPetriNet]: 106 programPoint places, -57 predicate places. [2024-11-13 14:08:30,762 INFO L471 AbstractCegarLoop]: Abstraction has has 49 places, 36 transitions, 85 flow [2024-11-13 14:08:30,762 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 19.75) internal successors, (79), 4 states have internal predecessors, (79), 0 states have call successors, (0), 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-13 14:08:30,763 INFO L196 CegarLoopForPetriNet]: Found error trace [2024-11-13 14:08:30,764 INFO L204 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-13 14:08:30,789 INFO L552 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_d6c6bbac-8b87-4a12-bfcd-06c657a41f19/bin/uautomizer-verify-qhAvR1uOyd/z3 -smt2 -in SMTLIB2_COMPLIANT=true (6)] Ended with exit code 0 [2024-11-13 14:08:30,964 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 6 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_d6c6bbac-8b87-4a12-bfcd-06c657a41f19/bin/uautomizer-verify-qhAvR1uOyd/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-11-13 14:08:30,965 INFO L396 AbstractCegarLoop]: === Iteration 6 === Targeting ULTIMATE.startErr19ASSERT_VIOLATIONMEMORY_LEAK === [P0Err0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, P0Err1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, P0Err6REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 100 more)] === [2024-11-13 14:08:30,966 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-13 14:08:30,966 INFO L85 PathProgramCache]: Analyzing trace with hash -82256949, now seen corresponding path program 1 times [2024-11-13 14:08:30,967 INFO L118 FreeRefinementEngine]: Executing refinement strategy FOX [2024-11-13 14:08:30,967 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleZ3 [1975742286] [2024-11-13 14:08:30,968 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-13 14:08:30,968 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-11-13 14:08:30,968 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_d6c6bbac-8b87-4a12-bfcd-06c657a41f19/bin/uautomizer-verify-qhAvR1uOyd/z3 [2024-11-13 14:08:30,970 INFO L229 MonitoredProcess]: Starting monitored process 7 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_d6c6bbac-8b87-4a12-bfcd-06c657a41f19/bin/uautomizer-verify-qhAvR1uOyd/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2024-11-13 14:08:30,974 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_d6c6bbac-8b87-4a12-bfcd-06c657a41f19/bin/uautomizer-verify-qhAvR1uOyd/z3 -smt2 -in SMTLIB2_COMPLIANT=true (7)] Waiting until timeout for monitored process [2024-11-13 14:08:31,211 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-13 14:08:31,215 INFO L255 TraceCheckSpWp]: Trace formula consists of 132 conjuncts, 2 conjuncts are in the unsatisfiable core [2024-11-13 14:08:31,216 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-11-13 14:08:31,263 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-13 14:08:31,263 INFO L307 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2024-11-13 14:08:31,263 INFO L136 FreeRefinementEngine]: Strategy FOX found an infeasible trace [2024-11-13 14:08:31,263 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1975742286] [2024-11-13 14:08:31,264 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1975742286] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-13 14:08:31,264 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-13 14:08:31,264 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [1] imperfect sequences [] total 1 [2024-11-13 14:08:31,264 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2090612445] [2024-11-13 14:08:31,264 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-13 14:08:31,264 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2024-11-13 14:08:31,264 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy FOX [2024-11-13 14:08:31,265 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-11-13 14:08:31,265 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-11-13 14:08:31,265 INFO L467 CegarLoopForPetriNet]: Number of universal loopers: 16 out of 101 [2024-11-13 14:08:31,266 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 49 places, 36 transitions, 85 flow. Second operand has 3 states, 3 states have (on average 20.333333333333332) internal successors, (61), 3 states have internal predecessors, (61), 0 states have call successors, (0), 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-13 14:08:31,266 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-11-13 14:08:31,266 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 16 of 101 [2024-11-13 14:08:31,266 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-11-13 14:08:31,874 INFO L124 PetriNetUnfolderBase]: 1043/1834 cut-off events. [2024-11-13 14:08:31,875 INFO L125 PetriNetUnfolderBase]: For 170/170 co-relation queries the response was YES. [2024-11-13 14:08:31,880 INFO L83 FinitePrefix]: Finished finitePrefix Result has 3766 conditions, 1834 events. 1043/1834 cut-off events. For 170/170 co-relation queries the response was YES. Maximal size of possible extension queue 135. Compared 11853 event pairs, 1043 based on Foata normal form. 60/1863 useless extension candidates. Maximal degree in co-relation 3758. Up to 1554 conditions per place. [2024-11-13 14:08:31,886 INFO L140 encePairwiseOnDemand]: 99/101 looper letters, 20 selfloop transitions, 1 changer transitions 1/35 dead transitions. [2024-11-13 14:08:31,887 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 50 places, 35 transitions, 127 flow [2024-11-13 14:08:31,887 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-11-13 14:08:31,887 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2024-11-13 14:08:31,889 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 71 transitions. [2024-11-13 14:08:31,889 INFO L512 CegarLoopForPetriNet]: DFA transition density 0.23432343234323433 [2024-11-13 14:08:31,889 INFO L175 Difference]: Start difference. First operand has 49 places, 36 transitions, 85 flow. Second operand 3 states and 71 transitions. [2024-11-13 14:08:31,889 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 50 places, 35 transitions, 127 flow [2024-11-13 14:08:31,890 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 48 places, 35 transitions, 124 flow, removed 0 selfloop flow, removed 2 redundant places. [2024-11-13 14:08:31,890 INFO L231 Difference]: Finished difference. Result has 48 places, 34 transitions, 80 flow [2024-11-13 14:08:31,891 INFO L260 CegarLoopForPetriNet]: {PETRI_ALPHABET=101, PETRI_DIFFERENCE_MINUEND_FLOW=80, PETRI_DIFFERENCE_MINUEND_PLACES=46, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=35, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=1, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=34, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=80, PETRI_PLACES=48, PETRI_TRANSITIONS=34} [2024-11-13 14:08:31,893 INFO L277 CegarLoopForPetriNet]: 106 programPoint places, -58 predicate places. [2024-11-13 14:08:31,894 INFO L471 AbstractCegarLoop]: Abstraction has has 48 places, 34 transitions, 80 flow [2024-11-13 14:08:31,894 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 20.333333333333332) internal successors, (61), 3 states have internal predecessors, (61), 0 states have call successors, (0), 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-13 14:08:31,894 INFO L196 CegarLoopForPetriNet]: Found error trace [2024-11-13 14:08:31,894 INFO L204 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-13 14:08:31,919 INFO L552 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_d6c6bbac-8b87-4a12-bfcd-06c657a41f19/bin/uautomizer-verify-qhAvR1uOyd/z3 -smt2 -in SMTLIB2_COMPLIANT=true (7)] Ended with exit code 0 [2024-11-13 14:08:32,095 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 7 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_d6c6bbac-8b87-4a12-bfcd-06c657a41f19/bin/uautomizer-verify-qhAvR1uOyd/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-11-13 14:08:32,095 INFO L396 AbstractCegarLoop]: === Iteration 7 === Targeting ULTIMATE.startErr18ASSERT_VIOLATIONMEMORY_LEAK === [P0Err0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, P0Err1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, P0Err6REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 100 more)] === [2024-11-13 14:08:32,096 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-13 14:08:32,096 INFO L85 PathProgramCache]: Analyzing trace with hash -82255328, now seen corresponding path program 1 times [2024-11-13 14:08:32,096 INFO L118 FreeRefinementEngine]: Executing refinement strategy FOX [2024-11-13 14:08:32,097 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleZ3 [1943352707] [2024-11-13 14:08:32,097 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-13 14:08:32,097 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-11-13 14:08:32,097 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_d6c6bbac-8b87-4a12-bfcd-06c657a41f19/bin/uautomizer-verify-qhAvR1uOyd/z3 [2024-11-13 14:08:32,099 INFO L229 MonitoredProcess]: Starting monitored process 8 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_d6c6bbac-8b87-4a12-bfcd-06c657a41f19/bin/uautomizer-verify-qhAvR1uOyd/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2024-11-13 14:08:32,101 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_d6c6bbac-8b87-4a12-bfcd-06c657a41f19/bin/uautomizer-verify-qhAvR1uOyd/z3 -smt2 -in SMTLIB2_COMPLIANT=true (8)] Waiting until timeout for monitored process [2024-11-13 14:08:32,325 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-13 14:08:32,328 INFO L255 TraceCheckSpWp]: Trace formula consists of 132 conjuncts, 3 conjuncts are in the unsatisfiable core [2024-11-13 14:08:32,329 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-11-13 14:08:32,364 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-13 14:08:32,364 INFO L307 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2024-11-13 14:08:32,364 INFO L136 FreeRefinementEngine]: Strategy FOX found an infeasible trace [2024-11-13 14:08:32,364 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1943352707] [2024-11-13 14:08:32,364 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1943352707] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-13 14:08:32,365 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-13 14:08:32,365 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2024-11-13 14:08:32,365 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1991079239] [2024-11-13 14:08:32,365 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-13 14:08:32,365 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2024-11-13 14:08:32,366 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy FOX [2024-11-13 14:08:32,366 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2024-11-13 14:08:32,366 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2024-11-13 14:08:32,379 INFO L467 CegarLoopForPetriNet]: Number of universal loopers: 13 out of 101 [2024-11-13 14:08:32,379 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 48 places, 34 transitions, 80 flow. Second operand has 4 states, 4 states have (on average 16.25) internal successors, (65), 4 states have internal predecessors, (65), 0 states have call successors, (0), 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-13 14:08:32,379 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-11-13 14:08:32,379 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 13 of 101 [2024-11-13 14:08:32,379 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-11-13 14:08:33,179 INFO L124 PetriNetUnfolderBase]: 1995/3279 cut-off events. [2024-11-13 14:08:33,179 INFO L125 PetriNetUnfolderBase]: For 0/0 co-relation queries the response was YES. [2024-11-13 14:08:33,192 INFO L83 FinitePrefix]: Finished finitePrefix Result has 6735 conditions, 3279 events. 1995/3279 cut-off events. For 0/0 co-relation queries the response was YES. Maximal size of possible extension queue 188. Compared 19851 event pairs, 225 based on Foata normal form. 120/3390 useless extension candidates. Maximal degree in co-relation 6727. Up to 1861 conditions per place. [2024-11-13 14:08:33,204 INFO L140 encePairwiseOnDemand]: 95/101 looper letters, 46 selfloop transitions, 5 changer transitions 1/61 dead transitions. [2024-11-13 14:08:33,204 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 50 places, 61 transitions, 246 flow [2024-11-13 14:08:33,204 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2024-11-13 14:08:33,204 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 4 states. [2024-11-13 14:08:33,205 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 106 transitions. [2024-11-13 14:08:33,205 INFO L512 CegarLoopForPetriNet]: DFA transition density 0.2623762376237624 [2024-11-13 14:08:33,205 INFO L175 Difference]: Start difference. First operand has 48 places, 34 transitions, 80 flow. Second operand 4 states and 106 transitions. [2024-11-13 14:08:33,205 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 50 places, 61 transitions, 246 flow [2024-11-13 14:08:33,206 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 49 places, 61 transitions, 245 flow, removed 0 selfloop flow, removed 1 redundant places. [2024-11-13 14:08:33,207 INFO L231 Difference]: Finished difference. Result has 51 places, 37 transitions, 113 flow [2024-11-13 14:08:33,207 INFO L260 CegarLoopForPetriNet]: {PETRI_ALPHABET=101, PETRI_DIFFERENCE_MINUEND_FLOW=79, PETRI_DIFFERENCE_MINUEND_PLACES=46, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=34, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=2, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=29, PETRI_DIFFERENCE_SUBTRAHEND_STATES=4, PETRI_FLOW=113, PETRI_PLACES=51, PETRI_TRANSITIONS=37} [2024-11-13 14:08:33,208 INFO L277 CegarLoopForPetriNet]: 106 programPoint places, -55 predicate places. [2024-11-13 14:08:33,209 INFO L471 AbstractCegarLoop]: Abstraction has has 51 places, 37 transitions, 113 flow [2024-11-13 14:08:33,209 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 16.25) internal successors, (65), 4 states have internal predecessors, (65), 0 states have call successors, (0), 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-13 14:08:33,209 INFO L196 CegarLoopForPetriNet]: Found error trace [2024-11-13 14:08:33,209 INFO L204 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-13 14:08:33,234 INFO L552 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_d6c6bbac-8b87-4a12-bfcd-06c657a41f19/bin/uautomizer-verify-qhAvR1uOyd/z3 -smt2 -in SMTLIB2_COMPLIANT=true (8)] Ended with exit code 0 [2024-11-13 14:08:33,409 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 8 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_d6c6bbac-8b87-4a12-bfcd-06c657a41f19/bin/uautomizer-verify-qhAvR1uOyd/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-11-13 14:08:33,410 INFO L396 AbstractCegarLoop]: === Iteration 8 === Targeting ULTIMATE.startErr18ASSERT_VIOLATIONMEMORY_LEAK === [P0Err0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, P0Err1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, P0Err6REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 100 more)] === [2024-11-13 14:08:33,410 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-13 14:08:33,410 INFO L85 PathProgramCache]: Analyzing trace with hash -1111374794, now seen corresponding path program 1 times [2024-11-13 14:08:33,411 INFO L118 FreeRefinementEngine]: Executing refinement strategy FOX [2024-11-13 14:08:33,411 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleZ3 [224249304] [2024-11-13 14:08:33,411 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-13 14:08:33,411 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-11-13 14:08:33,411 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_d6c6bbac-8b87-4a12-bfcd-06c657a41f19/bin/uautomizer-verify-qhAvR1uOyd/z3 [2024-11-13 14:08:33,413 INFO L229 MonitoredProcess]: Starting monitored process 9 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_d6c6bbac-8b87-4a12-bfcd-06c657a41f19/bin/uautomizer-verify-qhAvR1uOyd/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2024-11-13 14:08:33,415 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_d6c6bbac-8b87-4a12-bfcd-06c657a41f19/bin/uautomizer-verify-qhAvR1uOyd/z3 -smt2 -in SMTLIB2_COMPLIANT=true (9)] Waiting until timeout for monitored process [2024-11-13 14:08:33,659 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-13 14:08:33,662 INFO L255 TraceCheckSpWp]: Trace formula consists of 163 conjuncts, 4 conjuncts are in the unsatisfiable core [2024-11-13 14:08:33,664 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-11-13 14:08:33,719 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-13 14:08:33,721 INFO L307 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2024-11-13 14:08:33,721 INFO L136 FreeRefinementEngine]: Strategy FOX found an infeasible trace [2024-11-13 14:08:33,721 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [224249304] [2024-11-13 14:08:33,721 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [224249304] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-13 14:08:33,721 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-13 14:08:33,722 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2024-11-13 14:08:33,722 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1723161997] [2024-11-13 14:08:33,722 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-13 14:08:33,722 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2024-11-13 14:08:33,722 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy FOX [2024-11-13 14:08:33,723 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2024-11-13 14:08:33,723 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2024-11-13 14:08:33,744 INFO L467 CegarLoopForPetriNet]: Number of universal loopers: 13 out of 101 [2024-11-13 14:08:33,745 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 51 places, 37 transitions, 113 flow. Second operand has 5 states, 5 states have (on average 16.0) internal successors, (80), 5 states have internal predecessors, (80), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-13 14:08:33,745 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-11-13 14:08:33,745 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 13 of 101 [2024-11-13 14:08:33,745 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-11-13 14:08:34,331 INFO L124 PetriNetUnfolderBase]: 1195/1987 cut-off events. [2024-11-13 14:08:34,331 INFO L125 PetriNetUnfolderBase]: For 456/456 co-relation queries the response was YES. [2024-11-13 14:08:34,336 INFO L83 FinitePrefix]: Finished finitePrefix Result has 4750 conditions, 1987 events. 1195/1987 cut-off events. For 456/456 co-relation queries the response was YES. Maximal size of possible extension queue 84. Compared 10451 event pairs, 123 based on Foata normal form. 96/2074 useless extension candidates. Maximal degree in co-relation 4739. Up to 769 conditions per place. [2024-11-13 14:08:34,342 INFO L140 encePairwiseOnDemand]: 95/101 looper letters, 58 selfloop transitions, 8 changer transitions 1/76 dead transitions. [2024-11-13 14:08:34,343 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 55 places, 76 transitions, 352 flow [2024-11-13 14:08:34,343 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2024-11-13 14:08:34,343 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 5 states. [2024-11-13 14:08:34,344 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 134 transitions. [2024-11-13 14:08:34,345 INFO L512 CegarLoopForPetriNet]: DFA transition density 0.26534653465346536 [2024-11-13 14:08:34,345 INFO L175 Difference]: Start difference. First operand has 51 places, 37 transitions, 113 flow. Second operand 5 states and 134 transitions. [2024-11-13 14:08:34,345 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 55 places, 76 transitions, 352 flow [2024-11-13 14:08:34,347 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 53 places, 76 transitions, 342 flow, removed 1 selfloop flow, removed 2 redundant places. [2024-11-13 14:08:34,348 INFO L231 Difference]: Finished difference. Result has 55 places, 40 transitions, 153 flow [2024-11-13 14:08:34,349 INFO L260 CegarLoopForPetriNet]: {PETRI_ALPHABET=101, PETRI_DIFFERENCE_MINUEND_FLOW=105, PETRI_DIFFERENCE_MINUEND_PLACES=49, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=37, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=5, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=29, PETRI_DIFFERENCE_SUBTRAHEND_STATES=5, PETRI_FLOW=153, PETRI_PLACES=55, PETRI_TRANSITIONS=40} [2024-11-13 14:08:34,350 INFO L277 CegarLoopForPetriNet]: 106 programPoint places, -51 predicate places. [2024-11-13 14:08:34,350 INFO L471 AbstractCegarLoop]: Abstraction has has 55 places, 40 transitions, 153 flow [2024-11-13 14:08:34,350 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 16.0) internal successors, (80), 5 states have internal predecessors, (80), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-13 14:08:34,350 INFO L196 CegarLoopForPetriNet]: Found error trace [2024-11-13 14:08:34,350 INFO L204 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-13 14:08:34,376 INFO L552 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_d6c6bbac-8b87-4a12-bfcd-06c657a41f19/bin/uautomizer-verify-qhAvR1uOyd/z3 -smt2 -in SMTLIB2_COMPLIANT=true (9)] Ended with exit code 0 [2024-11-13 14:08:34,551 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 9 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_d6c6bbac-8b87-4a12-bfcd-06c657a41f19/bin/uautomizer-verify-qhAvR1uOyd/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-11-13 14:08:34,551 INFO L396 AbstractCegarLoop]: === Iteration 9 === Targeting ULTIMATE.startErr18ASSERT_VIOLATIONMEMORY_LEAK === [P0Err0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, P0Err1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, P0Err6REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 100 more)] === [2024-11-13 14:08:34,552 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-13 14:08:34,552 INFO L85 PathProgramCache]: Analyzing trace with hash 203751326, now seen corresponding path program 1 times [2024-11-13 14:08:34,553 INFO L118 FreeRefinementEngine]: Executing refinement strategy FOX [2024-11-13 14:08:34,553 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleZ3 [2066680657] [2024-11-13 14:08:34,553 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-13 14:08:34,553 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-11-13 14:08:34,553 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_d6c6bbac-8b87-4a12-bfcd-06c657a41f19/bin/uautomizer-verify-qhAvR1uOyd/z3 [2024-11-13 14:08:34,556 INFO L229 MonitoredProcess]: Starting monitored process 10 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_d6c6bbac-8b87-4a12-bfcd-06c657a41f19/bin/uautomizer-verify-qhAvR1uOyd/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2024-11-13 14:08:34,558 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_d6c6bbac-8b87-4a12-bfcd-06c657a41f19/bin/uautomizer-verify-qhAvR1uOyd/z3 -smt2 -in SMTLIB2_COMPLIANT=true (10)] Waiting until timeout for monitored process [2024-11-13 14:08:34,826 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-13 14:08:34,830 INFO L255 TraceCheckSpWp]: Trace formula consists of 186 conjuncts, 5 conjuncts are in the unsatisfiable core [2024-11-13 14:08:34,831 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-11-13 14:08:34,917 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-13 14:08:34,917 INFO L307 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2024-11-13 14:08:34,918 INFO L136 FreeRefinementEngine]: Strategy FOX found an infeasible trace [2024-11-13 14:08:34,918 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [2066680657] [2024-11-13 14:08:34,918 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [2066680657] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-13 14:08:34,918 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-13 14:08:34,918 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2024-11-13 14:08:34,918 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1002269508] [2024-11-13 14:08:34,918 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-13 14:08:34,918 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2024-11-13 14:08:34,918 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy FOX [2024-11-13 14:08:34,919 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2024-11-13 14:08:34,919 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2024-11-13 14:08:34,942 INFO L467 CegarLoopForPetriNet]: Number of universal loopers: 13 out of 101 [2024-11-13 14:08:34,943 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 55 places, 40 transitions, 153 flow. Second operand has 6 states, 6 states have (on average 16.0) internal successors, (96), 6 states have internal predecessors, (96), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-13 14:08:34,943 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-11-13 14:08:34,943 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 13 of 101 [2024-11-13 14:08:34,943 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-11-13 14:08:35,527 INFO L124 PetriNetUnfolderBase]: 669/1085 cut-off events. [2024-11-13 14:08:35,527 INFO L125 PetriNetUnfolderBase]: For 832/832 co-relation queries the response was YES. [2024-11-13 14:08:35,530 INFO L83 FinitePrefix]: Finished finitePrefix Result has 2964 conditions, 1085 events. 669/1085 cut-off events. For 832/832 co-relation queries the response was YES. Maximal size of possible extension queue 53. Compared 4805 event pairs, 103 based on Foata normal form. 44/1120 useless extension candidates. Maximal degree in co-relation 2951. Up to 352 conditions per place. [2024-11-13 14:08:35,533 INFO L140 encePairwiseOnDemand]: 95/101 looper letters, 50 selfloop transitions, 11 changer transitions 1/71 dead transitions. [2024-11-13 14:08:35,533 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 60 places, 71 transitions, 353 flow [2024-11-13 14:08:35,534 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2024-11-13 14:08:35,534 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 6 states. [2024-11-13 14:08:35,535 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6 states to 6 states and 142 transitions. [2024-11-13 14:08:35,536 INFO L512 CegarLoopForPetriNet]: DFA transition density 0.23432343234323433 [2024-11-13 14:08:35,536 INFO L175 Difference]: Start difference. First operand has 55 places, 40 transitions, 153 flow. Second operand 6 states and 142 transitions. [2024-11-13 14:08:35,536 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 60 places, 71 transitions, 353 flow [2024-11-13 14:08:35,546 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 56 places, 71 transitions, 328 flow, removed 4 selfloop flow, removed 4 redundant places. [2024-11-13 14:08:35,548 INFO L231 Difference]: Finished difference. Result has 58 places, 40 transitions, 167 flow [2024-11-13 14:08:35,548 INFO L260 CegarLoopForPetriNet]: {PETRI_ALPHABET=101, PETRI_DIFFERENCE_MINUEND_FLOW=131, PETRI_DIFFERENCE_MINUEND_PLACES=51, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=40, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=11, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=29, PETRI_DIFFERENCE_SUBTRAHEND_STATES=6, PETRI_FLOW=167, PETRI_PLACES=58, PETRI_TRANSITIONS=40} [2024-11-13 14:08:35,549 INFO L277 CegarLoopForPetriNet]: 106 programPoint places, -48 predicate places. [2024-11-13 14:08:35,549 INFO L471 AbstractCegarLoop]: Abstraction has has 58 places, 40 transitions, 167 flow [2024-11-13 14:08:35,549 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 16.0) internal successors, (96), 6 states have internal predecessors, (96), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-13 14:08:35,549 INFO L196 CegarLoopForPetriNet]: Found error trace [2024-11-13 14:08:35,549 INFO L204 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-13 14:08:35,577 INFO L552 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_d6c6bbac-8b87-4a12-bfcd-06c657a41f19/bin/uautomizer-verify-qhAvR1uOyd/z3 -smt2 -in SMTLIB2_COMPLIANT=true (10)] Ended with exit code 0 [2024-11-13 14:08:35,750 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 10 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_d6c6bbac-8b87-4a12-bfcd-06c657a41f19/bin/uautomizer-verify-qhAvR1uOyd/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-11-13 14:08:35,750 INFO L396 AbstractCegarLoop]: === Iteration 10 === Targeting ULTIMATE.startErr18ASSERT_VIOLATIONMEMORY_LEAK === [P0Err0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, P0Err1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, P0Err6REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 100 more)] === [2024-11-13 14:08:35,751 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-13 14:08:35,751 INFO L85 PathProgramCache]: Analyzing trace with hash 1316939286, now seen corresponding path program 1 times [2024-11-13 14:08:35,752 INFO L118 FreeRefinementEngine]: Executing refinement strategy FOX [2024-11-13 14:08:35,752 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleZ3 [2007502987] [2024-11-13 14:08:35,752 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-13 14:08:35,752 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-11-13 14:08:35,752 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_d6c6bbac-8b87-4a12-bfcd-06c657a41f19/bin/uautomizer-verify-qhAvR1uOyd/z3 [2024-11-13 14:08:35,755 INFO L229 MonitoredProcess]: Starting monitored process 11 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_d6c6bbac-8b87-4a12-bfcd-06c657a41f19/bin/uautomizer-verify-qhAvR1uOyd/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2024-11-13 14:08:35,758 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_d6c6bbac-8b87-4a12-bfcd-06c657a41f19/bin/uautomizer-verify-qhAvR1uOyd/z3 -smt2 -in SMTLIB2_COMPLIANT=true (11)] Waiting until timeout for monitored process [2024-11-13 14:08:36,031 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-13 14:08:36,035 INFO L255 TraceCheckSpWp]: Trace formula consists of 229 conjuncts, 11 conjuncts are in the unsatisfiable core [2024-11-13 14:08:36,037 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-11-13 14:08:36,255 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-13 14:08:36,255 INFO L307 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2024-11-13 14:08:36,255 INFO L136 FreeRefinementEngine]: Strategy FOX found an infeasible trace [2024-11-13 14:08:36,255 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [2007502987] [2024-11-13 14:08:36,256 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [2007502987] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-13 14:08:36,256 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-13 14:08:36,256 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2024-11-13 14:08:36,256 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [855280992] [2024-11-13 14:08:36,256 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-13 14:08:36,256 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 9 states [2024-11-13 14:08:36,257 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy FOX [2024-11-13 14:08:36,257 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2024-11-13 14:08:36,257 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=19, Invalid=53, Unknown=0, NotChecked=0, Total=72 [2024-11-13 14:08:36,324 INFO L467 CegarLoopForPetriNet]: Number of universal loopers: 11 out of 101 [2024-11-13 14:08:36,324 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 58 places, 40 transitions, 167 flow. Second operand has 9 states, 9 states have (on average 13.666666666666666) internal successors, (123), 9 states have internal predecessors, (123), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-13 14:08:36,325 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-11-13 14:08:36,325 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 11 of 101 [2024-11-13 14:08:36,325 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-11-13 14:08:37,126 INFO L124 PetriNetUnfolderBase]: 1315/2116 cut-off events. [2024-11-13 14:08:37,126 INFO L125 PetriNetUnfolderBase]: For 1724/1724 co-relation queries the response was YES. [2024-11-13 14:08:37,130 INFO L83 FinitePrefix]: Finished finitePrefix Result has 5664 conditions, 2116 events. 1315/2116 cut-off events. For 1724/1724 co-relation queries the response was YES. Maximal size of possible extension queue 99. Compared 10283 event pairs, 219 based on Foata normal form. 8/2119 useless extension candidates. Maximal degree in co-relation 5650. Up to 1041 conditions per place. [2024-11-13 14:08:37,135 INFO L140 encePairwiseOnDemand]: 91/101 looper letters, 48 selfloop transitions, 7 changer transitions 43/105 dead transitions. [2024-11-13 14:08:37,135 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 66 places, 105 transitions, 591 flow [2024-11-13 14:08:37,136 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2024-11-13 14:08:37,136 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 9 states. [2024-11-13 14:08:37,137 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 9 states to 9 states and 192 transitions. [2024-11-13 14:08:37,137 INFO L512 CegarLoopForPetriNet]: DFA transition density 0.21122112211221122 [2024-11-13 14:08:37,137 INFO L175 Difference]: Start difference. First operand has 58 places, 40 transitions, 167 flow. Second operand 9 states and 192 transitions. [2024-11-13 14:08:37,137 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 66 places, 105 transitions, 591 flow [2024-11-13 14:08:37,151 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 58 places, 105 transitions, 474 flow, removed 20 selfloop flow, removed 8 redundant places. [2024-11-13 14:08:37,153 INFO L231 Difference]: Finished difference. Result has 64 places, 43 transitions, 155 flow [2024-11-13 14:08:37,153 INFO L260 CegarLoopForPetriNet]: {PETRI_ALPHABET=101, PETRI_DIFFERENCE_MINUEND_FLOW=111, PETRI_DIFFERENCE_MINUEND_PLACES=50, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=40, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=4, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=35, PETRI_DIFFERENCE_SUBTRAHEND_STATES=9, PETRI_FLOW=155, PETRI_PLACES=64, PETRI_TRANSITIONS=43} [2024-11-13 14:08:37,154 INFO L277 CegarLoopForPetriNet]: 106 programPoint places, -42 predicate places. [2024-11-13 14:08:37,154 INFO L471 AbstractCegarLoop]: Abstraction has has 64 places, 43 transitions, 155 flow [2024-11-13 14:08:37,154 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 9 states, 9 states have (on average 13.666666666666666) internal successors, (123), 9 states have internal predecessors, (123), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-13 14:08:37,154 INFO L196 CegarLoopForPetriNet]: Found error trace [2024-11-13 14:08:37,155 INFO L204 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-13 14:08:37,181 INFO L552 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_d6c6bbac-8b87-4a12-bfcd-06c657a41f19/bin/uautomizer-verify-qhAvR1uOyd/z3 -smt2 -in SMTLIB2_COMPLIANT=true (11)] Ended with exit code 0 [2024-11-13 14:08:37,358 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 11 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_d6c6bbac-8b87-4a12-bfcd-06c657a41f19/bin/uautomizer-verify-qhAvR1uOyd/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-11-13 14:08:37,360 INFO L396 AbstractCegarLoop]: === Iteration 11 === Targeting ULTIMATE.startErr18ASSERT_VIOLATIONMEMORY_LEAK === [P0Err0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, P0Err1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, P0Err6REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 100 more)] === [2024-11-13 14:08:37,361 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-13 14:08:37,361 INFO L85 PathProgramCache]: Analyzing trace with hash -998658368, now seen corresponding path program 2 times [2024-11-13 14:08:37,361 INFO L118 FreeRefinementEngine]: Executing refinement strategy FOX [2024-11-13 14:08:37,361 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleZ3 [183450394] [2024-11-13 14:08:37,362 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2024-11-13 14:08:37,362 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-11-13 14:08:37,362 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_d6c6bbac-8b87-4a12-bfcd-06c657a41f19/bin/uautomizer-verify-qhAvR1uOyd/z3 [2024-11-13 14:08:37,369 INFO L229 MonitoredProcess]: Starting monitored process 12 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_d6c6bbac-8b87-4a12-bfcd-06c657a41f19/bin/uautomizer-verify-qhAvR1uOyd/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2024-11-13 14:08:37,372 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_d6c6bbac-8b87-4a12-bfcd-06c657a41f19/bin/uautomizer-verify-qhAvR1uOyd/z3 -smt2 -in SMTLIB2_COMPLIANT=true (12)] Waiting until timeout for monitored process [2024-11-13 14:08:37,651 INFO L227 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 1 check-sat command(s) [2024-11-13 14:08:37,652 INFO L228 tOrderPrioritization]: Conjunction of SSA is unsat [2024-11-13 14:08:37,655 INFO L255 TraceCheckSpWp]: Trace formula consists of 229 conjuncts, 22 conjuncts are in the unsatisfiable core [2024-11-13 14:08:37,660 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-11-13 14:08:37,936 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 11 treesize of output 7 [2024-11-13 14:08:38,006 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 19 treesize of output 11 [2024-11-13 14:08:38,511 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 19 treesize of output 11 [2024-11-13 14:08:38,608 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-13 14:08:38,608 INFO L307 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2024-11-13 14:08:38,608 INFO L136 FreeRefinementEngine]: Strategy FOX found an infeasible trace [2024-11-13 14:08:38,608 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [183450394] [2024-11-13 14:08:38,608 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [183450394] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-13 14:08:38,609 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-13 14:08:38,609 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2024-11-13 14:08:38,609 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1750596424] [2024-11-13 14:08:38,609 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-13 14:08:38,609 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 8 states [2024-11-13 14:08:38,610 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy FOX [2024-11-13 14:08:38,610 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2024-11-13 14:08:38,610 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=15, Invalid=41, Unknown=0, NotChecked=0, Total=56 [2024-11-13 14:08:38,699 INFO L467 CegarLoopForPetriNet]: Number of universal loopers: 16 out of 101 [2024-11-13 14:08:38,699 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 64 places, 43 transitions, 155 flow. Second operand has 8 states, 8 states have (on average 18.375) internal successors, (147), 8 states have internal predecessors, (147), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-13 14:08:38,699 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-11-13 14:08:38,699 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 16 of 101 [2024-11-13 14:08:38,699 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-11-13 14:08:39,768 INFO L124 PetriNetUnfolderBase]: 701/1302 cut-off events. [2024-11-13 14:08:39,769 INFO L125 PetriNetUnfolderBase]: For 114/114 co-relation queries the response was YES. [2024-11-13 14:08:39,775 INFO L83 FinitePrefix]: Finished finitePrefix Result has 2932 conditions, 1302 events. 701/1302 cut-off events. For 114/114 co-relation queries the response was YES. Maximal size of possible extension queue 97. Compared 7355 event pairs, 242 based on Foata normal form. 8/1224 useless extension candidates. Maximal degree in co-relation 2916. Up to 645 conditions per place. [2024-11-13 14:08:39,779 INFO L140 encePairwiseOnDemand]: 91/101 looper letters, 27 selfloop transitions, 6 changer transitions 14/68 dead transitions. [2024-11-13 14:08:39,779 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 65 places, 68 transitions, 310 flow [2024-11-13 14:08:39,779 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2024-11-13 14:08:39,779 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 7 states. [2024-11-13 14:08:39,780 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 7 states to 7 states and 160 transitions. [2024-11-13 14:08:39,781 INFO L512 CegarLoopForPetriNet]: DFA transition density 0.2263083451202263 [2024-11-13 14:08:39,781 INFO L175 Difference]: Start difference. First operand has 64 places, 43 transitions, 155 flow. Second operand 7 states and 160 transitions. [2024-11-13 14:08:39,781 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 65 places, 68 transitions, 310 flow [2024-11-13 14:08:39,784 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 59 places, 68 transitions, 284 flow, removed 7 selfloop flow, removed 6 redundant places. [2024-11-13 14:08:39,786 INFO L231 Difference]: Finished difference. Result has 63 places, 47 transitions, 178 flow [2024-11-13 14:08:39,787 INFO L260 CegarLoopForPetriNet]: {PETRI_ALPHABET=101, PETRI_DIFFERENCE_MINUEND_FLOW=135, PETRI_DIFFERENCE_MINUEND_PLACES=53, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=43, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=2, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=37, PETRI_DIFFERENCE_SUBTRAHEND_STATES=7, PETRI_FLOW=178, PETRI_PLACES=63, PETRI_TRANSITIONS=47} [2024-11-13 14:08:39,789 INFO L277 CegarLoopForPetriNet]: 106 programPoint places, -43 predicate places. [2024-11-13 14:08:39,789 INFO L471 AbstractCegarLoop]: Abstraction has has 63 places, 47 transitions, 178 flow [2024-11-13 14:08:39,789 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 8 states, 8 states have (on average 18.375) internal successors, (147), 8 states have internal predecessors, (147), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-13 14:08:39,789 INFO L196 CegarLoopForPetriNet]: Found error trace [2024-11-13 14:08:39,790 INFO L204 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-13 14:08:39,816 INFO L552 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_d6c6bbac-8b87-4a12-bfcd-06c657a41f19/bin/uautomizer-verify-qhAvR1uOyd/z3 -smt2 -in SMTLIB2_COMPLIANT=true (12)] Ended with exit code 0 [2024-11-13 14:08:39,990 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 12 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_d6c6bbac-8b87-4a12-bfcd-06c657a41f19/bin/uautomizer-verify-qhAvR1uOyd/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-11-13 14:08:39,990 INFO L396 AbstractCegarLoop]: === Iteration 12 === Targeting ULTIMATE.startErr18ASSERT_VIOLATIONMEMORY_LEAK === [P0Err0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, P0Err1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, P0Err6REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 100 more)] === [2024-11-13 14:08:39,991 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-13 14:08:39,991 INFO L85 PathProgramCache]: Analyzing trace with hash -1173367574, now seen corresponding path program 3 times [2024-11-13 14:08:39,992 INFO L118 FreeRefinementEngine]: Executing refinement strategy FOX [2024-11-13 14:08:39,992 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleZ3 [1285509221] [2024-11-13 14:08:39,992 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST2 [2024-11-13 14:08:39,992 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-11-13 14:08:39,992 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_d6c6bbac-8b87-4a12-bfcd-06c657a41f19/bin/uautomizer-verify-qhAvR1uOyd/z3 [2024-11-13 14:08:39,995 INFO L229 MonitoredProcess]: Starting monitored process 13 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_d6c6bbac-8b87-4a12-bfcd-06c657a41f19/bin/uautomizer-verify-qhAvR1uOyd/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2024-11-13 14:08:39,998 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_d6c6bbac-8b87-4a12-bfcd-06c657a41f19/bin/uautomizer-verify-qhAvR1uOyd/z3 -smt2 -in SMTLIB2_COMPLIANT=true (13)] Waiting until timeout for monitored process [2024-11-13 14:08:40,307 INFO L227 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued 1 check-sat command(s) [2024-11-13 14:08:40,307 INFO L228 tOrderPrioritization]: Conjunction of SSA is unsat [2024-11-13 14:08:40,311 INFO L255 TraceCheckSpWp]: Trace formula consists of 229 conjuncts, 11 conjuncts are in the unsatisfiable core [2024-11-13 14:08:40,314 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-11-13 14:08:40,531 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-13 14:08:40,531 INFO L307 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2024-11-13 14:08:40,531 INFO L136 FreeRefinementEngine]: Strategy FOX found an infeasible trace [2024-11-13 14:08:40,531 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1285509221] [2024-11-13 14:08:40,531 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1285509221] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-13 14:08:40,531 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-13 14:08:40,531 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2024-11-13 14:08:40,531 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1472504757] [2024-11-13 14:08:40,531 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-13 14:08:40,532 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 9 states [2024-11-13 14:08:40,532 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy FOX [2024-11-13 14:08:40,532 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2024-11-13 14:08:40,533 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=18, Invalid=54, Unknown=0, NotChecked=0, Total=72 [2024-11-13 14:08:40,571 INFO L467 CegarLoopForPetriNet]: Number of universal loopers: 11 out of 101 [2024-11-13 14:08:40,572 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 63 places, 47 transitions, 178 flow. Second operand has 9 states, 9 states have (on average 13.666666666666666) internal successors, (123), 9 states have internal predecessors, (123), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-13 14:08:40,572 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-11-13 14:08:40,572 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 11 of 101 [2024-11-13 14:08:40,572 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-11-13 14:08:41,685 INFO L124 PetriNetUnfolderBase]: 1643/2724 cut-off events. [2024-11-13 14:08:41,686 INFO L125 PetriNetUnfolderBase]: For 1063/1063 co-relation queries the response was YES. [2024-11-13 14:08:41,692 INFO L83 FinitePrefix]: Finished finitePrefix Result has 7324 conditions, 2724 events. 1643/2724 cut-off events. For 1063/1063 co-relation queries the response was YES. Maximal size of possible extension queue 131. Compared 14277 event pairs, 253 based on Foata normal form. 8/2727 useless extension candidates. Maximal degree in co-relation 7308. Up to 1378 conditions per place. [2024-11-13 14:08:41,695 INFO L140 encePairwiseOnDemand]: 91/101 looper letters, 55 selfloop transitions, 7 changer transitions 47/116 dead transitions. [2024-11-13 14:08:41,695 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 68 places, 116 transitions, 636 flow [2024-11-13 14:08:41,695 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2024-11-13 14:08:41,695 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 9 states. [2024-11-13 14:08:41,696 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 9 states to 9 states and 192 transitions. [2024-11-13 14:08:41,697 INFO L512 CegarLoopForPetriNet]: DFA transition density 0.21122112211221122 [2024-11-13 14:08:41,697 INFO L175 Difference]: Start difference. First operand has 63 places, 47 transitions, 178 flow. Second operand 9 states and 192 transitions. [2024-11-13 14:08:41,697 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 68 places, 116 transitions, 636 flow [2024-11-13 14:08:41,700 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 63 places, 116 transitions, 610 flow, removed 5 selfloop flow, removed 5 redundant places. [2024-11-13 14:08:41,702 INFO L231 Difference]: Finished difference. Result has 68 places, 45 transitions, 182 flow [2024-11-13 14:08:41,702 INFO L260 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=7, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=40, PETRI_DIFFERENCE_SUBTRAHEND_STATES=9, PETRI_FLOW=182, PETRI_PLACES=68, PETRI_TRANSITIONS=45} [2024-11-13 14:08:41,703 INFO L277 CegarLoopForPetriNet]: 106 programPoint places, -38 predicate places. [2024-11-13 14:08:41,703 INFO L471 AbstractCegarLoop]: Abstraction has has 68 places, 45 transitions, 182 flow [2024-11-13 14:08:41,703 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 9 states, 9 states have (on average 13.666666666666666) internal successors, (123), 9 states have internal predecessors, (123), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-13 14:08:41,703 INFO L196 CegarLoopForPetriNet]: Found error trace [2024-11-13 14:08:41,704 INFO L204 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-13 14:08:41,729 INFO L540 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_d6c6bbac-8b87-4a12-bfcd-06c657a41f19/bin/uautomizer-verify-qhAvR1uOyd/z3 -smt2 -in SMTLIB2_COMPLIANT=true (13)] Forceful destruction successful, exit code 0 [2024-11-13 14:08:41,907 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 13 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_d6c6bbac-8b87-4a12-bfcd-06c657a41f19/bin/uautomizer-verify-qhAvR1uOyd/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-11-13 14:08:41,907 INFO L396 AbstractCegarLoop]: === Iteration 13 === Targeting ULTIMATE.startErr18ASSERT_VIOLATIONMEMORY_LEAK === [P0Err0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, P0Err1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, P0Err6REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 100 more)] === [2024-11-13 14:08:41,908 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-13 14:08:41,908 INFO L85 PathProgramCache]: Analyzing trace with hash 1467087492, now seen corresponding path program 4 times [2024-11-13 14:08:41,908 INFO L118 FreeRefinementEngine]: Executing refinement strategy FOX [2024-11-13 14:08:41,908 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleZ3 [2006974] [2024-11-13 14:08:41,908 INFO L93 rtionOrderModulation]: Changing assertion order to TERMS_WITH_SMALL_CONSTANTS_FIRST [2024-11-13 14:08:41,908 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-11-13 14:08:41,909 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_d6c6bbac-8b87-4a12-bfcd-06c657a41f19/bin/uautomizer-verify-qhAvR1uOyd/z3 [2024-11-13 14:08:41,910 INFO L229 MonitoredProcess]: Starting monitored process 14 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_d6c6bbac-8b87-4a12-bfcd-06c657a41f19/bin/uautomizer-verify-qhAvR1uOyd/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2024-11-13 14:08:41,912 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_d6c6bbac-8b87-4a12-bfcd-06c657a41f19/bin/uautomizer-verify-qhAvR1uOyd/z3 -smt2 -in SMTLIB2_COMPLIANT=true (14)] Waiting until timeout for monitored process [2024-11-13 14:08:42,315 INFO L227 tOrderPrioritization]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 0 check-sat command(s) [2024-11-13 14:08:42,315 INFO L228 tOrderPrioritization]: Conjunction of SSA is unsat [2024-11-13 14:08:42,319 INFO L255 TraceCheckSpWp]: Trace formula consists of 229 conjuncts, 31 conjuncts are in the unsatisfiable core [2024-11-13 14:08:42,325 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-11-13 14:08:42,746 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 11 treesize of output 7 [2024-11-13 14:08:42,830 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 19 treesize of output 11 [2024-11-13 14:08:42,957 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 19 treesize of output 11 [2024-11-13 14:08:43,327 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 19 treesize of output 11 [2024-11-13 14:08:43,539 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-13 14:08:43,539 INFO L307 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2024-11-13 14:08:43,539 INFO L136 FreeRefinementEngine]: Strategy FOX found an infeasible trace [2024-11-13 14:08:43,539 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [2006974] [2024-11-13 14:08:43,539 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [2006974] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-13 14:08:43,539 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-13 14:08:43,539 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [9] imperfect sequences [] total 9 [2024-11-13 14:08:43,539 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [666930238] [2024-11-13 14:08:43,539 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-13 14:08:43,540 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 10 states [2024-11-13 14:08:43,540 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy FOX [2024-11-13 14:08:43,540 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2024-11-13 14:08:43,540 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=21, Invalid=69, Unknown=0, NotChecked=0, Total=90 [2024-11-13 14:08:43,628 INFO L467 CegarLoopForPetriNet]: Number of universal loopers: 16 out of 101 [2024-11-13 14:08:43,628 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 68 places, 45 transitions, 182 flow. Second operand has 10 states, 10 states have (on average 17.9) internal successors, (179), 10 states have internal predecessors, (179), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-13 14:08:43,629 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-11-13 14:08:43,629 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 16 of 101 [2024-11-13 14:08:43,629 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-11-13 14:08:44,872 INFO L124 PetriNetUnfolderBase]: 754/1454 cut-off events. [2024-11-13 14:08:44,872 INFO L125 PetriNetUnfolderBase]: For 437/449 co-relation queries the response was YES. [2024-11-13 14:08:44,875 INFO L83 FinitePrefix]: Finished finitePrefix Result has 3496 conditions, 1454 events. 754/1454 cut-off events. For 437/449 co-relation queries the response was YES. Maximal size of possible extension queue 122. Compared 8694 event pairs, 229 based on Foata normal form. 11/1395 useless extension candidates. Maximal degree in co-relation 3478. Up to 532 conditions per place. [2024-11-13 14:08:44,877 INFO L140 encePairwiseOnDemand]: 90/101 looper letters, 33 selfloop transitions, 7 changer transitions 17/77 dead transitions. [2024-11-13 14:08:44,877 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 71 places, 77 transitions, 385 flow [2024-11-13 14:08:44,879 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2024-11-13 14:08:44,879 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 8 states. [2024-11-13 14:08:44,880 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 8 states to 8 states and 185 transitions. [2024-11-13 14:08:44,881 INFO L512 CegarLoopForPetriNet]: DFA transition density 0.22896039603960397 [2024-11-13 14:08:44,881 INFO L175 Difference]: Start difference. First operand has 68 places, 45 transitions, 182 flow. Second operand 8 states and 185 transitions. [2024-11-13 14:08:44,881 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 71 places, 77 transitions, 385 flow [2024-11-13 14:08:44,883 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 64 places, 77 transitions, 359 flow, removed 8 selfloop flow, removed 7 redundant places. [2024-11-13 14:08:44,884 INFO L231 Difference]: Finished difference. Result has 69 places, 48 transitions, 210 flow [2024-11-13 14:08:44,884 INFO L260 CegarLoopForPetriNet]: {PETRI_ALPHABET=101, PETRI_DIFFERENCE_MINUEND_FLOW=162, PETRI_DIFFERENCE_MINUEND_PLACES=57, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=45, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=3, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=39, PETRI_DIFFERENCE_SUBTRAHEND_STATES=8, PETRI_FLOW=210, PETRI_PLACES=69, PETRI_TRANSITIONS=48} [2024-11-13 14:08:44,885 INFO L277 CegarLoopForPetriNet]: 106 programPoint places, -37 predicate places. [2024-11-13 14:08:44,885 INFO L471 AbstractCegarLoop]: Abstraction has has 69 places, 48 transitions, 210 flow [2024-11-13 14:08:44,885 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 10 states, 10 states have (on average 17.9) internal successors, (179), 10 states have internal predecessors, (179), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-13 14:08:44,885 INFO L196 CegarLoopForPetriNet]: Found error trace [2024-11-13 14:08:44,885 INFO L204 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-13 14:08:44,903 INFO L552 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_d6c6bbac-8b87-4a12-bfcd-06c657a41f19/bin/uautomizer-verify-qhAvR1uOyd/z3 -smt2 -in SMTLIB2_COMPLIANT=true (14)] Ended with exit code 0 [2024-11-13 14:08:45,086 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 14 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_d6c6bbac-8b87-4a12-bfcd-06c657a41f19/bin/uautomizer-verify-qhAvR1uOyd/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-11-13 14:08:45,086 INFO L396 AbstractCegarLoop]: === Iteration 14 === Targeting ULTIMATE.startErr18ASSERT_VIOLATIONMEMORY_LEAK === [P0Err0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, P0Err1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, P0Err6REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 100 more)] === [2024-11-13 14:08:45,086 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-13 14:08:45,087 INFO L85 PathProgramCache]: Analyzing trace with hash 445104670, now seen corresponding path program 5 times [2024-11-13 14:08:45,087 INFO L118 FreeRefinementEngine]: Executing refinement strategy FOX [2024-11-13 14:08:45,087 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleZ3 [196750847] [2024-11-13 14:08:45,087 INFO L93 rtionOrderModulation]: Changing assertion order to INSIDE_LOOP_FIRST1 [2024-11-13 14:08:45,087 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-11-13 14:08:45,088 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_d6c6bbac-8b87-4a12-bfcd-06c657a41f19/bin/uautomizer-verify-qhAvR1uOyd/z3 [2024-11-13 14:08:45,090 INFO L229 MonitoredProcess]: Starting monitored process 15 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_d6c6bbac-8b87-4a12-bfcd-06c657a41f19/bin/uautomizer-verify-qhAvR1uOyd/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2024-11-13 14:08:45,092 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_d6c6bbac-8b87-4a12-bfcd-06c657a41f19/bin/uautomizer-verify-qhAvR1uOyd/z3 -smt2 -in SMTLIB2_COMPLIANT=true (15)] Waiting until timeout for monitored process [2024-11-13 14:08:45,374 INFO L227 tOrderPrioritization]: Assert order INSIDE_LOOP_FIRST1 issued 1 check-sat command(s) [2024-11-13 14:08:45,374 INFO L228 tOrderPrioritization]: Conjunction of SSA is unsat [2024-11-13 14:08:45,378 INFO L255 TraceCheckSpWp]: Trace formula consists of 229 conjuncts, 28 conjuncts are in the unsatisfiable core [2024-11-13 14:08:45,384 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-11-13 14:08:45,562 INFO L173 IndexEqualityManager]: detected equality via solver [2024-11-13 14:08:45,563 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 19 treesize of output 3 [2024-11-13 14:08:46,189 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 7 treesize of output 3 [2024-11-13 14:08:46,284 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 11 treesize of output 7 [2024-11-13 14:08:46,566 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-13 14:08:46,567 INFO L307 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2024-11-13 14:08:46,567 INFO L136 FreeRefinementEngine]: Strategy FOX found an infeasible trace [2024-11-13 14:08:46,567 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [196750847] [2024-11-13 14:08:46,567 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [196750847] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-13 14:08:46,567 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-13 14:08:46,567 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [10] imperfect sequences [] total 10 [2024-11-13 14:08:46,567 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [891941704] [2024-11-13 14:08:46,567 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-13 14:08:46,568 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 11 states [2024-11-13 14:08:46,568 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy FOX [2024-11-13 14:08:46,568 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 11 interpolants. [2024-11-13 14:08:46,568 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=26, Invalid=84, Unknown=0, NotChecked=0, Total=110 [2024-11-13 14:08:46,672 INFO L467 CegarLoopForPetriNet]: Number of universal loopers: 13 out of 101 [2024-11-13 14:08:46,672 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 69 places, 48 transitions, 210 flow. Second operand has 11 states, 11 states have (on average 15.0) internal successors, (165), 11 states have internal predecessors, (165), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-13 14:08:46,672 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-11-13 14:08:46,672 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 13 of 101 [2024-11-13 14:08:46,672 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-11-13 14:08:47,781 INFO L124 PetriNetUnfolderBase]: 1407/2394 cut-off events. [2024-11-13 14:08:47,781 INFO L125 PetriNetUnfolderBase]: For 1683/1702 co-relation queries the response was YES. [2024-11-13 14:08:47,791 INFO L83 FinitePrefix]: Finished finitePrefix Result has 7010 conditions, 2394 events. 1407/2394 cut-off events. For 1683/1702 co-relation queries the response was YES. Maximal size of possible extension queue 148. Compared 12890 event pairs, 243 based on Foata normal form. 9/2382 useless extension candidates. Maximal degree in co-relation 6991. Up to 1142 conditions per place. [2024-11-13 14:08:47,796 INFO L140 encePairwiseOnDemand]: 91/101 looper letters, 49 selfloop transitions, 11 changer transitions 37/107 dead transitions. [2024-11-13 14:08:47,796 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 73 places, 107 transitions, 676 flow [2024-11-13 14:08:47,796 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2024-11-13 14:08:47,797 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 8 states. [2024-11-13 14:08:47,798 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 8 states to 8 states and 180 transitions. [2024-11-13 14:08:47,798 INFO L512 CegarLoopForPetriNet]: DFA transition density 0.22277227722772278 [2024-11-13 14:08:47,798 INFO L175 Difference]: Start difference. First operand has 69 places, 48 transitions, 210 flow. Second operand 8 states and 180 transitions. [2024-11-13 14:08:47,798 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 73 places, 107 transitions, 676 flow [2024-11-13 14:08:47,803 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 68 places, 107 transitions, 653 flow, removed 5 selfloop flow, removed 5 redundant places. [2024-11-13 14:08:47,805 INFO L231 Difference]: Finished difference. Result has 74 places, 54 transitions, 303 flow [2024-11-13 14:08:47,805 INFO L260 CegarLoopForPetriNet]: {PETRI_ALPHABET=101, PETRI_DIFFERENCE_MINUEND_FLOW=198, PETRI_DIFFERENCE_MINUEND_PLACES=61, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=48, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=6, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=40, PETRI_DIFFERENCE_SUBTRAHEND_STATES=8, PETRI_FLOW=303, PETRI_PLACES=74, PETRI_TRANSITIONS=54} [2024-11-13 14:08:47,806 INFO L277 CegarLoopForPetriNet]: 106 programPoint places, -32 predicate places. [2024-11-13 14:08:47,806 INFO L471 AbstractCegarLoop]: Abstraction has has 74 places, 54 transitions, 303 flow [2024-11-13 14:08:47,806 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 11 states, 11 states have (on average 15.0) internal successors, (165), 11 states have internal predecessors, (165), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-13 14:08:47,806 INFO L196 CegarLoopForPetriNet]: Found error trace [2024-11-13 14:08:47,806 INFO L204 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-13 14:08:47,833 INFO L552 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_d6c6bbac-8b87-4a12-bfcd-06c657a41f19/bin/uautomizer-verify-qhAvR1uOyd/z3 -smt2 -in SMTLIB2_COMPLIANT=true (15)] Ended with exit code 0 [2024-11-13 14:08:48,007 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 15 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_d6c6bbac-8b87-4a12-bfcd-06c657a41f19/bin/uautomizer-verify-qhAvR1uOyd/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-11-13 14:08:48,007 INFO L396 AbstractCegarLoop]: === Iteration 15 === Targeting ULTIMATE.startErr18ASSERT_VIOLATIONMEMORY_LEAK === [P0Err0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, P0Err1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, P0Err6REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 100 more)] === [2024-11-13 14:08:48,008 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-13 14:08:48,008 INFO L85 PathProgramCache]: Analyzing trace with hash -1613375586, now seen corresponding path program 6 times [2024-11-13 14:08:48,008 INFO L118 FreeRefinementEngine]: Executing refinement strategy FOX [2024-11-13 14:08:48,008 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleZ3 [2097761210] [2024-11-13 14:08:48,008 INFO L93 rtionOrderModulation]: Changing assertion order to MIX_INSIDE_OUTSIDE [2024-11-13 14:08:48,008 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-11-13 14:08:48,008 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_d6c6bbac-8b87-4a12-bfcd-06c657a41f19/bin/uautomizer-verify-qhAvR1uOyd/z3 [2024-11-13 14:08:48,010 INFO L229 MonitoredProcess]: Starting monitored process 16 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_d6c6bbac-8b87-4a12-bfcd-06c657a41f19/bin/uautomizer-verify-qhAvR1uOyd/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2024-11-13 14:08:48,012 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_d6c6bbac-8b87-4a12-bfcd-06c657a41f19/bin/uautomizer-verify-qhAvR1uOyd/z3 -smt2 -in SMTLIB2_COMPLIANT=true (16)] Waiting until timeout for monitored process [2024-11-13 14:08:48,353 INFO L227 tOrderPrioritization]: Assert order MIX_INSIDE_OUTSIDE issued 1 check-sat command(s) [2024-11-13 14:08:48,353 INFO L228 tOrderPrioritization]: Conjunction of SSA is sat [2024-11-13 14:08:48,353 INFO L356 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2024-11-13 14:08:48,466 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-11-13 14:08:48,610 INFO L130 FreeRefinementEngine]: Strategy FOX found a feasible trace [2024-11-13 14:08:48,610 INFO L325 BasicCegarLoop]: Counterexample is feasible [2024-11-13 14:08:48,612 INFO L782 garLoopResultBuilder]: Registering result UNSAFE for location ULTIMATE.startErr18ASSERT_VIOLATIONMEMORY_LEAK (102 of 103 remaining) [2024-11-13 14:08:48,614 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location P0Err0REQUIRES_VIOLATIONMEMORY_DEREFERENCE (101 of 103 remaining) [2024-11-13 14:08:48,614 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location P0Err1REQUIRES_VIOLATIONMEMORY_DEREFERENCE (100 of 103 remaining) [2024-11-13 14:08:48,614 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location P0Err6REQUIRES_VIOLATIONMEMORY_DEREFERENCE (99 of 103 remaining) [2024-11-13 14:08:48,614 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location P0Err7REQUIRES_VIOLATIONMEMORY_DEREFERENCE (98 of 103 remaining) [2024-11-13 14:08:48,614 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location P0Err4REQUIRES_VIOLATIONMEMORY_DEREFERENCE (97 of 103 remaining) [2024-11-13 14:08:48,614 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location P0Err5REQUIRES_VIOLATIONMEMORY_DEREFERENCE (96 of 103 remaining) [2024-11-13 14:08:48,614 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location P0Err2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (95 of 103 remaining) [2024-11-13 14:08:48,614 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location P0Err3REQUIRES_VIOLATIONMEMORY_DEREFERENCE (94 of 103 remaining) [2024-11-13 14:08:48,615 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location P0Err8REQUIRES_VIOLATIONMEMORY_DEREFERENCE (93 of 103 remaining) [2024-11-13 14:08:48,615 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location P0Err9REQUIRES_VIOLATIONMEMORY_DEREFERENCE (92 of 103 remaining) [2024-11-13 14:08:48,615 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location P0Err10REQUIRES_VIOLATIONMEMORY_DEREFERENCE (91 of 103 remaining) [2024-11-13 14:08:48,615 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location P0Err11REQUIRES_VIOLATIONMEMORY_DEREFERENCE (90 of 103 remaining) [2024-11-13 14:08:48,615 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location P0Err12REQUIRES_VIOLATIONMEMORY_DEREFERENCE (89 of 103 remaining) [2024-11-13 14:08:48,616 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location P0Err13REQUIRES_VIOLATIONMEMORY_DEREFERENCE (88 of 103 remaining) [2024-11-13 14:08:48,616 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location P0Err14REQUIRES_VIOLATIONMEMORY_DEREFERENCE (87 of 103 remaining) [2024-11-13 14:08:48,616 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location P0Err15REQUIRES_VIOLATIONMEMORY_DEREFERENCE (86 of 103 remaining) [2024-11-13 14:08:48,616 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location P1Err0REQUIRES_VIOLATIONMEMORY_DEREFERENCE (85 of 103 remaining) [2024-11-13 14:08:48,617 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location P1Err1REQUIRES_VIOLATIONMEMORY_DEREFERENCE (84 of 103 remaining) [2024-11-13 14:08:48,617 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location P1Err2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (83 of 103 remaining) [2024-11-13 14:08:48,617 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location P1Err3REQUIRES_VIOLATIONMEMORY_DEREFERENCE (82 of 103 remaining) [2024-11-13 14:08:48,617 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location P1Err4REQUIRES_VIOLATIONMEMORY_DEREFERENCE (81 of 103 remaining) [2024-11-13 14:08:48,617 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location P1Err5REQUIRES_VIOLATIONMEMORY_DEREFERENCE (80 of 103 remaining) [2024-11-13 14:08:48,617 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location P2Err0REQUIRES_VIOLATIONMEMORY_DEREFERENCE (79 of 103 remaining) [2024-11-13 14:08:48,618 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location P2Err1REQUIRES_VIOLATIONMEMORY_DEREFERENCE (78 of 103 remaining) [2024-11-13 14:08:48,618 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location P2Err2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (77 of 103 remaining) [2024-11-13 14:08:48,619 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location P2Err3REQUIRES_VIOLATIONMEMORY_DEREFERENCE (76 of 103 remaining) [2024-11-13 14:08:48,619 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location P2Err4REQUIRES_VIOLATIONMEMORY_DEREFERENCE (75 of 103 remaining) [2024-11-13 14:08:48,619 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location P2Err5REQUIRES_VIOLATIONMEMORY_DEREFERENCE (74 of 103 remaining) [2024-11-13 14:08:48,619 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location P2Err6REQUIRES_VIOLATIONMEMORY_DEREFERENCE (73 of 103 remaining) [2024-11-13 14:08:48,619 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location P2Err7REQUIRES_VIOLATIONMEMORY_DEREFERENCE (72 of 103 remaining) [2024-11-13 14:08:48,620 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location P2Err8REQUIRES_VIOLATIONMEMORY_DEREFERENCE (71 of 103 remaining) [2024-11-13 14:08:48,621 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location P2Err9REQUIRES_VIOLATIONMEMORY_DEREFERENCE (70 of 103 remaining) [2024-11-13 14:08:48,621 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location P2Err10REQUIRES_VIOLATIONMEMORY_DEREFERENCE (69 of 103 remaining) [2024-11-13 14:08:48,621 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location P2Err11REQUIRES_VIOLATIONMEMORY_DEREFERENCE (68 of 103 remaining) [2024-11-13 14:08:48,621 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location P2Err12REQUIRES_VIOLATIONMEMORY_DEREFERENCE (67 of 103 remaining) [2024-11-13 14:08:48,621 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location P2Err13REQUIRES_VIOLATIONMEMORY_DEREFERENCE (66 of 103 remaining) [2024-11-13 14:08:48,621 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location P2Err14REQUIRES_VIOLATIONMEMORY_DEREFERENCE (65 of 103 remaining) [2024-11-13 14:08:48,622 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location P2Err15REQUIRES_VIOLATIONMEMORY_DEREFERENCE (64 of 103 remaining) [2024-11-13 14:08:48,622 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location P2Err16REQUIRES_VIOLATIONMEMORY_DEREFERENCE (63 of 103 remaining) [2024-11-13 14:08:48,622 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location P2Err17REQUIRES_VIOLATIONMEMORY_DEREFERENCE (62 of 103 remaining) [2024-11-13 14:08:48,622 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE (61 of 103 remaining) [2024-11-13 14:08:48,622 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE (60 of 103 remaining) [2024-11-13 14:08:48,622 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (59 of 103 remaining) [2024-11-13 14:08:48,622 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr3REQUIRES_VIOLATIONMEMORY_DEREFERENCE (58 of 103 remaining) [2024-11-13 14:08:48,622 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr4REQUIRES_VIOLATIONMEMORY_DEREFERENCE (57 of 103 remaining) [2024-11-13 14:08:48,623 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr5REQUIRES_VIOLATIONMEMORY_DEREFERENCE (56 of 103 remaining) [2024-11-13 14:08:48,623 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr6REQUIRES_VIOLATIONMEMORY_DEREFERENCE (55 of 103 remaining) [2024-11-13 14:08:48,623 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr7REQUIRES_VIOLATIONMEMORY_DEREFERENCE (54 of 103 remaining) [2024-11-13 14:08:48,623 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr8REQUIRES_VIOLATIONMEMORY_DEREFERENCE (53 of 103 remaining) [2024-11-13 14:08:48,623 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr9REQUIRES_VIOLATIONMEMORY_DEREFERENCE (52 of 103 remaining) [2024-11-13 14:08:48,623 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr10REQUIRES_VIOLATIONMEMORY_DEREFERENCE (51 of 103 remaining) [2024-11-13 14:08:48,623 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr11REQUIRES_VIOLATIONMEMORY_DEREFERENCE (50 of 103 remaining) [2024-11-13 14:08:48,624 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr12REQUIRES_VIOLATIONMEMORY_DEREFERENCE (49 of 103 remaining) [2024-11-13 14:08:48,624 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr13REQUIRES_VIOLATIONMEMORY_DEREFERENCE (48 of 103 remaining) [2024-11-13 14:08:48,624 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr14REQUIRES_VIOLATIONMEMORY_DEREFERENCE (47 of 103 remaining) [2024-11-13 14:08:48,624 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr15REQUIRES_VIOLATIONMEMORY_DEREFERENCE (46 of 103 remaining) [2024-11-13 14:08:48,624 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr16REQUIRES_VIOLATIONMEMORY_DEREFERENCE (45 of 103 remaining) [2024-11-13 14:08:48,624 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr17REQUIRES_VIOLATIONMEMORY_DEREFERENCE (44 of 103 remaining) [2024-11-13 14:08:48,624 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr19ASSERT_VIOLATIONMEMORY_LEAK (43 of 103 remaining) [2024-11-13 14:08:48,624 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (42 of 103 remaining) [2024-11-13 14:08:48,625 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (41 of 103 remaining) [2024-11-13 14:08:48,625 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr2INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (40 of 103 remaining) [2024-11-13 14:08:48,625 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location P0Err0REQUIRES_VIOLATIONMEMORY_DEREFERENCE (39 of 103 remaining) [2024-11-13 14:08:48,625 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location P0Err1REQUIRES_VIOLATIONMEMORY_DEREFERENCE (38 of 103 remaining) [2024-11-13 14:08:48,625 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location P0Err6REQUIRES_VIOLATIONMEMORY_DEREFERENCE (37 of 103 remaining) [2024-11-13 14:08:48,625 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location P0Err7REQUIRES_VIOLATIONMEMORY_DEREFERENCE (36 of 103 remaining) [2024-11-13 14:08:48,625 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location P0Err4REQUIRES_VIOLATIONMEMORY_DEREFERENCE (35 of 103 remaining) [2024-11-13 14:08:48,625 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location P0Err5REQUIRES_VIOLATIONMEMORY_DEREFERENCE (34 of 103 remaining) [2024-11-13 14:08:48,626 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location P0Err2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (33 of 103 remaining) [2024-11-13 14:08:48,626 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location P0Err3REQUIRES_VIOLATIONMEMORY_DEREFERENCE (32 of 103 remaining) [2024-11-13 14:08:48,626 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location P0Err8REQUIRES_VIOLATIONMEMORY_DEREFERENCE (31 of 103 remaining) [2024-11-13 14:08:48,626 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location P0Err9REQUIRES_VIOLATIONMEMORY_DEREFERENCE (30 of 103 remaining) [2024-11-13 14:08:48,626 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location P0Err10REQUIRES_VIOLATIONMEMORY_DEREFERENCE (29 of 103 remaining) [2024-11-13 14:08:48,626 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location P0Err11REQUIRES_VIOLATIONMEMORY_DEREFERENCE (28 of 103 remaining) [2024-11-13 14:08:48,626 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location P0Err12REQUIRES_VIOLATIONMEMORY_DEREFERENCE (27 of 103 remaining) [2024-11-13 14:08:48,626 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location P0Err13REQUIRES_VIOLATIONMEMORY_DEREFERENCE (26 of 103 remaining) [2024-11-13 14:08:48,626 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location P0Err14REQUIRES_VIOLATIONMEMORY_DEREFERENCE (25 of 103 remaining) [2024-11-13 14:08:48,626 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location P0Err15REQUIRES_VIOLATIONMEMORY_DEREFERENCE (24 of 103 remaining) [2024-11-13 14:08:48,626 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location P1Err0REQUIRES_VIOLATIONMEMORY_DEREFERENCE (23 of 103 remaining) [2024-11-13 14:08:48,626 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location P1Err1REQUIRES_VIOLATIONMEMORY_DEREFERENCE (22 of 103 remaining) [2024-11-13 14:08:48,626 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location P1Err2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (21 of 103 remaining) [2024-11-13 14:08:48,626 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location P1Err3REQUIRES_VIOLATIONMEMORY_DEREFERENCE (20 of 103 remaining) [2024-11-13 14:08:48,627 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location P1Err4REQUIRES_VIOLATIONMEMORY_DEREFERENCE (19 of 103 remaining) [2024-11-13 14:08:48,627 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location P1Err5REQUIRES_VIOLATIONMEMORY_DEREFERENCE (18 of 103 remaining) [2024-11-13 14:08:48,627 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location P2Err0REQUIRES_VIOLATIONMEMORY_DEREFERENCE (17 of 103 remaining) [2024-11-13 14:08:48,627 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location P2Err1REQUIRES_VIOLATIONMEMORY_DEREFERENCE (16 of 103 remaining) [2024-11-13 14:08:48,627 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location P2Err2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (15 of 103 remaining) [2024-11-13 14:08:48,627 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location P2Err3REQUIRES_VIOLATIONMEMORY_DEREFERENCE (14 of 103 remaining) [2024-11-13 14:08:48,627 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location P2Err4REQUIRES_VIOLATIONMEMORY_DEREFERENCE (13 of 103 remaining) [2024-11-13 14:08:48,628 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location P2Err5REQUIRES_VIOLATIONMEMORY_DEREFERENCE (12 of 103 remaining) [2024-11-13 14:08:48,628 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location P2Err6REQUIRES_VIOLATIONMEMORY_DEREFERENCE (11 of 103 remaining) [2024-11-13 14:08:48,628 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location P2Err7REQUIRES_VIOLATIONMEMORY_DEREFERENCE (10 of 103 remaining) [2024-11-13 14:08:48,628 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location P2Err8REQUIRES_VIOLATIONMEMORY_DEREFERENCE (9 of 103 remaining) [2024-11-13 14:08:48,628 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location P2Err9REQUIRES_VIOLATIONMEMORY_DEREFERENCE (8 of 103 remaining) [2024-11-13 14:08:48,628 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location P2Err10REQUIRES_VIOLATIONMEMORY_DEREFERENCE (7 of 103 remaining) [2024-11-13 14:08:48,628 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location P2Err11REQUIRES_VIOLATIONMEMORY_DEREFERENCE (6 of 103 remaining) [2024-11-13 14:08:48,629 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location P2Err12REQUIRES_VIOLATIONMEMORY_DEREFERENCE (5 of 103 remaining) [2024-11-13 14:08:48,629 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location P2Err13REQUIRES_VIOLATIONMEMORY_DEREFERENCE (4 of 103 remaining) [2024-11-13 14:08:48,629 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location P2Err14REQUIRES_VIOLATIONMEMORY_DEREFERENCE (3 of 103 remaining) [2024-11-13 14:08:48,629 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location P2Err15REQUIRES_VIOLATIONMEMORY_DEREFERENCE (2 of 103 remaining) [2024-11-13 14:08:48,629 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location P2Err16REQUIRES_VIOLATIONMEMORY_DEREFERENCE (1 of 103 remaining) [2024-11-13 14:08:48,629 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location P2Err17REQUIRES_VIOLATIONMEMORY_DEREFERENCE (0 of 103 remaining) [2024-11-13 14:08:48,657 INFO L552 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_d6c6bbac-8b87-4a12-bfcd-06c657a41f19/bin/uautomizer-verify-qhAvR1uOyd/z3 -smt2 -in SMTLIB2_COMPLIANT=true (16)] Ended with exit code 0 [2024-11-13 14:08:48,830 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 16 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_d6c6bbac-8b87-4a12-bfcd-06c657a41f19/bin/uautomizer-verify-qhAvR1uOyd/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-11-13 14:08:48,830 INFO L407 BasicCegarLoop]: Path program histogram: [6, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-13 14:08:48,975 INFO L242 ceAbstractionStarter]: Analysis of concurrent program completed with 1 thread instances [2024-11-13 14:08:48,976 INFO L173 ceAbstractionStarter]: Computing trace abstraction results [2024-11-13 14:08:48,983 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 13.11 02:08:48 BasicIcfg [2024-11-13 14:08:48,984 INFO L131 PluginConnector]: ------------------------ END TraceAbstraction---------------------------- [2024-11-13 14:08:48,984 INFO L112 PluginConnector]: ------------------------Witness Printer---------------------------- [2024-11-13 14:08:48,984 INFO L270 PluginConnector]: Initializing Witness Printer... [2024-11-13 14:08:48,985 INFO L274 PluginConnector]: Witness Printer initialized [2024-11-13 14:08:48,986 INFO L184 PluginConnector]: Executing the observer RCFGCatcher from plugin Witness Printer for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 13.11 02:08:19" (3/4) ... [2024-11-13 14:08:48,988 INFO L145 WitnessPrinter]: No result that supports witness generation found [2024-11-13 14:08:48,990 INFO L131 PluginConnector]: ------------------------ END Witness Printer---------------------------- [2024-11-13 14:08:48,991 INFO L158 Benchmark]: Toolchain (without parser) took 33513.98ms. Allocated memory was 83.9MB in the beginning and 1.7GB in the end (delta: 1.6GB). Free memory was 58.8MB in the beginning and 908.3MB in the end (delta: -849.5MB). Peak memory consumption was 715.7MB. Max. memory is 16.1GB. [2024-11-13 14:08:48,991 INFO L158 Benchmark]: CDTParser took 2.03ms. Allocated memory is still 83.9MB. Free memory is still 64.7MB. There was no memory consumed. Max. memory is 16.1GB. [2024-11-13 14:08:48,992 INFO L158 Benchmark]: CACSL2BoogieTranslator took 1077.93ms. Allocated memory is still 83.9MB. Free memory was 58.8MB in the beginning and 32.4MB in the end (delta: 26.5MB). Peak memory consumption was 25.2MB. Max. memory is 16.1GB. [2024-11-13 14:08:48,992 INFO L158 Benchmark]: Boogie Procedure Inliner took 95.62ms. Allocated memory is still 83.9MB. Free memory was 32.4MB in the beginning and 29.6MB in the end (delta: 2.8MB). Peak memory consumption was 8.4MB. Max. memory is 16.1GB. [2024-11-13 14:08:48,992 INFO L158 Benchmark]: Boogie Preprocessor took 116.94ms. Allocated memory is still 83.9MB. Free memory was 29.6MB in the beginning and 25.1MB in the end (delta: 4.5MB). There was no memory consumed. Max. memory is 16.1GB. [2024-11-13 14:08:48,993 INFO L158 Benchmark]: RCFGBuilder took 2539.48ms. Allocated memory was 83.9MB in the beginning and 100.7MB in the end (delta: 16.8MB). Free memory was 25.1MB in the beginning and 31.0MB in the end (delta: -5.9MB). Peak memory consumption was 33.4MB. Max. memory is 16.1GB. [2024-11-13 14:08:48,993 INFO L158 Benchmark]: TraceAbstraction took 29670.71ms. Allocated memory was 100.7MB in the beginning and 1.7GB in the end (delta: 1.6GB). Free memory was 30.2MB in the beginning and 912.5MB in the end (delta: -882.3MB). Peak memory consumption was 667.8MB. Max. memory is 16.1GB. [2024-11-13 14:08:48,994 INFO L158 Benchmark]: Witness Printer took 5.49ms. Allocated memory is still 1.7GB. Free memory was 912.5MB in the beginning and 908.3MB in the end (delta: 4.2MB). There was no memory consumed. Max. memory is 16.1GB. [2024-11-13 14:08:48,996 INFO L338 ainManager$Toolchain]: ####################### End [Toolchain 1] ####################### --- Results --- * Results from de.uni_freiburg.informatik.ultimate.core: - StatisticsResult: Toolchain Benchmarks Benchmark results are: * CDTParser took 2.03ms. Allocated memory is still 83.9MB. Free memory is still 64.7MB. There was no memory consumed. Max. memory is 16.1GB. * CACSL2BoogieTranslator took 1077.93ms. Allocated memory is still 83.9MB. Free memory was 58.8MB in the beginning and 32.4MB in the end (delta: 26.5MB). Peak memory consumption was 25.2MB. Max. memory is 16.1GB. * Boogie Procedure Inliner took 95.62ms. Allocated memory is still 83.9MB. Free memory was 32.4MB in the beginning and 29.6MB in the end (delta: 2.8MB). Peak memory consumption was 8.4MB. Max. memory is 16.1GB. * Boogie Preprocessor took 116.94ms. Allocated memory is still 83.9MB. Free memory was 29.6MB in the beginning and 25.1MB in the end (delta: 4.5MB). There was no memory consumed. Max. memory is 16.1GB. * RCFGBuilder took 2539.48ms. Allocated memory was 83.9MB in the beginning and 100.7MB in the end (delta: 16.8MB). Free memory was 25.1MB in the beginning and 31.0MB in the end (delta: -5.9MB). Peak memory consumption was 33.4MB. Max. memory is 16.1GB. * TraceAbstraction took 29670.71ms. Allocated memory was 100.7MB in the beginning and 1.7GB in the end (delta: 1.6GB). Free memory was 30.2MB in the beginning and 912.5MB in the end (delta: -882.3MB). Peak memory consumption was 667.8MB. Max. memory is 16.1GB. * Witness Printer took 5.49ms. Allocated memory is still 1.7GB. Free memory was 912.5MB in the beginning and 908.3MB in the end (delta: 4.2MB). There was no memory consumed. Max. memory is 16.1GB. * Results from de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: - UnprovableResult [Line: 18]: Unable to prove that all allocated memory was freed Unable to prove that all allocated memory was freed Reason: overapproximation of memtrack at line 18. Possible FailurePath: [L710] 0 int __unbuffered_cnt = 0; [L712] 0 int __unbuffered_p0_EAX = 0; [L713] 0 _Bool __unbuffered_p0_EAX$flush_delayed; [L714] 0 int __unbuffered_p0_EAX$mem_tmp; [L715] 0 _Bool __unbuffered_p0_EAX$r_buff0_thd0; [L716] 0 _Bool __unbuffered_p0_EAX$r_buff0_thd1; [L717] 0 _Bool __unbuffered_p0_EAX$r_buff0_thd2; [L718] 0 _Bool __unbuffered_p0_EAX$r_buff0_thd3; [L719] 0 _Bool __unbuffered_p0_EAX$r_buff1_thd0; [L720] 0 _Bool __unbuffered_p0_EAX$r_buff1_thd1; [L721] 0 _Bool __unbuffered_p0_EAX$r_buff1_thd2; [L722] 0 _Bool __unbuffered_p0_EAX$r_buff1_thd3; [L723] 0 _Bool __unbuffered_p0_EAX$read_delayed; [L724] 0 int *__unbuffered_p0_EAX$read_delayed_var; [L725] 0 int __unbuffered_p0_EAX$w_buff0; [L726] 0 _Bool __unbuffered_p0_EAX$w_buff0_used; [L727] 0 int __unbuffered_p0_EAX$w_buff1; [L728] 0 _Bool __unbuffered_p0_EAX$w_buff1_used; [L730] 0 int __unbuffered_p0_EBX = 0; [L732] 0 int __unbuffered_p2_EAX = 0; [L733] 0 _Bool main$tmp_guard0; [L734] 0 _Bool main$tmp_guard1; [L736] 0 int x = 0; [L738] 0 int y = 0; [L738] 0 int y = 0; [L739] 0 _Bool y$flush_delayed; [L740] 0 int y$mem_tmp; [L741] 0 _Bool y$r_buff0_thd0; [L742] 0 _Bool y$r_buff0_thd1; [L743] 0 _Bool y$r_buff0_thd2; [L744] 0 _Bool y$r_buff0_thd3; [L745] 0 _Bool y$r_buff1_thd0; [L746] 0 _Bool y$r_buff1_thd1; [L747] 0 _Bool y$r_buff1_thd2; [L748] 0 _Bool y$r_buff1_thd3; [L749] 0 _Bool y$read_delayed; [L750] 0 int *y$read_delayed_var; [L751] 0 int y$w_buff0; [L752] 0 _Bool y$w_buff0_used; [L753] 0 int y$w_buff1; [L754] 0 _Bool y$w_buff1_used; [L755] 0 _Bool weak$$choice0; [L756] 0 _Bool weak$$choice1; [L757] 0 _Bool weak$$choice2; [L853] 0 pthread_t t1825; [L854] FCALL, FORK 0 pthread_create(&t1825, ((void *)0), P0, ((void *)0)) VAL [\old(arg)={0:0}, __unbuffered_cnt=0, __unbuffered_p0_EAX$flush_delayed=0, __unbuffered_p0_EAX$mem_tmp=0, __unbuffered_p0_EAX$r_buff0_thd0=0, __unbuffered_p0_EAX$r_buff0_thd1=0, __unbuffered_p0_EAX$r_buff0_thd2=0, __unbuffered_p0_EAX$r_buff0_thd3=0, __unbuffered_p0_EAX$r_buff1_thd0=0, __unbuffered_p0_EAX$r_buff1_thd1=0, __unbuffered_p0_EAX$r_buff1_thd2=0, __unbuffered_p0_EAX$r_buff1_thd3=0, __unbuffered_p0_EAX$read_delayed=0, __unbuffered_p0_EAX$read_delayed_var={0:0}, __unbuffered_p0_EAX$w_buff0=0, __unbuffered_p0_EAX$w_buff0_used=0, __unbuffered_p0_EAX$w_buff1=0, __unbuffered_p0_EAX$w_buff1_used=0, __unbuffered_p0_EAX=0, __unbuffered_p0_EBX=0, __unbuffered_p2_EAX=0, main$tmp_guard0=0, main$tmp_guard1=0, t1825=7, 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}] [L761] 1 weak$$choice0 = __VERIFIER_nondet_bool() [L762] 1 weak$$choice2 = __VERIFIER_nondet_bool() [L763] 1 y$flush_delayed = weak$$choice2 [L764] EXPR 1 \read(y) [L764] 1 y$mem_tmp = y [L765] 1 weak$$choice1 = __VERIFIER_nondet_bool() [L766] EXPR 1 !y$w_buff0_used ? y : (y$w_buff0_used && y$r_buff0_thd1 ? y$w_buff0 : (y$w_buff0_used && !y$r_buff1_thd1 && y$w_buff1_used && !y$r_buff0_thd1 ? (weak$$choice0 ? y : (weak$$choice1 ? y$w_buff0 : y$w_buff1)) : (y$w_buff0_used && y$r_buff1_thd1 && y$w_buff1_used && !y$r_buff0_thd1 ? (weak$$choice0 ? y$w_buff1 : y$w_buff0) : (weak$$choice0 ? y$w_buff0 : y)))) [L766] EXPR 1 \read(y) [L766] EXPR 1 !y$w_buff0_used ? y : (y$w_buff0_used && y$r_buff0_thd1 ? y$w_buff0 : (y$w_buff0_used && !y$r_buff1_thd1 && y$w_buff1_used && !y$r_buff0_thd1 ? (weak$$choice0 ? y : (weak$$choice1 ? y$w_buff0 : y$w_buff1)) : (y$w_buff0_used && y$r_buff1_thd1 && y$w_buff1_used && !y$r_buff0_thd1 ? (weak$$choice0 ? y$w_buff1 : y$w_buff0) : (weak$$choice0 ? y$w_buff0 : y)))) [L766] 1 y = !y$w_buff0_used ? y : (y$w_buff0_used && y$r_buff0_thd1 ? y$w_buff0 : (y$w_buff0_used && !y$r_buff1_thd1 && y$w_buff1_used && !y$r_buff0_thd1 ? (weak$$choice0 ? y : (weak$$choice1 ? y$w_buff0 : y$w_buff1)) : (y$w_buff0_used && y$r_buff1_thd1 && y$w_buff1_used && !y$r_buff0_thd1 ? (weak$$choice0 ? y$w_buff1 : y$w_buff0) : (weak$$choice0 ? y$w_buff0 : y)))) [L767] 1 y$w_buff0 = weak$$choice2 ? y$w_buff0 : (!y$w_buff0_used ? y$w_buff0 : (y$w_buff0_used && y$r_buff0_thd1 ? y$w_buff0 : (y$w_buff0_used && !y$r_buff1_thd1 && y$w_buff1_used && !y$r_buff0_thd1 ? y$w_buff0 : (y$w_buff0_used && y$r_buff1_thd1 && y$w_buff1_used && !y$r_buff0_thd1 ? y$w_buff0 : y$w_buff0)))) [L768] 1 y$w_buff1 = weak$$choice2 ? y$w_buff1 : (!y$w_buff0_used ? y$w_buff1 : (y$w_buff0_used && y$r_buff0_thd1 ? y$w_buff1 : (y$w_buff0_used && !y$r_buff1_thd1 && y$w_buff1_used && !y$r_buff0_thd1 ? y$w_buff1 : (y$w_buff0_used && y$r_buff1_thd1 && y$w_buff1_used && !y$r_buff0_thd1 ? y$w_buff1 : y$w_buff1)))) [L769] 1 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_thd1 ? (_Bool)0 : (y$w_buff0_used && !y$r_buff1_thd1 && y$w_buff1_used && !y$r_buff0_thd1 ? weak$$choice0 || !weak$$choice1 : (y$w_buff0_used && y$r_buff1_thd1 && y$w_buff1_used && !y$r_buff0_thd1 ? weak$$choice0 : weak$$choice0)))) [L770] 1 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_thd1 ? (_Bool)0 : (y$w_buff0_used && !y$r_buff1_thd1 && y$w_buff1_used && !y$r_buff0_thd1 ? weak$$choice0 : (y$w_buff0_used && y$r_buff1_thd1 && y$w_buff1_used && !y$r_buff0_thd1 ? (_Bool)0 : (_Bool)0)))) [L771] 1 y$r_buff0_thd1 = weak$$choice2 ? y$r_buff0_thd1 : (!y$w_buff0_used ? y$r_buff0_thd1 : (y$w_buff0_used && y$r_buff0_thd1 ? (_Bool)0 : (y$w_buff0_used && !y$r_buff1_thd1 && y$w_buff1_used && !y$r_buff0_thd1 ? y$r_buff0_thd1 : (y$w_buff0_used && y$r_buff1_thd1 && y$w_buff1_used && !y$r_buff0_thd1 ? (_Bool)0 : (_Bool)0)))) [L772] 1 y$r_buff1_thd1 = weak$$choice2 ? y$r_buff1_thd1 : (!y$w_buff0_used ? y$r_buff1_thd1 : (y$w_buff0_used && y$r_buff0_thd1 ? (_Bool)0 : (y$w_buff0_used && !y$r_buff1_thd1 && y$w_buff1_used && !y$r_buff0_thd1 ? (weak$$choice0 ? y$r_buff1_thd1 : (_Bool)0) : (y$w_buff0_used && y$r_buff1_thd1 && y$w_buff1_used && !y$r_buff0_thd1 ? (_Bool)0 : (_Bool)0)))) [L773] 1 __unbuffered_p0_EAX$read_delayed = (_Bool)1 [L774] 1 __unbuffered_p0_EAX$read_delayed_var = &y [L775] EXPR 1 \read(y) [L775] 1 __unbuffered_p0_EAX = y [L776] EXPR 1 y$flush_delayed ? y$mem_tmp : y [L776] EXPR 1 \read(y) [L776] EXPR 1 y$flush_delayed ? y$mem_tmp : y [L776] 1 y = y$flush_delayed ? y$mem_tmp : y [L777] 1 y$flush_delayed = (_Bool)0 VAL [\old(arg)={0:0}, __unbuffered_cnt=0, __unbuffered_p0_EAX$flush_delayed=0, __unbuffered_p0_EAX$mem_tmp=0, __unbuffered_p0_EAX$r_buff0_thd0=0, __unbuffered_p0_EAX$r_buff0_thd1=0, __unbuffered_p0_EAX$r_buff0_thd2=0, __unbuffered_p0_EAX$r_buff0_thd3=0, __unbuffered_p0_EAX$r_buff1_thd0=0, __unbuffered_p0_EAX$r_buff1_thd1=0, __unbuffered_p0_EAX$r_buff1_thd2=0, __unbuffered_p0_EAX$r_buff1_thd3=0, __unbuffered_p0_EAX$read_delayed=1, __unbuffered_p0_EAX$read_delayed_var={3:0}, __unbuffered_p0_EAX$w_buff0=0, __unbuffered_p0_EAX$w_buff0_used=0, __unbuffered_p0_EAX$w_buff1=0, __unbuffered_p0_EAX$w_buff1_used=0, __unbuffered_p0_EAX=0, __unbuffered_p0_EBX=0, __unbuffered_p2_EAX=0, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=1, 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}] [L780] 1 __unbuffered_p0_EBX = x VAL [\old(arg)={0:0}, __unbuffered_cnt=0, __unbuffered_p0_EAX$flush_delayed=0, __unbuffered_p0_EAX$mem_tmp=0, __unbuffered_p0_EAX$r_buff0_thd0=0, __unbuffered_p0_EAX$r_buff0_thd1=0, __unbuffered_p0_EAX$r_buff0_thd2=0, __unbuffered_p0_EAX$r_buff0_thd3=0, __unbuffered_p0_EAX$r_buff1_thd0=0, __unbuffered_p0_EAX$r_buff1_thd1=0, __unbuffered_p0_EAX$r_buff1_thd2=0, __unbuffered_p0_EAX$r_buff1_thd3=0, __unbuffered_p0_EAX$read_delayed=1, __unbuffered_p0_EAX$read_delayed_var={3:0}, __unbuffered_p0_EAX$w_buff0=0, __unbuffered_p0_EAX$w_buff0_used=0, __unbuffered_p0_EAX$w_buff1=0, __unbuffered_p0_EAX$w_buff1_used=0, __unbuffered_p0_EAX=0, __unbuffered_p0_EBX=0, __unbuffered_p2_EAX=0, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=1, 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}] [L855] 0 pthread_t t1826; [L856] FCALL, FORK 0 pthread_create(&t1826, ((void *)0), P1, ((void *)0)) VAL [\old(arg)={0:0}, \old(arg)={0:0}, __unbuffered_cnt=0, __unbuffered_p0_EAX$flush_delayed=0, __unbuffered_p0_EAX$mem_tmp=0, __unbuffered_p0_EAX$r_buff0_thd0=0, __unbuffered_p0_EAX$r_buff0_thd1=0, __unbuffered_p0_EAX$r_buff0_thd2=0, __unbuffered_p0_EAX$r_buff0_thd3=0, __unbuffered_p0_EAX$r_buff1_thd0=0, __unbuffered_p0_EAX$r_buff1_thd1=0, __unbuffered_p0_EAX$r_buff1_thd2=0, __unbuffered_p0_EAX$r_buff1_thd3=0, __unbuffered_p0_EAX$read_delayed=1, __unbuffered_p0_EAX$read_delayed_var={3:0}, __unbuffered_p0_EAX$w_buff0=0, __unbuffered_p0_EAX$w_buff0_used=0, __unbuffered_p0_EAX$w_buff1=0, __unbuffered_p0_EAX$w_buff1_used=0, __unbuffered_p0_EAX=0, __unbuffered_p0_EBX=0, __unbuffered_p2_EAX=0, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, t1825=7, t1826=8, weak$$choice0=1, 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}] [L792] 2 x = 1 VAL [\old(arg)={0:0}, \old(arg)={0:0}, __unbuffered_cnt=0, __unbuffered_p0_EAX$flush_delayed=0, __unbuffered_p0_EAX$mem_tmp=0, __unbuffered_p0_EAX$r_buff0_thd0=0, __unbuffered_p0_EAX$r_buff0_thd1=0, __unbuffered_p0_EAX$r_buff0_thd2=0, __unbuffered_p0_EAX$r_buff0_thd3=0, __unbuffered_p0_EAX$r_buff1_thd0=0, __unbuffered_p0_EAX$r_buff1_thd1=0, __unbuffered_p0_EAX$r_buff1_thd2=0, __unbuffered_p0_EAX$r_buff1_thd3=0, __unbuffered_p0_EAX$read_delayed=1, __unbuffered_p0_EAX$read_delayed_var={3:0}, __unbuffered_p0_EAX$w_buff0=0, __unbuffered_p0_EAX$w_buff0_used=0, __unbuffered_p0_EAX$w_buff1=0, __unbuffered_p0_EAX$w_buff1_used=0, __unbuffered_p0_EAX=0, __unbuffered_p0_EBX=0, __unbuffered_p2_EAX=0, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=1, 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}] [L857] 0 pthread_t t1827; [L858] FCALL, FORK 0 pthread_create(&t1827, ((void *)0), P2, ((void *)0)) VAL [\old(arg)={0:0}, \old(arg)={0:0}, \old(arg)={0:0}, __unbuffered_cnt=0, __unbuffered_p0_EAX$flush_delayed=0, __unbuffered_p0_EAX$mem_tmp=0, __unbuffered_p0_EAX$r_buff0_thd0=0, __unbuffered_p0_EAX$r_buff0_thd1=0, __unbuffered_p0_EAX$r_buff0_thd2=0, __unbuffered_p0_EAX$r_buff0_thd3=0, __unbuffered_p0_EAX$r_buff1_thd0=0, __unbuffered_p0_EAX$r_buff1_thd1=0, __unbuffered_p0_EAX$r_buff1_thd2=0, __unbuffered_p0_EAX$r_buff1_thd3=0, __unbuffered_p0_EAX$read_delayed=1, __unbuffered_p0_EAX$read_delayed_var={3:0}, __unbuffered_p0_EAX$w_buff0=0, __unbuffered_p0_EAX$w_buff0_used=0, __unbuffered_p0_EAX$w_buff1=0, __unbuffered_p0_EAX$w_buff1_used=0, __unbuffered_p0_EAX=0, __unbuffered_p0_EBX=0, __unbuffered_p2_EAX=0, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, t1825=7, t1826=8, t1827=9, weak$$choice0=1, 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}] [L795] 2 y = 1 VAL [\old(arg)={0:0}, \old(arg)={0:0}, \old(arg)={0:0}, __unbuffered_cnt=0, __unbuffered_p0_EAX$flush_delayed=0, __unbuffered_p0_EAX$mem_tmp=0, __unbuffered_p0_EAX$r_buff0_thd0=0, __unbuffered_p0_EAX$r_buff0_thd1=0, __unbuffered_p0_EAX$r_buff0_thd2=0, __unbuffered_p0_EAX$r_buff0_thd3=0, __unbuffered_p0_EAX$r_buff1_thd0=0, __unbuffered_p0_EAX$r_buff1_thd1=0, __unbuffered_p0_EAX$r_buff1_thd2=0, __unbuffered_p0_EAX$r_buff1_thd3=0, __unbuffered_p0_EAX$read_delayed=1, __unbuffered_p0_EAX$read_delayed_var={3:0}, __unbuffered_p0_EAX$w_buff0=0, __unbuffered_p0_EAX$w_buff0_used=0, __unbuffered_p0_EAX$w_buff1=0, __unbuffered_p0_EAX$w_buff1_used=0, __unbuffered_p0_EAX=0, __unbuffered_p0_EBX=0, __unbuffered_p2_EAX=0, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=1, 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}] [L798] 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) [L798] EXPR 2 y$w_buff1_used && y$r_buff1_thd2 ? y$w_buff1 : y [L798] EXPR 2 \read(y) [L798] EXPR 2 y$w_buff1_used && y$r_buff1_thd2 ? y$w_buff1 : y [L798] 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) [L798] 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) [L799] 2 y$w_buff0_used = y$w_buff0_used && y$r_buff0_thd2 ? (_Bool)0 : y$w_buff0_used [L800] 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 [L801] 2 y$r_buff0_thd2 = y$w_buff0_used && y$r_buff0_thd2 ? (_Bool)0 : y$r_buff0_thd2 [L802] 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$flush_delayed=0, __unbuffered_p0_EAX$mem_tmp=0, __unbuffered_p0_EAX$r_buff0_thd0=0, __unbuffered_p0_EAX$r_buff0_thd1=0, __unbuffered_p0_EAX$r_buff0_thd2=0, __unbuffered_p0_EAX$r_buff0_thd3=0, __unbuffered_p0_EAX$r_buff1_thd0=0, __unbuffered_p0_EAX$r_buff1_thd1=0, __unbuffered_p0_EAX$r_buff1_thd2=0, __unbuffered_p0_EAX$r_buff1_thd3=0, __unbuffered_p0_EAX$read_delayed=1, __unbuffered_p0_EAX$read_delayed_var={3:0}, __unbuffered_p0_EAX$w_buff0=0, __unbuffered_p0_EAX$w_buff0_used=0, __unbuffered_p0_EAX$w_buff1=0, __unbuffered_p0_EAX$w_buff1_used=0, __unbuffered_p0_EAX=0, __unbuffered_p0_EBX=0, __unbuffered_p2_EAX=0, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=1, 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}] [L805] 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$flush_delayed=0, __unbuffered_p0_EAX$mem_tmp=0, __unbuffered_p0_EAX$r_buff0_thd0=0, __unbuffered_p0_EAX$r_buff0_thd1=0, __unbuffered_p0_EAX$r_buff0_thd2=0, __unbuffered_p0_EAX$r_buff0_thd3=0, __unbuffered_p0_EAX$r_buff1_thd0=0, __unbuffered_p0_EAX$r_buff1_thd1=0, __unbuffered_p0_EAX$r_buff1_thd2=0, __unbuffered_p0_EAX$r_buff1_thd3=0, __unbuffered_p0_EAX$read_delayed=1, __unbuffered_p0_EAX$read_delayed_var={3:0}, __unbuffered_p0_EAX$w_buff0=0, __unbuffered_p0_EAX$w_buff0_used=0, __unbuffered_p0_EAX$w_buff1=0, __unbuffered_p0_EAX$w_buff1_used=0, __unbuffered_p0_EAX=0, __unbuffered_p0_EBX=0, __unbuffered_p2_EAX=0, arg={0:0}, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=1, 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}] [L785] 1 __unbuffered_cnt = __unbuffered_cnt + 1 VAL [\old(arg)={0:0}, \old(arg)={0:0}, \old(arg)={0:0}, __unbuffered_cnt=2, __unbuffered_p0_EAX$flush_delayed=0, __unbuffered_p0_EAX$mem_tmp=0, __unbuffered_p0_EAX$r_buff0_thd0=0, __unbuffered_p0_EAX$r_buff0_thd1=0, __unbuffered_p0_EAX$r_buff0_thd2=0, __unbuffered_p0_EAX$r_buff0_thd3=0, __unbuffered_p0_EAX$r_buff1_thd0=0, __unbuffered_p0_EAX$r_buff1_thd1=0, __unbuffered_p0_EAX$r_buff1_thd2=0, __unbuffered_p0_EAX$r_buff1_thd3=0, __unbuffered_p0_EAX$read_delayed=1, __unbuffered_p0_EAX$read_delayed_var={3:0}, __unbuffered_p0_EAX$w_buff0=0, __unbuffered_p0_EAX$w_buff0_used=0, __unbuffered_p0_EAX$w_buff1=0, __unbuffered_p0_EAX$w_buff1_used=0, __unbuffered_p0_EAX=0, __unbuffered_p0_EBX=0, __unbuffered_p2_EAX=0, arg={0:0}, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=1, 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}] [L812] 3 weak$$choice0 = __VERIFIER_nondet_bool() [L813] 3 weak$$choice2 = __VERIFIER_nondet_bool() [L814] 3 y$flush_delayed = weak$$choice2 [L815] EXPR 3 \read(y) [L815] 3 y$mem_tmp = y [L816] EXPR 3 !y$w_buff0_used || !y$r_buff0_thd3 && !y$w_buff1_used || !y$r_buff0_thd3 && !y$r_buff1_thd3 ? y : (y$w_buff0_used && y$r_buff0_thd3 ? y$w_buff0 : y$w_buff1) [L816] EXPR 3 \read(y) [L816] EXPR 3 !y$w_buff0_used || !y$r_buff0_thd3 && !y$w_buff1_used || !y$r_buff0_thd3 && !y$r_buff1_thd3 ? y : (y$w_buff0_used && y$r_buff0_thd3 ? y$w_buff0 : y$w_buff1) [L816] 3 y = !y$w_buff0_used || !y$r_buff0_thd3 && !y$w_buff1_used || !y$r_buff0_thd3 && !y$r_buff1_thd3 ? y : (y$w_buff0_used && y$r_buff0_thd3 ? y$w_buff0 : y$w_buff1) [L817] 3 y$w_buff0 = weak$$choice2 ? y$w_buff0 : (!y$w_buff0_used || !y$r_buff0_thd3 && !y$w_buff1_used || !y$r_buff0_thd3 && !y$r_buff1_thd3 ? y$w_buff0 : (y$w_buff0_used && y$r_buff0_thd3 ? y$w_buff0 : y$w_buff0)) [L818] 3 y$w_buff1 = weak$$choice2 ? y$w_buff1 : (!y$w_buff0_used || !y$r_buff0_thd3 && !y$w_buff1_used || !y$r_buff0_thd3 && !y$r_buff1_thd3 ? y$w_buff1 : (y$w_buff0_used && y$r_buff0_thd3 ? y$w_buff1 : y$w_buff1)) [L819] 3 y$w_buff0_used = weak$$choice2 ? y$w_buff0_used : (!y$w_buff0_used || !y$r_buff0_thd3 && !y$w_buff1_used || !y$r_buff0_thd3 && !y$r_buff1_thd3 ? y$w_buff0_used : (y$w_buff0_used && y$r_buff0_thd3 ? (_Bool)0 : y$w_buff0_used)) [L820] 3 y$w_buff1_used = weak$$choice2 ? y$w_buff1_used : (!y$w_buff0_used || !y$r_buff0_thd3 && !y$w_buff1_used || !y$r_buff0_thd3 && !y$r_buff1_thd3 ? y$w_buff1_used : (y$w_buff0_used && y$r_buff0_thd3 ? (_Bool)0 : (_Bool)0)) [L821] 3 y$r_buff0_thd3 = weak$$choice2 ? y$r_buff0_thd3 : (!y$w_buff0_used || !y$r_buff0_thd3 && !y$w_buff1_used || !y$r_buff0_thd3 && !y$r_buff1_thd3 ? y$r_buff0_thd3 : (y$w_buff0_used && y$r_buff0_thd3 ? (_Bool)0 : y$r_buff0_thd3)) [L822] 3 y$r_buff1_thd3 = weak$$choice2 ? y$r_buff1_thd3 : (!y$w_buff0_used || !y$r_buff0_thd3 && !y$w_buff1_used || !y$r_buff0_thd3 && !y$r_buff1_thd3 ? y$r_buff1_thd3 : (y$w_buff0_used && y$r_buff0_thd3 ? (_Bool)0 : (_Bool)0)) [L823] EXPR 3 \read(y) [L823] 3 __unbuffered_p2_EAX = y [L824] EXPR 3 y$flush_delayed ? y$mem_tmp : y [L824] EXPR 3 y$flush_delayed ? y$mem_tmp : y [L824] 3 y = y$flush_delayed ? y$mem_tmp : y [L825] 3 y$flush_delayed = (_Bool)0 VAL [\old(arg)={0:0}, \old(arg)={0:0}, \old(arg)={0:0}, __unbuffered_cnt=2, __unbuffered_p0_EAX$flush_delayed=0, __unbuffered_p0_EAX$mem_tmp=0, __unbuffered_p0_EAX$r_buff0_thd0=0, __unbuffered_p0_EAX$r_buff0_thd1=0, __unbuffered_p0_EAX$r_buff0_thd2=0, __unbuffered_p0_EAX$r_buff0_thd3=0, __unbuffered_p0_EAX$r_buff1_thd0=0, __unbuffered_p0_EAX$r_buff1_thd1=0, __unbuffered_p0_EAX$r_buff1_thd2=0, __unbuffered_p0_EAX$r_buff1_thd3=0, __unbuffered_p0_EAX$read_delayed=1, __unbuffered_p0_EAX$read_delayed_var={3:0}, __unbuffered_p0_EAX$w_buff0=0, __unbuffered_p0_EAX$w_buff0_used=0, __unbuffered_p0_EAX$w_buff1=0, __unbuffered_p0_EAX$w_buff1_used=0, __unbuffered_p0_EAX=0, __unbuffered_p0_EBX=0, __unbuffered_p2_EAX=1, 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=1, x=1, y$flush_delayed=0, y$mem_tmp=1, 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}] [L828] 3 y = 2 VAL [\old(arg)={0:0}, \old(arg)={0:0}, \old(arg)={0:0}, __unbuffered_cnt=2, __unbuffered_p0_EAX$flush_delayed=0, __unbuffered_p0_EAX$mem_tmp=0, __unbuffered_p0_EAX$r_buff0_thd0=0, __unbuffered_p0_EAX$r_buff0_thd1=0, __unbuffered_p0_EAX$r_buff0_thd2=0, __unbuffered_p0_EAX$r_buff0_thd3=0, __unbuffered_p0_EAX$r_buff1_thd0=0, __unbuffered_p0_EAX$r_buff1_thd1=0, __unbuffered_p0_EAX$r_buff1_thd2=0, __unbuffered_p0_EAX$r_buff1_thd3=0, __unbuffered_p0_EAX$read_delayed=1, __unbuffered_p0_EAX$read_delayed_var={3:0}, __unbuffered_p0_EAX$w_buff0=0, __unbuffered_p0_EAX$w_buff0_used=0, __unbuffered_p0_EAX$w_buff1=0, __unbuffered_p0_EAX$w_buff1_used=0, __unbuffered_p0_EAX=0, __unbuffered_p0_EBX=0, __unbuffered_p2_EAX=1, 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=1, x=1, y$flush_delayed=0, y$mem_tmp=1, 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}] [L831] 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) [L831] EXPR 3 y$w_buff1_used && y$r_buff1_thd3 ? y$w_buff1 : y [L831] EXPR 3 \read(y) [L831] EXPR 3 y$w_buff1_used && y$r_buff1_thd3 ? y$w_buff1 : y [L831] 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) [L831] 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) [L832] 3 y$w_buff0_used = y$w_buff0_used && y$r_buff0_thd3 ? (_Bool)0 : y$w_buff0_used [L833] 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 [L834] 3 y$r_buff0_thd3 = y$w_buff0_used && y$r_buff0_thd3 ? (_Bool)0 : y$r_buff0_thd3 [L835] 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}, \old(arg)={0:0}, __unbuffered_cnt=2, __unbuffered_p0_EAX$flush_delayed=0, __unbuffered_p0_EAX$mem_tmp=0, __unbuffered_p0_EAX$r_buff0_thd0=0, __unbuffered_p0_EAX$r_buff0_thd1=0, __unbuffered_p0_EAX$r_buff0_thd2=0, __unbuffered_p0_EAX$r_buff0_thd3=0, __unbuffered_p0_EAX$r_buff1_thd0=0, __unbuffered_p0_EAX$r_buff1_thd1=0, __unbuffered_p0_EAX$r_buff1_thd2=0, __unbuffered_p0_EAX$r_buff1_thd3=0, __unbuffered_p0_EAX$read_delayed=1, __unbuffered_p0_EAX$read_delayed_var={3:0}, __unbuffered_p0_EAX$w_buff0=0, __unbuffered_p0_EAX$w_buff0_used=0, __unbuffered_p0_EAX$w_buff1=0, __unbuffered_p0_EAX$w_buff1_used=0, __unbuffered_p0_EAX=0, __unbuffered_p0_EBX=0, __unbuffered_p2_EAX=1, 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=1, x=1, y$flush_delayed=0, y$mem_tmp=1, 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}] [L838] 3 __unbuffered_cnt = __unbuffered_cnt + 1 VAL [\old(arg)={0:0}, \old(arg)={0:0}, \old(arg)={0:0}, __unbuffered_cnt=3, __unbuffered_p0_EAX$flush_delayed=0, __unbuffered_p0_EAX$mem_tmp=0, __unbuffered_p0_EAX$r_buff0_thd0=0, __unbuffered_p0_EAX$r_buff0_thd1=0, __unbuffered_p0_EAX$r_buff0_thd2=0, __unbuffered_p0_EAX$r_buff0_thd3=0, __unbuffered_p0_EAX$r_buff1_thd0=0, __unbuffered_p0_EAX$r_buff1_thd1=0, __unbuffered_p0_EAX$r_buff1_thd2=0, __unbuffered_p0_EAX$r_buff1_thd3=0, __unbuffered_p0_EAX$read_delayed=1, __unbuffered_p0_EAX$read_delayed_var={3:0}, __unbuffered_p0_EAX$w_buff0=0, __unbuffered_p0_EAX$w_buff0_used=0, __unbuffered_p0_EAX$w_buff1=0, __unbuffered_p0_EAX$w_buff1_used=0, __unbuffered_p0_EAX=0, __unbuffered_p0_EBX=0, __unbuffered_p2_EAX=1, 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=1, x=1, y$flush_delayed=0, y$mem_tmp=1, 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}] [L860] 0 main$tmp_guard0 = __unbuffered_cnt == 3 VAL [\old(arg)={0:0}, \old(arg)={0:0}, \old(arg)={0:0}, __unbuffered_cnt=3, __unbuffered_p0_EAX$flush_delayed=0, __unbuffered_p0_EAX$mem_tmp=0, __unbuffered_p0_EAX$r_buff0_thd0=0, __unbuffered_p0_EAX$r_buff0_thd1=0, __unbuffered_p0_EAX$r_buff0_thd2=0, __unbuffered_p0_EAX$r_buff0_thd3=0, __unbuffered_p0_EAX$r_buff1_thd0=0, __unbuffered_p0_EAX$r_buff1_thd1=0, __unbuffered_p0_EAX$r_buff1_thd2=0, __unbuffered_p0_EAX$r_buff1_thd3=0, __unbuffered_p0_EAX$read_delayed=1, __unbuffered_p0_EAX$read_delayed_var={3:0}, __unbuffered_p0_EAX$w_buff0=0, __unbuffered_p0_EAX$w_buff0_used=0, __unbuffered_p0_EAX$w_buff1=0, __unbuffered_p0_EAX$w_buff1_used=0, __unbuffered_p0_EAX=0, __unbuffered_p0_EBX=0, __unbuffered_p2_EAX=1, arg={0:0}, arg={0:0}, arg={0:0}, main$tmp_guard0=1, main$tmp_guard1=0, t1825=7, t1826=8, t1827=9, weak$$choice0=0, weak$$choice1=0, weak$$choice2=1, x=1, y$flush_delayed=0, y$mem_tmp=1, 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}] [L862] CALL 0 assume_abort_if_not(main$tmp_guard0) [L4] COND FALSE 0 !(!cond) [L862] RET 0 assume_abort_if_not(main$tmp_guard0) [L864] 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) [L864] EXPR 0 y$w_buff1_used && y$r_buff1_thd0 ? y$w_buff1 : y [L864] EXPR 0 \read(y) [L864] EXPR 0 y$w_buff1_used && y$r_buff1_thd0 ? y$w_buff1 : y [L864] 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) [L864] 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) [L865] 0 y$w_buff0_used = y$w_buff0_used && y$r_buff0_thd0 ? (_Bool)0 : y$w_buff0_used [L866] 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 [L867] 0 y$r_buff0_thd0 = y$w_buff0_used && y$r_buff0_thd0 ? (_Bool)0 : y$r_buff0_thd0 [L868] 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}, \old(arg)={0:0}, __unbuffered_cnt=3, __unbuffered_p0_EAX$flush_delayed=0, __unbuffered_p0_EAX$mem_tmp=0, __unbuffered_p0_EAX$r_buff0_thd0=0, __unbuffered_p0_EAX$r_buff0_thd1=0, __unbuffered_p0_EAX$r_buff0_thd2=0, __unbuffered_p0_EAX$r_buff0_thd3=0, __unbuffered_p0_EAX$r_buff1_thd0=0, __unbuffered_p0_EAX$r_buff1_thd1=0, __unbuffered_p0_EAX$r_buff1_thd2=0, __unbuffered_p0_EAX$r_buff1_thd3=0, __unbuffered_p0_EAX$read_delayed=1, __unbuffered_p0_EAX$read_delayed_var={3:0}, __unbuffered_p0_EAX$w_buff0=0, __unbuffered_p0_EAX$w_buff0_used=0, __unbuffered_p0_EAX$w_buff1=0, __unbuffered_p0_EAX$w_buff1_used=0, __unbuffered_p0_EAX=0, __unbuffered_p0_EBX=0, __unbuffered_p2_EAX=1, arg={0:0}, arg={0:0}, arg={0:0}, main$tmp_guard0=1, main$tmp_guard1=0, t1825=7, t1826=8, t1827=9, weak$$choice0=0, weak$$choice1=0, weak$$choice2=1, x=1, y$flush_delayed=0, y$mem_tmp=1, 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}] [L871] 0 weak$$choice0 = __VERIFIER_nondet_bool() [L872] 0 weak$$choice2 = __VERIFIER_nondet_bool() [L873] 0 y$flush_delayed = weak$$choice2 [L874] EXPR 0 \read(y) [L874] 0 y$mem_tmp = y [L875] EXPR 0 !y$w_buff0_used || !y$r_buff0_thd0 && !y$w_buff1_used || !y$r_buff0_thd0 && !y$r_buff1_thd0 ? y : (y$w_buff0_used && y$r_buff0_thd0 ? y$w_buff0 : y$w_buff1) [L875] EXPR 0 \read(y) [L875] EXPR 0 !y$w_buff0_used || !y$r_buff0_thd0 && !y$w_buff1_used || !y$r_buff0_thd0 && !y$r_buff1_thd0 ? y : (y$w_buff0_used && y$r_buff0_thd0 ? y$w_buff0 : y$w_buff1) [L875] 0 y = !y$w_buff0_used || !y$r_buff0_thd0 && !y$w_buff1_used || !y$r_buff0_thd0 && !y$r_buff1_thd0 ? y : (y$w_buff0_used && y$r_buff0_thd0 ? y$w_buff0 : y$w_buff1) [L876] 0 y$w_buff0 = weak$$choice2 ? y$w_buff0 : (!y$w_buff0_used || !y$r_buff0_thd0 && !y$w_buff1_used || !y$r_buff0_thd0 && !y$r_buff1_thd0 ? y$w_buff0 : (y$w_buff0_used && y$r_buff0_thd0 ? y$w_buff0 : y$w_buff0)) [L877] 0 y$w_buff1 = weak$$choice2 ? y$w_buff1 : (!y$w_buff0_used || !y$r_buff0_thd0 && !y$w_buff1_used || !y$r_buff0_thd0 && !y$r_buff1_thd0 ? y$w_buff1 : (y$w_buff0_used && y$r_buff0_thd0 ? y$w_buff1 : y$w_buff1)) [L878] 0 y$w_buff0_used = weak$$choice2 ? y$w_buff0_used : (!y$w_buff0_used || !y$r_buff0_thd0 && !y$w_buff1_used || !y$r_buff0_thd0 && !y$r_buff1_thd0 ? y$w_buff0_used : (y$w_buff0_used && y$r_buff0_thd0 ? (_Bool)0 : y$w_buff0_used)) [L879] 0 y$w_buff1_used = weak$$choice2 ? y$w_buff1_used : (!y$w_buff0_used || !y$r_buff0_thd0 && !y$w_buff1_used || !y$r_buff0_thd0 && !y$r_buff1_thd0 ? y$w_buff1_used : (y$w_buff0_used && y$r_buff0_thd0 ? (_Bool)0 : (_Bool)0)) [L880] 0 y$r_buff0_thd0 = weak$$choice2 ? y$r_buff0_thd0 : (!y$w_buff0_used || !y$r_buff0_thd0 && !y$w_buff1_used || !y$r_buff0_thd0 && !y$r_buff1_thd0 ? y$r_buff0_thd0 : (y$w_buff0_used && y$r_buff0_thd0 ? (_Bool)0 : y$r_buff0_thd0)) [L881] 0 y$r_buff1_thd0 = weak$$choice2 ? y$r_buff1_thd0 : (!y$w_buff0_used || !y$r_buff0_thd0 && !y$w_buff1_used || !y$r_buff0_thd0 && !y$r_buff1_thd0 ? y$r_buff1_thd0 : (y$w_buff0_used && y$r_buff0_thd0 ? (_Bool)0 : (_Bool)0)) [L882] 0 weak$$choice1 = __VERIFIER_nondet_bool() [L883] EXPR 0 __unbuffered_p0_EAX$read_delayed ? (weak$$choice1 ? *__unbuffered_p0_EAX$read_delayed_var : __unbuffered_p0_EAX) : __unbuffered_p0_EAX [L883] EXPR 0 weak$$choice1 ? *__unbuffered_p0_EAX$read_delayed_var : __unbuffered_p0_EAX [L883] EXPR 0 \read(*__unbuffered_p0_EAX$read_delayed_var) [L883] EXPR 0 weak$$choice1 ? *__unbuffered_p0_EAX$read_delayed_var : __unbuffered_p0_EAX [L883] EXPR 0 __unbuffered_p0_EAX$read_delayed ? (weak$$choice1 ? *__unbuffered_p0_EAX$read_delayed_var : __unbuffered_p0_EAX) : __unbuffered_p0_EAX [L883] 0 __unbuffered_p0_EAX = __unbuffered_p0_EAX$read_delayed ? (weak$$choice1 ? *__unbuffered_p0_EAX$read_delayed_var : __unbuffered_p0_EAX) : __unbuffered_p0_EAX [L884] EXPR 0 \read(y) [L884] 0 main$tmp_guard1 = !(y == 2 && __unbuffered_p0_EAX == 2 && __unbuffered_p0_EBX == 0 && __unbuffered_p2_EAX == 1) [L885] EXPR 0 y$flush_delayed ? y$mem_tmp : y [L885] EXPR 0 \read(y) [L885] EXPR 0 y$flush_delayed ? y$mem_tmp : y [L885] 0 y = y$flush_delayed ? y$mem_tmp : y [L886] 0 y$flush_delayed = (_Bool)0 VAL [\old(arg)={0:0}, \old(arg)={0:0}, \old(arg)={0:0}, __unbuffered_cnt=3, __unbuffered_p0_EAX$flush_delayed=0, __unbuffered_p0_EAX$mem_tmp=0, __unbuffered_p0_EAX$r_buff0_thd0=0, __unbuffered_p0_EAX$r_buff0_thd1=0, __unbuffered_p0_EAX$r_buff0_thd2=0, __unbuffered_p0_EAX$r_buff0_thd3=0, __unbuffered_p0_EAX$r_buff1_thd0=0, __unbuffered_p0_EAX$r_buff1_thd1=0, __unbuffered_p0_EAX$r_buff1_thd2=0, __unbuffered_p0_EAX$r_buff1_thd3=0, __unbuffered_p0_EAX$read_delayed=1, __unbuffered_p0_EAX$read_delayed_var={3:0}, __unbuffered_p0_EAX$w_buff0=0, __unbuffered_p0_EAX$w_buff0_used=0, __unbuffered_p0_EAX$w_buff1=0, __unbuffered_p0_EAX$w_buff1_used=0, __unbuffered_p0_EAX=2, __unbuffered_p0_EBX=0, __unbuffered_p2_EAX=1, arg={0:0}, arg={0:0}, arg={0:0}, main$tmp_guard0=1, main$tmp_guard1=0, t1825=7, t1826=8, t1827=9, weak$$choice0=0, weak$$choice1=1, weak$$choice2=0, x=1, y$flush_delayed=0, y$mem_tmp=2, y$r_buff0_thd0=0, y$r_buff0_thd1=0, y$r_buff0_thd2=0, y$r_buff0_thd3=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}] [L888] CALL 0 __VERIFIER_assert(main$tmp_guard1) [L19] COND TRUE 0 !expression [L19] CALL 0 reach_error() [L18] COND FALSE 0 !(0) VAL [\old(arg)={0:0}, \old(arg)={0:0}, \old(arg)={0:0}, __unbuffered_cnt=3, __unbuffered_p0_EAX$flush_delayed=0, __unbuffered_p0_EAX$mem_tmp=0, __unbuffered_p0_EAX$r_buff0_thd0=0, __unbuffered_p0_EAX$r_buff0_thd1=0, __unbuffered_p0_EAX$r_buff0_thd2=0, __unbuffered_p0_EAX$r_buff0_thd3=0, __unbuffered_p0_EAX$r_buff1_thd0=0, __unbuffered_p0_EAX$r_buff1_thd1=0, __unbuffered_p0_EAX$r_buff1_thd2=0, __unbuffered_p0_EAX$r_buff1_thd3=0, __unbuffered_p0_EAX$read_delayed=1, __unbuffered_p0_EAX$read_delayed_var={3:0}, __unbuffered_p0_EAX$w_buff0=0, __unbuffered_p0_EAX$w_buff0_used=0, __unbuffered_p0_EAX$w_buff1=0, __unbuffered_p0_EAX$w_buff1_used=0, __unbuffered_p0_EAX=2, __unbuffered_p0_EBX=0, __unbuffered_p2_EAX=1, arg={0:0}, 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=2, 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}] [L18] 0 __assert_fail ("0", "safe002_power.oepc.c", 9, __extension__ __PRETTY_FUNCTION__) VAL [\old(arg)={0:0}, \old(arg)={0:0}, \old(arg)={0:0}, __unbuffered_cnt=3, __unbuffered_p0_EAX$flush_delayed=0, __unbuffered_p0_EAX$mem_tmp=0, __unbuffered_p0_EAX$r_buff0_thd0=0, __unbuffered_p0_EAX$r_buff0_thd1=0, __unbuffered_p0_EAX$r_buff0_thd2=0, __unbuffered_p0_EAX$r_buff0_thd3=0, __unbuffered_p0_EAX$r_buff1_thd0=0, __unbuffered_p0_EAX$r_buff1_thd1=0, __unbuffered_p0_EAX$r_buff1_thd2=0, __unbuffered_p0_EAX$r_buff1_thd3=0, __unbuffered_p0_EAX$read_delayed=1, __unbuffered_p0_EAX$read_delayed_var={3:0}, __unbuffered_p0_EAX$w_buff0=0, __unbuffered_p0_EAX$w_buff0_used=0, __unbuffered_p0_EAX$w_buff1=0, __unbuffered_p0_EAX$w_buff1_used=0, __unbuffered_p0_EAX=2, __unbuffered_p0_EBX=0, __unbuffered_p2_EAX=1, arg={0:0}, 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=2, 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}] - 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: -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: 851]: Unable to prove that all allocated memory was freed Unable to prove that all allocated memory was freed Reason: Not analyzed. - UnprovableResult [Line: 856]: 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: 858]: 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: 854]: 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, 164 locations, 103 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: 29.1s, OverallIterations: 15, TraceHistogramMax: 1, PathProgramHistogramMax: 6, EmptinessCheckTime: 0.0s, AutomataDifference: 16.7s, DeadEndRemovalTime: 0.0s, HoareAnnotationTime: 0.0s, InitialAbstractionConstructionTime: 0.1s, HoareTripleCheckerStatistics: 0 mSolverCounterUnknown, 761 SdHoareTripleChecker+Valid, 5.1s IncrementalHoareTripleChecker+Time, 0 mSdLazyCounter, 706 mSDsluCounter, 307 SdHoareTripleChecker+Invalid, 4.5s Time, 0 mProtectedAction, 0 SdHoareTripleChecker+Unchecked, 0 IncrementalHoareTripleChecker+Unchecked, 278 mSDsCounter, 97 IncrementalHoareTripleChecker+Valid, 0 mProtectedPredicate, 2166 IncrementalHoareTripleChecker+Invalid, 2263 SdHoareTripleChecker+Unknown, 0 mSolverCounterNotChecked, 97 mSolverCounterUnsat, 29 mSDtfsCounter, 2166 mSolverCounterSat, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Unknown, PredicateUnifierStatistics: 0 DeclaredPredicates, 285 GetRequests, 202 SyntacticMatches, 0 SemanticMatches, 83 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 84 ImplicationChecksByTransitivity, 2.2s Time, 0.0s BasicInterpolantAutomatonTime, BiggestAbstraction: size=303occurred in iteration=14, InterpolantAutomatonStates: 76, 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.8s SatisfiabilityAnalysisTime, 4.6s InterpolantComputationTime, 300 NumberOfCodeBlocks, 300 NumberOfCodeBlocksAsserted, 16 NumberOfCheckSat, 256 ConstructedInterpolants, 0 QuantifiedInterpolants, 2606 SizeOfPredicates, 56 NumberOfNonLiveVariables, 2341 ConjunctsInSsa, 136 ConjunctsInUnsatCore, 14 InterpolantComputations, 14 PerfectInterpolantSequences, 0/0 InterpolantCoveringCapability, INVARIANT_SYNTHESIS: No data available, INTERPOLANT_CONSOLIDATION: No data available, ABSTRACT_INTERPRETATION: No data available, PDR: No data available, ACCELERATED_INTERPOLATION: No data available, SIFA: No data available, ReuseStatistics: No data available RESULT: Ultimate could not prove your program: unable to determine feasibility of some traces [2024-11-13 14:08:49,043 INFO L540 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_d6c6bbac-8b87-4a12-bfcd-06c657a41f19/bin/uautomizer-verify-qhAvR1uOyd/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 (1)] Forceful destruction successful, exit code 0 Received shutdown request... --- End real Ultimate output --- Execution finished normally Writing output log to file Ultimate.log Result: UNKNOWN: Overapproximated counterexample