./Ultimate.py --spec ../../sv-benchmarks/c/properties/valid-memsafety.prp --file ../../sv-benchmarks/c/pthread-wmm/safe011_power.opt_pso.opt.i --full-output --architecture 32bit -------------------------------------------------------------------------------- Checking for memory safety (deref-memtrack) Using default analysis Version a0165632 Calling Ultimate with: /usr/lib/jvm/java-1.11.0-openjdk-amd64/bin/java -Dosgi.configuration.area=/tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_dbfb2896-8405-4c25-b1c4-f34e4377ca0b/bin/uautomizer-verify-jihMAELWvX/data/config -Xmx15G -Xms4m -jar /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_dbfb2896-8405-4c25-b1c4-f34e4377ca0b/bin/uautomizer-verify-jihMAELWvX/plugins/org.eclipse.equinox.launcher_1.5.800.v20200727-1323.jar -data @noDefault -ultimatedata /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_dbfb2896-8405-4c25-b1c4-f34e4377ca0b/bin/uautomizer-verify-jihMAELWvX/data -tc /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_dbfb2896-8405-4c25-b1c4-f34e4377ca0b/bin/uautomizer-verify-jihMAELWvX/config/AutomizerMemDerefMemtrack.xml -i ../../sv-benchmarks/c/pthread-wmm/safe011_power.opt_pso.opt.i -s /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_dbfb2896-8405-4c25-b1c4-f34e4377ca0b/bin/uautomizer-verify-jihMAELWvX/config/svcomp-DerefFreeMemtrack-32bit-Automizer_Default.epf --cacsl2boogietranslator.entry.function main --witnessprinter.witness.directory /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_dbfb2896-8405-4c25-b1c4-f34e4377ca0b/bin/uautomizer-verify-jihMAELWvX --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 bdec055c4bfc04b6b0c3fc918f7b96def91dcb331178222835136af29a7feef5 --- Real Ultimate output --- This is Ultimate 0.2.5-dev-a016563 [2024-11-08 19:11:24,962 INFO L188 SettingsManager]: Resetting all preferences to default values... [2024-11-08 19:11:25,023 INFO L114 SettingsManager]: Loading settings from /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_dbfb2896-8405-4c25-b1c4-f34e4377ca0b/bin/uautomizer-verify-jihMAELWvX/config/svcomp-DerefFreeMemtrack-32bit-Automizer_Default.epf [2024-11-08 19:11:25,028 WARN L101 SettingsManager]: Preference file contains the following unknown settings: [2024-11-08 19:11:25,029 WARN L103 SettingsManager]: * de.uni_freiburg.informatik.ultimate.core.Log level for class [2024-11-08 19:11:25,072 INFO L130 SettingsManager]: Preferences different from defaults after loading the file: [2024-11-08 19:11:25,073 INFO L151 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2024-11-08 19:11:25,074 INFO L153 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2024-11-08 19:11:25,075 INFO L151 SettingsManager]: Preferences of Boogie Preprocessor differ from their defaults: [2024-11-08 19:11:25,076 INFO L153 SettingsManager]: * Use memory slicer=true [2024-11-08 19:11:25,077 INFO L151 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2024-11-08 19:11:25,077 INFO L153 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2024-11-08 19:11:25,078 INFO L151 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2024-11-08 19:11:25,079 INFO L153 SettingsManager]: * Create parallel compositions if possible=false [2024-11-08 19:11:25,079 INFO L153 SettingsManager]: * Use SBE=true [2024-11-08 19:11:25,080 INFO L151 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2024-11-08 19:11:25,080 INFO L153 SettingsManager]: * sizeof long=4 [2024-11-08 19:11:25,080 INFO L153 SettingsManager]: * Overapproximate operations on floating types=true [2024-11-08 19:11:25,084 INFO L153 SettingsManager]: * sizeof POINTER=4 [2024-11-08 19:11:25,084 INFO L153 SettingsManager]: * Check division by zero=IGNORE [2024-11-08 19:11:25,085 INFO L153 SettingsManager]: * Check for the main procedure if all allocated memory was freed=true [2024-11-08 19:11:25,085 INFO L153 SettingsManager]: * Bitprecise bitfields=true [2024-11-08 19:11:25,089 INFO L153 SettingsManager]: * SV-COMP memtrack compatibility mode=true [2024-11-08 19:11:25,090 INFO L153 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2024-11-08 19:11:25,090 INFO L153 SettingsManager]: * Adapt memory model on pointer casts if necessary=true [2024-11-08 19:11:25,090 INFO L153 SettingsManager]: * Allow undefined functions=false [2024-11-08 19:11:25,091 INFO L153 SettingsManager]: * Check unreachability of reach_error function=false [2024-11-08 19:11:25,091 INFO L153 SettingsManager]: * sizeof long double=12 [2024-11-08 19:11:25,091 INFO L153 SettingsManager]: * Use constant arrays=true [2024-11-08 19:11:25,091 INFO L151 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2024-11-08 19:11:25,092 INFO L153 SettingsManager]: * Size of a code block=SequenceOfStatements [2024-11-08 19:11:25,092 INFO L153 SettingsManager]: * Only consider context switches at boundaries of atomic blocks=true [2024-11-08 19:11:25,092 INFO L153 SettingsManager]: * SMT solver=External_DefaultMode [2024-11-08 19:11:25,092 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2024-11-08 19:11:25,093 INFO L151 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2024-11-08 19:11:25,093 INFO L153 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2024-11-08 19:11:25,094 INFO L153 SettingsManager]: * Trace refinement strategy=CAMEL [2024-11-08 19:11:25,094 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2024-11-08 19:11:25,094 INFO L153 SettingsManager]: * Apply one-shot large block encoding in concurrent analysis=false [2024-11-08 19:11:25,094 INFO L153 SettingsManager]: * Automaton type used in concurrency analysis=PETRI_NET [2024-11-08 19:11:25,095 INFO L153 SettingsManager]: * Order on configurations for Petri net unfoldings=DBO [2024-11-08 19:11:25,095 INFO L153 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2024-11-08 19:11:25,095 INFO L153 SettingsManager]: * Looper check in Petri net analysis=SEMANTIC WARNING: An illegal reflective access operation has occurred WARNING: Illegal reflective access by com.sun.xml.bind.v2.runtime.reflect.opt.Injector$1 (file:/tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_dbfb2896-8405-4c25-b1c4-f34e4377ca0b/bin/uautomizer-verify-jihMAELWvX/plugins/com.sun.xml.bind_2.2.0.v201505121915.jar) to method java.lang.ClassLoader.defineClass(java.lang.String,byte[],int,int) WARNING: Please consider reporting this to the maintainers of com.sun.xml.bind.v2.runtime.reflect.opt.Injector$1 WARNING: Use --illegal-access=warn to enable warnings of further illegal reflective access operations WARNING: All illegal access operations will be denied in a future release Applying setting for plugin de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator: Entry function -> main Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Witness directory -> /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_dbfb2896-8405-4c25-b1c4-f34e4377ca0b/bin/uautomizer-verify-jihMAELWvX 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 -> bdec055c4bfc04b6b0c3fc918f7b96def91dcb331178222835136af29a7feef5 [2024-11-08 19:11:25,364 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2024-11-08 19:11:25,412 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2024-11-08 19:11:25,416 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2024-11-08 19:11:25,418 INFO L270 PluginConnector]: Initializing CDTParser... [2024-11-08 19:11:25,419 INFO L274 PluginConnector]: CDTParser initialized [2024-11-08 19:11:25,420 INFO L431 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_dbfb2896-8405-4c25-b1c4-f34e4377ca0b/bin/uautomizer-verify-jihMAELWvX/../../sv-benchmarks/c/pthread-wmm/safe011_power.opt_pso.opt.i Unable to find full path for "g++" [2024-11-08 19:11:27,552 INFO L533 CDTParser]: Created temporary CDT project at NULL [2024-11-08 19:11:27,847 INFO L384 CDTParser]: Found 1 translation units. [2024-11-08 19:11:27,848 INFO L180 CDTParser]: Scanning /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_dbfb2896-8405-4c25-b1c4-f34e4377ca0b/sv-benchmarks/c/pthread-wmm/safe011_power.opt_pso.opt.i [2024-11-08 19:11:27,867 INFO L427 CDTParser]: About to delete temporary CDT project at /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_dbfb2896-8405-4c25-b1c4-f34e4377ca0b/bin/uautomizer-verify-jihMAELWvX/data/e615b7dc9/e654cdd69aee42e1abc32ab115eaf2ee/FLAGcc287d315 [2024-11-08 19:11:28,157 INFO L435 CDTParser]: Successfully deleted /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_dbfb2896-8405-4c25-b1c4-f34e4377ca0b/bin/uautomizer-verify-jihMAELWvX/data/e615b7dc9/e654cdd69aee42e1abc32ab115eaf2ee [2024-11-08 19:11:28,160 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2024-11-08 19:11:28,162 INFO L133 ToolchainWalker]: Walking toolchain with 6 elements. [2024-11-08 19:11:28,163 INFO L112 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2024-11-08 19:11:28,163 INFO L270 PluginConnector]: Initializing CACSL2BoogieTranslator... [2024-11-08 19:11:28,170 INFO L274 PluginConnector]: CACSL2BoogieTranslator initialized [2024-11-08 19:11:28,171 INFO L184 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 08.11 07:11:28" (1/1) ... [2024-11-08 19:11:28,172 INFO L204 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@2eb14403 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.11 07:11:28, skipping insertion in model container [2024-11-08 19:11:28,172 INFO L184 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 08.11 07:11:28" (1/1) ... [2024-11-08 19:11:28,248 INFO L175 MainTranslator]: Built tables and reachable declarations [2024-11-08 19:11:28,852 INFO L210 PostProcessor]: Analyzing one entry point: main [2024-11-08 19:11:28,871 INFO L200 MainTranslator]: Completed pre-run [2024-11-08 19:11:28,991 INFO L210 PostProcessor]: Analyzing one entry point: main [2024-11-08 19:11:29,096 INFO L204 MainTranslator]: Completed translation [2024-11-08 19:11:29,097 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.11 07:11:29 WrapperNode [2024-11-08 19:11:29,098 INFO L131 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2024-11-08 19:11:29,099 INFO L112 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2024-11-08 19:11:29,099 INFO L270 PluginConnector]: Initializing Boogie Procedure Inliner... [2024-11-08 19:11:29,099 INFO L274 PluginConnector]: Boogie Procedure Inliner initialized [2024-11-08 19:11:29,109 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.11 07:11:29" (1/1) ... [2024-11-08 19:11:29,136 INFO L184 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.11 07:11:29" (1/1) ... [2024-11-08 19:11:29,188 INFO L138 Inliner]: procedures = 175, calls = 43, calls flagged for inlining = 6, calls inlined = 7, statements flattened = 137 [2024-11-08 19:11:29,188 INFO L131 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2024-11-08 19:11:29,189 INFO L112 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2024-11-08 19:11:29,189 INFO L270 PluginConnector]: Initializing Boogie Preprocessor... [2024-11-08 19:11:29,189 INFO L274 PluginConnector]: Boogie Preprocessor initialized [2024-11-08 19:11:29,207 INFO L184 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.11 07:11:29" (1/1) ... [2024-11-08 19:11:29,207 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.11 07:11:29" (1/1) ... [2024-11-08 19:11:29,215 INFO L184 PluginConnector]: Executing the observer MemorySlicer from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.11 07:11:29" (1/1) ... [2024-11-08 19:11:29,252 INFO L175 MemorySlicer]: Split 2 memory accesses to 1 slices as follows [2]. 100 percent of accesses are in the largest equivalence class. The 2 initializations are split as follows [2]. The 0 writes are split as follows [0]. [2024-11-08 19:11:29,253 INFO L184 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.11 07:11:29" (1/1) ... [2024-11-08 19:11:29,253 INFO L184 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.11 07:11:29" (1/1) ... [2024-11-08 19:11:29,260 INFO L184 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.11 07:11:29" (1/1) ... [2024-11-08 19:11:29,262 INFO L184 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.11 07:11:29" (1/1) ... [2024-11-08 19:11:29,264 INFO L184 PluginConnector]: Executing the observer LTLStepAnnotator from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.11 07:11:29" (1/1) ... [2024-11-08 19:11:29,266 INFO L184 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.11 07:11:29" (1/1) ... [2024-11-08 19:11:29,269 INFO L131 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2024-11-08 19:11:29,270 INFO L112 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2024-11-08 19:11:29,271 INFO L270 PluginConnector]: Initializing RCFGBuilder... [2024-11-08 19:11:29,271 INFO L274 PluginConnector]: RCFGBuilder initialized [2024-11-08 19:11:29,272 INFO L184 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.11 07:11:29" (1/1) ... [2024-11-08 19:11:29,287 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2024-11-08 19:11:29,302 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_dbfb2896-8405-4c25-b1c4-f34e4377ca0b/bin/uautomizer-verify-jihMAELWvX/z3 [2024-11-08 19:11:29,320 INFO L229 MonitoredProcess]: Starting monitored process 1 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_dbfb2896-8405-4c25-b1c4-f34e4377ca0b/bin/uautomizer-verify-jihMAELWvX/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 (exit command is (exit), workingDir is null) [2024-11-08 19:11:29,325 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_dbfb2896-8405-4c25-b1c4-f34e4377ca0b/bin/uautomizer-verify-jihMAELWvX/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 (1)] Waiting until timeout for monitored process [2024-11-08 19:11:29,360 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_atomic_begin [2024-11-08 19:11:29,360 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2024-11-08 19:11:29,360 INFO L130 BoogieDeclarations]: Found specification of procedure P0 [2024-11-08 19:11:29,360 INFO L138 BoogieDeclarations]: Found implementation of procedure P0 [2024-11-08 19:11:29,362 INFO L130 BoogieDeclarations]: Found specification of procedure P1 [2024-11-08 19:11:29,362 INFO L138 BoogieDeclarations]: Found implementation of procedure P1 [2024-11-08 19:11:29,362 INFO L130 BoogieDeclarations]: Found specification of procedure P2 [2024-11-08 19:11:29,362 INFO L138 BoogieDeclarations]: Found implementation of procedure P2 [2024-11-08 19:11:29,362 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#0 [2024-11-08 19:11:29,363 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_atomic_end [2024-11-08 19:11:29,363 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2024-11-08 19:11:29,363 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2024-11-08 19:11:29,368 WARN L207 CfgBuilder]: User set CodeBlockSize to SequenceOfStatements but program contains fork statements. Overwriting the user preferences and setting CodeBlockSize to OneNontrivialStatement. [2024-11-08 19:11:29,575 INFO L238 CfgBuilder]: Building ICFG [2024-11-08 19:11:29,578 INFO L264 CfgBuilder]: Building CFG for each procedure with an implementation [2024-11-08 19:11:30,079 INFO L283 CfgBuilder]: Omitted future-live optimization because the input is a concurrent program. [2024-11-08 19:11:30,079 INFO L287 CfgBuilder]: Performing block encoding [2024-11-08 19:11:30,426 INFO L311 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2024-11-08 19:11:30,426 INFO L316 CfgBuilder]: Removed 0 assume(true) statements. [2024-11-08 19:11:30,427 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 08.11 07:11:30 BoogieIcfgContainer [2024-11-08 19:11:30,427 INFO L131 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2024-11-08 19:11:30,429 INFO L112 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2024-11-08 19:11:30,430 INFO L270 PluginConnector]: Initializing TraceAbstraction... [2024-11-08 19:11:30,433 INFO L274 PluginConnector]: TraceAbstraction initialized [2024-11-08 19:11:30,434 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 08.11 07:11:28" (1/3) ... [2024-11-08 19:11:30,434 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@2e258eea and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 08.11 07:11:30, skipping insertion in model container [2024-11-08 19:11:30,435 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.11 07:11:29" (2/3) ... [2024-11-08 19:11:30,435 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@2e258eea and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 08.11 07:11:30, skipping insertion in model container [2024-11-08 19:11:30,435 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 08.11 07:11:30" (3/3) ... [2024-11-08 19:11:30,437 INFO L112 eAbstractionObserver]: Analyzing ICFG safe011_power.opt_pso.opt.i [2024-11-08 19:11:30,455 INFO L214 ceAbstractionStarter]: Automizer settings: Hoare:None NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2024-11-08 19:11:30,455 INFO L154 ceAbstractionStarter]: Applying trace abstraction to program that has 3 error locations. [2024-11-08 19:11:30,456 INFO L489 ceAbstractionStarter]: Constructing petrified ICFG for 1 thread instances. [2024-11-08 19:11:30,524 INFO L143 ThreadInstanceAdder]: Constructed 0 joinOtherThreadTransitions. [2024-11-08 19:11:30,560 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 52 places, 44 transitions, 100 flow [2024-11-08 19:11:30,599 INFO L124 PetriNetUnfolderBase]: 2/41 cut-off events. [2024-11-08 19:11:30,600 INFO L125 PetriNetUnfolderBase]: For 0/0 co-relation queries the response was YES. [2024-11-08 19:11:30,603 INFO L83 FinitePrefix]: Finished finitePrefix Result has 51 conditions, 41 events. 2/41 cut-off events. For 0/0 co-relation queries the response was YES. Maximal size of possible extension queue 5. Compared 78 event pairs, 0 based on Foata normal form. 0/36 useless extension candidates. Maximal degree in co-relation 43. Up to 2 conditions per place. [2024-11-08 19:11:30,603 INFO L82 GeneralOperation]: Start removeDead. Operand has 52 places, 44 transitions, 100 flow [2024-11-08 19:11:30,611 INFO L88 GeneralOperation]: Finished RemoveDead, result has has 49 places, 41 transitions, 91 flow [2024-11-08 19:11:30,631 INFO L332 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2024-11-08 19:11:30,642 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;@21579829, mLbeIndependenceSettings=[IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=false, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2024-11-08 19:11:30,642 INFO L334 AbstractCegarLoop]: Starting to check reachability of 7 error locations. [2024-11-08 19:11:30,649 INFO L185 PetriNetUnfolderBase]: Found word, exiting Unfolder. [2024-11-08 19:11:30,649 INFO L124 PetriNetUnfolderBase]: 0/10 cut-off events. [2024-11-08 19:11:30,650 INFO L125 PetriNetUnfolderBase]: For 0/0 co-relation queries the response was YES. [2024-11-08 19:11:30,650 INFO L196 CegarLoopForPetriNet]: Found error trace [2024-11-08 19:11:30,651 INFO L204 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1] [2024-11-08 19:11:30,651 INFO L396 AbstractCegarLoop]: === Iteration 1 === Targeting P1Err0ASSERT_VIOLATIONMEMORY_LEAK === [P1Err0ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr1ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr0ASSERT_VIOLATIONMEMORY_LEAK (and 4 more)] === [2024-11-08 19:11:30,656 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-08 19:11:30,657 INFO L85 PathProgramCache]: Analyzing trace with hash -1414063623, now seen corresponding path program 1 times [2024-11-08 19:11:30,668 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-08 19:11:30,668 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1511080576] [2024-11-08 19:11:30,669 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-08 19:11:30,670 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-08 19:11:30,814 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 19:11:31,268 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-08 19:11:31,269 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-08 19:11:31,269 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1511080576] [2024-11-08 19:11:31,270 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1511080576] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-08 19:11:31,270 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-08 19:11:31,271 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [1] imperfect sequences [] total 1 [2024-11-08 19:11:31,273 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [219059187] [2024-11-08 19:11:31,274 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-08 19:11:31,284 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2024-11-08 19:11:31,291 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-08 19:11:31,326 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-11-08 19:11:31,327 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-11-08 19:11:31,329 INFO L467 CegarLoopForPetriNet]: Number of universal loopers: 19 out of 44 [2024-11-08 19:11:31,333 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 49 places, 41 transitions, 91 flow. Second operand has 3 states, 3 states have (on average 20.666666666666668) internal successors, (62), 3 states have internal predecessors, (62), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-08 19:11:31,334 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-11-08 19:11:31,334 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 19 of 44 [2024-11-08 19:11:31,336 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-11-08 19:11:32,041 INFO L124 PetriNetUnfolderBase]: 678/1271 cut-off events. [2024-11-08 19:11:32,041 INFO L125 PetriNetUnfolderBase]: For 9/9 co-relation queries the response was YES. [2024-11-08 19:11:32,049 INFO L83 FinitePrefix]: Finished finitePrefix Result has 2341 conditions, 1271 events. 678/1271 cut-off events. For 9/9 co-relation queries the response was YES. Maximal size of possible extension queue 94. Compared 8174 event pairs, 108 based on Foata normal form. 72/1330 useless extension candidates. Maximal degree in co-relation 2330. Up to 832 conditions per place. [2024-11-08 19:11:32,061 INFO L140 encePairwiseOnDemand]: 39/44 looper letters, 31 selfloop transitions, 2 changer transitions 2/51 dead transitions. [2024-11-08 19:11:32,062 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 49 places, 51 transitions, 184 flow [2024-11-08 19:11:32,064 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-11-08 19:11:32,067 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2024-11-08 19:11:32,076 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 97 transitions. [2024-11-08 19:11:32,078 INFO L512 CegarLoopForPetriNet]: DFA transition density 0.7348484848484849 [2024-11-08 19:11:32,081 INFO L175 Difference]: Start difference. First operand has 49 places, 41 transitions, 91 flow. Second operand 3 states and 97 transitions. [2024-11-08 19:11:32,082 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 49 places, 51 transitions, 184 flow [2024-11-08 19:11:32,086 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 46 places, 51 transitions, 180 flow, removed 0 selfloop flow, removed 3 redundant places. [2024-11-08 19:11:32,091 INFO L231 Difference]: Finished difference. Result has 46 places, 36 transitions, 82 flow [2024-11-08 19:11:32,095 INFO L260 CegarLoopForPetriNet]: {PETRI_ALPHABET=44, PETRI_DIFFERENCE_MINUEND_FLOW=80, PETRI_DIFFERENCE_MINUEND_PLACES=44, 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=3, PETRI_FLOW=82, PETRI_PLACES=46, PETRI_TRANSITIONS=36} [2024-11-08 19:11:32,100 INFO L277 CegarLoopForPetriNet]: 49 programPoint places, -3 predicate places. [2024-11-08 19:11:32,100 INFO L471 AbstractCegarLoop]: Abstraction has has 46 places, 36 transitions, 82 flow [2024-11-08 19:11:32,101 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 20.666666666666668) internal successors, (62), 3 states have internal predecessors, (62), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-08 19:11:32,101 INFO L196 CegarLoopForPetriNet]: Found error trace [2024-11-08 19:11:32,101 INFO L204 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-08 19:11:32,102 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable0 [2024-11-08 19:11:32,102 INFO L396 AbstractCegarLoop]: === Iteration 2 === Targeting ULTIMATE.startErr1ASSERT_VIOLATIONMEMORY_LEAK === [P1Err0ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr1ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr0ASSERT_VIOLATIONMEMORY_LEAK (and 4 more)] === [2024-11-08 19:11:32,103 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-08 19:11:32,103 INFO L85 PathProgramCache]: Analyzing trace with hash -533648435, now seen corresponding path program 1 times [2024-11-08 19:11:32,103 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-08 19:11:32,104 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [417142047] [2024-11-08 19:11:32,104 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-08 19:11:32,104 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-08 19:11:32,156 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 19:11:32,295 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-08 19:11:32,295 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-08 19:11:32,295 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [417142047] [2024-11-08 19:11:32,296 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [417142047] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-08 19:11:32,296 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-08 19:11:32,296 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [1] imperfect sequences [] total 1 [2024-11-08 19:11:32,296 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [618627289] [2024-11-08 19:11:32,297 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-08 19:11:32,298 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2024-11-08 19:11:32,298 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-08 19:11:32,299 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-11-08 19:11:32,299 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-11-08 19:11:32,300 INFO L467 CegarLoopForPetriNet]: Number of universal loopers: 18 out of 44 [2024-11-08 19:11:32,300 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 46 places, 36 transitions, 82 flow. Second operand has 3 states, 3 states have (on average 22.333333333333332) internal successors, (67), 3 states have internal predecessors, (67), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-08 19:11:32,301 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-11-08 19:11:32,301 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 18 of 44 [2024-11-08 19:11:32,301 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-11-08 19:11:32,616 INFO L124 PetriNetUnfolderBase]: 603/1127 cut-off events. [2024-11-08 19:11:32,616 INFO L125 PetriNetUnfolderBase]: For 78/78 co-relation queries the response was YES. [2024-11-08 19:11:32,622 INFO L83 FinitePrefix]: Finished finitePrefix Result has 2163 conditions, 1127 events. 603/1127 cut-off events. For 78/78 co-relation queries the response was YES. Maximal size of possible extension queue 83. Compared 7146 event pairs, 603 based on Foata normal form. 36/1129 useless extension candidates. Maximal degree in co-relation 2153. Up to 922 conditions per place. [2024-11-08 19:11:32,629 INFO L140 encePairwiseOnDemand]: 42/44 looper letters, 18 selfloop transitions, 1 changer transitions 1/35 dead transitions. [2024-11-08 19:11:32,630 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 46 places, 35 transitions, 120 flow [2024-11-08 19:11:32,631 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-11-08 19:11:32,631 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2024-11-08 19:11:32,632 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 75 transitions. [2024-11-08 19:11:32,632 INFO L512 CegarLoopForPetriNet]: DFA transition density 0.5681818181818182 [2024-11-08 19:11:32,633 INFO L175 Difference]: Start difference. First operand has 46 places, 36 transitions, 82 flow. Second operand 3 states and 75 transitions. [2024-11-08 19:11:32,633 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 46 places, 35 transitions, 120 flow [2024-11-08 19:11:32,636 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 44 places, 35 transitions, 116 flow, removed 0 selfloop flow, removed 2 redundant places. [2024-11-08 19:11:32,638 INFO L231 Difference]: Finished difference. Result has 44 places, 34 transitions, 76 flow [2024-11-08 19:11:32,638 INFO L260 CegarLoopForPetriNet]: {PETRI_ALPHABET=44, PETRI_DIFFERENCE_MINUEND_FLOW=76, PETRI_DIFFERENCE_MINUEND_PLACES=42, 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=76, PETRI_PLACES=44, PETRI_TRANSITIONS=34} [2024-11-08 19:11:32,639 INFO L277 CegarLoopForPetriNet]: 49 programPoint places, -5 predicate places. [2024-11-08 19:11:32,639 INFO L471 AbstractCegarLoop]: Abstraction has has 44 places, 34 transitions, 76 flow [2024-11-08 19:11:32,641 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 22.333333333333332) internal successors, (67), 3 states have internal predecessors, (67), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-08 19:11:32,641 INFO L196 CegarLoopForPetriNet]: Found error trace [2024-11-08 19:11:32,641 INFO L204 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-08 19:11:32,642 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1 [2024-11-08 19:11:32,643 INFO L396 AbstractCegarLoop]: === Iteration 3 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONMEMORY_LEAK === [P1Err0ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr1ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr0ASSERT_VIOLATIONMEMORY_LEAK (and 4 more)] === [2024-11-08 19:11:32,645 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-08 19:11:32,646 INFO L85 PathProgramCache]: Analyzing trace with hash -533646914, now seen corresponding path program 1 times [2024-11-08 19:11:32,646 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-08 19:11:32,650 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [189098991] [2024-11-08 19:11:32,650 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-08 19:11:32,650 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-08 19:11:32,790 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 19:11:33,287 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-08 19:11:33,288 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-08 19:11:33,288 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [189098991] [2024-11-08 19:11:33,288 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [189098991] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-08 19:11:33,288 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-08 19:11:33,288 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2024-11-08 19:11:33,289 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1543328134] [2024-11-08 19:11:33,289 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-08 19:11:33,289 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2024-11-08 19:11:33,290 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-08 19:11:33,290 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2024-11-08 19:11:33,293 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2024-11-08 19:11:33,303 INFO L467 CegarLoopForPetriNet]: Number of universal loopers: 17 out of 44 [2024-11-08 19:11:33,305 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 44 places, 34 transitions, 76 flow. Second operand has 5 states, 5 states have (on average 19.4) internal successors, (97), 5 states have internal predecessors, (97), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-08 19:11:33,305 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-11-08 19:11:33,307 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 17 of 44 [2024-11-08 19:11:33,308 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-11-08 19:11:34,079 INFO L124 PetriNetUnfolderBase]: 983/1723 cut-off events. [2024-11-08 19:11:34,079 INFO L125 PetriNetUnfolderBase]: For 0/0 co-relation queries the response was YES. [2024-11-08 19:11:34,084 INFO L83 FinitePrefix]: Finished finitePrefix Result has 3253 conditions, 1723 events. 983/1723 cut-off events. For 0/0 co-relation queries the response was YES. Maximal size of possible extension queue 127. Compared 11036 event pairs, 167 based on Foata normal form. 0/1677 useless extension candidates. Maximal degree in co-relation 3247. Up to 790 conditions per place. [2024-11-08 19:11:34,092 INFO L140 encePairwiseOnDemand]: 38/44 looper letters, 26 selfloop transitions, 2 changer transitions 39/80 dead transitions. [2024-11-08 19:11:34,093 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 50 places, 80 transitions, 302 flow [2024-11-08 19:11:34,094 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2024-11-08 19:11:34,095 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 8 states. [2024-11-08 19:11:34,096 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 8 states to 8 states and 205 transitions. [2024-11-08 19:11:34,099 INFO L512 CegarLoopForPetriNet]: DFA transition density 0.5823863636363636 [2024-11-08 19:11:34,101 INFO L175 Difference]: Start difference. First operand has 44 places, 34 transitions, 76 flow. Second operand 8 states and 205 transitions. [2024-11-08 19:11:34,101 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 50 places, 80 transitions, 302 flow [2024-11-08 19:11:34,102 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 49 places, 80 transitions, 301 flow, removed 0 selfloop flow, removed 1 redundant places. [2024-11-08 19:11:34,106 INFO L231 Difference]: Finished difference. Result has 54 places, 33 transitions, 89 flow [2024-11-08 19:11:34,106 INFO L260 CegarLoopForPetriNet]: {PETRI_ALPHABET=44, PETRI_DIFFERENCE_MINUEND_FLOW=75, PETRI_DIFFERENCE_MINUEND_PLACES=42, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=34, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=2, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=32, PETRI_DIFFERENCE_SUBTRAHEND_STATES=8, PETRI_FLOW=89, PETRI_PLACES=54, PETRI_TRANSITIONS=33} [2024-11-08 19:11:34,108 INFO L277 CegarLoopForPetriNet]: 49 programPoint places, 5 predicate places. [2024-11-08 19:11:34,109 INFO L471 AbstractCegarLoop]: Abstraction has has 54 places, 33 transitions, 89 flow [2024-11-08 19:11:34,110 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 19.4) internal successors, (97), 5 states have internal predecessors, (97), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-08 19:11:34,110 INFO L196 CegarLoopForPetriNet]: Found error trace [2024-11-08 19:11:34,110 INFO L204 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-08 19:11:34,110 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2 [2024-11-08 19:11:34,111 INFO L396 AbstractCegarLoop]: === Iteration 4 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONMEMORY_LEAK === [P1Err0ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr1ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr0ASSERT_VIOLATIONMEMORY_LEAK (and 4 more)] === [2024-11-08 19:11:34,112 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-08 19:11:34,112 INFO L85 PathProgramCache]: Analyzing trace with hash 1805066013, now seen corresponding path program 1 times [2024-11-08 19:11:34,113 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-08 19:11:34,113 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [76613904] [2024-11-08 19:11:34,113 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-08 19:11:34,114 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-08 19:11:34,164 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 19:11:34,603 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-08 19:11:34,603 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-08 19:11:34,604 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [76613904] [2024-11-08 19:11:34,604 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [76613904] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-08 19:11:34,604 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-08 19:11:34,604 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2024-11-08 19:11:34,604 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [431479324] [2024-11-08 19:11:34,605 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-08 19:11:34,605 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2024-11-08 19:11:34,605 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-08 19:11:34,606 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2024-11-08 19:11:34,608 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2024-11-08 19:11:34,622 INFO L467 CegarLoopForPetriNet]: Number of universal loopers: 16 out of 44 [2024-11-08 19:11:34,623 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 54 places, 33 transitions, 89 flow. Second operand has 6 states, 6 states have (on average 18.166666666666668) internal successors, (109), 6 states have internal predecessors, (109), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-08 19:11:34,623 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-11-08 19:11:34,623 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 16 of 44 [2024-11-08 19:11:34,624 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-11-08 19:11:35,363 INFO L124 PetriNetUnfolderBase]: 1064/1849 cut-off events. [2024-11-08 19:11:35,364 INFO L125 PetriNetUnfolderBase]: For 249/249 co-relation queries the response was YES. [2024-11-08 19:11:35,369 INFO L83 FinitePrefix]: Finished finitePrefix Result has 3907 conditions, 1849 events. 1064/1849 cut-off events. For 249/249 co-relation queries the response was YES. Maximal size of possible extension queue 136. Compared 11952 event pairs, 233 based on Foata normal form. 45/1878 useless extension candidates. Maximal degree in co-relation 3895. Up to 577 conditions per place. [2024-11-08 19:11:35,374 INFO L140 encePairwiseOnDemand]: 38/44 looper letters, 32 selfloop transitions, 3 changer transitions 33/80 dead transitions. [2024-11-08 19:11:35,375 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 55 places, 80 transitions, 336 flow [2024-11-08 19:11:35,375 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2024-11-08 19:11:35,375 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 8 states. [2024-11-08 19:11:35,376 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 8 states to 8 states and 198 transitions. [2024-11-08 19:11:35,377 INFO L512 CegarLoopForPetriNet]: DFA transition density 0.5625 [2024-11-08 19:11:35,377 INFO L175 Difference]: Start difference. First operand has 54 places, 33 transitions, 89 flow. Second operand 8 states and 198 transitions. [2024-11-08 19:11:35,377 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 55 places, 80 transitions, 336 flow [2024-11-08 19:11:35,396 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 49 places, 80 transitions, 314 flow, removed 8 selfloop flow, removed 6 redundant places. [2024-11-08 19:11:35,397 INFO L231 Difference]: Finished difference. Result has 55 places, 33 transitions, 99 flow [2024-11-08 19:11:35,398 INFO L260 CegarLoopForPetriNet]: {PETRI_ALPHABET=44, PETRI_DIFFERENCE_MINUEND_FLOW=77, PETRI_DIFFERENCE_MINUEND_PLACES=42, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=33, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=3, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=30, PETRI_DIFFERENCE_SUBTRAHEND_STATES=8, PETRI_FLOW=99, PETRI_PLACES=55, PETRI_TRANSITIONS=33} [2024-11-08 19:11:35,398 INFO L277 CegarLoopForPetriNet]: 49 programPoint places, 6 predicate places. [2024-11-08 19:11:35,399 INFO L471 AbstractCegarLoop]: Abstraction has has 55 places, 33 transitions, 99 flow [2024-11-08 19:11:35,399 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 18.166666666666668) internal successors, (109), 6 states have internal predecessors, (109), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-08 19:11:35,399 INFO L196 CegarLoopForPetriNet]: Found error trace [2024-11-08 19:11:35,400 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-08 19:11:35,400 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable3 [2024-11-08 19:11:35,400 INFO L396 AbstractCegarLoop]: === Iteration 5 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONMEMORY_LEAK === [P1Err0ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr1ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr0ASSERT_VIOLATIONMEMORY_LEAK (and 4 more)] === [2024-11-08 19:11:35,401 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-08 19:11:35,401 INFO L85 PathProgramCache]: Analyzing trace with hash 887162933, now seen corresponding path program 1 times [2024-11-08 19:11:35,401 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-08 19:11:35,401 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1548610615] [2024-11-08 19:11:35,402 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-08 19:11:35,402 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-08 19:11:35,434 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 19:11:35,762 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-08 19:11:35,762 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-08 19:11:35,763 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1548610615] [2024-11-08 19:11:35,763 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1548610615] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-08 19:11:35,763 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-08 19:11:35,764 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2024-11-08 19:11:35,764 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1686846060] [2024-11-08 19:11:35,764 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-08 19:11:35,765 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2024-11-08 19:11:35,765 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-08 19:11:35,766 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2024-11-08 19:11:35,766 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2024-11-08 19:11:35,771 INFO L467 CegarLoopForPetriNet]: Number of universal loopers: 16 out of 44 [2024-11-08 19:11:35,772 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 55 places, 33 transitions, 99 flow. Second operand has 5 states, 5 states have (on average 18.6) internal successors, (93), 5 states have internal predecessors, (93), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-08 19:11:35,772 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-11-08 19:11:35,772 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 16 of 44 [2024-11-08 19:11:35,773 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-11-08 19:11:36,323 INFO L124 PetriNetUnfolderBase]: 898/1601 cut-off events. [2024-11-08 19:11:36,323 INFO L125 PetriNetUnfolderBase]: For 556/560 co-relation queries the response was YES. [2024-11-08 19:11:36,332 INFO L83 FinitePrefix]: Finished finitePrefix Result has 3464 conditions, 1601 events. 898/1601 cut-off events. For 556/560 co-relation queries the response was YES. Maximal size of possible extension queue 102. Compared 9258 event pairs, 276 based on Foata normal form. 48/1642 useless extension candidates. Maximal degree in co-relation 3450. Up to 1078 conditions per place. [2024-11-08 19:11:36,340 INFO L140 encePairwiseOnDemand]: 38/44 looper letters, 30 selfloop transitions, 3 changer transitions 27/72 dead transitions. [2024-11-08 19:11:36,340 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 57 places, 72 transitions, 315 flow [2024-11-08 19:11:36,341 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2024-11-08 19:11:36,341 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 7 states. [2024-11-08 19:11:36,343 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 7 states to 7 states and 174 transitions. [2024-11-08 19:11:36,344 INFO L512 CegarLoopForPetriNet]: DFA transition density 0.564935064935065 [2024-11-08 19:11:36,344 INFO L175 Difference]: Start difference. First operand has 55 places, 33 transitions, 99 flow. Second operand 7 states and 174 transitions. [2024-11-08 19:11:36,345 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 57 places, 72 transitions, 315 flow [2024-11-08 19:11:36,361 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 49 places, 72 transitions, 283 flow, removed 12 selfloop flow, removed 8 redundant places. [2024-11-08 19:11:36,362 INFO L231 Difference]: Finished difference. Result has 54 places, 35 transitions, 114 flow [2024-11-08 19:11:36,363 INFO L260 CegarLoopForPetriNet]: {PETRI_ALPHABET=44, PETRI_DIFFERENCE_MINUEND_FLOW=79, PETRI_DIFFERENCE_MINUEND_PLACES=43, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=33, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=1, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=30, PETRI_DIFFERENCE_SUBTRAHEND_STATES=7, PETRI_FLOW=114, PETRI_PLACES=54, PETRI_TRANSITIONS=35} [2024-11-08 19:11:36,364 INFO L277 CegarLoopForPetriNet]: 49 programPoint places, 5 predicate places. [2024-11-08 19:11:36,367 INFO L471 AbstractCegarLoop]: Abstraction has has 54 places, 35 transitions, 114 flow [2024-11-08 19:11:36,367 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 18.6) internal successors, (93), 5 states have internal predecessors, (93), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-08 19:11:36,368 INFO L196 CegarLoopForPetriNet]: Found error trace [2024-11-08 19:11:36,368 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] [2024-11-08 19:11:36,368 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable4 [2024-11-08 19:11:36,368 INFO L396 AbstractCegarLoop]: === Iteration 6 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONMEMORY_LEAK === [P1Err0ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr1ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr0ASSERT_VIOLATIONMEMORY_LEAK (and 4 more)] === [2024-11-08 19:11:36,369 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-08 19:11:36,369 INFO L85 PathProgramCache]: Analyzing trace with hash 1422718047, now seen corresponding path program 1 times [2024-11-08 19:11:36,369 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-08 19:11:36,370 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1572499555] [2024-11-08 19:11:36,370 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-08 19:11:36,370 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-08 19:11:36,413 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 19:11:37,281 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-08 19:11:37,282 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-08 19:11:37,284 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1572499555] [2024-11-08 19:11:37,284 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1572499555] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-08 19:11:37,285 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-08 19:11:37,285 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2024-11-08 19:11:37,285 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [878735055] [2024-11-08 19:11:37,285 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-08 19:11:37,286 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2024-11-08 19:11:37,286 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-08 19:11:37,287 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2024-11-08 19:11:37,287 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2024-11-08 19:11:37,314 INFO L467 CegarLoopForPetriNet]: Number of universal loopers: 15 out of 44 [2024-11-08 19:11:37,315 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 54 places, 35 transitions, 114 flow. Second operand has 5 states, 5 states have (on average 18.0) internal successors, (90), 5 states have internal predecessors, (90), 0 states have call successors, (0), 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-08 19:11:37,315 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-11-08 19:11:37,315 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 15 of 44 [2024-11-08 19:11:37,315 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-11-08 19:11:38,222 INFO L124 PetriNetUnfolderBase]: 1155/1999 cut-off events. [2024-11-08 19:11:38,222 INFO L125 PetriNetUnfolderBase]: For 1107/1107 co-relation queries the response was YES. [2024-11-08 19:11:38,228 INFO L83 FinitePrefix]: Finished finitePrefix Result has 4868 conditions, 1999 events. 1155/1999 cut-off events. For 1107/1107 co-relation queries the response was YES. Maximal size of possible extension queue 120. Compared 11605 event pairs, 513 based on Foata normal form. 47/2045 useless extension candidates. Maximal degree in co-relation 4855. Up to 1322 conditions per place. [2024-11-08 19:11:38,265 INFO L140 encePairwiseOnDemand]: 33/44 looper letters, 31 selfloop transitions, 10 changer transitions 29/81 dead transitions. [2024-11-08 19:11:38,265 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 56 places, 81 transitions, 403 flow [2024-11-08 19:11:38,266 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2024-11-08 19:11:38,266 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 7 states. [2024-11-08 19:11:38,267 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 7 states to 7 states and 174 transitions. [2024-11-08 19:11:38,268 INFO L512 CegarLoopForPetriNet]: DFA transition density 0.564935064935065 [2024-11-08 19:11:38,268 INFO L175 Difference]: Start difference. First operand has 54 places, 35 transitions, 114 flow. Second operand 7 states and 174 transitions. [2024-11-08 19:11:38,268 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 56 places, 81 transitions, 403 flow [2024-11-08 19:11:38,274 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 53 places, 81 transitions, 387 flow, removed 6 selfloop flow, removed 3 redundant places. [2024-11-08 19:11:38,276 INFO L231 Difference]: Finished difference. Result has 58 places, 42 transitions, 199 flow [2024-11-08 19:11:38,276 INFO L260 CegarLoopForPetriNet]: {PETRI_ALPHABET=44, PETRI_DIFFERENCE_MINUEND_FLOW=107, PETRI_DIFFERENCE_MINUEND_PLACES=47, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=35, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=3, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=25, PETRI_DIFFERENCE_SUBTRAHEND_STATES=7, PETRI_FLOW=199, PETRI_PLACES=58, PETRI_TRANSITIONS=42} [2024-11-08 19:11:38,279 INFO L277 CegarLoopForPetriNet]: 49 programPoint places, 9 predicate places. [2024-11-08 19:11:38,280 INFO L471 AbstractCegarLoop]: Abstraction has has 58 places, 42 transitions, 199 flow [2024-11-08 19:11:38,280 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 18.0) internal successors, (90), 5 states have internal predecessors, (90), 0 states have call successors, (0), 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-08 19:11:38,280 INFO L196 CegarLoopForPetriNet]: Found error trace [2024-11-08 19:11:38,281 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] [2024-11-08 19:11:38,281 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable5 [2024-11-08 19:11:38,281 INFO L396 AbstractCegarLoop]: === Iteration 7 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONMEMORY_LEAK === [P1Err0ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr1ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr0ASSERT_VIOLATIONMEMORY_LEAK (and 4 more)] === [2024-11-08 19:11:38,281 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-08 19:11:38,282 INFO L85 PathProgramCache]: Analyzing trace with hash 1569755799, now seen corresponding path program 2 times [2024-11-08 19:11:38,282 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-08 19:11:38,282 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1349459860] [2024-11-08 19:11:38,282 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-08 19:11:38,282 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-08 19:11:38,311 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 19:11:38,600 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-08 19:11:38,600 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-08 19:11:38,600 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1349459860] [2024-11-08 19:11:38,601 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1349459860] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-08 19:11:38,602 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-08 19:11:38,603 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2024-11-08 19:11:38,603 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1283688886] [2024-11-08 19:11:38,603 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-08 19:11:38,604 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2024-11-08 19:11:38,604 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-08 19:11:38,604 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2024-11-08 19:11:38,605 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2024-11-08 19:11:38,611 INFO L467 CegarLoopForPetriNet]: Number of universal loopers: 16 out of 44 [2024-11-08 19:11:38,611 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 58 places, 42 transitions, 199 flow. Second operand has 5 states, 5 states have (on average 18.8) internal successors, (94), 5 states have internal predecessors, (94), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-08 19:11:38,612 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-11-08 19:11:38,612 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 16 of 44 [2024-11-08 19:11:38,612 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-11-08 19:11:39,395 INFO L124 PetriNetUnfolderBase]: 1359/2426 cut-off events. [2024-11-08 19:11:39,395 INFO L125 PetriNetUnfolderBase]: For 5116/5116 co-relation queries the response was YES. [2024-11-08 19:11:39,405 INFO L83 FinitePrefix]: Finished finitePrefix Result has 8199 conditions, 2426 events. 1359/2426 cut-off events. For 5116/5116 co-relation queries the response was YES. Maximal size of possible extension queue 157. Compared 15662 event pairs, 514 based on Foata normal form. 63/2463 useless extension candidates. Maximal degree in co-relation 8182. Up to 962 conditions per place. [2024-11-08 19:11:39,415 INFO L140 encePairwiseOnDemand]: 39/44 looper letters, 38 selfloop transitions, 4 changer transitions 29/83 dead transitions. [2024-11-08 19:11:39,416 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 60 places, 83 transitions, 572 flow [2024-11-08 19:11:39,417 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2024-11-08 19:11:39,417 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 7 states. [2024-11-08 19:11:39,418 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 7 states to 7 states and 176 transitions. [2024-11-08 19:11:39,418 INFO L512 CegarLoopForPetriNet]: DFA transition density 0.5714285714285714 [2024-11-08 19:11:39,418 INFO L175 Difference]: Start difference. First operand has 58 places, 42 transitions, 199 flow. Second operand 7 states and 176 transitions. [2024-11-08 19:11:39,418 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 60 places, 83 transitions, 572 flow [2024-11-08 19:11:39,430 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 57 places, 83 transitions, 541 flow, removed 10 selfloop flow, removed 3 redundant places. [2024-11-08 19:11:39,470 INFO L231 Difference]: Finished difference. Result has 62 places, 42 transitions, 203 flow [2024-11-08 19:11:39,470 INFO L260 CegarLoopForPetriNet]: {PETRI_ALPHABET=44, PETRI_DIFFERENCE_MINUEND_FLOW=181, PETRI_DIFFERENCE_MINUEND_PLACES=51, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=42, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=4, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=38, PETRI_DIFFERENCE_SUBTRAHEND_STATES=7, PETRI_FLOW=203, PETRI_PLACES=62, PETRI_TRANSITIONS=42} [2024-11-08 19:11:39,471 INFO L277 CegarLoopForPetriNet]: 49 programPoint places, 13 predicate places. [2024-11-08 19:11:39,471 INFO L471 AbstractCegarLoop]: Abstraction has has 62 places, 42 transitions, 203 flow [2024-11-08 19:11:39,471 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 18.8) internal successors, (94), 5 states have internal predecessors, (94), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-08 19:11:39,471 INFO L196 CegarLoopForPetriNet]: Found error trace [2024-11-08 19:11:39,471 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] [2024-11-08 19:11:39,472 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable6 [2024-11-08 19:11:39,472 INFO L396 AbstractCegarLoop]: === Iteration 8 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONMEMORY_LEAK === [P1Err0ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr1ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr0ASSERT_VIOLATIONMEMORY_LEAK (and 4 more)] === [2024-11-08 19:11:39,472 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-08 19:11:39,473 INFO L85 PathProgramCache]: Analyzing trace with hash -1066464830, now seen corresponding path program 1 times [2024-11-08 19:11:39,473 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-08 19:11:39,473 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [599305587] [2024-11-08 19:11:39,474 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-08 19:11:39,474 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-08 19:11:39,520 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 19:11:40,307 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-08 19:11:40,307 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-08 19:11:40,308 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [599305587] [2024-11-08 19:11:40,308 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [599305587] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-08 19:11:40,308 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-08 19:11:40,308 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2024-11-08 19:11:40,308 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [204166956] [2024-11-08 19:11:40,309 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-08 19:11:40,309 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2024-11-08 19:11:40,309 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-08 19:11:40,310 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2024-11-08 19:11:40,310 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=12, Invalid=30, Unknown=0, NotChecked=0, Total=42 [2024-11-08 19:11:40,314 INFO L467 CegarLoopForPetriNet]: Number of universal loopers: 17 out of 44 [2024-11-08 19:11:40,315 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 62 places, 42 transitions, 203 flow. Second operand has 7 states, 7 states have (on average 18.857142857142858) internal successors, (132), 7 states have internal predecessors, (132), 0 states have call successors, (0), 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-08 19:11:40,315 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-11-08 19:11:40,315 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 17 of 44 [2024-11-08 19:11:40,315 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-11-08 19:11:41,164 INFO L124 PetriNetUnfolderBase]: 1632/3032 cut-off events. [2024-11-08 19:11:41,164 INFO L125 PetriNetUnfolderBase]: For 7154/7173 co-relation queries the response was YES. [2024-11-08 19:11:41,179 INFO L83 FinitePrefix]: Finished finitePrefix Result has 9687 conditions, 3032 events. 1632/3032 cut-off events. For 7154/7173 co-relation queries the response was YES. Maximal size of possible extension queue 202. Compared 20294 event pairs, 746 based on Foata normal form. 105/3061 useless extension candidates. Maximal degree in co-relation 9667. Up to 1929 conditions per place. [2024-11-08 19:11:41,193 INFO L140 encePairwiseOnDemand]: 36/44 looper letters, 37 selfloop transitions, 9 changer transitions 33/96 dead transitions. [2024-11-08 19:11:41,193 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 65 places, 96 transitions, 605 flow [2024-11-08 19:11:41,194 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2024-11-08 19:11:41,194 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 8 states. [2024-11-08 19:11:41,195 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 8 states to 8 states and 198 transitions. [2024-11-08 19:11:41,195 INFO L512 CegarLoopForPetriNet]: DFA transition density 0.5625 [2024-11-08 19:11:41,196 INFO L175 Difference]: Start difference. First operand has 62 places, 42 transitions, 203 flow. Second operand 8 states and 198 transitions. [2024-11-08 19:11:41,196 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 65 places, 96 transitions, 605 flow [2024-11-08 19:11:41,235 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 60 places, 96 transitions, 577 flow, removed 12 selfloop flow, removed 5 redundant places. [2024-11-08 19:11:41,236 INFO L231 Difference]: Finished difference. Result has 66 places, 49 transitions, 282 flow [2024-11-08 19:11:41,237 INFO L260 CegarLoopForPetriNet]: {PETRI_ALPHABET=44, PETRI_DIFFERENCE_MINUEND_FLOW=183, PETRI_DIFFERENCE_MINUEND_PLACES=53, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=42, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=3, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=34, PETRI_DIFFERENCE_SUBTRAHEND_STATES=8, PETRI_FLOW=282, PETRI_PLACES=66, PETRI_TRANSITIONS=49} [2024-11-08 19:11:41,237 INFO L277 CegarLoopForPetriNet]: 49 programPoint places, 17 predicate places. [2024-11-08 19:11:41,238 INFO L471 AbstractCegarLoop]: Abstraction has has 66 places, 49 transitions, 282 flow [2024-11-08 19:11:41,238 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 7 states, 7 states have (on average 18.857142857142858) internal successors, (132), 7 states have internal predecessors, (132), 0 states have call successors, (0), 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-08 19:11:41,238 INFO L196 CegarLoopForPetriNet]: Found error trace [2024-11-08 19:11:41,238 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] [2024-11-08 19:11:41,242 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable7 [2024-11-08 19:11:41,242 INFO L396 AbstractCegarLoop]: === Iteration 9 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONMEMORY_LEAK === [P1Err0ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr1ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr0ASSERT_VIOLATIONMEMORY_LEAK (and 4 more)] === [2024-11-08 19:11:41,243 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-08 19:11:41,243 INFO L85 PathProgramCache]: Analyzing trace with hash 227913241, now seen corresponding path program 1 times [2024-11-08 19:11:41,243 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-08 19:11:41,244 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2083344339] [2024-11-08 19:11:41,244 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-08 19:11:41,244 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-08 19:11:41,309 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 19:11:42,126 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-08 19:11:42,127 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-08 19:11:42,127 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2083344339] [2024-11-08 19:11:42,128 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2083344339] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-08 19:11:42,128 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-08 19:11:42,128 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2024-11-08 19:11:42,128 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1664646810] [2024-11-08 19:11:42,129 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-08 19:11:42,129 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 8 states [2024-11-08 19:11:42,129 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-08 19:11:42,130 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2024-11-08 19:11:42,130 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=17, Invalid=39, Unknown=0, NotChecked=0, Total=56 [2024-11-08 19:11:42,133 INFO L467 CegarLoopForPetriNet]: Number of universal loopers: 17 out of 44 [2024-11-08 19:11:42,133 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 66 places, 49 transitions, 282 flow. Second operand has 8 states, 8 states have (on average 18.75) internal successors, (150), 8 states have internal predecessors, (150), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-08 19:11:42,134 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-11-08 19:11:42,134 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 17 of 44 [2024-11-08 19:11:42,134 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-11-08 19:11:43,293 INFO L124 PetriNetUnfolderBase]: 1863/3316 cut-off events. [2024-11-08 19:11:43,294 INFO L125 PetriNetUnfolderBase]: For 13836/13910 co-relation queries the response was YES. [2024-11-08 19:11:43,310 INFO L83 FinitePrefix]: Finished finitePrefix Result has 13197 conditions, 3316 events. 1863/3316 cut-off events. For 13836/13910 co-relation queries the response was YES. Maximal size of possible extension queue 199. Compared 22128 event pairs, 756 based on Foata normal form. 69/3305 useless extension candidates. Maximal degree in co-relation 13174. Up to 2106 conditions per place. [2024-11-08 19:11:43,338 INFO L140 encePairwiseOnDemand]: 34/44 looper letters, 43 selfloop transitions, 22 changer transitions 36/118 dead transitions. [2024-11-08 19:11:43,339 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 70 places, 118 transitions, 987 flow [2024-11-08 19:11:43,339 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2024-11-08 19:11:43,339 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 9 states. [2024-11-08 19:11:43,341 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 9 states to 9 states and 222 transitions. [2024-11-08 19:11:43,341 INFO L512 CegarLoopForPetriNet]: DFA transition density 0.5606060606060606 [2024-11-08 19:11:43,342 INFO L175 Difference]: Start difference. First operand has 66 places, 49 transitions, 282 flow. Second operand 9 states and 222 transitions. [2024-11-08 19:11:43,342 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 70 places, 118 transitions, 987 flow [2024-11-08 19:11:43,361 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 68 places, 118 transitions, 975 flow, removed 6 selfloop flow, removed 2 redundant places. [2024-11-08 19:11:43,365 INFO L231 Difference]: Finished difference. Result has 75 places, 65 transitions, 558 flow [2024-11-08 19:11:43,366 INFO L260 CegarLoopForPetriNet]: {PETRI_ALPHABET=44, PETRI_DIFFERENCE_MINUEND_FLOW=278, PETRI_DIFFERENCE_MINUEND_PLACES=60, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=49, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=8, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=30, PETRI_DIFFERENCE_SUBTRAHEND_STATES=9, PETRI_FLOW=558, PETRI_PLACES=75, PETRI_TRANSITIONS=65} [2024-11-08 19:11:43,368 INFO L277 CegarLoopForPetriNet]: 49 programPoint places, 26 predicate places. [2024-11-08 19:11:43,368 INFO L471 AbstractCegarLoop]: Abstraction has has 75 places, 65 transitions, 558 flow [2024-11-08 19:11:43,368 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 8 states, 8 states have (on average 18.75) internal successors, (150), 8 states have internal predecessors, (150), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-08 19:11:43,369 INFO L196 CegarLoopForPetriNet]: Found error trace [2024-11-08 19:11:43,369 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] [2024-11-08 19:11:43,369 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable8 [2024-11-08 19:11:43,369 INFO L396 AbstractCegarLoop]: === Iteration 10 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONMEMORY_LEAK === [P1Err0ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr1ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr0ASSERT_VIOLATIONMEMORY_LEAK (and 4 more)] === [2024-11-08 19:11:43,372 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-08 19:11:43,372 INFO L85 PathProgramCache]: Analyzing trace with hash -1281821857, now seen corresponding path program 2 times [2024-11-08 19:11:43,372 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-08 19:11:43,373 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1219741768] [2024-11-08 19:11:43,373 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-08 19:11:43,373 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-08 19:11:43,416 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 19:11:44,354 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-08 19:11:44,354 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-08 19:11:44,354 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1219741768] [2024-11-08 19:11:44,355 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1219741768] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-08 19:11:44,355 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-08 19:11:44,355 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2024-11-08 19:11:44,355 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [226002470] [2024-11-08 19:11:44,356 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-08 19:11:44,356 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 9 states [2024-11-08 19:11:44,357 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-08 19:11:44,357 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2024-11-08 19:11:44,357 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=19, Invalid=53, Unknown=0, NotChecked=0, Total=72 [2024-11-08 19:11:44,375 INFO L467 CegarLoopForPetriNet]: Number of universal loopers: 15 out of 44 [2024-11-08 19:11:44,376 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 75 places, 65 transitions, 558 flow. Second operand has 9 states, 9 states have (on average 16.77777777777778) internal successors, (151), 9 states have internal predecessors, (151), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-08 19:11:44,376 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-11-08 19:11:44,376 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 15 of 44 [2024-11-08 19:11:44,377 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-11-08 19:11:45,788 INFO L124 PetriNetUnfolderBase]: 2217/3857 cut-off events. [2024-11-08 19:11:45,789 INFO L125 PetriNetUnfolderBase]: For 27046/27153 co-relation queries the response was YES. [2024-11-08 19:11:45,817 INFO L83 FinitePrefix]: Finished finitePrefix Result has 18536 conditions, 3857 events. 2217/3857 cut-off events. For 27046/27153 co-relation queries the response was YES. Maximal size of possible extension queue 224. Compared 25580 event pairs, 897 based on Foata normal form. 175/3980 useless extension candidates. Maximal degree in co-relation 18506. Up to 2358 conditions per place. [2024-11-08 19:11:45,838 INFO L140 encePairwiseOnDemand]: 35/44 looper letters, 60 selfloop transitions, 19 changer transitions 70/161 dead transitions. [2024-11-08 19:11:45,839 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 81 places, 161 transitions, 1912 flow [2024-11-08 19:11:45,839 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 11 states. [2024-11-08 19:11:45,840 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 11 states. [2024-11-08 19:11:45,840 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 11 states to 11 states and 248 transitions. [2024-11-08 19:11:45,841 INFO L512 CegarLoopForPetriNet]: DFA transition density 0.512396694214876 [2024-11-08 19:11:45,841 INFO L175 Difference]: Start difference. First operand has 75 places, 65 transitions, 558 flow. Second operand 11 states and 248 transitions. [2024-11-08 19:11:45,841 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 81 places, 161 transitions, 1912 flow [2024-11-08 19:11:45,890 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 78 places, 161 transitions, 1881 flow, removed 15 selfloop flow, removed 3 redundant places. [2024-11-08 19:11:45,894 INFO L231 Difference]: Finished difference. Result has 86 places, 73 transitions, 791 flow [2024-11-08 19:11:45,894 INFO L260 CegarLoopForPetriNet]: {PETRI_ALPHABET=44, PETRI_DIFFERENCE_MINUEND_FLOW=537, PETRI_DIFFERENCE_MINUEND_PLACES=68, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=65, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=12, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=48, PETRI_DIFFERENCE_SUBTRAHEND_STATES=11, PETRI_FLOW=791, PETRI_PLACES=86, PETRI_TRANSITIONS=73} [2024-11-08 19:11:45,896 INFO L277 CegarLoopForPetriNet]: 49 programPoint places, 37 predicate places. [2024-11-08 19:11:45,897 INFO L471 AbstractCegarLoop]: Abstraction has has 86 places, 73 transitions, 791 flow [2024-11-08 19:11:45,897 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 9 states, 9 states have (on average 16.77777777777778) internal successors, (151), 9 states have internal predecessors, (151), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-08 19:11:45,897 INFO L196 CegarLoopForPetriNet]: Found error trace [2024-11-08 19:11:45,898 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] [2024-11-08 19:11:45,898 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable9 [2024-11-08 19:11:45,898 INFO L396 AbstractCegarLoop]: === Iteration 11 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONMEMORY_LEAK === [P1Err0ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr1ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr0ASSERT_VIOLATIONMEMORY_LEAK (and 4 more)] === [2024-11-08 19:11:45,899 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-08 19:11:45,900 INFO L85 PathProgramCache]: Analyzing trace with hash 1590080409, now seen corresponding path program 1 times [2024-11-08 19:11:45,900 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-08 19:11:45,900 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [975830539] [2024-11-08 19:11:45,901 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-08 19:11:45,904 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-08 19:11:45,988 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 19:11:46,159 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-08 19:11:46,159 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-08 19:11:46,159 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [975830539] [2024-11-08 19:11:46,160 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [975830539] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-08 19:11:46,160 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-08 19:11:46,160 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2024-11-08 19:11:46,160 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1611889178] [2024-11-08 19:11:46,160 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-08 19:11:46,161 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2024-11-08 19:11:46,161 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-08 19:11:46,161 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2024-11-08 19:11:46,161 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2024-11-08 19:11:46,170 INFO L467 CegarLoopForPetriNet]: Number of universal loopers: 15 out of 44 [2024-11-08 19:11:46,171 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 86 places, 73 transitions, 791 flow. Second operand has 4 states, 4 states have (on average 18.75) internal successors, (75), 4 states have internal predecessors, (75), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-08 19:11:46,171 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-11-08 19:11:46,171 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 15 of 44 [2024-11-08 19:11:46,171 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-11-08 19:11:47,031 INFO L124 PetriNetUnfolderBase]: 3373/5429 cut-off events. [2024-11-08 19:11:47,031 INFO L125 PetriNetUnfolderBase]: For 75019/75848 co-relation queries the response was YES. [2024-11-08 19:11:47,064 INFO L83 FinitePrefix]: Finished finitePrefix Result has 28805 conditions, 5429 events. 3373/5429 cut-off events. For 75019/75848 co-relation queries the response was YES. Maximal size of possible extension queue 271. Compared 33083 event pairs, 433 based on Foata normal form. 767/6040 useless extension candidates. Maximal degree in co-relation 28768. Up to 3067 conditions per place. [2024-11-08 19:11:47,094 INFO L140 encePairwiseOnDemand]: 38/44 looper letters, 76 selfloop transitions, 5 changer transitions 13/110 dead transitions. [2024-11-08 19:11:47,094 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 83 places, 110 transitions, 1501 flow [2024-11-08 19:11:47,095 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2024-11-08 19:11:47,095 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 4 states. [2024-11-08 19:11:47,096 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 108 transitions. [2024-11-08 19:11:47,096 INFO L512 CegarLoopForPetriNet]: DFA transition density 0.6136363636363636 [2024-11-08 19:11:47,096 INFO L175 Difference]: Start difference. First operand has 86 places, 73 transitions, 791 flow. Second operand 4 states and 108 transitions. [2024-11-08 19:11:47,096 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 83 places, 110 transitions, 1501 flow [2024-11-08 19:11:47,180 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 75 places, 110 transitions, 1391 flow, removed 53 selfloop flow, removed 8 redundant places. [2024-11-08 19:11:47,182 INFO L231 Difference]: Finished difference. Result has 77 places, 68 transitions, 657 flow [2024-11-08 19:11:47,183 INFO L260 CegarLoopForPetriNet]: {PETRI_ALPHABET=44, PETRI_DIFFERENCE_MINUEND_FLOW=627, PETRI_DIFFERENCE_MINUEND_PLACES=72, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=65, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=1, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=60, PETRI_DIFFERENCE_SUBTRAHEND_STATES=4, PETRI_FLOW=657, PETRI_PLACES=77, PETRI_TRANSITIONS=68} [2024-11-08 19:11:47,183 INFO L277 CegarLoopForPetriNet]: 49 programPoint places, 28 predicate places. [2024-11-08 19:11:47,183 INFO L471 AbstractCegarLoop]: Abstraction has has 77 places, 68 transitions, 657 flow [2024-11-08 19:11:47,184 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 18.75) internal successors, (75), 4 states have internal predecessors, (75), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-08 19:11:47,184 INFO L196 CegarLoopForPetriNet]: Found error trace [2024-11-08 19:11:47,184 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] [2024-11-08 19:11:47,184 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable10 [2024-11-08 19:11:47,184 INFO L396 AbstractCegarLoop]: === Iteration 12 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONMEMORY_LEAK === [P1Err0ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr1ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr0ASSERT_VIOLATIONMEMORY_LEAK (and 4 more)] === [2024-11-08 19:11:47,185 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-08 19:11:47,185 INFO L85 PathProgramCache]: Analyzing trace with hash -810798353, now seen corresponding path program 1 times [2024-11-08 19:11:47,185 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-08 19:11:47,185 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [352622154] [2024-11-08 19:11:47,189 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-08 19:11:47,190 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-08 19:11:47,256 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 19:11:47,491 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-08 19:11:47,491 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-08 19:11:47,492 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [352622154] [2024-11-08 19:11:47,492 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [352622154] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-08 19:11:47,492 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-08 19:11:47,492 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2024-11-08 19:11:47,493 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1281805048] [2024-11-08 19:11:47,493 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-08 19:11:47,493 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2024-11-08 19:11:47,493 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-08 19:11:47,494 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2024-11-08 19:11:47,494 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=8, Invalid=12, Unknown=0, NotChecked=0, Total=20 [2024-11-08 19:11:47,500 INFO L467 CegarLoopForPetriNet]: Number of universal loopers: 15 out of 44 [2024-11-08 19:11:47,501 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 77 places, 68 transitions, 657 flow. Second operand has 5 states, 5 states have (on average 18.2) internal successors, (91), 5 states have internal predecessors, (91), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-08 19:11:47,501 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-11-08 19:11:47,501 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 15 of 44 [2024-11-08 19:11:47,501 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-11-08 19:11:48,463 INFO L124 PetriNetUnfolderBase]: 2280/3704 cut-off events. [2024-11-08 19:11:48,463 INFO L125 PetriNetUnfolderBase]: For 45543/46094 co-relation queries the response was YES. [2024-11-08 19:11:48,473 INFO L83 FinitePrefix]: Finished finitePrefix Result has 19055 conditions, 3704 events. 2280/3704 cut-off events. For 45543/46094 co-relation queries the response was YES. Maximal size of possible extension queue 191. Compared 20938 event pairs, 222 based on Foata normal form. 571/4127 useless extension candidates. Maximal degree in co-relation 19021. Up to 1228 conditions per place. [2024-11-08 19:11:48,487 INFO L140 encePairwiseOnDemand]: 38/44 looper letters, 74 selfloop transitions, 8 changer transitions 14/112 dead transitions. [2024-11-08 19:11:48,488 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 81 places, 112 transitions, 1343 flow [2024-11-08 19:11:48,488 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2024-11-08 19:11:48,488 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 5 states. [2024-11-08 19:11:48,489 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 135 transitions. [2024-11-08 19:11:48,489 INFO L512 CegarLoopForPetriNet]: DFA transition density 0.6136363636363636 [2024-11-08 19:11:48,490 INFO L175 Difference]: Start difference. First operand has 77 places, 68 transitions, 657 flow. Second operand 5 states and 135 transitions. [2024-11-08 19:11:48,490 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 81 places, 112 transitions, 1343 flow [2024-11-08 19:11:48,525 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 78 places, 112 transitions, 1295 flow, removed 5 selfloop flow, removed 3 redundant places. [2024-11-08 19:11:48,528 INFO L231 Difference]: Finished difference. Result has 80 places, 63 transitions, 543 flow [2024-11-08 19:11:48,528 INFO L260 CegarLoopForPetriNet]: {PETRI_ALPHABET=44, PETRI_DIFFERENCE_MINUEND_FLOW=591, PETRI_DIFFERENCE_MINUEND_PLACES=74, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=66, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=4, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=58, PETRI_DIFFERENCE_SUBTRAHEND_STATES=5, PETRI_FLOW=543, PETRI_PLACES=80, PETRI_TRANSITIONS=63} [2024-11-08 19:11:48,529 INFO L277 CegarLoopForPetriNet]: 49 programPoint places, 31 predicate places. [2024-11-08 19:11:48,529 INFO L471 AbstractCegarLoop]: Abstraction has has 80 places, 63 transitions, 543 flow [2024-11-08 19:11:48,530 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 18.2) internal successors, (91), 5 states have internal predecessors, (91), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-08 19:11:48,530 INFO L196 CegarLoopForPetriNet]: Found error trace [2024-11-08 19:11:48,530 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] [2024-11-08 19:11:48,530 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable11 [2024-11-08 19:11:48,530 INFO L396 AbstractCegarLoop]: === Iteration 13 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONMEMORY_LEAK === [P1Err0ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr1ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr0ASSERT_VIOLATIONMEMORY_LEAK (and 4 more)] === [2024-11-08 19:11:48,531 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-08 19:11:48,531 INFO L85 PathProgramCache]: Analyzing trace with hash -1099028239, now seen corresponding path program 1 times [2024-11-08 19:11:48,531 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-08 19:11:48,532 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2128417228] [2024-11-08 19:11:48,532 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-08 19:11:48,532 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-08 19:11:48,646 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 19:11:48,893 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-08 19:11:48,894 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-08 19:11:48,894 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2128417228] [2024-11-08 19:11:48,894 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2128417228] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-08 19:11:48,894 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-08 19:11:48,895 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2024-11-08 19:11:48,895 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [70919732] [2024-11-08 19:11:48,895 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-08 19:11:48,895 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2024-11-08 19:11:48,896 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-08 19:11:48,896 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2024-11-08 19:11:48,897 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=12, Invalid=18, Unknown=0, NotChecked=0, Total=30 [2024-11-08 19:11:48,903 INFO L467 CegarLoopForPetriNet]: Number of universal loopers: 15 out of 44 [2024-11-08 19:11:48,903 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 80 places, 63 transitions, 543 flow. Second operand has 6 states, 6 states have (on average 18.0) internal successors, (108), 6 states have internal predecessors, (108), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-08 19:11:48,904 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-11-08 19:11:48,904 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 15 of 44 [2024-11-08 19:11:48,904 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-11-08 19:11:49,503 INFO L124 PetriNetUnfolderBase]: 1644/2674 cut-off events. [2024-11-08 19:11:49,503 INFO L125 PetriNetUnfolderBase]: For 35312/35750 co-relation queries the response was YES. [2024-11-08 19:11:49,517 INFO L83 FinitePrefix]: Finished finitePrefix Result has 14610 conditions, 2674 events. 1644/2674 cut-off events. For 35312/35750 co-relation queries the response was YES. Maximal size of possible extension queue 180. Compared 14666 event pairs, 211 based on Foata normal form. 389/2952 useless extension candidates. Maximal degree in co-relation 14575. Up to 947 conditions per place. [2024-11-08 19:11:49,525 INFO L140 encePairwiseOnDemand]: 38/44 looper letters, 54 selfloop transitions, 11 changer transitions 16/94 dead transitions. [2024-11-08 19:11:49,525 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 85 places, 94 transitions, 986 flow [2024-11-08 19:11:49,526 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2024-11-08 19:11:49,526 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 6 states. [2024-11-08 19:11:49,530 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6 states to 6 states and 149 transitions. [2024-11-08 19:11:49,532 INFO L512 CegarLoopForPetriNet]: DFA transition density 0.5643939393939394 [2024-11-08 19:11:49,532 INFO L175 Difference]: Start difference. First operand has 80 places, 63 transitions, 543 flow. Second operand 6 states and 149 transitions. [2024-11-08 19:11:49,532 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 85 places, 94 transitions, 986 flow [2024-11-08 19:11:49,578 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 80 places, 94 transitions, 851 flow, removed 63 selfloop flow, removed 5 redundant places. [2024-11-08 19:11:49,582 INFO L231 Difference]: Finished difference. Result has 82 places, 53 transitions, 397 flow [2024-11-08 19:11:49,586 INFO L260 CegarLoopForPetriNet]: {PETRI_ALPHABET=44, PETRI_DIFFERENCE_MINUEND_FLOW=437, PETRI_DIFFERENCE_MINUEND_PLACES=75, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=61, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=10, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=50, PETRI_DIFFERENCE_SUBTRAHEND_STATES=6, PETRI_FLOW=397, PETRI_PLACES=82, PETRI_TRANSITIONS=53} [2024-11-08 19:11:49,586 INFO L277 CegarLoopForPetriNet]: 49 programPoint places, 33 predicate places. [2024-11-08 19:11:49,587 INFO L471 AbstractCegarLoop]: Abstraction has has 82 places, 53 transitions, 397 flow [2024-11-08 19:11:49,587 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 18.0) internal successors, (108), 6 states have internal predecessors, (108), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-08 19:11:49,587 INFO L196 CegarLoopForPetriNet]: Found error trace [2024-11-08 19:11:49,587 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-08 19:11:49,587 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable12 [2024-11-08 19:11:49,587 INFO L396 AbstractCegarLoop]: === Iteration 14 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONMEMORY_LEAK === [P1Err0ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr1ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr0ASSERT_VIOLATIONMEMORY_LEAK (and 4 more)] === [2024-11-08 19:11:49,588 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-08 19:11:49,588 INFO L85 PathProgramCache]: Analyzing trace with hash -624855054, now seen corresponding path program 1 times [2024-11-08 19:11:49,588 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-08 19:11:49,588 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1738518580] [2024-11-08 19:11:49,588 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-08 19:11:49,589 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-08 19:11:49,736 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 19:11:52,319 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-08 19:11:52,319 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-08 19:11:52,320 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1738518580] [2024-11-08 19:11:52,320 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1738518580] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-08 19:11:52,320 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-08 19:11:52,320 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [10] imperfect sequences [] total 10 [2024-11-08 19:11:52,320 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1397148884] [2024-11-08 19:11:52,321 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-08 19:11:52,321 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 11 states [2024-11-08 19:11:52,321 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-08 19:11:52,322 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 11 interpolants. [2024-11-08 19:11:52,322 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=26, Invalid=84, Unknown=0, NotChecked=0, Total=110 [2024-11-08 19:11:52,335 INFO L467 CegarLoopForPetriNet]: Number of universal loopers: 17 out of 44 [2024-11-08 19:11:52,335 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 82 places, 53 transitions, 397 flow. Second operand has 11 states, 11 states have (on average 18.545454545454547) internal successors, (204), 11 states have internal predecessors, (204), 0 states have call successors, (0), 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-08 19:11:52,336 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-11-08 19:11:52,336 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 17 of 44 [2024-11-08 19:11:52,336 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-11-08 19:11:53,232 INFO L124 PetriNetUnfolderBase]: 798/1689 cut-off events. [2024-11-08 19:11:53,232 INFO L125 PetriNetUnfolderBase]: For 8906/9104 co-relation queries the response was YES. [2024-11-08 19:11:53,242 INFO L83 FinitePrefix]: Finished finitePrefix Result has 6625 conditions, 1689 events. 798/1689 cut-off events. For 8906/9104 co-relation queries the response was YES. Maximal size of possible extension queue 145. Compared 11001 event pairs, 215 based on Foata normal form. 36/1602 useless extension candidates. Maximal degree in co-relation 6591. Up to 505 conditions per place. [2024-11-08 19:11:53,246 INFO L140 encePairwiseOnDemand]: 36/44 looper letters, 30 selfloop transitions, 4 changer transitions 40/98 dead transitions. [2024-11-08 19:11:53,246 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 91 places, 98 transitions, 765 flow [2024-11-08 19:11:53,247 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 11 states. [2024-11-08 19:11:53,247 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 11 states. [2024-11-08 19:11:53,248 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 11 states to 11 states and 253 transitions. [2024-11-08 19:11:53,248 INFO L512 CegarLoopForPetriNet]: DFA transition density 0.5227272727272727 [2024-11-08 19:11:53,248 INFO L175 Difference]: Start difference. First operand has 82 places, 53 transitions, 397 flow. Second operand 11 states and 253 transitions. [2024-11-08 19:11:53,248 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 91 places, 98 transitions, 765 flow [2024-11-08 19:11:53,280 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 75 places, 98 transitions, 608 flow, removed 57 selfloop flow, removed 16 redundant places. [2024-11-08 19:11:53,282 INFO L231 Difference]: Finished difference. Result has 82 places, 50 transitions, 300 flow [2024-11-08 19:11:53,283 INFO L260 CegarLoopForPetriNet]: {PETRI_ALPHABET=44, PETRI_DIFFERENCE_MINUEND_FLOW=298, PETRI_DIFFERENCE_MINUEND_PLACES=65, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=53, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=4, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=49, PETRI_DIFFERENCE_SUBTRAHEND_STATES=11, PETRI_FLOW=300, PETRI_PLACES=82, PETRI_TRANSITIONS=50} [2024-11-08 19:11:53,283 INFO L277 CegarLoopForPetriNet]: 49 programPoint places, 33 predicate places. [2024-11-08 19:11:53,284 INFO L471 AbstractCegarLoop]: Abstraction has has 82 places, 50 transitions, 300 flow [2024-11-08 19:11:53,284 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 11 states, 11 states have (on average 18.545454545454547) internal successors, (204), 11 states have internal predecessors, (204), 0 states have call successors, (0), 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-08 19:11:53,284 INFO L196 CegarLoopForPetriNet]: Found error trace [2024-11-08 19:11:53,284 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-08 19:11:53,285 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable13 [2024-11-08 19:11:53,285 INFO L396 AbstractCegarLoop]: === Iteration 15 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONMEMORY_LEAK === [P1Err0ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr1ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr0ASSERT_VIOLATIONMEMORY_LEAK (and 4 more)] === [2024-11-08 19:11:53,285 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-08 19:11:53,285 INFO L85 PathProgramCache]: Analyzing trace with hash -1454394920, now seen corresponding path program 2 times [2024-11-08 19:11:53,286 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-08 19:11:53,286 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [36842204] [2024-11-08 19:11:53,286 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-08 19:11:53,286 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-08 19:11:53,384 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-11-08 19:11:53,384 INFO L356 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2024-11-08 19:11:53,488 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-11-08 19:11:53,536 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2024-11-08 19:11:53,537 INFO L325 BasicCegarLoop]: Counterexample is feasible [2024-11-08 19:11:53,538 INFO L782 garLoopResultBuilder]: Registering result UNSAFE for location ULTIMATE.startErr0ASSERT_VIOLATIONMEMORY_LEAK (6 of 7 remaining) [2024-11-08 19:11:53,541 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location P1Err0ASSERT_VIOLATIONMEMORY_LEAK (5 of 7 remaining) [2024-11-08 19:11:53,542 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr1ASSERT_VIOLATIONMEMORY_LEAK (4 of 7 remaining) [2024-11-08 19:11:53,542 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (3 of 7 remaining) [2024-11-08 19:11:53,543 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (2 of 7 remaining) [2024-11-08 19:11:53,544 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr2INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (1 of 7 remaining) [2024-11-08 19:11:53,544 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location P1Err0ASSERT_VIOLATIONMEMORY_LEAK (0 of 7 remaining) [2024-11-08 19:11:53,544 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable14 [2024-11-08 19:11:53,545 INFO L407 BasicCegarLoop]: Path program histogram: [2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-08 19:11:53,675 INFO L239 ceAbstractionStarter]: Analysis of concurrent program completed with 1 thread instances [2024-11-08 19:11:53,678 INFO L170 ceAbstractionStarter]: Computing trace abstraction results [2024-11-08 19:11:53,686 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 08.11 07:11:53 BasicIcfg [2024-11-08 19:11:53,686 INFO L131 PluginConnector]: ------------------------ END TraceAbstraction---------------------------- [2024-11-08 19:11:53,687 INFO L112 PluginConnector]: ------------------------Witness Printer---------------------------- [2024-11-08 19:11:53,687 INFO L270 PluginConnector]: Initializing Witness Printer... [2024-11-08 19:11:53,687 INFO L274 PluginConnector]: Witness Printer initialized [2024-11-08 19:11:53,688 INFO L184 PluginConnector]: Executing the observer RCFGCatcher from plugin Witness Printer for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 08.11 07:11:30" (3/4) ... [2024-11-08 19:11:53,690 INFO L145 WitnessPrinter]: No result that supports witness generation found [2024-11-08 19:11:53,692 INFO L131 PluginConnector]: ------------------------ END Witness Printer---------------------------- [2024-11-08 19:11:53,693 INFO L158 Benchmark]: Toolchain (without parser) took 25531.08ms. Allocated memory was 127.9MB in the beginning and 528.5MB in the end (delta: 400.6MB). Free memory was 91.2MB in the beginning and 216.9MB in the end (delta: -125.7MB). Peak memory consumption was 276.9MB. Max. memory is 16.1GB. [2024-11-08 19:11:53,693 INFO L158 Benchmark]: CDTParser took 0.34ms. Allocated memory is still 94.4MB. Free memory was 66.3MB in the beginning and 66.3MB in the end (delta: 28.4kB). There was no memory consumed. Max. memory is 16.1GB. [2024-11-08 19:11:53,694 INFO L158 Benchmark]: CACSL2BoogieTranslator took 935.03ms. Allocated memory is still 127.9MB. Free memory was 91.2MB in the beginning and 97.8MB in the end (delta: -6.6MB). Peak memory consumption was 33.9MB. Max. memory is 16.1GB. [2024-11-08 19:11:53,694 INFO L158 Benchmark]: Boogie Procedure Inliner took 89.29ms. Allocated memory is still 127.9MB. Free memory was 97.8MB in the beginning and 95.1MB in the end (delta: 2.7MB). Peak memory consumption was 2.1MB. Max. memory is 16.1GB. [2024-11-08 19:11:53,695 INFO L158 Benchmark]: Boogie Preprocessor took 80.94ms. Allocated memory is still 127.9MB. Free memory was 95.1MB in the beginning and 91.2MB in the end (delta: 3.9MB). Peak memory consumption was 4.2MB. Max. memory is 16.1GB. [2024-11-08 19:11:53,695 INFO L158 Benchmark]: RCFGBuilder took 1156.88ms. Allocated memory is still 127.9MB. Free memory was 91.2MB in the beginning and 83.3MB in the end (delta: 7.9MB). Peak memory consumption was 45.3MB. Max. memory is 16.1GB. [2024-11-08 19:11:53,696 INFO L158 Benchmark]: TraceAbstraction took 23257.00ms. Allocated memory was 127.9MB in the beginning and 528.5MB in the end (delta: 400.6MB). Free memory was 82.6MB in the beginning and 216.9MB in the end (delta: -134.3MB). Peak memory consumption was 264.8MB. Max. memory is 16.1GB. [2024-11-08 19:11:53,696 INFO L158 Benchmark]: Witness Printer took 5.24ms. Allocated memory is still 528.5MB. Free memory is still 216.9MB. There was no memory consumed. Max. memory is 16.1GB. [2024-11-08 19:11:53,699 INFO L338 ainManager$Toolchain]: ####################### End [Toolchain 1] ####################### --- Results --- * Results from de.uni_freiburg.informatik.ultimate.core: - StatisticsResult: Toolchain Benchmarks Benchmark results are: * CDTParser took 0.34ms. Allocated memory is still 94.4MB. Free memory was 66.3MB in the beginning and 66.3MB in the end (delta: 28.4kB). There was no memory consumed. Max. memory is 16.1GB. * CACSL2BoogieTranslator took 935.03ms. Allocated memory is still 127.9MB. Free memory was 91.2MB in the beginning and 97.8MB in the end (delta: -6.6MB). Peak memory consumption was 33.9MB. Max. memory is 16.1GB. * Boogie Procedure Inliner took 89.29ms. Allocated memory is still 127.9MB. Free memory was 97.8MB in the beginning and 95.1MB in the end (delta: 2.7MB). Peak memory consumption was 2.1MB. Max. memory is 16.1GB. * Boogie Preprocessor took 80.94ms. Allocated memory is still 127.9MB. Free memory was 95.1MB in the beginning and 91.2MB in the end (delta: 3.9MB). Peak memory consumption was 4.2MB. Max. memory is 16.1GB. * RCFGBuilder took 1156.88ms. Allocated memory is still 127.9MB. Free memory was 91.2MB in the beginning and 83.3MB in the end (delta: 7.9MB). Peak memory consumption was 45.3MB. Max. memory is 16.1GB. * TraceAbstraction took 23257.00ms. Allocated memory was 127.9MB in the beginning and 528.5MB in the end (delta: 400.6MB). Free memory was 82.6MB in the beginning and 216.9MB in the end (delta: -134.3MB). Peak memory consumption was 264.8MB. Max. memory is 16.1GB. * Witness Printer took 5.24ms. Allocated memory is still 528.5MB. Free memory is still 216.9MB. There was no memory consumed. Max. memory is 16.1GB. * Results from de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: - UnprovableResult [Line: 17]: Unable to prove that all allocated memory was freed Unable to prove that all allocated memory was freed Reason: overapproximation of memtrack at line 17. Possible FailurePath: [L709] 0 int __unbuffered_cnt = 0; [L711] 0 int __unbuffered_p2_EAX = 0; [L712] 0 _Bool main$tmp_guard0; [L713] 0 _Bool main$tmp_guard1; [L715] 0 int x = 0; [L716] 0 _Bool x$flush_delayed; [L717] 0 int x$mem_tmp; [L718] 0 _Bool x$r_buff0_thd0; [L719] 0 _Bool x$r_buff0_thd1; [L720] 0 _Bool x$r_buff0_thd2; [L721] 0 _Bool x$r_buff0_thd3; [L722] 0 _Bool x$r_buff1_thd0; [L723] 0 _Bool x$r_buff1_thd1; [L724] 0 _Bool x$r_buff1_thd2; [L725] 0 _Bool x$r_buff1_thd3; [L726] 0 _Bool x$read_delayed; [L727] 0 int *x$read_delayed_var; [L728] 0 int x$w_buff0; [L729] 0 _Bool x$w_buff0_used; [L730] 0 int x$w_buff1; [L731] 0 _Bool x$w_buff1_used; [L733] 0 int y = 0; [L735] 0 int z = 0; [L736] 0 _Bool weak$$choice0; [L737] 0 _Bool weak$$choice2; [L818] 0 pthread_t t2028; [L819] FCALL, FORK 0 pthread_create(&t2028, ((void *)0), P0, ((void *)0)) VAL [\old(arg)={0:0}, __unbuffered_cnt=0, __unbuffered_p2_EAX=0, main$tmp_guard0=0, main$tmp_guard1=0, t2028=-1, weak$$choice0=0, weak$$choice2=0, x$flush_delayed=0, x$mem_tmp=0, x$r_buff0_thd0=0, x$r_buff0_thd1=0, x$r_buff0_thd2=0, x$r_buff0_thd3=0, x$r_buff1_thd0=0, x$r_buff1_thd1=0, x$r_buff1_thd2=0, x$r_buff1_thd3=0, x$read_delayed=0, x$read_delayed_var={0:0}, x$w_buff0=0, x$w_buff0_used=0, x$w_buff1=0, x$w_buff1_used=0, x=0, y=0, z=0] [L820] 0 pthread_t t2029; [L821] FCALL, FORK 0 pthread_create(&t2029, ((void *)0), P1, ((void *)0)) VAL [\old(arg)={0:0}, __unbuffered_cnt=0, __unbuffered_p2_EAX=0, main$tmp_guard0=0, main$tmp_guard1=0, t2028=-1, t2029=0, weak$$choice0=0, weak$$choice2=0, x$flush_delayed=0, x$mem_tmp=0, x$r_buff0_thd0=0, x$r_buff0_thd1=0, x$r_buff0_thd2=0, x$r_buff0_thd3=0, x$r_buff1_thd0=0, x$r_buff1_thd1=0, x$r_buff1_thd2=0, x$r_buff1_thd3=0, x$read_delayed=0, x$read_delayed_var={0:0}, x$w_buff0=0, x$w_buff0_used=0, x$w_buff1=0, x$w_buff1_used=0, x=0, y=0, z=0] [L822] 0 pthread_t t2030; [L823] FCALL, FORK 0 pthread_create(&t2030, ((void *)0), P2, ((void *)0)) VAL [\old(arg)={0:0}, \old(arg)={0:0}, __unbuffered_cnt=0, __unbuffered_p2_EAX=0, main$tmp_guard0=0, main$tmp_guard1=0, t2028=-1, t2029=0, t2030=1, weak$$choice0=0, weak$$choice2=0, x$flush_delayed=0, x$mem_tmp=0, x$r_buff0_thd0=0, x$r_buff0_thd1=0, x$r_buff0_thd2=0, x$r_buff0_thd3=0, x$r_buff1_thd0=0, x$r_buff1_thd1=0, x$r_buff1_thd2=0, x$r_buff1_thd3=0, x$read_delayed=0, x$read_delayed_var={0:0}, x$w_buff0=0, x$w_buff0_used=0, x$w_buff1=0, x$w_buff1_used=0, x=0, y=0, z=0] [L761] 2 x$w_buff1 = x$w_buff0 [L762] 2 x$w_buff0 = 2 [L763] 2 x$w_buff1_used = x$w_buff0_used [L764] 2 x$w_buff0_used = (_Bool)1 [L765] CALL 2 __VERIFIER_assert(!(x$w_buff1_used && x$w_buff0_used)) [L18] COND FALSE 2 !(!expression) [L765] RET 2 __VERIFIER_assert(!(x$w_buff1_used && x$w_buff0_used)) [L766] 2 x$r_buff1_thd0 = x$r_buff0_thd0 [L767] 2 x$r_buff1_thd1 = x$r_buff0_thd1 [L768] 2 x$r_buff1_thd2 = x$r_buff0_thd2 [L769] 2 x$r_buff1_thd3 = x$r_buff0_thd3 [L770] 2 x$r_buff0_thd2 = (_Bool)1 VAL [\old(arg)={0:0}, \old(arg)={0:0}, \old(arg)={0:0}, __unbuffered_cnt=0, __unbuffered_p2_EAX=0, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=0, x$flush_delayed=0, x$mem_tmp=0, x$r_buff0_thd0=0, x$r_buff0_thd1=0, x$r_buff0_thd2=1, x$r_buff0_thd3=0, x$r_buff1_thd0=0, x$r_buff1_thd1=0, x$r_buff1_thd2=0, x$r_buff1_thd3=0, x$read_delayed=0, x$read_delayed_var={0:0}, x$w_buff0=2, x$w_buff0_used=1, x$w_buff1=0, x$w_buff1_used=0, x=0, y=0, z=0] [L773] 2 y = 1 VAL [\old(arg)={0:0}, \old(arg)={0:0}, \old(arg)={0:0}, __unbuffered_cnt=0, __unbuffered_p2_EAX=0, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=0, x$flush_delayed=0, x$mem_tmp=0, x$r_buff0_thd0=0, x$r_buff0_thd1=0, x$r_buff0_thd2=1, x$r_buff0_thd3=0, x$r_buff1_thd0=0, x$r_buff1_thd1=0, x$r_buff1_thd2=0, x$r_buff1_thd3=0, x$read_delayed=0, x$read_delayed_var={0:0}, x$w_buff0=2, x$w_buff0_used=1, x$w_buff1=0, x$w_buff1_used=0, x=0, y=1, z=0] [L790] 3 __unbuffered_p2_EAX = y VAL [\old(arg)={0:0}, \old(arg)={0:0}, __unbuffered_cnt=0, __unbuffered_p2_EAX=1, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=0, x$flush_delayed=0, x$mem_tmp=0, x$r_buff0_thd0=0, x$r_buff0_thd1=0, x$r_buff0_thd2=1, x$r_buff0_thd3=0, x$r_buff1_thd0=0, x$r_buff1_thd1=0, x$r_buff1_thd2=0, x$r_buff1_thd3=0, x$read_delayed=0, x$read_delayed_var={0:0}, x$w_buff0=2, x$w_buff0_used=1, x$w_buff1=0, x$w_buff1_used=0, x=0, y=1, z=0] [L793] 3 z = 1 VAL [\old(arg)={0:0}, \old(arg)={0:0}, __unbuffered_cnt=0, __unbuffered_p2_EAX=1, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=0, x$flush_delayed=0, x$mem_tmp=0, x$r_buff0_thd0=0, x$r_buff0_thd1=0, x$r_buff0_thd2=1, x$r_buff0_thd3=0, x$r_buff1_thd0=0, x$r_buff1_thd1=0, x$r_buff1_thd2=0, x$r_buff1_thd3=0, x$read_delayed=0, x$read_delayed_var={0:0}, x$w_buff0=2, x$w_buff0_used=1, x$w_buff1=0, x$w_buff1_used=0, x=0, y=1, z=1] [L741] 1 z = 2 VAL [\old(arg)={0:0}, \old(arg)={0:0}, __unbuffered_cnt=0, __unbuffered_p2_EAX=1, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=0, x$flush_delayed=0, x$mem_tmp=0, x$r_buff0_thd0=0, x$r_buff0_thd1=0, x$r_buff0_thd2=1, x$r_buff0_thd3=0, x$r_buff1_thd0=0, x$r_buff1_thd1=0, x$r_buff1_thd2=0, x$r_buff1_thd3=0, x$read_delayed=0, x$read_delayed_var={0:0}, x$w_buff0=2, x$w_buff0_used=1, x$w_buff1=0, x$w_buff1_used=0, x=0, y=1, z=2] [L744] 1 x = 1 VAL [\old(arg)={0:0}, \old(arg)={0:0}, __unbuffered_cnt=0, __unbuffered_p2_EAX=1, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=0, x$flush_delayed=0, x$mem_tmp=0, x$r_buff0_thd0=0, x$r_buff0_thd1=0, x$r_buff0_thd2=1, x$r_buff0_thd3=0, x$r_buff1_thd0=0, x$r_buff1_thd1=0, x$r_buff1_thd2=0, x$r_buff1_thd3=0, x$read_delayed=0, x$read_delayed_var={0:0}, x$w_buff0=2, x$w_buff0_used=1, x$w_buff1=0, x$w_buff1_used=0, x=1, y=1, z=2] [L776] 2 x = x$w_buff0_used && x$r_buff0_thd2 ? x$w_buff0 : (x$w_buff1_used && x$r_buff1_thd2 ? x$w_buff1 : x) [L777] 2 x$w_buff0_used = x$w_buff0_used && x$r_buff0_thd2 ? (_Bool)0 : x$w_buff0_used [L778] 2 x$w_buff1_used = x$w_buff0_used && x$r_buff0_thd2 || x$w_buff1_used && x$r_buff1_thd2 ? (_Bool)0 : x$w_buff1_used [L779] 2 x$r_buff0_thd2 = x$w_buff0_used && x$r_buff0_thd2 ? (_Bool)0 : x$r_buff0_thd2 [L780] 2 x$r_buff1_thd2 = x$w_buff0_used && x$r_buff0_thd2 || x$w_buff1_used && x$r_buff1_thd2 ? (_Bool)0 : x$r_buff1_thd2 VAL [\old(arg)={0:0}, \old(arg)={0:0}, \old(arg)={0:0}, __unbuffered_cnt=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$$choice2=0, x$flush_delayed=0, x$mem_tmp=0, x$r_buff0_thd0=0, x$r_buff0_thd1=0, x$r_buff0_thd2=1, x$r_buff0_thd3=0, x$r_buff1_thd0=0, x$r_buff1_thd1=0, x$r_buff1_thd2=0, x$r_buff1_thd3=0, x$read_delayed=0, x$read_delayed_var={0:0}, x$w_buff0=2, x$w_buff0_used=0, x$w_buff1=0, x$w_buff1_used=0, x=2, y=1, z=2] [L747] 1 x = x$w_buff0_used && x$r_buff0_thd1 ? x$w_buff0 : (x$w_buff1_used && x$r_buff1_thd1 ? x$w_buff1 : x) [L748] 1 x$w_buff0_used = x$w_buff0_used && x$r_buff0_thd1 ? (_Bool)0 : x$w_buff0_used [L749] 1 x$w_buff1_used = x$w_buff0_used && x$r_buff0_thd1 || x$w_buff1_used && x$r_buff1_thd1 ? (_Bool)0 : x$w_buff1_used [L750] 1 x$r_buff0_thd1 = x$w_buff0_used && x$r_buff0_thd1 ? (_Bool)0 : x$r_buff0_thd1 [L751] 1 x$r_buff1_thd1 = x$w_buff0_used && x$r_buff0_thd1 || x$w_buff1_used && x$r_buff1_thd1 ? (_Bool)0 : x$r_buff1_thd1 VAL [\old(arg)={0:0}, \old(arg)={0:0}, __unbuffered_cnt=0, __unbuffered_p2_EAX=1, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=0, x$flush_delayed=0, x$mem_tmp=0, x$r_buff0_thd0=0, x$r_buff0_thd1=0, x$r_buff0_thd2=1, x$r_buff0_thd3=0, x$r_buff1_thd0=0, x$r_buff1_thd1=0, x$r_buff1_thd2=0, x$r_buff1_thd3=0, x$read_delayed=0, x$read_delayed_var={0:0}, x$w_buff0=2, x$w_buff0_used=0, x$w_buff1=0, x$w_buff1_used=0, x=2, y=1, z=2] [L796] 3 x = x$w_buff0_used && x$r_buff0_thd3 ? x$w_buff0 : (x$w_buff1_used && x$r_buff1_thd3 ? x$w_buff1 : x) [L797] 3 x$w_buff0_used = x$w_buff0_used && x$r_buff0_thd3 ? (_Bool)0 : x$w_buff0_used [L798] 3 x$w_buff1_used = x$w_buff0_used && x$r_buff0_thd3 || x$w_buff1_used && x$r_buff1_thd3 ? (_Bool)0 : x$w_buff1_used [L799] 3 x$r_buff0_thd3 = x$w_buff0_used && x$r_buff0_thd3 ? (_Bool)0 : x$r_buff0_thd3 [L800] 3 x$r_buff1_thd3 = x$w_buff0_used && x$r_buff0_thd3 || x$w_buff1_used && x$r_buff1_thd3 ? (_Bool)0 : x$r_buff1_thd3 VAL [\old(arg)={0:0}, \old(arg)={0:0}, __unbuffered_cnt=0, __unbuffered_p2_EAX=1, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=0, x$flush_delayed=0, x$mem_tmp=0, x$r_buff0_thd0=0, x$r_buff0_thd1=0, x$r_buff0_thd2=1, x$r_buff0_thd3=0, x$r_buff1_thd0=0, x$r_buff1_thd1=0, x$r_buff1_thd2=0, x$r_buff1_thd3=0, x$read_delayed=0, x$read_delayed_var={0:0}, x$w_buff0=2, x$w_buff0_used=0, x$w_buff1=0, x$w_buff1_used=0, x=2, y=1, z=2] [L783] 2 __unbuffered_cnt = __unbuffered_cnt + 1 VAL [\old(arg)={0:0}, \old(arg)={0:0}, \old(arg)={0:0}, __unbuffered_cnt=1, __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$$choice2=0, x$flush_delayed=0, x$mem_tmp=0, x$r_buff0_thd0=0, x$r_buff0_thd1=0, x$r_buff0_thd2=1, x$r_buff0_thd3=0, x$r_buff1_thd0=0, x$r_buff1_thd1=0, x$r_buff1_thd2=0, x$r_buff1_thd3=0, x$read_delayed=0, x$read_delayed_var={0:0}, x$w_buff0=2, x$w_buff0_used=0, x$w_buff1=0, x$w_buff1_used=0, x=2, y=1, z=2] [L754] 1 __unbuffered_cnt = __unbuffered_cnt + 1 VAL [\old(arg)={0:0}, \old(arg)={0:0}, __unbuffered_cnt=2, __unbuffered_p2_EAX=1, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=0, x$flush_delayed=0, x$mem_tmp=0, x$r_buff0_thd0=0, x$r_buff0_thd1=0, x$r_buff0_thd2=1, x$r_buff0_thd3=0, x$r_buff1_thd0=0, x$r_buff1_thd1=0, x$r_buff1_thd2=0, x$r_buff1_thd3=0, x$read_delayed=0, x$read_delayed_var={0:0}, x$w_buff0=2, x$w_buff0_used=0, x$w_buff1=0, x$w_buff1_used=0, x=2, y=1, z=2] [L803] 3 __unbuffered_cnt = __unbuffered_cnt + 1 VAL [\old(arg)={0:0}, \old(arg)={0:0}, __unbuffered_cnt=3, __unbuffered_p2_EAX=1, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=0, x$flush_delayed=0, x$mem_tmp=0, x$r_buff0_thd0=0, x$r_buff0_thd1=0, x$r_buff0_thd2=1, x$r_buff0_thd3=0, x$r_buff1_thd0=0, x$r_buff1_thd1=0, x$r_buff1_thd2=0, x$r_buff1_thd3=0, x$read_delayed=0, x$read_delayed_var={0:0}, x$w_buff0=2, x$w_buff0_used=0, x$w_buff1=0, x$w_buff1_used=0, x=2, y=1, z=2] [L825] 0 main$tmp_guard0 = __unbuffered_cnt == 3 VAL [\old(arg)={0:0}, \old(arg)={0:0}, __unbuffered_cnt=3, __unbuffered_p2_EAX=1, arg={0:0}, arg={0:0}, main$tmp_guard0=1, main$tmp_guard1=0, t2028=-1, t2029=0, t2030=1, weak$$choice0=0, weak$$choice2=0, x$flush_delayed=0, x$mem_tmp=0, x$r_buff0_thd0=0, x$r_buff0_thd1=0, x$r_buff0_thd2=1, x$r_buff0_thd3=0, x$r_buff1_thd0=0, x$r_buff1_thd1=0, x$r_buff1_thd2=0, x$r_buff1_thd3=0, x$read_delayed=0, x$read_delayed_var={0:0}, x$w_buff0=2, x$w_buff0_used=0, x$w_buff1=0, x$w_buff1_used=0, x=2, y=1, z=2] [L827] CALL 0 assume_abort_if_not(main$tmp_guard0) [L3] COND FALSE 0 !(!cond) [L827] RET 0 assume_abort_if_not(main$tmp_guard0) [L829] 0 x = x$w_buff0_used && x$r_buff0_thd0 ? x$w_buff0 : (x$w_buff1_used && x$r_buff1_thd0 ? x$w_buff1 : x) [L830] 0 x$w_buff0_used = x$w_buff0_used && x$r_buff0_thd0 ? (_Bool)0 : x$w_buff0_used [L831] 0 x$w_buff1_used = x$w_buff0_used && x$r_buff0_thd0 || x$w_buff1_used && x$r_buff1_thd0 ? (_Bool)0 : x$w_buff1_used [L832] 0 x$r_buff0_thd0 = x$w_buff0_used && x$r_buff0_thd0 ? (_Bool)0 : x$r_buff0_thd0 [L833] 0 x$r_buff1_thd0 = x$w_buff0_used && x$r_buff0_thd0 || x$w_buff1_used && x$r_buff1_thd0 ? (_Bool)0 : x$r_buff1_thd0 VAL [\old(arg)={0:0}, \old(arg)={0:0}, __unbuffered_cnt=3, __unbuffered_p2_EAX=1, arg={0:0}, arg={0:0}, main$tmp_guard0=1, main$tmp_guard1=0, t2028=-1, t2029=0, t2030=1, weak$$choice0=0, weak$$choice2=0, x$flush_delayed=0, x$mem_tmp=0, x$r_buff0_thd0=0, x$r_buff0_thd1=0, x$r_buff0_thd2=1, x$r_buff0_thd3=0, x$r_buff1_thd0=0, x$r_buff1_thd1=0, x$r_buff1_thd2=0, x$r_buff1_thd3=0, x$read_delayed=0, x$read_delayed_var={0:0}, x$w_buff0=2, x$w_buff0_used=0, x$w_buff1=0, x$w_buff1_used=0, x=2, y=1, z=2] [L836] 0 weak$$choice0 = __VERIFIER_nondet_bool() [L837] 0 weak$$choice2 = __VERIFIER_nondet_bool() [L838] 0 x$flush_delayed = weak$$choice2 [L839] 0 x$mem_tmp = x [L840] 0 x = !x$w_buff0_used || !x$r_buff0_thd0 && !x$w_buff1_used || !x$r_buff0_thd0 && !x$r_buff1_thd0 ? x : (x$w_buff0_used && x$r_buff0_thd0 ? x$w_buff0 : x$w_buff1) [L841] 0 x$w_buff0 = weak$$choice2 ? x$w_buff0 : (!x$w_buff0_used || !x$r_buff0_thd0 && !x$w_buff1_used || !x$r_buff0_thd0 && !x$r_buff1_thd0 ? x$w_buff0 : (x$w_buff0_used && x$r_buff0_thd0 ? x$w_buff0 : x$w_buff0)) [L842] 0 x$w_buff1 = weak$$choice2 ? x$w_buff1 : (!x$w_buff0_used || !x$r_buff0_thd0 && !x$w_buff1_used || !x$r_buff0_thd0 && !x$r_buff1_thd0 ? x$w_buff1 : (x$w_buff0_used && x$r_buff0_thd0 ? x$w_buff1 : x$w_buff1)) [L843] 0 x$w_buff0_used = weak$$choice2 ? x$w_buff0_used : (!x$w_buff0_used || !x$r_buff0_thd0 && !x$w_buff1_used || !x$r_buff0_thd0 && !x$r_buff1_thd0 ? x$w_buff0_used : (x$w_buff0_used && x$r_buff0_thd0 ? (_Bool)0 : x$w_buff0_used)) [L844] 0 x$w_buff1_used = weak$$choice2 ? x$w_buff1_used : (!x$w_buff0_used || !x$r_buff0_thd0 && !x$w_buff1_used || !x$r_buff0_thd0 && !x$r_buff1_thd0 ? x$w_buff1_used : (x$w_buff0_used && x$r_buff0_thd0 ? (_Bool)0 : (_Bool)0)) [L845] 0 x$r_buff0_thd0 = weak$$choice2 ? x$r_buff0_thd0 : (!x$w_buff0_used || !x$r_buff0_thd0 && !x$w_buff1_used || !x$r_buff0_thd0 && !x$r_buff1_thd0 ? x$r_buff0_thd0 : (x$w_buff0_used && x$r_buff0_thd0 ? (_Bool)0 : x$r_buff0_thd0)) [L846] 0 x$r_buff1_thd0 = weak$$choice2 ? x$r_buff1_thd0 : (!x$w_buff0_used || !x$r_buff0_thd0 && !x$w_buff1_used || !x$r_buff0_thd0 && !x$r_buff1_thd0 ? x$r_buff1_thd0 : (x$w_buff0_used && x$r_buff0_thd0 ? (_Bool)0 : (_Bool)0)) [L847] 0 main$tmp_guard1 = !(x == 2 && z == 2 && __unbuffered_p2_EAX == 1) [L848] 0 x = x$flush_delayed ? x$mem_tmp : x [L849] 0 x$flush_delayed = (_Bool)0 VAL [\old(arg)={0:0}, \old(arg)={0:0}, __unbuffered_cnt=3, __unbuffered_p2_EAX=1, arg={0:0}, arg={0:0}, main$tmp_guard0=1, main$tmp_guard1=0, t2028=-1, t2029=0, t2030=1, weak$$choice0=0, weak$$choice2=0, x$flush_delayed=0, x$mem_tmp=2, x$r_buff0_thd0=0, x$r_buff0_thd1=0, x$r_buff0_thd2=1, x$r_buff0_thd3=0, x$r_buff1_thd0=0, x$r_buff1_thd1=0, x$r_buff1_thd2=0, x$r_buff1_thd3=0, x$read_delayed=0, x$read_delayed_var={0:0}, x$w_buff0=2, x$w_buff0_used=0, x$w_buff1=0, x$w_buff1_used=0, x=2, y=1, z=2] [L851] CALL 0 __VERIFIER_assert(main$tmp_guard1) [L18] COND TRUE 0 !expression [L18] CALL 0 reach_error() [L17] COND FALSE 0 !(0) VAL [\old(arg)={0:0}, \old(arg)={0:0}, __unbuffered_cnt=3, __unbuffered_p2_EAX=1, arg={0:0}, arg={0:0}, main$tmp_guard0=1, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=0, x$flush_delayed=0, x$mem_tmp=2, x$r_buff0_thd0=0, x$r_buff0_thd1=0, x$r_buff0_thd2=1, x$r_buff0_thd3=0, x$r_buff1_thd0=0, x$r_buff1_thd1=0, x$r_buff1_thd2=0, x$r_buff1_thd3=0, x$read_delayed=0, x$read_delayed_var={0:0}, x$w_buff0=2, x$w_buff0_used=0, x$w_buff1=0, x$w_buff1_used=0, x=2, y=1, z=2] [L17] 0 __assert_fail ("0", "safe011_power.opt_pso.opt.c", 8, __extension__ __PRETTY_FUNCTION__) VAL [\old(arg)={0:0}, \old(arg)={0:0}, __unbuffered_cnt=3, __unbuffered_p2_EAX=1, arg={0:0}, arg={0:0}, main$tmp_guard0=1, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=0, x$flush_delayed=0, x$mem_tmp=2, x$r_buff0_thd0=0, x$r_buff0_thd1=0, x$r_buff0_thd2=1, x$r_buff0_thd3=0, x$r_buff1_thd0=0, x$r_buff1_thd1=0, x$r_buff1_thd2=0, x$r_buff1_thd3=0, x$read_delayed=0, x$read_delayed_var={0:0}, x$w_buff0=2, x$w_buff0_used=0, x$w_buff1=0, x$w_buff1_used=0, x=2, y=1, z=2] - UnprovableResult [Line: 17]: Unable to prove that all allocated memory was freed Unable to prove that all allocated memory was freed Reason: Not analyzed. - UnprovableResult [Line: 816]: Unable to prove that all allocated memory was freed Unable to prove that all allocated memory was freed Reason: Not analyzed. - UnprovableResult [Line: 823]: 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: 819]: 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: 821]: 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, 68 locations, 7 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: 23.0s, OverallIterations: 15, TraceHistogramMax: 1, PathProgramHistogramMax: 2, EmptinessCheckTime: 0.0s, AutomataDifference: 12.6s, DeadEndRemovalTime: 0.0s, HoareAnnotationTime: 0.0s, InitialAbstractionConstructionTime: 0.1s, HoareTripleCheckerStatistics: 0 mSolverCounterUnknown, 675 SdHoareTripleChecker+Valid, 3.7s IncrementalHoareTripleChecker+Time, 0 mSdLazyCounter, 639 mSDsluCounter, 171 SdHoareTripleChecker+Invalid, 3.2s Time, 0 mProtectedAction, 0 SdHoareTripleChecker+Unchecked, 0 IncrementalHoareTripleChecker+Unchecked, 125 mSDsCounter, 87 IncrementalHoareTripleChecker+Valid, 0 mProtectedPredicate, 1758 IncrementalHoareTripleChecker+Invalid, 1845 SdHoareTripleChecker+Unknown, 0 mSolverCounterNotChecked, 87 mSolverCounterUnsat, 46 mSDtfsCounter, 1758 mSolverCounterSat, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Unknown, PredicateUnifierStatistics: 0 DeclaredPredicates, 114 GetRequests, 14 SyntacticMatches, 0 SemanticMatches, 100 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 99 ImplicationChecksByTransitivity, 1.7s Time, 0.0s BasicInterpolantAutomatonTime, BiggestAbstraction: size=791occurred in iteration=10, InterpolantAutomatonStates: 97, traceCheckStatistics: No data available, InterpolantConsolidationStatistics: No data available, PathInvariantsStatistics: No data available, 0/0 InterpolantCoveringCapability, TotalInterpolationStatistics: No data available, 0.0s DumpTime, AutomataMinimizationStatistics: No data available, HoareAnnotationStatistics: No data available, RefinementEngineStatistics: TRACE_CHECK: 0.1s SsaConstructionTime, 0.8s SatisfiabilityAnalysisTime, 8.8s InterpolantComputationTime, 317 NumberOfCodeBlocks, 317 NumberOfCodeBlocksAsserted, 15 NumberOfCheckSat, 273 ConstructedInterpolants, 0 QuantifiedInterpolants, 1707 SizeOfPredicates, 0 NumberOfNonLiveVariables, 0 ConjunctsInSsa, 0 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-08 19:11:53,752 INFO L552 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_dbfb2896-8405-4c25-b1c4-f34e4377ca0b/bin/uautomizer-verify-jihMAELWvX/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/lib/jvm/java-1.11.0-openjdk-amd64/bin/java -Dosgi.configuration.area=/tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_dbfb2896-8405-4c25-b1c4-f34e4377ca0b/bin/uautomizer-verify-jihMAELWvX/data/config -Xmx15G -Xms4m -jar /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_dbfb2896-8405-4c25-b1c4-f34e4377ca0b/bin/uautomizer-verify-jihMAELWvX/plugins/org.eclipse.equinox.launcher_1.5.800.v20200727-1323.jar -data @noDefault -ultimatedata /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_dbfb2896-8405-4c25-b1c4-f34e4377ca0b/bin/uautomizer-verify-jihMAELWvX/data -tc /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_dbfb2896-8405-4c25-b1c4-f34e4377ca0b/bin/uautomizer-verify-jihMAELWvX/config/AutomizerMemDerefMemtrack.xml -i ../../sv-benchmarks/c/pthread-wmm/safe011_power.opt_pso.opt.i -s /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_dbfb2896-8405-4c25-b1c4-f34e4377ca0b/bin/uautomizer-verify-jihMAELWvX/config/svcomp-DerefFreeMemtrack-32bit-Automizer_Bitvector.epf --cacsl2boogietranslator.entry.function main --witnessprinter.witness.directory /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_dbfb2896-8405-4c25-b1c4-f34e4377ca0b/bin/uautomizer-verify-jihMAELWvX --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 bdec055c4bfc04b6b0c3fc918f7b96def91dcb331178222835136af29a7feef5 --- Real Ultimate output --- This is Ultimate 0.2.5-dev-a016563 [2024-11-08 19:11:56,310 INFO L188 SettingsManager]: Resetting all preferences to default values... [2024-11-08 19:11:56,406 INFO L114 SettingsManager]: Loading settings from /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_dbfb2896-8405-4c25-b1c4-f34e4377ca0b/bin/uautomizer-verify-jihMAELWvX/config/svcomp-DerefFreeMemtrack-32bit-Automizer_Bitvector.epf [2024-11-08 19:11:56,413 WARN L101 SettingsManager]: Preference file contains the following unknown settings: [2024-11-08 19:11:56,415 WARN L103 SettingsManager]: * de.uni_freiburg.informatik.ultimate.core.Log level for class [2024-11-08 19:11:56,453 INFO L130 SettingsManager]: Preferences different from defaults after loading the file: [2024-11-08 19:11:56,456 INFO L151 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2024-11-08 19:11:56,457 INFO L153 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2024-11-08 19:11:56,458 INFO L151 SettingsManager]: Preferences of Boogie Preprocessor differ from their defaults: [2024-11-08 19:11:56,459 INFO L153 SettingsManager]: * Use memory slicer=true [2024-11-08 19:11:56,460 INFO L151 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2024-11-08 19:11:56,460 INFO L153 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2024-11-08 19:11:56,461 INFO L151 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2024-11-08 19:11:56,462 INFO L153 SettingsManager]: * Create parallel compositions if possible=false [2024-11-08 19:11:56,464 INFO L153 SettingsManager]: * Use SBE=true [2024-11-08 19:11:56,465 INFO L151 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2024-11-08 19:11:56,465 INFO L153 SettingsManager]: * sizeof long=4 [2024-11-08 19:11:56,465 INFO L153 SettingsManager]: * Overapproximate operations on floating types=true [2024-11-08 19:11:56,466 INFO L153 SettingsManager]: * sizeof POINTER=4 [2024-11-08 19:11:56,466 INFO L153 SettingsManager]: * Check division by zero=IGNORE [2024-11-08 19:11:56,466 INFO L153 SettingsManager]: * Check for the main procedure if all allocated memory was freed=true [2024-11-08 19:11:56,471 INFO L153 SettingsManager]: * Bitprecise bitfields=true [2024-11-08 19:11:56,471 INFO L153 SettingsManager]: * SV-COMP memtrack compatibility mode=true [2024-11-08 19:11:56,472 INFO L153 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2024-11-08 19:11:56,472 INFO L153 SettingsManager]: * Adapt memory model on pointer casts if necessary=true [2024-11-08 19:11:56,472 INFO L153 SettingsManager]: * Use bitvectors instead of ints=true [2024-11-08 19:11:56,472 INFO L153 SettingsManager]: * Allow undefined functions=false [2024-11-08 19:11:56,473 INFO L153 SettingsManager]: * Memory model=HoenickeLindenmann_4ByteResolution [2024-11-08 19:11:56,473 INFO L153 SettingsManager]: * Check unreachability of reach_error function=false [2024-11-08 19:11:56,473 INFO L153 SettingsManager]: * sizeof long double=12 [2024-11-08 19:11:56,474 INFO L153 SettingsManager]: * Use constant arrays=true [2024-11-08 19:11:56,475 INFO L151 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2024-11-08 19:11:56,475 INFO L153 SettingsManager]: * Size of a code block=SequenceOfStatements [2024-11-08 19:11:56,475 INFO L153 SettingsManager]: * Only consider context switches at boundaries of atomic blocks=true [2024-11-08 19:11:56,476 INFO L153 SettingsManager]: * SMT solver=External_DefaultMode [2024-11-08 19:11:56,476 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2024-11-08 19:11:56,476 INFO L151 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2024-11-08 19:11:56,477 INFO L153 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2024-11-08 19:11:56,477 INFO L153 SettingsManager]: * Trace refinement strategy=FOX [2024-11-08 19:11:56,477 INFO L153 SettingsManager]: * Command for external solver=cvc4 --incremental --print-success --lang smt [2024-11-08 19:11:56,478 INFO L153 SettingsManager]: * Apply one-shot large block encoding in concurrent analysis=false [2024-11-08 19:11:56,478 INFO L153 SettingsManager]: * Automaton type used in concurrency analysis=PETRI_NET [2024-11-08 19:11:56,480 INFO L153 SettingsManager]: * Order on configurations for Petri net unfoldings=DBO [2024-11-08 19:11:56,480 INFO L153 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2024-11-08 19:11:56,481 INFO L153 SettingsManager]: * Looper check in Petri net analysis=SEMANTIC WARNING: An illegal reflective access operation has occurred WARNING: Illegal reflective access by com.sun.xml.bind.v2.runtime.reflect.opt.Injector$1 (file:/tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_dbfb2896-8405-4c25-b1c4-f34e4377ca0b/bin/uautomizer-verify-jihMAELWvX/plugins/com.sun.xml.bind_2.2.0.v201505121915.jar) to method java.lang.ClassLoader.defineClass(java.lang.String,byte[],int,int) WARNING: Please consider reporting this to the maintainers of com.sun.xml.bind.v2.runtime.reflect.opt.Injector$1 WARNING: Use --illegal-access=warn to enable warnings of further illegal reflective access operations WARNING: All illegal access operations will be denied in a future release Applying setting for plugin de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator: Entry function -> main Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Witness directory -> /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_dbfb2896-8405-4c25-b1c4-f34e4377ca0b/bin/uautomizer-verify-jihMAELWvX 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 -> bdec055c4bfc04b6b0c3fc918f7b96def91dcb331178222835136af29a7feef5 [2024-11-08 19:11:56,886 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2024-11-08 19:11:56,915 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2024-11-08 19:11:56,918 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2024-11-08 19:11:56,920 INFO L270 PluginConnector]: Initializing CDTParser... [2024-11-08 19:11:56,920 INFO L274 PluginConnector]: CDTParser initialized [2024-11-08 19:11:56,922 INFO L431 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_dbfb2896-8405-4c25-b1c4-f34e4377ca0b/bin/uautomizer-verify-jihMAELWvX/../../sv-benchmarks/c/pthread-wmm/safe011_power.opt_pso.opt.i Unable to find full path for "g++" [2024-11-08 19:11:59,224 INFO L533 CDTParser]: Created temporary CDT project at NULL [2024-11-08 19:11:59,519 INFO L384 CDTParser]: Found 1 translation units. [2024-11-08 19:11:59,519 INFO L180 CDTParser]: Scanning /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_dbfb2896-8405-4c25-b1c4-f34e4377ca0b/sv-benchmarks/c/pthread-wmm/safe011_power.opt_pso.opt.i [2024-11-08 19:11:59,536 INFO L427 CDTParser]: About to delete temporary CDT project at /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_dbfb2896-8405-4c25-b1c4-f34e4377ca0b/bin/uautomizer-verify-jihMAELWvX/data/576991b3d/3ea9274d9c434523953cf68a2ccf4e97/FLAGb86eab52c [2024-11-08 19:11:59,553 INFO L435 CDTParser]: Successfully deleted /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_dbfb2896-8405-4c25-b1c4-f34e4377ca0b/bin/uautomizer-verify-jihMAELWvX/data/576991b3d/3ea9274d9c434523953cf68a2ccf4e97 [2024-11-08 19:11:59,556 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2024-11-08 19:11:59,558 INFO L133 ToolchainWalker]: Walking toolchain with 6 elements. [2024-11-08 19:11:59,559 INFO L112 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2024-11-08 19:11:59,559 INFO L270 PluginConnector]: Initializing CACSL2BoogieTranslator... [2024-11-08 19:11:59,565 INFO L274 PluginConnector]: CACSL2BoogieTranslator initialized [2024-11-08 19:11:59,566 INFO L184 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 08.11 07:11:59" (1/1) ... [2024-11-08 19:11:59,567 INFO L204 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@26c0789 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.11 07:11:59, skipping insertion in model container [2024-11-08 19:11:59,568 INFO L184 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 08.11 07:11:59" (1/1) ... [2024-11-08 19:11:59,648 INFO L175 MainTranslator]: Built tables and reachable declarations [2024-11-08 19:12:00,201 INFO L210 PostProcessor]: Analyzing one entry point: main [2024-11-08 19:12:00,216 INFO L200 MainTranslator]: Completed pre-run [2024-11-08 19:12:00,280 INFO L210 PostProcessor]: Analyzing one entry point: main [2024-11-08 19:12:00,326 INFO L204 MainTranslator]: Completed translation [2024-11-08 19:12:00,327 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.11 07:12:00 WrapperNode [2024-11-08 19:12:00,327 INFO L131 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2024-11-08 19:12:00,341 INFO L112 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2024-11-08 19:12:00,342 INFO L270 PluginConnector]: Initializing Boogie Procedure Inliner... [2024-11-08 19:12:00,342 INFO L274 PluginConnector]: Boogie Procedure Inliner initialized [2024-11-08 19:12:00,350 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.11 07:12:00" (1/1) ... [2024-11-08 19:12:00,378 INFO L184 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.11 07:12:00" (1/1) ... [2024-11-08 19:12:00,418 INFO L138 Inliner]: procedures = 176, calls = 43, calls flagged for inlining = 6, calls inlined = 7, statements flattened = 138 [2024-11-08 19:12:00,418 INFO L131 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2024-11-08 19:12:00,419 INFO L112 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2024-11-08 19:12:00,419 INFO L270 PluginConnector]: Initializing Boogie Preprocessor... [2024-11-08 19:12:00,419 INFO L274 PluginConnector]: Boogie Preprocessor initialized [2024-11-08 19:12:00,432 INFO L184 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.11 07:12:00" (1/1) ... [2024-11-08 19:12:00,432 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.11 07:12:00" (1/1) ... [2024-11-08 19:12:00,435 INFO L184 PluginConnector]: Executing the observer MemorySlicer from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.11 07:12:00" (1/1) ... [2024-11-08 19:12:00,464 INFO L175 MemorySlicer]: Split 2 memory accesses to 1 slices as follows [2]. 100 percent of accesses are in the largest equivalence class. The 2 initializations are split as follows [2]. The 0 writes are split as follows [0]. [2024-11-08 19:12:00,468 INFO L184 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.11 07:12:00" (1/1) ... [2024-11-08 19:12:00,468 INFO L184 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.11 07:12:00" (1/1) ... [2024-11-08 19:12:00,478 INFO L184 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.11 07:12:00" (1/1) ... [2024-11-08 19:12:00,483 INFO L184 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.11 07:12:00" (1/1) ... [2024-11-08 19:12:00,489 INFO L184 PluginConnector]: Executing the observer LTLStepAnnotator from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.11 07:12:00" (1/1) ... [2024-11-08 19:12:00,491 INFO L184 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.11 07:12:00" (1/1) ... [2024-11-08 19:12:00,497 INFO L131 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2024-11-08 19:12:00,502 INFO L112 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2024-11-08 19:12:00,502 INFO L270 PluginConnector]: Initializing RCFGBuilder... [2024-11-08 19:12:00,502 INFO L274 PluginConnector]: RCFGBuilder initialized [2024-11-08 19:12:00,503 INFO L184 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.11 07:12:00" (1/1) ... [2024-11-08 19:12:00,519 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2024-11-08 19:12:00,534 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_dbfb2896-8405-4c25-b1c4-f34e4377ca0b/bin/uautomizer-verify-jihMAELWvX/z3 [2024-11-08 19:12:00,553 INFO L229 MonitoredProcess]: Starting monitored process 1 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_dbfb2896-8405-4c25-b1c4-f34e4377ca0b/bin/uautomizer-verify-jihMAELWvX/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 (exit command is (exit), workingDir is null) [2024-11-08 19:12:00,560 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_dbfb2896-8405-4c25-b1c4-f34e4377ca0b/bin/uautomizer-verify-jihMAELWvX/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 (1)] Waiting until timeout for monitored process [2024-11-08 19:12:00,589 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_atomic_begin [2024-11-08 19:12:00,590 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2024-11-08 19:12:00,590 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~intINTTYPE1#0 [2024-11-08 19:12:00,590 INFO L130 BoogieDeclarations]: Found specification of procedure P0 [2024-11-08 19:12:00,590 INFO L138 BoogieDeclarations]: Found implementation of procedure P0 [2024-11-08 19:12:00,591 INFO L130 BoogieDeclarations]: Found specification of procedure P1 [2024-11-08 19:12:00,591 INFO L138 BoogieDeclarations]: Found implementation of procedure P1 [2024-11-08 19:12:00,591 INFO L130 BoogieDeclarations]: Found specification of procedure P2 [2024-11-08 19:12:00,593 INFO L138 BoogieDeclarations]: Found implementation of procedure P2 [2024-11-08 19:12:00,593 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_atomic_end [2024-11-08 19:12:00,593 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2024-11-08 19:12:00,593 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2024-11-08 19:12:00,595 WARN L207 CfgBuilder]: User set CodeBlockSize to SequenceOfStatements but program contains fork statements. Overwriting the user preferences and setting CodeBlockSize to OneNontrivialStatement. [2024-11-08 19:12:00,800 INFO L238 CfgBuilder]: Building ICFG [2024-11-08 19:12:00,803 INFO L264 CfgBuilder]: Building CFG for each procedure with an implementation [2024-11-08 19:12:01,274 INFO L283 CfgBuilder]: Omitted future-live optimization because the input is a concurrent program. [2024-11-08 19:12:01,274 INFO L287 CfgBuilder]: Performing block encoding [2024-11-08 19:12:01,613 INFO L311 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2024-11-08 19:12:01,614 INFO L316 CfgBuilder]: Removed 0 assume(true) statements. [2024-11-08 19:12:01,615 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 08.11 07:12:01 BoogieIcfgContainer [2024-11-08 19:12:01,616 INFO L131 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2024-11-08 19:12:01,619 INFO L112 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2024-11-08 19:12:01,620 INFO L270 PluginConnector]: Initializing TraceAbstraction... [2024-11-08 19:12:01,623 INFO L274 PluginConnector]: TraceAbstraction initialized [2024-11-08 19:12:01,624 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 08.11 07:11:59" (1/3) ... [2024-11-08 19:12:01,625 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@2b77fa24 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 08.11 07:12:01, skipping insertion in model container [2024-11-08 19:12:01,626 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.11 07:12:00" (2/3) ... [2024-11-08 19:12:01,626 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@2b77fa24 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 08.11 07:12:01, skipping insertion in model container [2024-11-08 19:12:01,627 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 08.11 07:12:01" (3/3) ... [2024-11-08 19:12:01,629 INFO L112 eAbstractionObserver]: Analyzing ICFG safe011_power.opt_pso.opt.i [2024-11-08 19:12:01,650 INFO L214 ceAbstractionStarter]: Automizer settings: Hoare:None NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2024-11-08 19:12:01,650 INFO L154 ceAbstractionStarter]: Applying trace abstraction to program that has 3 error locations. [2024-11-08 19:12:01,651 INFO L489 ceAbstractionStarter]: Constructing petrified ICFG for 1 thread instances. [2024-11-08 19:12:01,743 INFO L143 ThreadInstanceAdder]: Constructed 0 joinOtherThreadTransitions. [2024-11-08 19:12:01,782 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 52 places, 44 transitions, 100 flow [2024-11-08 19:12:01,828 INFO L124 PetriNetUnfolderBase]: 2/41 cut-off events. [2024-11-08 19:12:01,829 INFO L125 PetriNetUnfolderBase]: For 0/0 co-relation queries the response was YES. [2024-11-08 19:12:01,832 INFO L83 FinitePrefix]: Finished finitePrefix Result has 51 conditions, 41 events. 2/41 cut-off events. For 0/0 co-relation queries the response was YES. Maximal size of possible extension queue 5. Compared 79 event pairs, 0 based on Foata normal form. 0/36 useless extension candidates. Maximal degree in co-relation 43. Up to 2 conditions per place. [2024-11-08 19:12:01,833 INFO L82 GeneralOperation]: Start removeDead. Operand has 52 places, 44 transitions, 100 flow [2024-11-08 19:12:01,838 INFO L88 GeneralOperation]: Finished RemoveDead, result has has 49 places, 41 transitions, 91 flow [2024-11-08 19:12:01,851 INFO L332 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2024-11-08 19:12:01,859 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;@7ff5b70, mLbeIndependenceSettings=[IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=false, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2024-11-08 19:12:01,859 INFO L334 AbstractCegarLoop]: Starting to check reachability of 7 error locations. [2024-11-08 19:12:01,867 INFO L185 PetriNetUnfolderBase]: Found word, exiting Unfolder. [2024-11-08 19:12:01,868 INFO L124 PetriNetUnfolderBase]: 0/10 cut-off events. [2024-11-08 19:12:01,868 INFO L125 PetriNetUnfolderBase]: For 0/0 co-relation queries the response was YES. [2024-11-08 19:12:01,868 INFO L196 CegarLoopForPetriNet]: Found error trace [2024-11-08 19:12:01,869 INFO L204 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1] [2024-11-08 19:12:01,870 INFO L396 AbstractCegarLoop]: === Iteration 1 === Targeting P1Err0ASSERT_VIOLATIONMEMORY_LEAK === [P1Err0ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr1ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr0ASSERT_VIOLATIONMEMORY_LEAK (and 4 more)] === [2024-11-08 19:12:01,875 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-08 19:12:01,875 INFO L85 PathProgramCache]: Analyzing trace with hash -1353053513, now seen corresponding path program 1 times [2024-11-08 19:12:01,888 INFO L118 FreeRefinementEngine]: Executing refinement strategy FOX [2024-11-08 19:12:01,889 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleZ3 [2126222943] [2024-11-08 19:12:01,889 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-08 19:12:01,890 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-11-08 19:12:01,890 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_dbfb2896-8405-4c25-b1c4-f34e4377ca0b/bin/uautomizer-verify-jihMAELWvX/z3 [2024-11-08 19:12:01,892 INFO L229 MonitoredProcess]: Starting monitored process 2 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_dbfb2896-8405-4c25-b1c4-f34e4377ca0b/bin/uautomizer-verify-jihMAELWvX/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2024-11-08 19:12:01,894 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_dbfb2896-8405-4c25-b1c4-f34e4377ca0b/bin/uautomizer-verify-jihMAELWvX/z3 -smt2 -in SMTLIB2_COMPLIANT=true (2)] Waiting until timeout for monitored process [2024-11-08 19:12:02,010 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 19:12:02,014 INFO L255 TraceCheckSpWp]: Trace formula consists of 62 conjuncts, 5 conjuncts are in the unsatisfiable core [2024-11-08 19:12:02,018 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-11-08 19:12:02,058 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-08 19:12:02,058 INFO L307 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2024-11-08 19:12:02,059 INFO L136 FreeRefinementEngine]: Strategy FOX found an infeasible trace [2024-11-08 19:12:02,059 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [2126222943] [2024-11-08 19:12:02,060 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [2126222943] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-08 19:12:02,060 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-08 19:12:02,061 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [1] imperfect sequences [] total 1 [2024-11-08 19:12:02,062 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [972662907] [2024-11-08 19:12:02,063 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-08 19:12:02,071 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2024-11-08 19:12:02,077 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy FOX [2024-11-08 19:12:02,107 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-11-08 19:12:02,108 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-11-08 19:12:02,110 INFO L467 CegarLoopForPetriNet]: Number of universal loopers: 19 out of 44 [2024-11-08 19:12:02,113 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 49 places, 41 transitions, 91 flow. Second operand has 3 states, 3 states have (on average 20.666666666666668) internal successors, (62), 3 states have internal predecessors, (62), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-08 19:12:02,113 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-11-08 19:12:02,113 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 19 of 44 [2024-11-08 19:12:02,115 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-11-08 19:12:02,606 INFO L124 PetriNetUnfolderBase]: 678/1271 cut-off events. [2024-11-08 19:12:02,607 INFO L125 PetriNetUnfolderBase]: For 9/9 co-relation queries the response was YES. [2024-11-08 19:12:02,613 INFO L83 FinitePrefix]: Finished finitePrefix Result has 2341 conditions, 1271 events. 678/1271 cut-off events. For 9/9 co-relation queries the response was YES. Maximal size of possible extension queue 96. Compared 8121 event pairs, 108 based on Foata normal form. 72/1325 useless extension candidates. Maximal degree in co-relation 2330. Up to 832 conditions per place. [2024-11-08 19:12:02,625 INFO L140 encePairwiseOnDemand]: 39/44 looper letters, 31 selfloop transitions, 2 changer transitions 2/51 dead transitions. [2024-11-08 19:12:02,626 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 49 places, 51 transitions, 184 flow [2024-11-08 19:12:02,627 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-11-08 19:12:02,630 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2024-11-08 19:12:02,640 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 97 transitions. [2024-11-08 19:12:02,642 INFO L512 CegarLoopForPetriNet]: DFA transition density 0.7348484848484849 [2024-11-08 19:12:02,644 INFO L175 Difference]: Start difference. First operand has 49 places, 41 transitions, 91 flow. Second operand 3 states and 97 transitions. [2024-11-08 19:12:02,645 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 49 places, 51 transitions, 184 flow [2024-11-08 19:12:02,648 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 46 places, 51 transitions, 180 flow, removed 0 selfloop flow, removed 3 redundant places. [2024-11-08 19:12:02,654 INFO L231 Difference]: Finished difference. Result has 46 places, 36 transitions, 82 flow [2024-11-08 19:12:02,657 INFO L260 CegarLoopForPetriNet]: {PETRI_ALPHABET=44, PETRI_DIFFERENCE_MINUEND_FLOW=80, PETRI_DIFFERENCE_MINUEND_PLACES=44, 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=3, PETRI_FLOW=82, PETRI_PLACES=46, PETRI_TRANSITIONS=36} [2024-11-08 19:12:02,662 INFO L277 CegarLoopForPetriNet]: 49 programPoint places, -3 predicate places. [2024-11-08 19:12:02,662 INFO L471 AbstractCegarLoop]: Abstraction has has 46 places, 36 transitions, 82 flow [2024-11-08 19:12:02,663 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 20.666666666666668) internal successors, (62), 3 states have internal predecessors, (62), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-08 19:12:02,663 INFO L196 CegarLoopForPetriNet]: Found error trace [2024-11-08 19:12:02,663 INFO L204 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-08 19:12:02,685 INFO L552 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_dbfb2896-8405-4c25-b1c4-f34e4377ca0b/bin/uautomizer-verify-jihMAELWvX/z3 -smt2 -in SMTLIB2_COMPLIANT=true (2)] Ended with exit code 0 [2024-11-08 19:12:02,868 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 2 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_dbfb2896-8405-4c25-b1c4-f34e4377ca0b/bin/uautomizer-verify-jihMAELWvX/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-11-08 19:12:02,868 INFO L396 AbstractCegarLoop]: === Iteration 2 === Targeting ULTIMATE.startErr1ASSERT_VIOLATIONMEMORY_LEAK === [P1Err0ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr1ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr0ASSERT_VIOLATIONMEMORY_LEAK (and 4 more)] === [2024-11-08 19:12:02,869 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-08 19:12:02,869 INFO L85 PathProgramCache]: Analyzing trace with hash 1234145807, now seen corresponding path program 1 times [2024-11-08 19:12:02,870 INFO L118 FreeRefinementEngine]: Executing refinement strategy FOX [2024-11-08 19:12:02,871 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleZ3 [1495843448] [2024-11-08 19:12:02,871 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-08 19:12:02,871 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-11-08 19:12:02,871 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_dbfb2896-8405-4c25-b1c4-f34e4377ca0b/bin/uautomizer-verify-jihMAELWvX/z3 [2024-11-08 19:12:02,873 INFO L229 MonitoredProcess]: Starting monitored process 3 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_dbfb2896-8405-4c25-b1c4-f34e4377ca0b/bin/uautomizer-verify-jihMAELWvX/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2024-11-08 19:12:02,874 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_dbfb2896-8405-4c25-b1c4-f34e4377ca0b/bin/uautomizer-verify-jihMAELWvX/z3 -smt2 -in SMTLIB2_COMPLIANT=true (3)] Waiting until timeout for monitored process [2024-11-08 19:12:02,989 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 19:12:02,992 INFO L255 TraceCheckSpWp]: Trace formula consists of 89 conjuncts, 2 conjuncts are in the unsatisfiable core [2024-11-08 19:12:02,993 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-11-08 19:12:03,031 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-08 19:12:03,032 INFO L307 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2024-11-08 19:12:03,032 INFO L136 FreeRefinementEngine]: Strategy FOX found an infeasible trace [2024-11-08 19:12:03,033 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1495843448] [2024-11-08 19:12:03,033 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1495843448] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-08 19:12:03,033 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-08 19:12:03,033 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [1] imperfect sequences [] total 1 [2024-11-08 19:12:03,034 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [242625087] [2024-11-08 19:12:03,034 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-08 19:12:03,035 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2024-11-08 19:12:03,036 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy FOX [2024-11-08 19:12:03,036 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-11-08 19:12:03,036 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-11-08 19:12:03,039 INFO L467 CegarLoopForPetriNet]: Number of universal loopers: 18 out of 44 [2024-11-08 19:12:03,039 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 46 places, 36 transitions, 82 flow. Second operand has 3 states, 3 states have (on average 22.333333333333332) internal successors, (67), 3 states have internal predecessors, (67), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-08 19:12:03,040 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-11-08 19:12:03,040 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 18 of 44 [2024-11-08 19:12:03,040 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-11-08 19:12:03,311 INFO L124 PetriNetUnfolderBase]: 603/1127 cut-off events. [2024-11-08 19:12:03,311 INFO L125 PetriNetUnfolderBase]: For 78/78 co-relation queries the response was YES. [2024-11-08 19:12:03,314 INFO L83 FinitePrefix]: Finished finitePrefix Result has 2163 conditions, 1127 events. 603/1127 cut-off events. For 78/78 co-relation queries the response was YES. Maximal size of possible extension queue 84. Compared 7108 event pairs, 603 based on Foata normal form. 36/1115 useless extension candidates. Maximal degree in co-relation 2153. Up to 922 conditions per place. [2024-11-08 19:12:03,319 INFO L140 encePairwiseOnDemand]: 42/44 looper letters, 18 selfloop transitions, 1 changer transitions 1/35 dead transitions. [2024-11-08 19:12:03,320 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 46 places, 35 transitions, 120 flow [2024-11-08 19:12:03,321 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-11-08 19:12:03,322 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2024-11-08 19:12:03,323 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 75 transitions. [2024-11-08 19:12:03,325 INFO L512 CegarLoopForPetriNet]: DFA transition density 0.5681818181818182 [2024-11-08 19:12:03,325 INFO L175 Difference]: Start difference. First operand has 46 places, 36 transitions, 82 flow. Second operand 3 states and 75 transitions. [2024-11-08 19:12:03,325 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 46 places, 35 transitions, 120 flow [2024-11-08 19:12:03,326 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 44 places, 35 transitions, 116 flow, removed 0 selfloop flow, removed 2 redundant places. [2024-11-08 19:12:03,327 INFO L231 Difference]: Finished difference. Result has 44 places, 34 transitions, 76 flow [2024-11-08 19:12:03,328 INFO L260 CegarLoopForPetriNet]: {PETRI_ALPHABET=44, PETRI_DIFFERENCE_MINUEND_FLOW=76, PETRI_DIFFERENCE_MINUEND_PLACES=42, 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=76, PETRI_PLACES=44, PETRI_TRANSITIONS=34} [2024-11-08 19:12:03,328 INFO L277 CegarLoopForPetriNet]: 49 programPoint places, -5 predicate places. [2024-11-08 19:12:03,328 INFO L471 AbstractCegarLoop]: Abstraction has has 44 places, 34 transitions, 76 flow [2024-11-08 19:12:03,329 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 22.333333333333332) internal successors, (67), 3 states have internal predecessors, (67), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-08 19:12:03,329 INFO L196 CegarLoopForPetriNet]: Found error trace [2024-11-08 19:12:03,329 INFO L204 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-08 19:12:03,348 INFO L552 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_dbfb2896-8405-4c25-b1c4-f34e4377ca0b/bin/uautomizer-verify-jihMAELWvX/z3 -smt2 -in SMTLIB2_COMPLIANT=true (3)] Ended with exit code 0 [2024-11-08 19:12:03,529 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 3 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_dbfb2896-8405-4c25-b1c4-f34e4377ca0b/bin/uautomizer-verify-jihMAELWvX/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-11-08 19:12:03,530 INFO L396 AbstractCegarLoop]: === Iteration 3 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONMEMORY_LEAK === [P1Err0ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr1ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr0ASSERT_VIOLATIONMEMORY_LEAK (and 4 more)] === [2024-11-08 19:12:03,530 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-08 19:12:03,530 INFO L85 PathProgramCache]: Analyzing trace with hash 1234147328, now seen corresponding path program 1 times [2024-11-08 19:12:03,531 INFO L118 FreeRefinementEngine]: Executing refinement strategy FOX [2024-11-08 19:12:03,531 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleZ3 [1100090013] [2024-11-08 19:12:03,531 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-08 19:12:03,532 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-11-08 19:12:03,532 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_dbfb2896-8405-4c25-b1c4-f34e4377ca0b/bin/uautomizer-verify-jihMAELWvX/z3 [2024-11-08 19:12:03,533 INFO L229 MonitoredProcess]: Starting monitored process 4 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_dbfb2896-8405-4c25-b1c4-f34e4377ca0b/bin/uautomizer-verify-jihMAELWvX/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2024-11-08 19:12:03,534 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_dbfb2896-8405-4c25-b1c4-f34e4377ca0b/bin/uautomizer-verify-jihMAELWvX/z3 -smt2 -in SMTLIB2_COMPLIANT=true (4)] Waiting until timeout for monitored process [2024-11-08 19:12:03,663 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 19:12:03,664 INFO L255 TraceCheckSpWp]: Trace formula consists of 89 conjuncts, 3 conjuncts are in the unsatisfiable core [2024-11-08 19:12:03,666 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-11-08 19:12:03,735 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-08 19:12:03,736 INFO L307 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2024-11-08 19:12:03,736 INFO L136 FreeRefinementEngine]: Strategy FOX found an infeasible trace [2024-11-08 19:12:03,736 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1100090013] [2024-11-08 19:12:03,736 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1100090013] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-08 19:12:03,737 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-08 19:12:03,737 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2024-11-08 19:12:03,737 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [864936309] [2024-11-08 19:12:03,737 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-08 19:12:03,738 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2024-11-08 19:12:03,738 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy FOX [2024-11-08 19:12:03,739 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2024-11-08 19:12:03,739 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2024-11-08 19:12:03,755 INFO L467 CegarLoopForPetriNet]: Number of universal loopers: 15 out of 44 [2024-11-08 19:12:03,756 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 44 places, 34 transitions, 76 flow. Second operand has 4 states, 4 states have (on average 18.25) internal successors, (73), 4 states have internal predecessors, (73), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-08 19:12:03,757 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-11-08 19:12:03,757 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 15 of 44 [2024-11-08 19:12:03,757 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-11-08 19:12:04,263 INFO L124 PetriNetUnfolderBase]: 1361/2287 cut-off events. [2024-11-08 19:12:04,263 INFO L125 PetriNetUnfolderBase]: For 0/0 co-relation queries the response was YES. [2024-11-08 19:12:04,270 INFO L83 FinitePrefix]: Finished finitePrefix Result has 4399 conditions, 2287 events. 1361/2287 cut-off events. For 0/0 co-relation queries the response was YES. Maximal size of possible extension queue 162. Compared 13922 event pairs, 147 based on Foata normal form. 80/2323 useless extension candidates. Maximal degree in co-relation 4393. Up to 1297 conditions per place. [2024-11-08 19:12:04,281 INFO L140 encePairwiseOnDemand]: 38/44 looper letters, 40 selfloop transitions, 5 changer transitions 1/57 dead transitions. [2024-11-08 19:12:04,281 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 46 places, 57 transitions, 218 flow [2024-11-08 19:12:04,282 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2024-11-08 19:12:04,282 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 4 states. [2024-11-08 19:12:04,283 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 108 transitions. [2024-11-08 19:12:04,284 INFO L512 CegarLoopForPetriNet]: DFA transition density 0.6136363636363636 [2024-11-08 19:12:04,285 INFO L175 Difference]: Start difference. First operand has 44 places, 34 transitions, 76 flow. Second operand 4 states and 108 transitions. [2024-11-08 19:12:04,285 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 46 places, 57 transitions, 218 flow [2024-11-08 19:12:04,286 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 45 places, 57 transitions, 217 flow, removed 0 selfloop flow, removed 1 redundant places. [2024-11-08 19:12:04,288 INFO L231 Difference]: Finished difference. Result has 47 places, 37 transitions, 109 flow [2024-11-08 19:12:04,288 INFO L260 CegarLoopForPetriNet]: {PETRI_ALPHABET=44, PETRI_DIFFERENCE_MINUEND_FLOW=75, PETRI_DIFFERENCE_MINUEND_PLACES=42, 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=109, PETRI_PLACES=47, PETRI_TRANSITIONS=37} [2024-11-08 19:12:04,290 INFO L277 CegarLoopForPetriNet]: 49 programPoint places, -2 predicate places. [2024-11-08 19:12:04,290 INFO L471 AbstractCegarLoop]: Abstraction has has 47 places, 37 transitions, 109 flow [2024-11-08 19:12:04,290 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 18.25) internal successors, (73), 4 states have internal predecessors, (73), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-08 19:12:04,291 INFO L196 CegarLoopForPetriNet]: Found error trace [2024-11-08 19:12:04,291 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-08 19:12:04,313 INFO L552 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_dbfb2896-8405-4c25-b1c4-f34e4377ca0b/bin/uautomizer-verify-jihMAELWvX/z3 -smt2 -in SMTLIB2_COMPLIANT=true (4)] Ended with exit code 0 [2024-11-08 19:12:04,495 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 4 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_dbfb2896-8405-4c25-b1c4-f34e4377ca0b/bin/uautomizer-verify-jihMAELWvX/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-11-08 19:12:04,495 INFO L396 AbstractCegarLoop]: === Iteration 4 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONMEMORY_LEAK === [P1Err0ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr1ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr0ASSERT_VIOLATIONMEMORY_LEAK (and 4 more)] === [2024-11-08 19:12:04,496 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-08 19:12:04,496 INFO L85 PathProgramCache]: Analyzing trace with hash 1768739143, now seen corresponding path program 1 times [2024-11-08 19:12:04,497 INFO L118 FreeRefinementEngine]: Executing refinement strategy FOX [2024-11-08 19:12:04,497 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleZ3 [487216997] [2024-11-08 19:12:04,497 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-08 19:12:04,497 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-11-08 19:12:04,497 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_dbfb2896-8405-4c25-b1c4-f34e4377ca0b/bin/uautomizer-verify-jihMAELWvX/z3 [2024-11-08 19:12:04,500 INFO L229 MonitoredProcess]: Starting monitored process 5 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_dbfb2896-8405-4c25-b1c4-f34e4377ca0b/bin/uautomizer-verify-jihMAELWvX/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2024-11-08 19:12:04,501 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_dbfb2896-8405-4c25-b1c4-f34e4377ca0b/bin/uautomizer-verify-jihMAELWvX/z3 -smt2 -in SMTLIB2_COMPLIANT=true (5)] Waiting until timeout for monitored process [2024-11-08 19:12:04,608 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 19:12:04,609 INFO L255 TraceCheckSpWp]: Trace formula consists of 99 conjuncts, 4 conjuncts are in the unsatisfiable core [2024-11-08 19:12:04,611 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-11-08 19:12:04,673 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-08 19:12:04,674 INFO L307 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2024-11-08 19:12:04,674 INFO L136 FreeRefinementEngine]: Strategy FOX found an infeasible trace [2024-11-08 19:12:04,674 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [487216997] [2024-11-08 19:12:04,674 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [487216997] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-08 19:12:04,674 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-08 19:12:04,675 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2024-11-08 19:12:04,675 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1295327427] [2024-11-08 19:12:04,675 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-08 19:12:04,678 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2024-11-08 19:12:04,679 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy FOX [2024-11-08 19:12:04,680 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2024-11-08 19:12:04,681 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2024-11-08 19:12:04,697 INFO L467 CegarLoopForPetriNet]: Number of universal loopers: 15 out of 44 [2024-11-08 19:12:04,697 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 47 places, 37 transitions, 109 flow. Second operand has 5 states, 5 states have (on average 18.0) internal successors, (90), 5 states have internal predecessors, (90), 0 states have call successors, (0), 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-08 19:12:04,698 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-11-08 19:12:04,698 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 15 of 44 [2024-11-08 19:12:04,699 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-11-08 19:12:05,092 INFO L124 PetriNetUnfolderBase]: 877/1503 cut-off events. [2024-11-08 19:12:05,092 INFO L125 PetriNetUnfolderBase]: For 376/376 co-relation queries the response was YES. [2024-11-08 19:12:05,095 INFO L83 FinitePrefix]: Finished finitePrefix Result has 3426 conditions, 1503 events. 877/1503 cut-off events. For 376/376 co-relation queries the response was YES. Maximal size of possible extension queue 80. Compared 8106 event pairs, 73 based on Foata normal form. 68/1535 useless extension candidates. Maximal degree in co-relation 3417. Up to 625 conditions per place. [2024-11-08 19:12:05,102 INFO L140 encePairwiseOnDemand]: 38/44 looper letters, 50 selfloop transitions, 8 changer transitions 1/70 dead transitions. [2024-11-08 19:12:05,102 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 51 places, 70 transitions, 314 flow [2024-11-08 19:12:05,102 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2024-11-08 19:12:05,103 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 5 states. [2024-11-08 19:12:05,103 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 136 transitions. [2024-11-08 19:12:05,105 INFO L512 CegarLoopForPetriNet]: DFA transition density 0.6181818181818182 [2024-11-08 19:12:05,105 INFO L175 Difference]: Start difference. First operand has 47 places, 37 transitions, 109 flow. Second operand 5 states and 136 transitions. [2024-11-08 19:12:05,105 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 51 places, 70 transitions, 314 flow [2024-11-08 19:12:05,107 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 49 places, 70 transitions, 304 flow, removed 1 selfloop flow, removed 2 redundant places. [2024-11-08 19:12:05,110 INFO L231 Difference]: Finished difference. Result has 51 places, 40 transitions, 149 flow [2024-11-08 19:12:05,111 INFO L260 CegarLoopForPetriNet]: {PETRI_ALPHABET=44, PETRI_DIFFERENCE_MINUEND_FLOW=101, PETRI_DIFFERENCE_MINUEND_PLACES=45, 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=149, PETRI_PLACES=51, PETRI_TRANSITIONS=40} [2024-11-08 19:12:05,111 INFO L277 CegarLoopForPetriNet]: 49 programPoint places, 2 predicate places. [2024-11-08 19:12:05,113 INFO L471 AbstractCegarLoop]: Abstraction has has 51 places, 40 transitions, 149 flow [2024-11-08 19:12:05,113 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 18.0) internal successors, (90), 5 states have internal predecessors, (90), 0 states have call successors, (0), 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-08 19:12:05,113 INFO L196 CegarLoopForPetriNet]: Found error trace [2024-11-08 19:12:05,113 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-08 19:12:05,134 INFO L552 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_dbfb2896-8405-4c25-b1c4-f34e4377ca0b/bin/uautomizer-verify-jihMAELWvX/z3 -smt2 -in SMTLIB2_COMPLIANT=true (5)] Ended with exit code 0 [2024-11-08 19:12:05,314 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 5 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_dbfb2896-8405-4c25-b1c4-f34e4377ca0b/bin/uautomizer-verify-jihMAELWvX/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-11-08 19:12:05,314 INFO L396 AbstractCegarLoop]: === Iteration 5 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONMEMORY_LEAK === [P1Err0ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr1ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr0ASSERT_VIOLATIONMEMORY_LEAK (and 4 more)] === [2024-11-08 19:12:05,315 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-08 19:12:05,315 INFO L85 PathProgramCache]: Analyzing trace with hash 1577772514, now seen corresponding path program 1 times [2024-11-08 19:12:05,315 INFO L118 FreeRefinementEngine]: Executing refinement strategy FOX [2024-11-08 19:12:05,316 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleZ3 [1601203653] [2024-11-08 19:12:05,316 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-08 19:12:05,316 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-11-08 19:12:05,316 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_dbfb2896-8405-4c25-b1c4-f34e4377ca0b/bin/uautomizer-verify-jihMAELWvX/z3 [2024-11-08 19:12:05,318 INFO L229 MonitoredProcess]: Starting monitored process 6 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_dbfb2896-8405-4c25-b1c4-f34e4377ca0b/bin/uautomizer-verify-jihMAELWvX/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2024-11-08 19:12:05,320 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_dbfb2896-8405-4c25-b1c4-f34e4377ca0b/bin/uautomizer-verify-jihMAELWvX/z3 -smt2 -in SMTLIB2_COMPLIANT=true (6)] Waiting until timeout for monitored process [2024-11-08 19:12:05,440 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 19:12:05,442 INFO L255 TraceCheckSpWp]: Trace formula consists of 120 conjuncts, 5 conjuncts are in the unsatisfiable core [2024-11-08 19:12:05,444 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-11-08 19:12:05,517 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-08 19:12:05,518 INFO L307 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2024-11-08 19:12:05,518 INFO L136 FreeRefinementEngine]: Strategy FOX found an infeasible trace [2024-11-08 19:12:05,518 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1601203653] [2024-11-08 19:12:05,518 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1601203653] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-08 19:12:05,519 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-08 19:12:05,519 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2024-11-08 19:12:05,519 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1168905803] [2024-11-08 19:12:05,519 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-08 19:12:05,520 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2024-11-08 19:12:05,520 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy FOX [2024-11-08 19:12:05,521 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2024-11-08 19:12:05,521 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2024-11-08 19:12:05,527 INFO L467 CegarLoopForPetriNet]: Number of universal loopers: 15 out of 44 [2024-11-08 19:12:05,528 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 51 places, 40 transitions, 149 flow. Second operand has 6 states, 6 states have (on average 18.0) internal successors, (108), 6 states have internal predecessors, (108), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-08 19:12:05,528 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-11-08 19:12:05,528 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 15 of 44 [2024-11-08 19:12:05,528 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-11-08 19:12:05,865 INFO L124 PetriNetUnfolderBase]: 489/831 cut-off events. [2024-11-08 19:12:05,865 INFO L125 PetriNetUnfolderBase]: For 677/677 co-relation queries the response was YES. [2024-11-08 19:12:05,867 INFO L83 FinitePrefix]: Finished finitePrefix Result has 2164 conditions, 831 events. 489/831 cut-off events. For 677/677 co-relation queries the response was YES. Maximal size of possible extension queue 48. Compared 3717 event pairs, 59 based on Foata normal form. 36/836 useless extension candidates. Maximal degree in co-relation 2153. Up to 268 conditions per place. [2024-11-08 19:12:05,870 INFO L140 encePairwiseOnDemand]: 38/44 looper letters, 44 selfloop transitions, 11 changer transitions 1/67 dead transitions. [2024-11-08 19:12:05,871 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 56 places, 67 transitions, 325 flow [2024-11-08 19:12:05,871 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2024-11-08 19:12:05,872 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 6 states. [2024-11-08 19:12:05,872 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6 states to 6 states and 148 transitions. [2024-11-08 19:12:05,875 INFO L512 CegarLoopForPetriNet]: DFA transition density 0.5606060606060606 [2024-11-08 19:12:05,875 INFO L175 Difference]: Start difference. First operand has 51 places, 40 transitions, 149 flow. Second operand 6 states and 148 transitions. [2024-11-08 19:12:05,876 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 56 places, 67 transitions, 325 flow [2024-11-08 19:12:05,883 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 52 places, 67 transitions, 300 flow, removed 4 selfloop flow, removed 4 redundant places. [2024-11-08 19:12:05,884 INFO L231 Difference]: Finished difference. Result has 54 places, 40 transitions, 163 flow [2024-11-08 19:12:05,885 INFO L260 CegarLoopForPetriNet]: {PETRI_ALPHABET=44, PETRI_DIFFERENCE_MINUEND_FLOW=127, PETRI_DIFFERENCE_MINUEND_PLACES=47, 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=163, PETRI_PLACES=54, PETRI_TRANSITIONS=40} [2024-11-08 19:12:05,885 INFO L277 CegarLoopForPetriNet]: 49 programPoint places, 5 predicate places. [2024-11-08 19:12:05,885 INFO L471 AbstractCegarLoop]: Abstraction has has 54 places, 40 transitions, 163 flow [2024-11-08 19:12:05,887 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 18.0) internal successors, (108), 6 states have internal predecessors, (108), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-08 19:12:05,887 INFO L196 CegarLoopForPetriNet]: Found error trace [2024-11-08 19:12:05,887 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-08 19:12:05,909 INFO L552 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_dbfb2896-8405-4c25-b1c4-f34e4377ca0b/bin/uautomizer-verify-jihMAELWvX/z3 -smt2 -in SMTLIB2_COMPLIANT=true (6)] Ended with exit code 0 [2024-11-08 19:12:06,088 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 6 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_dbfb2896-8405-4c25-b1c4-f34e4377ca0b/bin/uautomizer-verify-jihMAELWvX/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-11-08 19:12:06,089 INFO L396 AbstractCegarLoop]: === Iteration 6 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONMEMORY_LEAK === [P1Err0ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr1ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr0ASSERT_VIOLATIONMEMORY_LEAK (and 4 more)] === [2024-11-08 19:12:06,089 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-08 19:12:06,089 INFO L85 PathProgramCache]: Analyzing trace with hash -957905422, now seen corresponding path program 1 times [2024-11-08 19:12:06,090 INFO L118 FreeRefinementEngine]: Executing refinement strategy FOX [2024-11-08 19:12:06,090 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleZ3 [1975973840] [2024-11-08 19:12:06,090 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-08 19:12:06,090 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-11-08 19:12:06,090 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_dbfb2896-8405-4c25-b1c4-f34e4377ca0b/bin/uautomizer-verify-jihMAELWvX/z3 [2024-11-08 19:12:06,094 INFO L229 MonitoredProcess]: Starting monitored process 7 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_dbfb2896-8405-4c25-b1c4-f34e4377ca0b/bin/uautomizer-verify-jihMAELWvX/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2024-11-08 19:12:06,096 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_dbfb2896-8405-4c25-b1c4-f34e4377ca0b/bin/uautomizer-verify-jihMAELWvX/z3 -smt2 -in SMTLIB2_COMPLIANT=true (7)] Waiting until timeout for monitored process [2024-11-08 19:12:06,199 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 19:12:06,202 INFO L255 TraceCheckSpWp]: Trace formula consists of 130 conjuncts, 8 conjuncts are in the unsatisfiable core [2024-11-08 19:12:06,204 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-11-08 19:12:06,520 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-08 19:12:06,520 INFO L307 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2024-11-08 19:12:06,521 INFO L136 FreeRefinementEngine]: Strategy FOX found an infeasible trace [2024-11-08 19:12:06,521 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1975973840] [2024-11-08 19:12:06,521 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1975973840] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-08 19:12:06,521 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-08 19:12:06,521 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2024-11-08 19:12:06,522 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1335864253] [2024-11-08 19:12:06,522 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-08 19:12:06,522 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2024-11-08 19:12:06,522 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy FOX [2024-11-08 19:12:06,523 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2024-11-08 19:12:06,523 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=10, Invalid=20, Unknown=0, NotChecked=0, Total=30 [2024-11-08 19:12:06,541 INFO L467 CegarLoopForPetriNet]: Number of universal loopers: 16 out of 44 [2024-11-08 19:12:06,542 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 54 places, 40 transitions, 163 flow. Second operand has 6 states, 6 states have (on average 19.166666666666668) internal successors, (115), 6 states have internal predecessors, (115), 0 states have call successors, (0), 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-08 19:12:06,542 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-11-08 19:12:06,542 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 16 of 44 [2024-11-08 19:12:06,542 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-11-08 19:12:06,894 INFO L124 PetriNetUnfolderBase]: 617/1152 cut-off events. [2024-11-08 19:12:06,894 INFO L125 PetriNetUnfolderBase]: For 408/435 co-relation queries the response was YES. [2024-11-08 19:12:06,898 INFO L83 FinitePrefix]: Finished finitePrefix Result has 2599 conditions, 1152 events. 617/1152 cut-off events. For 408/435 co-relation queries the response was YES. Maximal size of possible extension queue 65. Compared 6116 event pairs, 279 based on Foata normal form. 8/1100 useless extension candidates. Maximal degree in co-relation 2587. Up to 549 conditions per place. [2024-11-08 19:12:06,901 INFO L140 encePairwiseOnDemand]: 38/44 looper letters, 26 selfloop transitions, 2 changer transitions 17/63 dead transitions. [2024-11-08 19:12:06,901 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 59 places, 63 transitions, 311 flow [2024-11-08 19:12:06,902 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2024-11-08 19:12:06,902 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 6 states. [2024-11-08 19:12:06,903 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6 states to 6 states and 142 transitions. [2024-11-08 19:12:06,903 INFO L512 CegarLoopForPetriNet]: DFA transition density 0.5378787878787878 [2024-11-08 19:12:06,903 INFO L175 Difference]: Start difference. First operand has 54 places, 40 transitions, 163 flow. Second operand 6 states and 142 transitions. [2024-11-08 19:12:06,903 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 59 places, 63 transitions, 311 flow [2024-11-08 19:12:06,907 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 51 places, 63 transitions, 244 flow, removed 14 selfloop flow, removed 8 redundant places. [2024-11-08 19:12:06,908 INFO L231 Difference]: Finished difference. Result has 55 places, 40 transitions, 121 flow [2024-11-08 19:12:06,908 INFO L260 CegarLoopForPetriNet]: {PETRI_ALPHABET=44, PETRI_DIFFERENCE_MINUEND_FLOW=107, PETRI_DIFFERENCE_MINUEND_PLACES=46, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=40, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=2, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=38, PETRI_DIFFERENCE_SUBTRAHEND_STATES=6, PETRI_FLOW=121, PETRI_PLACES=55, PETRI_TRANSITIONS=40} [2024-11-08 19:12:06,909 INFO L277 CegarLoopForPetriNet]: 49 programPoint places, 6 predicate places. [2024-11-08 19:12:06,909 INFO L471 AbstractCegarLoop]: Abstraction has has 55 places, 40 transitions, 121 flow [2024-11-08 19:12:06,909 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 19.166666666666668) internal successors, (115), 6 states have internal predecessors, (115), 0 states have call successors, (0), 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-08 19:12:06,910 INFO L196 CegarLoopForPetriNet]: Found error trace [2024-11-08 19:12:06,910 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-08 19:12:06,931 INFO L552 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_dbfb2896-8405-4c25-b1c4-f34e4377ca0b/bin/uautomizer-verify-jihMAELWvX/z3 -smt2 -in SMTLIB2_COMPLIANT=true (7)] Ended with exit code 0 [2024-11-08 19:12:07,114 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 7 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_dbfb2896-8405-4c25-b1c4-f34e4377ca0b/bin/uautomizer-verify-jihMAELWvX/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-11-08 19:12:07,114 INFO L396 AbstractCegarLoop]: === Iteration 7 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONMEMORY_LEAK === [P1Err0ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr1ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr0ASSERT_VIOLATIONMEMORY_LEAK (and 4 more)] === [2024-11-08 19:12:07,116 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-08 19:12:07,116 INFO L85 PathProgramCache]: Analyzing trace with hash 1001386498, now seen corresponding path program 2 times [2024-11-08 19:12:07,117 INFO L118 FreeRefinementEngine]: Executing refinement strategy FOX [2024-11-08 19:12:07,118 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleZ3 [846802718] [2024-11-08 19:12:07,118 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2024-11-08 19:12:07,119 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-11-08 19:12:07,119 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_dbfb2896-8405-4c25-b1c4-f34e4377ca0b/bin/uautomizer-verify-jihMAELWvX/z3 [2024-11-08 19:12:07,120 INFO L229 MonitoredProcess]: Starting monitored process 8 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_dbfb2896-8405-4c25-b1c4-f34e4377ca0b/bin/uautomizer-verify-jihMAELWvX/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2024-11-08 19:12:07,121 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_dbfb2896-8405-4c25-b1c4-f34e4377ca0b/bin/uautomizer-verify-jihMAELWvX/z3 -smt2 -in SMTLIB2_COMPLIANT=true (8)] Waiting until timeout for monitored process [2024-11-08 19:12:07,238 INFO L227 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 1 check-sat command(s) [2024-11-08 19:12:07,238 INFO L228 tOrderPrioritization]: Conjunction of SSA is unsat [2024-11-08 19:12:07,240 INFO L255 TraceCheckSpWp]: Trace formula consists of 130 conjuncts, 16 conjuncts are in the unsatisfiable core [2024-11-08 19:12:07,244 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-11-08 19:12:07,635 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-08 19:12:07,635 INFO L307 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2024-11-08 19:12:07,635 INFO L136 FreeRefinementEngine]: Strategy FOX found an infeasible trace [2024-11-08 19:12:07,636 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [846802718] [2024-11-08 19:12:07,636 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [846802718] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-08 19:12:07,636 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-08 19:12:07,636 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2024-11-08 19:12:07,636 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1702260534] [2024-11-08 19:12:07,637 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-08 19:12:07,637 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 9 states [2024-11-08 19:12:07,637 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy FOX [2024-11-08 19:12:07,638 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2024-11-08 19:12:07,638 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=20, Invalid=52, Unknown=0, NotChecked=0, Total=72 [2024-11-08 19:12:07,649 INFO L467 CegarLoopForPetriNet]: Number of universal loopers: 17 out of 44 [2024-11-08 19:12:07,649 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 55 places, 40 transitions, 121 flow. Second operand has 9 states, 9 states have (on average 19.0) internal successors, (171), 9 states have internal predecessors, (171), 0 states have call successors, (0), 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-08 19:12:07,650 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-11-08 19:12:07,650 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 17 of 44 [2024-11-08 19:12:07,650 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-11-08 19:12:08,030 INFO L124 PetriNetUnfolderBase]: 466/876 cut-off events. [2024-11-08 19:12:08,031 INFO L125 PetriNetUnfolderBase]: For 44/48 co-relation queries the response was YES. [2024-11-08 19:12:08,034 INFO L83 FinitePrefix]: Finished finitePrefix Result has 1790 conditions, 876 events. 466/876 cut-off events. For 44/48 co-relation queries the response was YES. Maximal size of possible extension queue 61. Compared 4326 event pairs, 168 based on Foata normal form. 8/827 useless extension candidates. Maximal degree in co-relation 1779. Up to 423 conditions per place. [2024-11-08 19:12:08,037 INFO L140 encePairwiseOnDemand]: 36/44 looper letters, 25 selfloop transitions, 4 changer transitions 14/62 dead transitions. [2024-11-08 19:12:08,038 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 58 places, 62 transitions, 258 flow [2024-11-08 19:12:08,038 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2024-11-08 19:12:08,038 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 7 states. [2024-11-08 19:12:08,039 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 7 states to 7 states and 163 transitions. [2024-11-08 19:12:08,039 INFO L512 CegarLoopForPetriNet]: DFA transition density 0.5292207792207793 [2024-11-08 19:12:08,039 INFO L175 Difference]: Start difference. First operand has 55 places, 40 transitions, 121 flow. Second operand 7 states and 163 transitions. [2024-11-08 19:12:08,039 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 58 places, 62 transitions, 258 flow [2024-11-08 19:12:08,041 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 53 places, 62 transitions, 240 flow, removed 7 selfloop flow, removed 5 redundant places. [2024-11-08 19:12:08,042 INFO L231 Difference]: Finished difference. Result has 57 places, 42 transitions, 136 flow [2024-11-08 19:12:08,042 INFO L260 CegarLoopForPetriNet]: {PETRI_ALPHABET=44, PETRI_DIFFERENCE_MINUEND_FLOW=109, PETRI_DIFFERENCE_MINUEND_PLACES=47, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=40, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=2, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=36, PETRI_DIFFERENCE_SUBTRAHEND_STATES=7, PETRI_FLOW=136, PETRI_PLACES=57, PETRI_TRANSITIONS=42} [2024-11-08 19:12:08,043 INFO L277 CegarLoopForPetriNet]: 49 programPoint places, 8 predicate places. [2024-11-08 19:12:08,043 INFO L471 AbstractCegarLoop]: Abstraction has has 57 places, 42 transitions, 136 flow [2024-11-08 19:12:08,044 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 9 states, 9 states have (on average 19.0) internal successors, (171), 9 states have internal predecessors, (171), 0 states have call successors, (0), 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-08 19:12:08,044 INFO L196 CegarLoopForPetriNet]: Found error trace [2024-11-08 19:12:08,044 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-08 19:12:08,067 INFO L552 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_dbfb2896-8405-4c25-b1c4-f34e4377ca0b/bin/uautomizer-verify-jihMAELWvX/z3 -smt2 -in SMTLIB2_COMPLIANT=true (8)] Ended with exit code 0 [2024-11-08 19:12:08,249 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 8 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_dbfb2896-8405-4c25-b1c4-f34e4377ca0b/bin/uautomizer-verify-jihMAELWvX/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-11-08 19:12:08,250 INFO L396 AbstractCegarLoop]: === Iteration 8 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONMEMORY_LEAK === [P1Err0ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr1ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr0ASSERT_VIOLATIONMEMORY_LEAK (and 4 more)] === [2024-11-08 19:12:08,250 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-08 19:12:08,250 INFO L85 PathProgramCache]: Analyzing trace with hash 1830128156, now seen corresponding path program 3 times [2024-11-08 19:12:08,251 INFO L118 FreeRefinementEngine]: Executing refinement strategy FOX [2024-11-08 19:12:08,251 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleZ3 [428065456] [2024-11-08 19:12:08,252 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST2 [2024-11-08 19:12:08,252 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-11-08 19:12:08,252 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_dbfb2896-8405-4c25-b1c4-f34e4377ca0b/bin/uautomizer-verify-jihMAELWvX/z3 [2024-11-08 19:12:08,254 INFO L229 MonitoredProcess]: Starting monitored process 9 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_dbfb2896-8405-4c25-b1c4-f34e4377ca0b/bin/uautomizer-verify-jihMAELWvX/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2024-11-08 19:12:08,256 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_dbfb2896-8405-4c25-b1c4-f34e4377ca0b/bin/uautomizer-verify-jihMAELWvX/z3 -smt2 -in SMTLIB2_COMPLIANT=true (9)] Waiting until timeout for monitored process [2024-11-08 19:12:08,364 INFO L227 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued 1 check-sat command(s) [2024-11-08 19:12:08,364 INFO L228 tOrderPrioritization]: Conjunction of SSA is unsat [2024-11-08 19:12:08,368 INFO L255 TraceCheckSpWp]: Trace formula consists of 130 conjuncts, 19 conjuncts are in the unsatisfiable core [2024-11-08 19:12:08,371 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-11-08 19:12:08,971 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-08 19:12:08,972 INFO L307 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2024-11-08 19:12:08,972 INFO L136 FreeRefinementEngine]: Strategy FOX found an infeasible trace [2024-11-08 19:12:08,972 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [428065456] [2024-11-08 19:12:08,972 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [428065456] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-08 19:12:08,973 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-08 19:12:08,974 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [9] imperfect sequences [] total 9 [2024-11-08 19:12:08,974 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [446711604] [2024-11-08 19:12:08,975 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-08 19:12:08,975 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 10 states [2024-11-08 19:12:08,975 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy FOX [2024-11-08 19:12:08,976 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2024-11-08 19:12:08,977 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=24, Invalid=66, Unknown=0, NotChecked=0, Total=90 [2024-11-08 19:12:09,002 INFO L467 CegarLoopForPetriNet]: Number of universal loopers: 17 out of 44 [2024-11-08 19:12:09,003 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 57 places, 42 transitions, 136 flow. Second operand has 10 states, 10 states have (on average 18.8) internal successors, (188), 10 states have internal predecessors, (188), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-08 19:12:09,003 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-11-08 19:12:09,003 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 17 of 44 [2024-11-08 19:12:09,003 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-11-08 19:12:09,445 INFO L124 PetriNetUnfolderBase]: 536/1021 cut-off events. [2024-11-08 19:12:09,445 INFO L125 PetriNetUnfolderBase]: For 192/204 co-relation queries the response was YES. [2024-11-08 19:12:09,448 INFO L83 FinitePrefix]: Finished finitePrefix Result has 2235 conditions, 1021 events. 536/1021 cut-off events. For 192/204 co-relation queries the response was YES. Maximal size of possible extension queue 82. Compared 5257 event pairs, 202 based on Foata normal form. 8/969 useless extension candidates. Maximal degree in co-relation 2223. Up to 369 conditions per place. [2024-11-08 19:12:09,451 INFO L140 encePairwiseOnDemand]: 37/44 looper letters, 24 selfloop transitions, 4 changer transitions 16/63 dead transitions. [2024-11-08 19:12:09,452 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 60 places, 63 transitions, 275 flow [2024-11-08 19:12:09,452 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2024-11-08 19:12:09,453 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 7 states. [2024-11-08 19:12:09,453 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 7 states to 7 states and 163 transitions. [2024-11-08 19:12:09,453 INFO L512 CegarLoopForPetriNet]: DFA transition density 0.5292207792207793 [2024-11-08 19:12:09,454 INFO L175 Difference]: Start difference. First operand has 57 places, 42 transitions, 136 flow. Second operand 7 states and 163 transitions. [2024-11-08 19:12:09,454 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 60 places, 63 transitions, 275 flow [2024-11-08 19:12:09,455 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 55 places, 63 transitions, 260 flow, removed 5 selfloop flow, removed 5 redundant places. [2024-11-08 19:12:09,458 INFO L231 Difference]: Finished difference. Result has 59 places, 42 transitions, 144 flow [2024-11-08 19:12:09,459 INFO L260 CegarLoopForPetriNet]: {PETRI_ALPHABET=44, PETRI_DIFFERENCE_MINUEND_FLOW=125, PETRI_DIFFERENCE_MINUEND_PLACES=49, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=42, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=4, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=38, PETRI_DIFFERENCE_SUBTRAHEND_STATES=7, PETRI_FLOW=144, PETRI_PLACES=59, PETRI_TRANSITIONS=42} [2024-11-08 19:12:09,459 INFO L277 CegarLoopForPetriNet]: 49 programPoint places, 10 predicate places. [2024-11-08 19:12:09,459 INFO L471 AbstractCegarLoop]: Abstraction has has 59 places, 42 transitions, 144 flow [2024-11-08 19:12:09,460 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 10 states, 10 states have (on average 18.8) internal successors, (188), 10 states have internal predecessors, (188), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-08 19:12:09,460 INFO L196 CegarLoopForPetriNet]: Found error trace [2024-11-08 19:12:09,461 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-08 19:12:09,484 INFO L540 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_dbfb2896-8405-4c25-b1c4-f34e4377ca0b/bin/uautomizer-verify-jihMAELWvX/z3 -smt2 -in SMTLIB2_COMPLIANT=true (9)] Forceful destruction successful, exit code 0 [2024-11-08 19:12:09,662 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 9 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_dbfb2896-8405-4c25-b1c4-f34e4377ca0b/bin/uautomizer-verify-jihMAELWvX/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-11-08 19:12:09,662 INFO L396 AbstractCegarLoop]: === Iteration 9 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONMEMORY_LEAK === [P1Err0ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr1ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr0ASSERT_VIOLATIONMEMORY_LEAK (and 4 more)] === [2024-11-08 19:12:09,663 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-08 19:12:09,663 INFO L85 PathProgramCache]: Analyzing trace with hash -1860327426, now seen corresponding path program 4 times [2024-11-08 19:12:09,663 INFO L118 FreeRefinementEngine]: Executing refinement strategy FOX [2024-11-08 19:12:09,664 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleZ3 [1131883247] [2024-11-08 19:12:09,664 INFO L93 rtionOrderModulation]: Changing assertion order to TERMS_WITH_SMALL_CONSTANTS_FIRST [2024-11-08 19:12:09,664 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-11-08 19:12:09,664 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_dbfb2896-8405-4c25-b1c4-f34e4377ca0b/bin/uautomizer-verify-jihMAELWvX/z3 [2024-11-08 19:12:09,667 INFO L229 MonitoredProcess]: Starting monitored process 10 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_dbfb2896-8405-4c25-b1c4-f34e4377ca0b/bin/uautomizer-verify-jihMAELWvX/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2024-11-08 19:12:09,670 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_dbfb2896-8405-4c25-b1c4-f34e4377ca0b/bin/uautomizer-verify-jihMAELWvX/z3 -smt2 -in SMTLIB2_COMPLIANT=true (10)] Waiting until timeout for monitored process [2024-11-08 19:12:09,785 INFO L227 tOrderPrioritization]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 0 check-sat command(s) [2024-11-08 19:12:09,785 INFO L228 tOrderPrioritization]: Conjunction of SSA is unsat [2024-11-08 19:12:09,788 INFO L255 TraceCheckSpWp]: Trace formula consists of 130 conjuncts, 11 conjuncts are in the unsatisfiable core [2024-11-08 19:12:09,790 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-11-08 19:12:10,215 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-08 19:12:10,215 INFO L307 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2024-11-08 19:12:10,215 INFO L136 FreeRefinementEngine]: Strategy FOX found an infeasible trace [2024-11-08 19:12:10,215 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1131883247] [2024-11-08 19:12:10,215 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1131883247] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-08 19:12:10,216 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-08 19:12:10,216 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2024-11-08 19:12:10,216 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1623269444] [2024-11-08 19:12:10,216 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-08 19:12:10,216 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 8 states [2024-11-08 19:12:10,217 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy FOX [2024-11-08 19:12:10,217 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2024-11-08 19:12:10,217 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=15, Invalid=41, Unknown=0, NotChecked=0, Total=56 [2024-11-08 19:12:10,246 INFO L467 CegarLoopForPetriNet]: Number of universal loopers: 13 out of 44 [2024-11-08 19:12:10,246 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 59 places, 42 transitions, 144 flow. Second operand has 8 states, 8 states have (on average 15.75) internal successors, (126), 8 states have internal predecessors, (126), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-08 19:12:10,247 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-11-08 19:12:10,247 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 13 of 44 [2024-11-08 19:12:10,247 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-11-08 19:12:10,672 INFO L124 PetriNetUnfolderBase]: 912/1483 cut-off events. [2024-11-08 19:12:10,673 INFO L125 PetriNetUnfolderBase]: For 610/632 co-relation queries the response was YES. [2024-11-08 19:12:10,677 INFO L83 FinitePrefix]: Finished finitePrefix Result has 3731 conditions, 1483 events. 912/1483 cut-off events. For 610/632 co-relation queries the response was YES. Maximal size of possible extension queue 84. Compared 6579 event pairs, 329 based on Foata normal form. 13/1463 useless extension candidates. Maximal degree in co-relation 3718. Up to 718 conditions per place. [2024-11-08 19:12:10,680 INFO L140 encePairwiseOnDemand]: 35/44 looper letters, 34 selfloop transitions, 3 changer transitions 42/88 dead transitions. [2024-11-08 19:12:10,681 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 62 places, 88 transitions, 459 flow [2024-11-08 19:12:10,681 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2024-11-08 19:12:10,681 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 7 states. [2024-11-08 19:12:10,682 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 7 states to 7 states and 155 transitions. [2024-11-08 19:12:10,682 INFO L512 CegarLoopForPetriNet]: DFA transition density 0.5032467532467533 [2024-11-08 19:12:10,682 INFO L175 Difference]: Start difference. First operand has 59 places, 42 transitions, 144 flow. Second operand 7 states and 155 transitions. [2024-11-08 19:12:10,683 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 62 places, 88 transitions, 459 flow [2024-11-08 19:12:10,687 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 56 places, 88 transitions, 425 flow, removed 9 selfloop flow, removed 6 redundant places. [2024-11-08 19:12:10,688 INFO L231 Difference]: Finished difference. Result has 61 places, 42 transitions, 152 flow [2024-11-08 19:12:10,688 INFO L260 CegarLoopForPetriNet]: {PETRI_ALPHABET=44, PETRI_DIFFERENCE_MINUEND_FLOW=126, PETRI_DIFFERENCE_MINUEND_PLACES=50, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=42, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=3, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=39, PETRI_DIFFERENCE_SUBTRAHEND_STATES=7, PETRI_FLOW=152, PETRI_PLACES=61, PETRI_TRANSITIONS=42} [2024-11-08 19:12:10,689 INFO L277 CegarLoopForPetriNet]: 49 programPoint places, 12 predicate places. [2024-11-08 19:12:10,690 INFO L471 AbstractCegarLoop]: Abstraction has has 61 places, 42 transitions, 152 flow [2024-11-08 19:12:10,690 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 8 states, 8 states have (on average 15.75) internal successors, (126), 8 states have internal predecessors, (126), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-08 19:12:10,690 INFO L196 CegarLoopForPetriNet]: Found error trace [2024-11-08 19:12:10,691 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-08 19:12:10,711 INFO L540 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_dbfb2896-8405-4c25-b1c4-f34e4377ca0b/bin/uautomizer-verify-jihMAELWvX/z3 -smt2 -in SMTLIB2_COMPLIANT=true (10)] Forceful destruction successful, exit code 0 [2024-11-08 19:12:10,895 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 10 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_dbfb2896-8405-4c25-b1c4-f34e4377ca0b/bin/uautomizer-verify-jihMAELWvX/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-11-08 19:12:10,895 INFO L396 AbstractCegarLoop]: === Iteration 10 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONMEMORY_LEAK === [P1Err0ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr1ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr0ASSERT_VIOLATIONMEMORY_LEAK (and 4 more)] === [2024-11-08 19:12:10,896 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-08 19:12:10,896 INFO L85 PathProgramCache]: Analyzing trace with hash -71863058, now seen corresponding path program 5 times [2024-11-08 19:12:10,896 INFO L118 FreeRefinementEngine]: Executing refinement strategy FOX [2024-11-08 19:12:10,896 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleZ3 [453601920] [2024-11-08 19:12:10,897 INFO L93 rtionOrderModulation]: Changing assertion order to INSIDE_LOOP_FIRST1 [2024-11-08 19:12:10,897 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-11-08 19:12:10,897 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_dbfb2896-8405-4c25-b1c4-f34e4377ca0b/bin/uautomizer-verify-jihMAELWvX/z3 [2024-11-08 19:12:10,899 INFO L229 MonitoredProcess]: Starting monitored process 11 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_dbfb2896-8405-4c25-b1c4-f34e4377ca0b/bin/uautomizer-verify-jihMAELWvX/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2024-11-08 19:12:10,900 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_dbfb2896-8405-4c25-b1c4-f34e4377ca0b/bin/uautomizer-verify-jihMAELWvX/z3 -smt2 -in SMTLIB2_COMPLIANT=true (11)] Waiting until timeout for monitored process [2024-11-08 19:12:11,030 INFO L227 tOrderPrioritization]: Assert order INSIDE_LOOP_FIRST1 issued 1 check-sat command(s) [2024-11-08 19:12:11,030 INFO L228 tOrderPrioritization]: Conjunction of SSA is sat [2024-11-08 19:12:11,030 INFO L356 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2024-11-08 19:12:11,074 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-11-08 19:12:11,149 INFO L130 FreeRefinementEngine]: Strategy FOX found a feasible trace [2024-11-08 19:12:11,150 INFO L325 BasicCegarLoop]: Counterexample is feasible [2024-11-08 19:12:11,151 INFO L782 garLoopResultBuilder]: Registering result UNSAFE for location ULTIMATE.startErr0ASSERT_VIOLATIONMEMORY_LEAK (6 of 7 remaining) [2024-11-08 19:12:11,152 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location P1Err0ASSERT_VIOLATIONMEMORY_LEAK (5 of 7 remaining) [2024-11-08 19:12:11,153 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr1ASSERT_VIOLATIONMEMORY_LEAK (4 of 7 remaining) [2024-11-08 19:12:11,153 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (3 of 7 remaining) [2024-11-08 19:12:11,153 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (2 of 7 remaining) [2024-11-08 19:12:11,154 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr2INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (1 of 7 remaining) [2024-11-08 19:12:11,154 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location P1Err0ASSERT_VIOLATIONMEMORY_LEAK (0 of 7 remaining) [2024-11-08 19:12:11,174 INFO L552 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_dbfb2896-8405-4c25-b1c4-f34e4377ca0b/bin/uautomizer-verify-jihMAELWvX/z3 -smt2 -in SMTLIB2_COMPLIANT=true (11)] Ended with exit code 0 [2024-11-08 19:12:11,354 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 11 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_dbfb2896-8405-4c25-b1c4-f34e4377ca0b/bin/uautomizer-verify-jihMAELWvX/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-11-08 19:12:11,355 INFO L407 BasicCegarLoop]: Path program histogram: [5, 1, 1, 1, 1, 1] [2024-11-08 19:12:11,477 INFO L239 ceAbstractionStarter]: Analysis of concurrent program completed with 1 thread instances [2024-11-08 19:12:11,477 INFO L170 ceAbstractionStarter]: Computing trace abstraction results [2024-11-08 19:12:11,485 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 08.11 07:12:11 BasicIcfg [2024-11-08 19:12:11,485 INFO L131 PluginConnector]: ------------------------ END TraceAbstraction---------------------------- [2024-11-08 19:12:11,486 INFO L112 PluginConnector]: ------------------------Witness Printer---------------------------- [2024-11-08 19:12:11,486 INFO L270 PluginConnector]: Initializing Witness Printer... [2024-11-08 19:12:11,487 INFO L274 PluginConnector]: Witness Printer initialized [2024-11-08 19:12:11,488 INFO L184 PluginConnector]: Executing the observer RCFGCatcher from plugin Witness Printer for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 08.11 07:12:01" (3/4) ... [2024-11-08 19:12:11,490 INFO L145 WitnessPrinter]: No result that supports witness generation found [2024-11-08 19:12:11,492 INFO L131 PluginConnector]: ------------------------ END Witness Printer---------------------------- [2024-11-08 19:12:11,493 INFO L158 Benchmark]: Toolchain (without parser) took 11935.34ms. Allocated memory was 60.8MB in the beginning and 195.0MB in the end (delta: 134.2MB). Free memory was 28.6MB in the beginning and 145.5MB in the end (delta: -116.9MB). Peak memory consumption was 16.9MB. Max. memory is 16.1GB. [2024-11-08 19:12:11,496 INFO L158 Benchmark]: CDTParser took 0.25ms. Allocated memory is still 60.8MB. Free memory was 37.0MB in the beginning and 36.9MB in the end (delta: 81.8kB). There was no memory consumed. Max. memory is 16.1GB. [2024-11-08 19:12:11,497 INFO L158 Benchmark]: CACSL2BoogieTranslator took 768.66ms. Allocated memory was 60.8MB in the beginning and 86.0MB in the end (delta: 25.2MB). Free memory was 28.3MB in the beginning and 42.5MB in the end (delta: -14.1MB). Peak memory consumption was 9.8MB. Max. memory is 16.1GB. [2024-11-08 19:12:11,497 INFO L158 Benchmark]: Boogie Procedure Inliner took 76.98ms. Allocated memory is still 86.0MB. Free memory was 63.1MB in the beginning and 60.2MB in the end (delta: 2.8MB). Peak memory consumption was 2.1MB. Max. memory is 16.1GB. [2024-11-08 19:12:11,498 INFO L158 Benchmark]: Boogie Preprocessor took 82.46ms. Allocated memory is still 86.0MB. Free memory was 60.2MB in the beginning and 56.8MB in the end (delta: 3.5MB). Peak memory consumption was 4.2MB. Max. memory is 16.1GB. [2024-11-08 19:12:11,498 INFO L158 Benchmark]: RCFGBuilder took 1113.80ms. Allocated memory was 86.0MB in the beginning and 107.0MB in the end (delta: 21.0MB). Free memory was 56.8MB in the beginning and 80.6MB in the end (delta: -23.8MB). Peak memory consumption was 24.1MB. Max. memory is 16.1GB. [2024-11-08 19:12:11,499 INFO L158 Benchmark]: TraceAbstraction took 9866.97ms. Allocated memory was 107.0MB in the beginning and 195.0MB in the end (delta: 88.1MB). Free memory was 79.9MB in the beginning and 146.5MB in the end (delta: -66.6MB). Peak memory consumption was 20.7MB. Max. memory is 16.1GB. [2024-11-08 19:12:11,499 INFO L158 Benchmark]: Witness Printer took 6.19ms. Allocated memory is still 195.0MB. Free memory was 146.5MB in the beginning and 145.5MB in the end (delta: 1.1MB). Peak memory consumption was 2.1MB. Max. memory is 16.1GB. [2024-11-08 19:12:11,505 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.25ms. Allocated memory is still 60.8MB. Free memory was 37.0MB in the beginning and 36.9MB in the end (delta: 81.8kB). There was no memory consumed. Max. memory is 16.1GB. * CACSL2BoogieTranslator took 768.66ms. Allocated memory was 60.8MB in the beginning and 86.0MB in the end (delta: 25.2MB). Free memory was 28.3MB in the beginning and 42.5MB in the end (delta: -14.1MB). Peak memory consumption was 9.8MB. Max. memory is 16.1GB. * Boogie Procedure Inliner took 76.98ms. Allocated memory is still 86.0MB. Free memory was 63.1MB in the beginning and 60.2MB in the end (delta: 2.8MB). Peak memory consumption was 2.1MB. Max. memory is 16.1GB. * Boogie Preprocessor took 82.46ms. Allocated memory is still 86.0MB. Free memory was 60.2MB in the beginning and 56.8MB in the end (delta: 3.5MB). Peak memory consumption was 4.2MB. Max. memory is 16.1GB. * RCFGBuilder took 1113.80ms. Allocated memory was 86.0MB in the beginning and 107.0MB in the end (delta: 21.0MB). Free memory was 56.8MB in the beginning and 80.6MB in the end (delta: -23.8MB). Peak memory consumption was 24.1MB. Max. memory is 16.1GB. * TraceAbstraction took 9866.97ms. Allocated memory was 107.0MB in the beginning and 195.0MB in the end (delta: 88.1MB). Free memory was 79.9MB in the beginning and 146.5MB in the end (delta: -66.6MB). Peak memory consumption was 20.7MB. Max. memory is 16.1GB. * Witness Printer took 6.19ms. Allocated memory is still 195.0MB. Free memory was 146.5MB in the beginning and 145.5MB in the end (delta: 1.1MB). Peak memory consumption was 2.1MB. Max. memory is 16.1GB. * Results from de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: - UnprovableResult [Line: 17]: Unable to prove that all allocated memory was freed Unable to prove that all allocated memory was freed Reason: overapproximation of memtrack at line 17. Possible FailurePath: [L709] 0 int __unbuffered_cnt = 0; [L711] 0 int __unbuffered_p2_EAX = 0; [L712] 0 _Bool main$tmp_guard0; [L713] 0 _Bool main$tmp_guard1; [L715] 0 int x = 0; [L716] 0 _Bool x$flush_delayed; [L717] 0 int x$mem_tmp; [L718] 0 _Bool x$r_buff0_thd0; [L719] 0 _Bool x$r_buff0_thd1; [L720] 0 _Bool x$r_buff0_thd2; [L721] 0 _Bool x$r_buff0_thd3; [L722] 0 _Bool x$r_buff1_thd0; [L723] 0 _Bool x$r_buff1_thd1; [L724] 0 _Bool x$r_buff1_thd2; [L725] 0 _Bool x$r_buff1_thd3; [L726] 0 _Bool x$read_delayed; [L727] 0 int *x$read_delayed_var; [L728] 0 int x$w_buff0; [L729] 0 _Bool x$w_buff0_used; [L730] 0 int x$w_buff1; [L731] 0 _Bool x$w_buff1_used; [L733] 0 int y = 0; [L735] 0 int z = 0; [L736] 0 _Bool weak$$choice0; [L737] 0 _Bool weak$$choice2; [L818] 0 pthread_t t2028; [L819] FCALL, FORK 0 pthread_create(&t2028, ((void *)0), P0, ((void *)0)) VAL [\old(arg)={0:0}, __unbuffered_cnt=0, __unbuffered_p2_EAX=0, main$tmp_guard0=0, main$tmp_guard1=0, t2028=-2, weak$$choice0=0, weak$$choice2=0, x$flush_delayed=0, x$mem_tmp=0, x$r_buff0_thd0=0, x$r_buff0_thd1=0, x$r_buff0_thd2=0, x$r_buff0_thd3=0, x$r_buff1_thd0=0, x$r_buff1_thd1=0, x$r_buff1_thd2=0, x$r_buff1_thd3=0, x$read_delayed=0, x$read_delayed_var={0:0}, x$w_buff0=0, x$w_buff0_used=0, x$w_buff1=0, x$w_buff1_used=0, x=0, y=0, z=0] [L820] 0 pthread_t t2029; [L821] FCALL, FORK 0 pthread_create(&t2029, ((void *)0), P1, ((void *)0)) VAL [\old(arg)={0:0}, __unbuffered_cnt=0, __unbuffered_p2_EAX=0, main$tmp_guard0=0, main$tmp_guard1=0, t2028=-2, t2029=-1, weak$$choice0=0, weak$$choice2=0, x$flush_delayed=0, x$mem_tmp=0, x$r_buff0_thd0=0, x$r_buff0_thd1=0, x$r_buff0_thd2=0, x$r_buff0_thd3=0, x$r_buff1_thd0=0, x$r_buff1_thd1=0, x$r_buff1_thd2=0, x$r_buff1_thd3=0, x$read_delayed=0, x$read_delayed_var={0:0}, x$w_buff0=0, x$w_buff0_used=0, x$w_buff1=0, x$w_buff1_used=0, x=0, y=0, z=0] [L761] 2 x$w_buff1 = x$w_buff0 [L762] 2 x$w_buff0 = 2 [L763] 2 x$w_buff1_used = x$w_buff0_used [L764] 2 x$w_buff0_used = (_Bool)1 [L765] CALL 2 __VERIFIER_assert(!(x$w_buff1_used && x$w_buff0_used)) [L18] COND FALSE 2 !(!expression) [L765] RET 2 __VERIFIER_assert(!(x$w_buff1_used && x$w_buff0_used)) [L766] 2 x$r_buff1_thd0 = x$r_buff0_thd0 [L767] 2 x$r_buff1_thd1 = x$r_buff0_thd1 [L768] 2 x$r_buff1_thd2 = x$r_buff0_thd2 [L769] 2 x$r_buff1_thd3 = x$r_buff0_thd3 [L770] 2 x$r_buff0_thd2 = (_Bool)1 VAL [\old(arg)={0:0}, \old(arg)={0:0}, __unbuffered_cnt=0, __unbuffered_p2_EAX=0, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=0, x$flush_delayed=0, x$mem_tmp=0, x$r_buff0_thd0=0, x$r_buff0_thd1=0, x$r_buff0_thd2=1, x$r_buff0_thd3=0, x$r_buff1_thd0=0, x$r_buff1_thd1=0, x$r_buff1_thd2=0, x$r_buff1_thd3=0, x$read_delayed=0, x$read_delayed_var={0:0}, x$w_buff0=2, x$w_buff0_used=1, x$w_buff1=0, x$w_buff1_used=0, x=0, y=0, z=0] [L822] 0 pthread_t t2030; [L823] FCALL, FORK 0 pthread_create(&t2030, ((void *)0), P2, ((void *)0)) VAL [\old(arg)={0:0}, \old(arg)={0:0}, __unbuffered_cnt=0, __unbuffered_p2_EAX=0, main$tmp_guard0=0, main$tmp_guard1=0, t2028=-2, t2029=-1, t2030=0, weak$$choice0=0, weak$$choice2=0, x$flush_delayed=0, x$mem_tmp=0, x$r_buff0_thd0=0, x$r_buff0_thd1=0, x$r_buff0_thd2=1, x$r_buff0_thd3=0, x$r_buff1_thd0=0, x$r_buff1_thd1=0, x$r_buff1_thd2=0, x$r_buff1_thd3=0, x$read_delayed=0, x$read_delayed_var={0:0}, x$w_buff0=2, x$w_buff0_used=1, x$w_buff1=0, x$w_buff1_used=0, x=0, y=0, z=0] [L773] 2 y = 1 VAL [\old(arg)={0:0}, \old(arg)={0:0}, \old(arg)={0:0}, __unbuffered_cnt=0, __unbuffered_p2_EAX=0, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=0, x$flush_delayed=0, x$mem_tmp=0, x$r_buff0_thd0=0, x$r_buff0_thd1=0, x$r_buff0_thd2=1, x$r_buff0_thd3=0, x$r_buff1_thd0=0, x$r_buff1_thd1=0, x$r_buff1_thd2=0, x$r_buff1_thd3=0, x$read_delayed=0, x$read_delayed_var={0:0}, x$w_buff0=2, x$w_buff0_used=1, x$w_buff1=0, x$w_buff1_used=0, x=0, y=1, z=0] [L790] 3 __unbuffered_p2_EAX = y VAL [\old(arg)={0:0}, \old(arg)={0:0}, __unbuffered_cnt=0, __unbuffered_p2_EAX=1, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=0, x$flush_delayed=0, x$mem_tmp=0, x$r_buff0_thd0=0, x$r_buff0_thd1=0, x$r_buff0_thd2=1, x$r_buff0_thd3=0, x$r_buff1_thd0=0, x$r_buff1_thd1=0, x$r_buff1_thd2=0, x$r_buff1_thd3=0, x$read_delayed=0, x$read_delayed_var={0:0}, x$w_buff0=2, x$w_buff0_used=1, x$w_buff1=0, x$w_buff1_used=0, x=0, y=1, z=0] [L793] 3 z = 1 VAL [\old(arg)={0:0}, \old(arg)={0:0}, __unbuffered_cnt=0, __unbuffered_p2_EAX=1, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=0, x$flush_delayed=0, x$mem_tmp=0, x$r_buff0_thd0=0, x$r_buff0_thd1=0, x$r_buff0_thd2=1, x$r_buff0_thd3=0, x$r_buff1_thd0=0, x$r_buff1_thd1=0, x$r_buff1_thd2=0, x$r_buff1_thd3=0, x$read_delayed=0, x$read_delayed_var={0:0}, x$w_buff0=2, x$w_buff0_used=1, x$w_buff1=0, x$w_buff1_used=0, x=0, y=1, z=1] [L741] 1 z = 2 VAL [\old(arg)={0:0}, \old(arg)={0:0}, __unbuffered_cnt=0, __unbuffered_p2_EAX=1, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=0, x$flush_delayed=0, x$mem_tmp=0, x$r_buff0_thd0=0, x$r_buff0_thd1=0, x$r_buff0_thd2=1, x$r_buff0_thd3=0, x$r_buff1_thd0=0, x$r_buff1_thd1=0, x$r_buff1_thd2=0, x$r_buff1_thd3=0, x$read_delayed=0, x$read_delayed_var={0:0}, x$w_buff0=2, x$w_buff0_used=1, x$w_buff1=0, x$w_buff1_used=0, x=0, y=1, z=2] [L744] 1 x = 1 VAL [\old(arg)={0:0}, \old(arg)={0:0}, __unbuffered_cnt=0, __unbuffered_p2_EAX=1, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=0, x$flush_delayed=0, x$mem_tmp=0, x$r_buff0_thd0=0, x$r_buff0_thd1=0, x$r_buff0_thd2=1, x$r_buff0_thd3=0, x$r_buff1_thd0=0, x$r_buff1_thd1=0, x$r_buff1_thd2=0, x$r_buff1_thd3=0, x$read_delayed=0, x$read_delayed_var={0:0}, x$w_buff0=2, x$w_buff0_used=1, x$w_buff1=0, x$w_buff1_used=0, x=1, y=1, z=2] [L747] 1 x = x$w_buff0_used && x$r_buff0_thd1 ? x$w_buff0 : (x$w_buff1_used && x$r_buff1_thd1 ? x$w_buff1 : x) [L748] 1 x$w_buff0_used = x$w_buff0_used && x$r_buff0_thd1 ? (_Bool)0 : x$w_buff0_used [L749] 1 x$w_buff1_used = x$w_buff0_used && x$r_buff0_thd1 || x$w_buff1_used && x$r_buff1_thd1 ? (_Bool)0 : x$w_buff1_used [L750] 1 x$r_buff0_thd1 = x$w_buff0_used && x$r_buff0_thd1 ? (_Bool)0 : x$r_buff0_thd1 [L751] 1 x$r_buff1_thd1 = x$w_buff0_used && x$r_buff0_thd1 || x$w_buff1_used && x$r_buff1_thd1 ? (_Bool)0 : x$r_buff1_thd1 VAL [\old(arg)={0:0}, \old(arg)={0:0}, __unbuffered_cnt=0, __unbuffered_p2_EAX=1, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=0, x$flush_delayed=0, x$mem_tmp=0, x$r_buff0_thd0=0, x$r_buff0_thd1=0, x$r_buff0_thd2=1, x$r_buff0_thd3=0, x$r_buff1_thd0=0, x$r_buff1_thd1=0, x$r_buff1_thd2=0, x$r_buff1_thd3=0, x$read_delayed=0, x$read_delayed_var={0:0}, x$w_buff0=2, x$w_buff0_used=1, x$w_buff1=0, x$w_buff1_used=0, x=1, y=1, z=2] [L776] 2 x = x$w_buff0_used && x$r_buff0_thd2 ? x$w_buff0 : (x$w_buff1_used && x$r_buff1_thd2 ? x$w_buff1 : x) [L777] 2 x$w_buff0_used = x$w_buff0_used && x$r_buff0_thd2 ? (_Bool)0 : x$w_buff0_used [L778] 2 x$w_buff1_used = x$w_buff0_used && x$r_buff0_thd2 || x$w_buff1_used && x$r_buff1_thd2 ? (_Bool)0 : x$w_buff1_used [L779] 2 x$r_buff0_thd2 = x$w_buff0_used && x$r_buff0_thd2 ? (_Bool)0 : x$r_buff0_thd2 [L780] 2 x$r_buff1_thd2 = x$w_buff0_used && x$r_buff0_thd2 || x$w_buff1_used && x$r_buff1_thd2 ? (_Bool)0 : x$r_buff1_thd2 VAL [\old(arg)={0:0}, \old(arg)={0:0}, \old(arg)={0:0}, __unbuffered_cnt=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$$choice2=0, x$flush_delayed=0, x$mem_tmp=0, x$r_buff0_thd0=0, x$r_buff0_thd1=0, x$r_buff0_thd2=1, x$r_buff0_thd3=0, x$r_buff1_thd0=0, x$r_buff1_thd1=0, x$r_buff1_thd2=0, x$r_buff1_thd3=0, x$read_delayed=0, x$read_delayed_var={0:0}, x$w_buff0=2, x$w_buff0_used=0, x$w_buff1=0, x$w_buff1_used=0, x=2, y=1, z=2] [L796] 3 x = x$w_buff0_used && x$r_buff0_thd3 ? x$w_buff0 : (x$w_buff1_used && x$r_buff1_thd3 ? x$w_buff1 : x) [L797] 3 x$w_buff0_used = x$w_buff0_used && x$r_buff0_thd3 ? (_Bool)0 : x$w_buff0_used [L798] 3 x$w_buff1_used = x$w_buff0_used && x$r_buff0_thd3 || x$w_buff1_used && x$r_buff1_thd3 ? (_Bool)0 : x$w_buff1_used [L799] 3 x$r_buff0_thd3 = x$w_buff0_used && x$r_buff0_thd3 ? (_Bool)0 : x$r_buff0_thd3 [L800] 3 x$r_buff1_thd3 = x$w_buff0_used && x$r_buff0_thd3 || x$w_buff1_used && x$r_buff1_thd3 ? (_Bool)0 : x$r_buff1_thd3 VAL [\old(arg)={0:0}, \old(arg)={0:0}, __unbuffered_cnt=0, __unbuffered_p2_EAX=1, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=0, x$flush_delayed=0, x$mem_tmp=0, x$r_buff0_thd0=0, x$r_buff0_thd1=0, x$r_buff0_thd2=1, x$r_buff0_thd3=0, x$r_buff1_thd0=0, x$r_buff1_thd1=0, x$r_buff1_thd2=0, x$r_buff1_thd3=0, x$read_delayed=0, x$read_delayed_var={0:0}, x$w_buff0=2, x$w_buff0_used=0, x$w_buff1=0, x$w_buff1_used=0, x=2, y=1, z=2] [L803] 3 __unbuffered_cnt = __unbuffered_cnt + 1 VAL [\old(arg)={0:0}, \old(arg)={0:0}, __unbuffered_cnt=1, __unbuffered_p2_EAX=1, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=0, x$flush_delayed=0, x$mem_tmp=0, x$r_buff0_thd0=0, x$r_buff0_thd1=0, x$r_buff0_thd2=1, x$r_buff0_thd3=0, x$r_buff1_thd0=0, x$r_buff1_thd1=0, x$r_buff1_thd2=0, x$r_buff1_thd3=0, x$read_delayed=0, x$read_delayed_var={0:0}, x$w_buff0=2, x$w_buff0_used=0, x$w_buff1=0, x$w_buff1_used=0, x=2, y=1, z=2] [L754] 1 __unbuffered_cnt = __unbuffered_cnt + 1 VAL [\old(arg)={0:0}, \old(arg)={0:0}, __unbuffered_cnt=2, __unbuffered_p2_EAX=1, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=0, x$flush_delayed=0, x$mem_tmp=0, x$r_buff0_thd0=0, x$r_buff0_thd1=0, x$r_buff0_thd2=1, x$r_buff0_thd3=0, x$r_buff1_thd0=0, x$r_buff1_thd1=0, x$r_buff1_thd2=0, x$r_buff1_thd3=0, x$read_delayed=0, x$read_delayed_var={0:0}, x$w_buff0=2, x$w_buff0_used=0, x$w_buff1=0, x$w_buff1_used=0, x=2, y=1, z=2] [L783] 2 __unbuffered_cnt = __unbuffered_cnt + 1 VAL [\old(arg)={0:0}, \old(arg)={0:0}, \old(arg)={0:0}, __unbuffered_cnt=3, __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$$choice2=0, x$flush_delayed=0, x$mem_tmp=0, x$r_buff0_thd0=0, x$r_buff0_thd1=0, x$r_buff0_thd2=1, x$r_buff0_thd3=0, x$r_buff1_thd0=0, x$r_buff1_thd1=0, x$r_buff1_thd2=0, x$r_buff1_thd3=0, x$read_delayed=0, x$read_delayed_var={0:0}, x$w_buff0=2, x$w_buff0_used=0, x$w_buff1=0, x$w_buff1_used=0, x=2, y=1, z=2] [L825] 0 main$tmp_guard0 = __unbuffered_cnt == 3 VAL [\old(arg)={0:0}, \old(arg)={0:0}, __unbuffered_cnt=3, __unbuffered_p2_EAX=1, arg={0:0}, arg={0:0}, main$tmp_guard0=1, main$tmp_guard1=0, t2028=-2, t2029=-1, t2030=0, weak$$choice0=0, weak$$choice2=0, x$flush_delayed=0, x$mem_tmp=0, x$r_buff0_thd0=0, x$r_buff0_thd1=0, x$r_buff0_thd2=1, x$r_buff0_thd3=0, x$r_buff1_thd0=0, x$r_buff1_thd1=0, x$r_buff1_thd2=0, x$r_buff1_thd3=0, x$read_delayed=0, x$read_delayed_var={0:0}, x$w_buff0=2, x$w_buff0_used=0, x$w_buff1=0, x$w_buff1_used=0, x=2, y=1, z=2] [L827] CALL 0 assume_abort_if_not(main$tmp_guard0) [L3] COND FALSE 0 !(!cond) [L827] RET 0 assume_abort_if_not(main$tmp_guard0) [L829] 0 x = x$w_buff0_used && x$r_buff0_thd0 ? x$w_buff0 : (x$w_buff1_used && x$r_buff1_thd0 ? x$w_buff1 : x) [L830] 0 x$w_buff0_used = x$w_buff0_used && x$r_buff0_thd0 ? (_Bool)0 : x$w_buff0_used [L831] 0 x$w_buff1_used = x$w_buff0_used && x$r_buff0_thd0 || x$w_buff1_used && x$r_buff1_thd0 ? (_Bool)0 : x$w_buff1_used [L832] 0 x$r_buff0_thd0 = x$w_buff0_used && x$r_buff0_thd0 ? (_Bool)0 : x$r_buff0_thd0 [L833] 0 x$r_buff1_thd0 = x$w_buff0_used && x$r_buff0_thd0 || x$w_buff1_used && x$r_buff1_thd0 ? (_Bool)0 : x$r_buff1_thd0 VAL [\old(arg)={0:0}, \old(arg)={0:0}, __unbuffered_cnt=3, __unbuffered_p2_EAX=1, arg={0:0}, arg={0:0}, main$tmp_guard0=1, main$tmp_guard1=0, t2028=-2, t2029=-1, t2030=0, weak$$choice0=0, weak$$choice2=0, x$flush_delayed=0, x$mem_tmp=0, x$r_buff0_thd0=0, x$r_buff0_thd1=0, x$r_buff0_thd2=1, x$r_buff0_thd3=0, x$r_buff1_thd0=0, x$r_buff1_thd1=0, x$r_buff1_thd2=0, x$r_buff1_thd3=0, x$read_delayed=0, x$read_delayed_var={0:0}, x$w_buff0=2, x$w_buff0_used=0, x$w_buff1=0, x$w_buff1_used=0, x=2, y=1, z=2] [L836] 0 weak$$choice0 = __VERIFIER_nondet_bool() [L837] 0 weak$$choice2 = __VERIFIER_nondet_bool() [L838] 0 x$flush_delayed = weak$$choice2 [L839] 0 x$mem_tmp = x [L840] 0 x = !x$w_buff0_used || !x$r_buff0_thd0 && !x$w_buff1_used || !x$r_buff0_thd0 && !x$r_buff1_thd0 ? x : (x$w_buff0_used && x$r_buff0_thd0 ? x$w_buff0 : x$w_buff1) [L841] 0 x$w_buff0 = weak$$choice2 ? x$w_buff0 : (!x$w_buff0_used || !x$r_buff0_thd0 && !x$w_buff1_used || !x$r_buff0_thd0 && !x$r_buff1_thd0 ? x$w_buff0 : (x$w_buff0_used && x$r_buff0_thd0 ? x$w_buff0 : x$w_buff0)) [L842] 0 x$w_buff1 = weak$$choice2 ? x$w_buff1 : (!x$w_buff0_used || !x$r_buff0_thd0 && !x$w_buff1_used || !x$r_buff0_thd0 && !x$r_buff1_thd0 ? x$w_buff1 : (x$w_buff0_used && x$r_buff0_thd0 ? x$w_buff1 : x$w_buff1)) [L843] 0 x$w_buff0_used = weak$$choice2 ? x$w_buff0_used : (!x$w_buff0_used || !x$r_buff0_thd0 && !x$w_buff1_used || !x$r_buff0_thd0 && !x$r_buff1_thd0 ? x$w_buff0_used : (x$w_buff0_used && x$r_buff0_thd0 ? (_Bool)0 : x$w_buff0_used)) [L844] 0 x$w_buff1_used = weak$$choice2 ? x$w_buff1_used : (!x$w_buff0_used || !x$r_buff0_thd0 && !x$w_buff1_used || !x$r_buff0_thd0 && !x$r_buff1_thd0 ? x$w_buff1_used : (x$w_buff0_used && x$r_buff0_thd0 ? (_Bool)0 : (_Bool)0)) [L845] 0 x$r_buff0_thd0 = weak$$choice2 ? x$r_buff0_thd0 : (!x$w_buff0_used || !x$r_buff0_thd0 && !x$w_buff1_used || !x$r_buff0_thd0 && !x$r_buff1_thd0 ? x$r_buff0_thd0 : (x$w_buff0_used && x$r_buff0_thd0 ? (_Bool)0 : x$r_buff0_thd0)) [L846] 0 x$r_buff1_thd0 = weak$$choice2 ? x$r_buff1_thd0 : (!x$w_buff0_used || !x$r_buff0_thd0 && !x$w_buff1_used || !x$r_buff0_thd0 && !x$r_buff1_thd0 ? x$r_buff1_thd0 : (x$w_buff0_used && x$r_buff0_thd0 ? (_Bool)0 : (_Bool)0)) [L847] 0 main$tmp_guard1 = !(x == 2 && z == 2 && __unbuffered_p2_EAX == 1) [L848] 0 x = x$flush_delayed ? x$mem_tmp : x [L849] 0 x$flush_delayed = (_Bool)0 VAL [\old(arg)={0:0}, \old(arg)={0:0}, __unbuffered_cnt=3, __unbuffered_p2_EAX=1, arg={0:0}, arg={0:0}, main$tmp_guard0=1, main$tmp_guard1=0, t2028=-2, t2029=-1, t2030=0, weak$$choice0=0, weak$$choice2=1, x$flush_delayed=0, x$mem_tmp=2, x$r_buff0_thd0=0, x$r_buff0_thd1=0, x$r_buff0_thd2=1, x$r_buff0_thd3=0, x$r_buff1_thd0=0, x$r_buff1_thd1=0, x$r_buff1_thd2=0, x$r_buff1_thd3=0, x$read_delayed=0, x$read_delayed_var={0:0}, x$w_buff0=2, x$w_buff0_used=0, x$w_buff1=0, x$w_buff1_used=0, x=2, y=1, z=2] [L851] CALL 0 __VERIFIER_assert(main$tmp_guard1) [L18] COND TRUE 0 !expression [L18] CALL 0 reach_error() [L17] COND FALSE 0 !(0) VAL [\old(arg)={0:0}, \old(arg)={0:0}, __unbuffered_cnt=3, __unbuffered_p2_EAX=1, arg={0:0}, arg={0:0}, main$tmp_guard0=1, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=1, x$flush_delayed=0, x$mem_tmp=2, x$r_buff0_thd0=0, x$r_buff0_thd1=0, x$r_buff0_thd2=1, x$r_buff0_thd3=0, x$r_buff1_thd0=0, x$r_buff1_thd1=0, x$r_buff1_thd2=0, x$r_buff1_thd3=0, x$read_delayed=0, x$read_delayed_var={0:0}, x$w_buff0=2, x$w_buff0_used=0, x$w_buff1=0, x$w_buff1_used=0, x=2, y=1, z=2] [L17] 0 __assert_fail ("0", "safe011_power.opt_pso.opt.c", 8, __extension__ __PRETTY_FUNCTION__) VAL [\old(arg)={0:0}, \old(arg)={0:0}, __unbuffered_cnt=3, __unbuffered_p2_EAX=1, arg={0:0}, arg={0:0}, main$tmp_guard0=1, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=1, x$flush_delayed=0, x$mem_tmp=2, x$r_buff0_thd0=0, x$r_buff0_thd1=0, x$r_buff0_thd2=1, x$r_buff0_thd3=0, x$r_buff1_thd0=0, x$r_buff1_thd1=0, x$r_buff1_thd2=0, x$r_buff1_thd3=0, x$read_delayed=0, x$read_delayed_var={0:0}, x$w_buff0=2, x$w_buff0_used=0, x$w_buff1=0, x$w_buff1_used=0, x=2, y=1, z=2] - UnprovableResult [Line: 17]: Unable to prove that all allocated memory was freed Unable to prove that all allocated memory was freed Reason: Not analyzed. - UnprovableResult [Line: 816]: Unable to prove that all allocated memory was freed Unable to prove that all allocated memory was freed Reason: Not analyzed. - UnprovableResult [Line: 821]: 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: 823]: 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: 819]: 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, 68 locations, 7 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: 9.6s, OverallIterations: 10, TraceHistogramMax: 1, PathProgramHistogramMax: 5, EmptinessCheckTime: 0.0s, AutomataDifference: 3.9s, DeadEndRemovalTime: 0.0s, HoareAnnotationTime: 0.0s, InitialAbstractionConstructionTime: 0.1s, HoareTripleCheckerStatistics: 0 mSolverCounterUnknown, 411 SdHoareTripleChecker+Valid, 1.5s IncrementalHoareTripleChecker+Time, 0 mSdLazyCounter, 382 mSDsluCounter, 161 SdHoareTripleChecker+Invalid, 1.2s Time, 0 mProtectedAction, 0 SdHoareTripleChecker+Unchecked, 0 IncrementalHoareTripleChecker+Unchecked, 135 mSDsCounter, 59 IncrementalHoareTripleChecker+Valid, 0 mProtectedPredicate, 1023 IncrementalHoareTripleChecker+Invalid, 1082 SdHoareTripleChecker+Unknown, 0 mSolverCounterNotChecked, 59 mSolverCounterUnsat, 26 mSDtfsCounter, 1023 mSolverCounterSat, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Unknown, PredicateUnifierStatistics: 0 DeclaredPredicates, 210 GetRequests, 156 SyntacticMatches, 0 SemanticMatches, 54 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 47 ImplicationChecksByTransitivity, 0.6s Time, 0.0s BasicInterpolantAutomatonTime, BiggestAbstraction: size=163occurred in iteration=5, InterpolantAutomatonStates: 48, traceCheckStatistics: No data available, InterpolantConsolidationStatistics: No data available, PathInvariantsStatistics: No data available, 0/0 InterpolantCoveringCapability, TotalInterpolationStatistics: No data available, 0.0s DumpTime, AutomataMinimizationStatistics: No data available, HoareAnnotationStatistics: No data available, RefinementEngineStatistics: TRACE_CHECK: 0.2s SsaConstructionTime, 0.3s SatisfiabilityAnalysisTime, 2.1s InterpolantComputationTime, 231 NumberOfCodeBlocks, 231 NumberOfCodeBlocksAsserted, 11 NumberOfCheckSat, 192 ConstructedInterpolants, 0 QuantifiedInterpolants, 1080 SizeOfPredicates, 27 NumberOfNonLiveVariables, 979 ConjunctsInSsa, 73 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-08 19:12:11,546 INFO L552 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_dbfb2896-8405-4c25-b1c4-f34e4377ca0b/bin/uautomizer-verify-jihMAELWvX/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 (1)] Ended with exit code 0 Received shutdown request... --- End real Ultimate output --- Execution finished normally Writing output log to file Ultimate.log Result: UNKNOWN: Overapproximated counterexample