./Ultimate.py --spec ../../sv-benchmarks/c/properties/valid-memsafety.prp --file ../../sv-benchmarks/c/pthread-wmm/mix003_power.opt_pso.opt_rmo.opt_tso.opt.i --full-output --architecture 32bit -------------------------------------------------------------------------------- Checking for memory safety (deref-memtrack) Using default analysis Version 6497de01 Calling Ultimate with: /usr/bin/java -Dosgi.configuration.area=/tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_10321ffd-2a79-4b20-bf29-0d8ff17e75fa/bin/uautomizer-verify-LYvppIcaGC/data/config -Xmx15G -Xms4m -jar /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_10321ffd-2a79-4b20-bf29-0d8ff17e75fa/bin/uautomizer-verify-LYvppIcaGC/plugins/org.eclipse.equinox.launcher_1.6.800.v20240513-1750.jar -data @noDefault -ultimatedata /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_10321ffd-2a79-4b20-bf29-0d8ff17e75fa/bin/uautomizer-verify-LYvppIcaGC/data -tc /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_10321ffd-2a79-4b20-bf29-0d8ff17e75fa/bin/uautomizer-verify-LYvppIcaGC/config/AutomizerMemDerefMemtrack.xml -i ../../sv-benchmarks/c/pthread-wmm/mix003_power.opt_pso.opt_rmo.opt_tso.opt.i -s /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_10321ffd-2a79-4b20-bf29-0d8ff17e75fa/bin/uautomizer-verify-LYvppIcaGC/config/svcomp-DerefFreeMemtrack-32bit-Automizer_Default.epf --cacsl2boogietranslator.entry.function main --witnessprinter.witness.directory /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_10321ffd-2a79-4b20-bf29-0d8ff17e75fa/bin/uautomizer-verify-LYvppIcaGC --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 80bd490b89eb696c85e417e2f0348670cfb7c8195637276a01d1016d9277f95a --- Real Ultimate output --- This is Ultimate 0.3.0-dev-6497de0 [2024-11-23 23:29:50,118 INFO L188 SettingsManager]: Resetting all preferences to default values... [2024-11-23 23:29:50,226 INFO L114 SettingsManager]: Loading settings from /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_10321ffd-2a79-4b20-bf29-0d8ff17e75fa/bin/uautomizer-verify-LYvppIcaGC/config/svcomp-DerefFreeMemtrack-32bit-Automizer_Default.epf [2024-11-23 23:29:50,236 WARN L101 SettingsManager]: Preference file contains the following unknown settings: [2024-11-23 23:29:50,236 WARN L103 SettingsManager]: * de.uni_freiburg.informatik.ultimate.core.Log level for class [2024-11-23 23:29:50,278 INFO L130 SettingsManager]: Preferences different from defaults after loading the file: [2024-11-23 23:29:50,279 INFO L151 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2024-11-23 23:29:50,280 INFO L153 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2024-11-23 23:29:50,280 INFO L151 SettingsManager]: Preferences of Boogie Preprocessor differ from their defaults: [2024-11-23 23:29:50,280 INFO L153 SettingsManager]: * Use memory slicer=true [2024-11-23 23:29:50,281 INFO L151 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2024-11-23 23:29:50,282 INFO L153 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2024-11-23 23:29:50,282 INFO L151 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2024-11-23 23:29:50,282 INFO L153 SettingsManager]: * Create parallel compositions if possible=false [2024-11-23 23:29:50,283 INFO L153 SettingsManager]: * Use SBE=true [2024-11-23 23:29:50,283 INFO L151 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2024-11-23 23:29:50,283 INFO L153 SettingsManager]: * sizeof long=4 [2024-11-23 23:29:50,284 INFO L153 SettingsManager]: * Overapproximate operations on floating types=true [2024-11-23 23:29:50,284 INFO L153 SettingsManager]: * sizeof POINTER=4 [2024-11-23 23:29:50,284 INFO L153 SettingsManager]: * Check division by zero=IGNORE [2024-11-23 23:29:50,284 INFO L153 SettingsManager]: * Check for the main procedure if all allocated memory was freed=true [2024-11-23 23:29:50,284 INFO L153 SettingsManager]: * Bitprecise bitfields=true [2024-11-23 23:29:50,284 INFO L153 SettingsManager]: * SV-COMP memtrack compatibility mode=true [2024-11-23 23:29:50,284 INFO L153 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2024-11-23 23:29:50,284 INFO L153 SettingsManager]: * Adapt memory model on pointer casts if necessary=true [2024-11-23 23:29:50,285 INFO L153 SettingsManager]: * Check unreachability of reach_error function=false [2024-11-23 23:29:50,285 INFO L153 SettingsManager]: * sizeof long double=12 [2024-11-23 23:29:50,285 INFO L153 SettingsManager]: * Behaviour of calls to undefined functions=OVERAPPROXIMATE_BEHAVIOUR [2024-11-23 23:29:50,285 INFO L153 SettingsManager]: * Use constant arrays=true [2024-11-23 23:29:50,285 INFO L151 SettingsManager]: Preferences of IcfgBuilder differ from their defaults: [2024-11-23 23:29:50,285 INFO L153 SettingsManager]: * Size of a code block=SequenceOfStatements [2024-11-23 23:29:50,286 INFO L153 SettingsManager]: * Only consider context switches at boundaries of atomic blocks=true [2024-11-23 23:29:50,286 INFO L153 SettingsManager]: * SMT solver=External_DefaultMode [2024-11-23 23:29:50,286 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2024-11-23 23:29:50,287 INFO L151 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2024-11-23 23:29:50,287 INFO L153 SettingsManager]: * Size of a code block=SequenceOfStatements [2024-11-23 23:29:50,287 INFO L153 SettingsManager]: * Only consider context switches at boundaries of atomic blocks=true [2024-11-23 23:29:50,287 INFO L153 SettingsManager]: * SMT solver=External_DefaultMode [2024-11-23 23:29:50,287 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2024-11-23 23:29:50,287 INFO L151 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2024-11-23 23:29:50,287 INFO L153 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2024-11-23 23:29:50,288 INFO L153 SettingsManager]: * Trace refinement strategy=CAMEL [2024-11-23 23:29:50,288 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2024-11-23 23:29:50,288 INFO L153 SettingsManager]: * Apply one-shot large block encoding in concurrent analysis=false [2024-11-23 23:29:50,288 INFO L153 SettingsManager]: * Automaton type used in concurrency analysis=PETRI_NET [2024-11-23 23:29:50,288 INFO L153 SettingsManager]: * Order on configurations for Petri net unfoldings=DBO [2024-11-23 23:29:50,288 INFO L153 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2024-11-23 23:29:50,288 INFO L153 SettingsManager]: * Looper check in Petri net analysis=SEMANTIC Applying setting for plugin de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator: Entry function -> main Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Witness directory -> /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_10321ffd-2a79-4b20-bf29-0d8ff17e75fa/bin/uautomizer-verify-LYvppIcaGC 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 -> 80bd490b89eb696c85e417e2f0348670cfb7c8195637276a01d1016d9277f95a [2024-11-23 23:29:50,648 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2024-11-23 23:29:50,660 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2024-11-23 23:29:50,664 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2024-11-23 23:29:50,666 INFO L270 PluginConnector]: Initializing CDTParser... [2024-11-23 23:29:50,667 INFO L274 PluginConnector]: CDTParser initialized [2024-11-23 23:29:50,668 INFO L431 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_10321ffd-2a79-4b20-bf29-0d8ff17e75fa/bin/uautomizer-verify-LYvppIcaGC/../../sv-benchmarks/c/pthread-wmm/mix003_power.opt_pso.opt_rmo.opt_tso.opt.i [2024-11-23 23:29:53,793 INFO L533 CDTParser]: Created temporary CDT project at /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_10321ffd-2a79-4b20-bf29-0d8ff17e75fa/bin/uautomizer-verify-LYvppIcaGC/data/df47aeaae/61e43b8cebc7457d9c77aa7e19daecf9/FLAG42da96bb5 [2024-11-23 23:29:54,177 INFO L384 CDTParser]: Found 1 translation units. [2024-11-23 23:29:54,178 INFO L180 CDTParser]: Scanning /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_10321ffd-2a79-4b20-bf29-0d8ff17e75fa/sv-benchmarks/c/pthread-wmm/mix003_power.opt_pso.opt_rmo.opt_tso.opt.i [2024-11-23 23:29:54,199 INFO L427 CDTParser]: About to delete temporary CDT project at /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_10321ffd-2a79-4b20-bf29-0d8ff17e75fa/bin/uautomizer-verify-LYvppIcaGC/data/df47aeaae/61e43b8cebc7457d9c77aa7e19daecf9/FLAG42da96bb5 [2024-11-23 23:29:54,215 INFO L435 CDTParser]: Successfully deleted /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_10321ffd-2a79-4b20-bf29-0d8ff17e75fa/bin/uautomizer-verify-LYvppIcaGC/data/df47aeaae/61e43b8cebc7457d9c77aa7e19daecf9 [2024-11-23 23:29:54,218 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2024-11-23 23:29:54,220 INFO L133 ToolchainWalker]: Walking toolchain with 6 elements. [2024-11-23 23:29:54,221 INFO L112 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2024-11-23 23:29:54,222 INFO L270 PluginConnector]: Initializing CACSL2BoogieTranslator... [2024-11-23 23:29:54,227 INFO L274 PluginConnector]: CACSL2BoogieTranslator initialized [2024-11-23 23:29:54,228 INFO L184 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 23.11 11:29:54" (1/1) ... [2024-11-23 23:29:54,229 INFO L204 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@69c54d45 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 23.11 11:29:54, skipping insertion in model container [2024-11-23 23:29:54,229 INFO L184 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 23.11 11:29:54" (1/1) ... [2024-11-23 23:29:54,270 INFO L175 MainTranslator]: Built tables and reachable declarations [2024-11-23 23:29:54,701 INFO L210 PostProcessor]: Analyzing one entry point: main [2024-11-23 23:29:54,716 INFO L200 MainTranslator]: Completed pre-run [2024-11-23 23:29:54,832 INFO L210 PostProcessor]: Analyzing one entry point: main [2024-11-23 23:29:54,871 INFO L204 MainTranslator]: Completed translation [2024-11-23 23:29:54,872 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 23.11 11:29:54 WrapperNode [2024-11-23 23:29:54,872 INFO L131 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2024-11-23 23:29:54,874 INFO L112 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2024-11-23 23:29:54,875 INFO L270 PluginConnector]: Initializing Boogie Procedure Inliner... [2024-11-23 23:29:54,875 INFO L274 PluginConnector]: Boogie Procedure Inliner initialized [2024-11-23 23:29:54,886 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 23.11 11:29:54" (1/1) ... [2024-11-23 23:29:54,911 INFO L184 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 23.11 11:29:54" (1/1) ... [2024-11-23 23:29:54,958 INFO L138 Inliner]: procedures = 175, calls = 47, calls flagged for inlining = 6, calls inlined = 7, statements flattened = 144 [2024-11-23 23:29:54,958 INFO L131 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2024-11-23 23:29:54,959 INFO L112 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2024-11-23 23:29:54,959 INFO L270 PluginConnector]: Initializing Boogie Preprocessor... [2024-11-23 23:29:54,959 INFO L274 PluginConnector]: Boogie Preprocessor initialized [2024-11-23 23:29:54,970 INFO L184 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 23.11 11:29:54" (1/1) ... [2024-11-23 23:29:54,970 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 23.11 11:29:54" (1/1) ... [2024-11-23 23:29:54,974 INFO L184 PluginConnector]: Executing the observer MemorySlicer from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 23.11 11:29:54" (1/1) ... [2024-11-23 23:29:54,997 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-23 23:29:54,998 INFO L184 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 23.11 11:29:54" (1/1) ... [2024-11-23 23:29:55,001 INFO L184 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 23.11 11:29:54" (1/1) ... [2024-11-23 23:29:55,013 INFO L184 PluginConnector]: Executing the observer ReplaceArrayAssignments from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 23.11 11:29:54" (1/1) ... [2024-11-23 23:29:55,018 INFO L184 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 23.11 11:29:54" (1/1) ... [2024-11-23 23:29:55,020 INFO L184 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 23.11 11:29:54" (1/1) ... [2024-11-23 23:29:55,029 INFO L184 PluginConnector]: Executing the observer LTLStepAnnotator from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 23.11 11:29:54" (1/1) ... [2024-11-23 23:29:55,030 INFO L184 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 23.11 11:29:54" (1/1) ... [2024-11-23 23:29:55,033 INFO L131 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2024-11-23 23:29:55,038 INFO L112 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2024-11-23 23:29:55,039 INFO L270 PluginConnector]: Initializing RCFGBuilder... [2024-11-23 23:29:55,039 INFO L274 PluginConnector]: RCFGBuilder initialized [2024-11-23 23:29:55,040 INFO L184 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 23.11 11:29:54" (1/1) ... [2024-11-23 23:29:55,050 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2024-11-23 23:29:55,074 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_10321ffd-2a79-4b20-bf29-0d8ff17e75fa/bin/uautomizer-verify-LYvppIcaGC/z3 [2024-11-23 23:29:55,092 INFO L229 MonitoredProcess]: Starting monitored process 1 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_10321ffd-2a79-4b20-bf29-0d8ff17e75fa/bin/uautomizer-verify-LYvppIcaGC/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 (exit command is (exit), workingDir is null) [2024-11-23 23:29:55,100 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_10321ffd-2a79-4b20-bf29-0d8ff17e75fa/bin/uautomizer-verify-LYvppIcaGC/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 (1)] Waiting until timeout for monitored process [2024-11-23 23:29:55,129 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_atomic_begin [2024-11-23 23:29:55,129 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2024-11-23 23:29:55,129 INFO L130 BoogieDeclarations]: Found specification of procedure P0 [2024-11-23 23:29:55,130 INFO L138 BoogieDeclarations]: Found implementation of procedure P0 [2024-11-23 23:29:55,130 INFO L130 BoogieDeclarations]: Found specification of procedure P1 [2024-11-23 23:29:55,130 INFO L138 BoogieDeclarations]: Found implementation of procedure P1 [2024-11-23 23:29:55,130 INFO L130 BoogieDeclarations]: Found specification of procedure P2 [2024-11-23 23:29:55,130 INFO L138 BoogieDeclarations]: Found implementation of procedure P2 [2024-11-23 23:29:55,130 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#0 [2024-11-23 23:29:55,130 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_atomic_end [2024-11-23 23:29:55,131 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2024-11-23 23:29:55,131 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2024-11-23 23:29:55,132 WARN L203 CfgBuilder]: User set CodeBlockSize to SequenceOfStatements but program contains fork statements. Overwriting the user preferences and setting CodeBlockSize to OneNontrivialStatement. [2024-11-23 23:29:55,280 INFO L234 CfgBuilder]: Building ICFG [2024-11-23 23:29:55,283 INFO L260 CfgBuilder]: Building CFG for each procedure with an implementation [2024-11-23 23:29:55,731 INFO L279 CfgBuilder]: Omitted future-live optimization because the input is a concurrent program. [2024-11-23 23:29:55,732 INFO L283 CfgBuilder]: Performing block encoding [2024-11-23 23:29:56,098 INFO L307 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2024-11-23 23:29:56,099 INFO L312 CfgBuilder]: Removed 0 assume(true) statements. [2024-11-23 23:29:56,099 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 23.11 11:29:56 BoogieIcfgContainer [2024-11-23 23:29:56,100 INFO L131 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2024-11-23 23:29:56,103 INFO L112 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2024-11-23 23:29:56,105 INFO L270 PluginConnector]: Initializing TraceAbstraction... [2024-11-23 23:29:56,110 INFO L274 PluginConnector]: TraceAbstraction initialized [2024-11-23 23:29:56,110 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 23.11 11:29:54" (1/3) ... [2024-11-23 23:29:56,111 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@4c6dc850 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 23.11 11:29:56, skipping insertion in model container [2024-11-23 23:29:56,112 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 23.11 11:29:54" (2/3) ... [2024-11-23 23:29:56,112 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@4c6dc850 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 23.11 11:29:56, skipping insertion in model container [2024-11-23 23:29:56,112 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 23.11 11:29:56" (3/3) ... [2024-11-23 23:29:56,114 INFO L128 eAbstractionObserver]: Analyzing ICFG mix003_power.opt_pso.opt_rmo.opt_tso.opt.i [2024-11-23 23:29:56,130 INFO L216 ceAbstractionStarter]: Automizer settings: Hoare:None NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2024-11-23 23:29:56,131 INFO L151 ceAbstractionStarter]: Applying trace abstraction to ICFG mix003_power.opt_pso.opt_rmo.opt_tso.opt.i that has 4 procedures, 45 locations, 1 initial locations, 0 loop locations, and 3 error locations. [2024-11-23 23:29:56,132 INFO L491 ceAbstractionStarter]: Constructing petrified ICFG for 1 thread instances. [2024-11-23 23:29:56,207 INFO L143 ThreadInstanceAdder]: Constructed 0 joinOtherThreadTransitions. [2024-11-23 23:29:56,250 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 54 places, 46 transitions, 104 flow [2024-11-23 23:29:56,301 INFO L124 PetriNetUnfolderBase]: 2/43 cut-off events. [2024-11-23 23:29:56,305 INFO L125 PetriNetUnfolderBase]: For 0/0 co-relation queries the response was YES. [2024-11-23 23:29:56,309 INFO L83 FinitePrefix]: Finished finitePrefix Result has 53 conditions, 43 events. 2/43 cut-off events. For 0/0 co-relation queries the response was YES. Maximal size of possible extension queue 5. Compared 87 event pairs, 0 based on Foata normal form. 0/38 useless extension candidates. Maximal degree in co-relation 45. Up to 2 conditions per place. [2024-11-23 23:29:56,311 INFO L82 GeneralOperation]: Start removeDead. Operand has 54 places, 46 transitions, 104 flow [2024-11-23 23:29:56,317 INFO L88 GeneralOperation]: Finished RemoveDead, result has has 51 places, 43 transitions, 95 flow [2024-11-23 23:29:56,333 INFO L332 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2024-11-23 23:29:56,351 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;@308c2ff1, mLbeIndependenceSettings=[IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=false, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2024-11-23 23:29:56,354 INFO L334 AbstractCegarLoop]: Starting to check reachability of 7 error locations. [2024-11-23 23:29:56,388 INFO L185 PetriNetUnfolderBase]: Found word, exiting Unfolder. [2024-11-23 23:29:56,388 INFO L124 PetriNetUnfolderBase]: 0/18 cut-off events. [2024-11-23 23:29:56,388 INFO L125 PetriNetUnfolderBase]: For 0/0 co-relation queries the response was YES. [2024-11-23 23:29:56,389 INFO L198 CegarLoopForPetriNet]: Found error trace [2024-11-23 23:29:56,390 INFO L206 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1] [2024-11-23 23:29:56,391 INFO L396 AbstractCegarLoop]: === Iteration 1 === Targeting P2Err0ASSERT_VIOLATIONMEMORY_LEAK === [P2Err0ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr1ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr0ASSERT_VIOLATIONMEMORY_LEAK (and 4 more)] === [2024-11-23 23:29:56,397 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-23 23:29:56,398 INFO L85 PathProgramCache]: Analyzing trace with hash 1225390657, now seen corresponding path program 1 times [2024-11-23 23:29:56,406 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-23 23:29:56,407 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1396244082] [2024-11-23 23:29:56,407 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-23 23:29:56,408 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-23 23:29:56,571 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-23 23:29:57,109 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-23 23:29:57,110 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-23 23:29:57,110 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1396244082] [2024-11-23 23:29:57,111 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1396244082] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-23 23:29:57,111 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-23 23:29:57,111 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [1] imperfect sequences [] total 1 [2024-11-23 23:29:57,113 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [711552989] [2024-11-23 23:29:57,114 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-23 23:29:57,119 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2024-11-23 23:29:57,124 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-23 23:29:57,147 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-11-23 23:29:57,148 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-11-23 23:29:57,150 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 22 out of 46 [2024-11-23 23:29:57,153 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 51 places, 43 transitions, 95 flow. Second operand has 3 states, 3 states have (on average 24.333333333333332) internal successors, (73), 3 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-23 23:29:57,153 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-11-23 23:29:57,153 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 22 of 46 [2024-11-23 23:29:57,154 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-11-23 23:29:57,677 INFO L124 PetriNetUnfolderBase]: 459/869 cut-off events. [2024-11-23 23:29:57,678 INFO L125 PetriNetUnfolderBase]: For 0/0 co-relation queries the response was YES. [2024-11-23 23:29:57,684 INFO L83 FinitePrefix]: Finished finitePrefix Result has 1608 conditions, 869 events. 459/869 cut-off events. For 0/0 co-relation queries the response was YES. Maximal size of possible extension queue 87. Compared 5853 event pairs, 67 based on Foata normal form. 60/916 useless extension candidates. Maximal degree in co-relation 1597. Up to 585 conditions per place. [2024-11-23 23:29:57,695 INFO L140 encePairwiseOnDemand]: 41/46 looper letters, 26 selfloop transitions, 2 changer transitions 2/49 dead transitions. [2024-11-23 23:29:57,695 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 51 places, 49 transitions, 167 flow [2024-11-23 23:29:57,697 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-11-23 23:29:57,699 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2024-11-23 23:29:57,711 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 101 transitions. [2024-11-23 23:29:57,714 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.7318840579710145 [2024-11-23 23:29:57,717 INFO L175 Difference]: Start difference. First operand has 51 places, 43 transitions, 95 flow. Second operand 3 states and 101 transitions. [2024-11-23 23:29:57,718 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 51 places, 49 transitions, 167 flow [2024-11-23 23:29:57,727 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 48 places, 49 transitions, 164 flow, removed 0 selfloop flow, removed 3 redundant places. [2024-11-23 23:29:57,732 INFO L231 Difference]: Finished difference. Result has 48 places, 38 transitions, 86 flow [2024-11-23 23:29:57,736 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=46, PETRI_DIFFERENCE_MINUEND_FLOW=84, PETRI_DIFFERENCE_MINUEND_PLACES=46, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=39, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=2, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=37, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=86, PETRI_PLACES=48, PETRI_TRANSITIONS=38} [2024-11-23 23:29:57,741 INFO L279 CegarLoopForPetriNet]: 51 programPoint places, -3 predicate places. [2024-11-23 23:29:57,741 INFO L471 AbstractCegarLoop]: Abstraction has has 48 places, 38 transitions, 86 flow [2024-11-23 23:29:57,741 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 24.333333333333332) internal successors, (73), 3 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-23 23:29:57,741 INFO L198 CegarLoopForPetriNet]: Found error trace [2024-11-23 23:29:57,741 INFO L206 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-23 23:29:57,742 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable0 [2024-11-23 23:29:57,742 INFO L396 AbstractCegarLoop]: === Iteration 2 === Targeting ULTIMATE.startErr1ASSERT_VIOLATIONMEMORY_LEAK === [P2Err0ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr1ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr0ASSERT_VIOLATIONMEMORY_LEAK (and 4 more)] === [2024-11-23 23:29:57,743 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-23 23:29:57,743 INFO L85 PathProgramCache]: Analyzing trace with hash 1436946444, now seen corresponding path program 1 times [2024-11-23 23:29:57,743 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-23 23:29:57,743 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1034068650] [2024-11-23 23:29:57,743 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-23 23:29:57,744 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-23 23:29:57,801 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-23 23:29:57,915 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-23 23:29:57,915 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-23 23:29:57,915 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1034068650] [2024-11-23 23:29:57,915 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1034068650] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-23 23:29:57,916 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-23 23:29:57,916 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [1] imperfect sequences [] total 1 [2024-11-23 23:29:57,916 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [136514004] [2024-11-23 23:29:57,916 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-23 23:29:57,917 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2024-11-23 23:29:57,917 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-23 23:29:57,917 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-11-23 23:29:57,918 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-11-23 23:29:57,920 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 21 out of 46 [2024-11-23 23:29:57,921 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 48 places, 38 transitions, 86 flow. Second operand has 3 states, 3 states have (on average 25.0) internal successors, (75), 3 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-23 23:29:57,921 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-11-23 23:29:57,921 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 21 of 46 [2024-11-23 23:29:57,921 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-11-23 23:29:58,212 INFO L124 PetriNetUnfolderBase]: 400/816 cut-off events. [2024-11-23 23:29:58,213 INFO L125 PetriNetUnfolderBase]: For 42/42 co-relation queries the response was YES. [2024-11-23 23:29:58,219 INFO L83 FinitePrefix]: Finished finitePrefix Result has 1507 conditions, 816 events. 400/816 cut-off events. For 42/42 co-relation queries the response was YES. Maximal size of possible extension queue 82. Compared 5700 event pairs, 400 based on Foata normal form. 30/827 useless extension candidates. Maximal degree in co-relation 1497. Up to 627 conditions per place. [2024-11-23 23:29:58,227 INFO L140 encePairwiseOnDemand]: 44/46 looper letters, 17 selfloop transitions, 1 changer transitions 1/37 dead transitions. [2024-11-23 23:29:58,227 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 48 places, 37 transitions, 122 flow [2024-11-23 23:29:58,228 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-11-23 23:29:58,229 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2024-11-23 23:29:58,229 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 83 transitions. [2024-11-23 23:29:58,230 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.6014492753623188 [2024-11-23 23:29:58,231 INFO L175 Difference]: Start difference. First operand has 48 places, 38 transitions, 86 flow. Second operand 3 states and 83 transitions. [2024-11-23 23:29:58,231 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 48 places, 37 transitions, 122 flow [2024-11-23 23:29:58,232 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 46 places, 37 transitions, 118 flow, removed 0 selfloop flow, removed 2 redundant places. [2024-11-23 23:29:58,234 INFO L231 Difference]: Finished difference. Result has 46 places, 36 transitions, 80 flow [2024-11-23 23:29:58,236 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=46, PETRI_DIFFERENCE_MINUEND_FLOW=80, PETRI_DIFFERENCE_MINUEND_PLACES=44, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=37, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=1, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=36, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=80, PETRI_PLACES=46, PETRI_TRANSITIONS=36} [2024-11-23 23:29:58,237 INFO L279 CegarLoopForPetriNet]: 51 programPoint places, -5 predicate places. [2024-11-23 23:29:58,237 INFO L471 AbstractCegarLoop]: Abstraction has has 46 places, 36 transitions, 80 flow [2024-11-23 23:29:58,237 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 25.0) internal successors, (75), 3 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-23 23:29:58,237 INFO L198 CegarLoopForPetriNet]: Found error trace [2024-11-23 23:29:58,237 INFO L206 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-23 23:29:58,238 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1 [2024-11-23 23:29:58,238 INFO L396 AbstractCegarLoop]: === Iteration 3 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONMEMORY_LEAK === [P2Err0ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr1ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr0ASSERT_VIOLATIONMEMORY_LEAK (and 4 more)] === [2024-11-23 23:29:58,240 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-23 23:29:58,240 INFO L85 PathProgramCache]: Analyzing trace with hash 1436947813, now seen corresponding path program 1 times [2024-11-23 23:29:58,240 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-23 23:29:58,240 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [568344057] [2024-11-23 23:29:58,240 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-23 23:29:58,240 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-23 23:29:58,311 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-23 23:29:58,642 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-23 23:29:58,643 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-23 23:29:58,644 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [568344057] [2024-11-23 23:29:58,644 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [568344057] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-23 23:29:58,645 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-23 23:29:58,645 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2024-11-23 23:29:58,645 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1873759622] [2024-11-23 23:29:58,645 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-23 23:29:58,645 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2024-11-23 23:29:58,646 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-23 23:29:58,647 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2024-11-23 23:29:58,647 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2024-11-23 23:29:58,654 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 18 out of 46 [2024-11-23 23:29:58,654 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 46 places, 36 transitions, 80 flow. Second operand has 4 states, 4 states have (on average 21.0) internal successors, (84), 4 states have internal predecessors, (84), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-23 23:29:58,655 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-11-23 23:29:58,655 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 18 of 46 [2024-11-23 23:29:58,655 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-11-23 23:29:59,189 INFO L124 PetriNetUnfolderBase]: 1079/1918 cut-off events. [2024-11-23 23:29:59,189 INFO L125 PetriNetUnfolderBase]: For 0/0 co-relation queries the response was YES. [2024-11-23 23:29:59,194 INFO L83 FinitePrefix]: Finished finitePrefix Result has 3600 conditions, 1918 events. 1079/1918 cut-off events. For 0/0 co-relation queries the response was YES. Maximal size of possible extension queue 151. Compared 12328 event pairs, 107 based on Foata normal form. 72/1983 useless extension candidates. Maximal degree in co-relation 3594. Up to 1011 conditions per place. [2024-11-23 23:29:59,206 INFO L140 encePairwiseOnDemand]: 40/46 looper letters, 39 selfloop transitions, 5 changer transitions 1/59 dead transitions. [2024-11-23 23:29:59,206 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 48 places, 59 transitions, 220 flow [2024-11-23 23:29:59,207 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2024-11-23 23:29:59,207 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 4 states. [2024-11-23 23:29:59,208 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 119 transitions. [2024-11-23 23:29:59,210 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.6467391304347826 [2024-11-23 23:29:59,210 INFO L175 Difference]: Start difference. First operand has 46 places, 36 transitions, 80 flow. Second operand 4 states and 119 transitions. [2024-11-23 23:29:59,211 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 48 places, 59 transitions, 220 flow [2024-11-23 23:29:59,211 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 47 places, 59 transitions, 219 flow, removed 0 selfloop flow, removed 1 redundant places. [2024-11-23 23:29:59,214 INFO L231 Difference]: Finished difference. Result has 49 places, 39 transitions, 113 flow [2024-11-23 23:29:59,214 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=46, PETRI_DIFFERENCE_MINUEND_FLOW=79, PETRI_DIFFERENCE_MINUEND_PLACES=44, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=36, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=2, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=31, PETRI_DIFFERENCE_SUBTRAHEND_STATES=4, PETRI_FLOW=113, PETRI_PLACES=49, PETRI_TRANSITIONS=39} [2024-11-23 23:29:59,216 INFO L279 CegarLoopForPetriNet]: 51 programPoint places, -2 predicate places. [2024-11-23 23:29:59,216 INFO L471 AbstractCegarLoop]: Abstraction has has 49 places, 39 transitions, 113 flow [2024-11-23 23:29:59,216 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 21.0) internal successors, (84), 4 states have internal predecessors, (84), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-23 23:29:59,216 INFO L198 CegarLoopForPetriNet]: Found error trace [2024-11-23 23:29:59,217 INFO L206 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-23 23:29:59,217 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2 [2024-11-23 23:29:59,217 INFO L396 AbstractCegarLoop]: === Iteration 4 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONMEMORY_LEAK === [P2Err0ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr1ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr0ASSERT_VIOLATIONMEMORY_LEAK (and 4 more)] === [2024-11-23 23:29:59,218 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-23 23:29:59,218 INFO L85 PathProgramCache]: Analyzing trace with hash -1453254212, now seen corresponding path program 1 times [2024-11-23 23:29:59,218 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-23 23:29:59,218 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [656331983] [2024-11-23 23:29:59,219 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-23 23:29:59,219 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-23 23:29:59,264 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-23 23:29:59,483 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-23 23:29:59,484 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-23 23:29:59,484 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [656331983] [2024-11-23 23:29:59,485 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [656331983] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-23 23:29:59,485 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-23 23:29:59,485 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2024-11-23 23:29:59,485 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [332049089] [2024-11-23 23:29:59,485 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-23 23:29:59,486 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2024-11-23 23:29:59,486 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-23 23:29:59,486 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2024-11-23 23:29:59,486 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=8, Invalid=12, Unknown=0, NotChecked=0, Total=20 [2024-11-23 23:29:59,501 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 18 out of 46 [2024-11-23 23:29:59,501 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 49 places, 39 transitions, 113 flow. Second operand has 5 states, 5 states have (on average 20.6) internal successors, (103), 5 states have internal predecessors, (103), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-23 23:29:59,502 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-11-23 23:29:59,502 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 18 of 46 [2024-11-23 23:29:59,502 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-11-23 23:29:59,925 INFO L124 PetriNetUnfolderBase]: 733/1310 cut-off events. [2024-11-23 23:29:59,925 INFO L125 PetriNetUnfolderBase]: For 354/354 co-relation queries the response was YES. [2024-11-23 23:29:59,931 INFO L83 FinitePrefix]: Finished finitePrefix Result has 2961 conditions, 1310 events. 733/1310 cut-off events. For 354/354 co-relation queries the response was YES. Maximal size of possible extension queue 79. Compared 7320 event pairs, 41 based on Foata normal form. 64/1367 useless extension candidates. Maximal degree in co-relation 2952. Up to 521 conditions per place. [2024-11-23 23:29:59,939 INFO L140 encePairwiseOnDemand]: 40/46 looper letters, 49 selfloop transitions, 8 changer transitions 1/72 dead transitions. [2024-11-23 23:29:59,939 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 53 places, 72 transitions, 316 flow [2024-11-23 23:29:59,939 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2024-11-23 23:29:59,940 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 5 states. [2024-11-23 23:29:59,940 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 150 transitions. [2024-11-23 23:29:59,940 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.6521739130434783 [2024-11-23 23:29:59,940 INFO L175 Difference]: Start difference. First operand has 49 places, 39 transitions, 113 flow. Second operand 5 states and 150 transitions. [2024-11-23 23:29:59,941 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 53 places, 72 transitions, 316 flow [2024-11-23 23:29:59,942 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 51 places, 72 transitions, 306 flow, removed 1 selfloop flow, removed 2 redundant places. [2024-11-23 23:29:59,945 INFO L231 Difference]: Finished difference. Result has 53 places, 42 transitions, 153 flow [2024-11-23 23:29:59,946 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=46, PETRI_DIFFERENCE_MINUEND_FLOW=105, PETRI_DIFFERENCE_MINUEND_PLACES=47, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=39, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=5, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=31, PETRI_DIFFERENCE_SUBTRAHEND_STATES=5, PETRI_FLOW=153, PETRI_PLACES=53, PETRI_TRANSITIONS=42} [2024-11-23 23:29:59,947 INFO L279 CegarLoopForPetriNet]: 51 programPoint places, 2 predicate places. [2024-11-23 23:29:59,947 INFO L471 AbstractCegarLoop]: Abstraction has has 53 places, 42 transitions, 153 flow [2024-11-23 23:29:59,947 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 20.6) internal successors, (103), 5 states have internal predecessors, (103), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-23 23:29:59,948 INFO L198 CegarLoopForPetriNet]: Found error trace [2024-11-23 23:29:59,948 INFO L206 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-23 23:29:59,948 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable3 [2024-11-23 23:29:59,948 INFO L396 AbstractCegarLoop]: === Iteration 5 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONMEMORY_LEAK === [P2Err0ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr1ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr0ASSERT_VIOLATIONMEMORY_LEAK (and 4 more)] === [2024-11-23 23:29:59,949 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-23 23:29:59,949 INFO L85 PathProgramCache]: Analyzing trace with hash 1075661901, now seen corresponding path program 1 times [2024-11-23 23:29:59,949 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-23 23:29:59,949 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1986172205] [2024-11-23 23:29:59,949 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-23 23:29:59,951 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-23 23:30:00,038 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-23 23:30:00,314 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-23 23:30:00,315 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-23 23:30:00,315 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1986172205] [2024-11-23 23:30:00,315 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1986172205] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-23 23:30:00,315 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-23 23:30:00,315 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2024-11-23 23:30:00,315 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1644188651] [2024-11-23 23:30:00,316 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-23 23:30:00,316 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2024-11-23 23:30:00,316 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-23 23:30:00,317 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2024-11-23 23:30:00,317 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=12, Invalid=18, Unknown=0, NotChecked=0, Total=30 [2024-11-23 23:30:00,324 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 18 out of 46 [2024-11-23 23:30:00,325 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 53 places, 42 transitions, 153 flow. Second operand has 6 states, 6 states have (on average 20.5) internal successors, (123), 6 states have internal predecessors, (123), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-23 23:30:00,325 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-11-23 23:30:00,325 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 18 of 46 [2024-11-23 23:30:00,325 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-11-23 23:30:00,670 INFO L124 PetriNetUnfolderBase]: 411/708 cut-off events. [2024-11-23 23:30:00,670 INFO L125 PetriNetUnfolderBase]: For 644/644 co-relation queries the response was YES. [2024-11-23 23:30:00,673 INFO L83 FinitePrefix]: Finished finitePrefix Result has 1879 conditions, 708 events. 411/708 cut-off events. For 644/644 co-relation queries the response was YES. Maximal size of possible extension queue 43. Compared 3099 event pairs, 29 based on Foata normal form. 36/737 useless extension candidates. Maximal degree in co-relation 1868. Up to 268 conditions per place. [2024-11-23 23:30:00,676 INFO L140 encePairwiseOnDemand]: 40/46 looper letters, 43 selfloop transitions, 11 changer transitions 1/69 dead transitions. [2024-11-23 23:30:00,677 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 58 places, 69 transitions, 327 flow [2024-11-23 23:30:00,677 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2024-11-23 23:30:00,677 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 6 states. [2024-11-23 23:30:00,678 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6 states to 6 states and 165 transitions. [2024-11-23 23:30:00,678 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.5978260869565217 [2024-11-23 23:30:00,680 INFO L175 Difference]: Start difference. First operand has 53 places, 42 transitions, 153 flow. Second operand 6 states and 165 transitions. [2024-11-23 23:30:00,680 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 58 places, 69 transitions, 327 flow [2024-11-23 23:30:00,687 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 54 places, 69 transitions, 302 flow, removed 4 selfloop flow, removed 4 redundant places. [2024-11-23 23:30:00,689 INFO L231 Difference]: Finished difference. Result has 56 places, 42 transitions, 167 flow [2024-11-23 23:30:00,689 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=46, PETRI_DIFFERENCE_MINUEND_FLOW=131, PETRI_DIFFERENCE_MINUEND_PLACES=49, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=42, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=11, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=31, PETRI_DIFFERENCE_SUBTRAHEND_STATES=6, PETRI_FLOW=167, PETRI_PLACES=56, PETRI_TRANSITIONS=42} [2024-11-23 23:30:00,689 INFO L279 CegarLoopForPetriNet]: 51 programPoint places, 5 predicate places. [2024-11-23 23:30:00,691 INFO L471 AbstractCegarLoop]: Abstraction has has 56 places, 42 transitions, 167 flow [2024-11-23 23:30:00,691 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 20.5) internal successors, (123), 6 states have internal predecessors, (123), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-23 23:30:00,691 INFO L198 CegarLoopForPetriNet]: Found error trace [2024-11-23 23:30:00,691 INFO L206 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-23 23:30:00,691 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable4 [2024-11-23 23:30:00,692 INFO L396 AbstractCegarLoop]: === Iteration 6 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONMEMORY_LEAK === [P2Err0ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr1ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr0ASSERT_VIOLATIONMEMORY_LEAK (and 4 more)] === [2024-11-23 23:30:00,692 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-23 23:30:00,692 INFO L85 PathProgramCache]: Analyzing trace with hash -1487936201, now seen corresponding path program 1 times [2024-11-23 23:30:00,692 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-23 23:30:00,692 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1741911898] [2024-11-23 23:30:00,692 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-23 23:30:00,692 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-23 23:30:00,895 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-23 23:30:01,368 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-23 23:30:01,368 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-23 23:30:01,368 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1741911898] [2024-11-23 23:30:01,368 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1741911898] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-23 23:30:01,368 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-23 23:30:01,368 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2024-11-23 23:30:01,369 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [187605310] [2024-11-23 23:30:01,369 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-23 23:30:01,369 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2024-11-23 23:30:01,369 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-23 23:30:01,370 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2024-11-23 23:30:01,370 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2024-11-23 23:30:01,394 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 17 out of 46 [2024-11-23 23:30:01,394 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 56 places, 42 transitions, 167 flow. Second operand has 6 states, 6 states have (on average 20.333333333333332) internal successors, (122), 6 states have internal predecessors, (122), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-23 23:30:01,394 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-11-23 23:30:01,394 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 17 of 46 [2024-11-23 23:30:01,394 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-11-23 23:30:01,940 INFO L124 PetriNetUnfolderBase]: 729/1364 cut-off events. [2024-11-23 23:30:01,941 INFO L125 PetriNetUnfolderBase]: For 576/590 co-relation queries the response was YES. [2024-11-23 23:30:01,946 INFO L83 FinitePrefix]: Finished finitePrefix Result has 3114 conditions, 1364 events. 729/1364 cut-off events. For 576/590 co-relation queries the response was YES. Maximal size of possible extension queue 88. Compared 7347 event pairs, 179 based on Foata normal form. 8/1332 useless extension candidates. Maximal degree in co-relation 3102. Up to 709 conditions per place. [2024-11-23 23:30:01,951 INFO L140 encePairwiseOnDemand]: 36/46 looper letters, 47 selfloop transitions, 10 changer transitions 10/86 dead transitions. [2024-11-23 23:30:01,951 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 62 places, 86 transitions, 407 flow [2024-11-23 23:30:01,953 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2024-11-23 23:30:01,953 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 7 states. [2024-11-23 23:30:01,954 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 7 states to 7 states and 187 transitions. [2024-11-23 23:30:01,955 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.5807453416149069 [2024-11-23 23:30:01,955 INFO L175 Difference]: Start difference. First operand has 56 places, 42 transitions, 167 flow. Second operand 7 states and 187 transitions. [2024-11-23 23:30:01,955 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 62 places, 86 transitions, 407 flow [2024-11-23 23:30:01,964 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 54 places, 86 transitions, 343 flow, removed 14 selfloop flow, removed 8 redundant places. [2024-11-23 23:30:01,966 INFO L231 Difference]: Finished difference. Result has 59 places, 50 transitions, 183 flow [2024-11-23 23:30:01,967 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=46, PETRI_DIFFERENCE_MINUEND_FLOW=111, PETRI_DIFFERENCE_MINUEND_PLACES=48, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=42, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=2, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=35, PETRI_DIFFERENCE_SUBTRAHEND_STATES=7, PETRI_FLOW=183, PETRI_PLACES=59, PETRI_TRANSITIONS=50} [2024-11-23 23:30:01,968 INFO L279 CegarLoopForPetriNet]: 51 programPoint places, 8 predicate places. [2024-11-23 23:30:01,969 INFO L471 AbstractCegarLoop]: Abstraction has has 59 places, 50 transitions, 183 flow [2024-11-23 23:30:01,969 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 20.333333333333332) internal successors, (122), 6 states have internal predecessors, (122), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-23 23:30:01,969 INFO L198 CegarLoopForPetriNet]: Found error trace [2024-11-23 23:30:01,969 INFO L206 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-23 23:30:01,969 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable5 [2024-11-23 23:30:01,970 INFO L396 AbstractCegarLoop]: === Iteration 7 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONMEMORY_LEAK === [P2Err0ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr1ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr0ASSERT_VIOLATIONMEMORY_LEAK (and 4 more)] === [2024-11-23 23:30:01,971 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-23 23:30:01,971 INFO L85 PathProgramCache]: Analyzing trace with hash -916294857, now seen corresponding path program 2 times [2024-11-23 23:30:01,972 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-23 23:30:01,972 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1011628709] [2024-11-23 23:30:01,972 INFO L95 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2024-11-23 23:30:01,972 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-23 23:30:02,139 INFO L229 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 1 check-sat command(s) [2024-11-23 23:30:02,139 INFO L230 tOrderPrioritization]: Conjunction of SSA is unsat [2024-11-23 23:30:02,597 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-23 23:30:02,598 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-23 23:30:02,598 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1011628709] [2024-11-23 23:30:02,599 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1011628709] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-23 23:30:02,599 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-23 23:30:02,599 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2024-11-23 23:30:02,599 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [679287436] [2024-11-23 23:30:02,599 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-23 23:30:02,599 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2024-11-23 23:30:02,600 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-23 23:30:02,600 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2024-11-23 23:30:02,600 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=12, Invalid=30, Unknown=0, NotChecked=0, Total=42 [2024-11-23 23:30:02,631 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 17 out of 46 [2024-11-23 23:30:02,631 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 59 places, 50 transitions, 183 flow. Second operand has 7 states, 7 states have (on average 19.857142857142858) internal successors, (139), 7 states have internal predecessors, (139), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-23 23:30:02,631 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-11-23 23:30:02,631 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 17 of 46 [2024-11-23 23:30:02,631 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-11-23 23:30:03,196 INFO L124 PetriNetUnfolderBase]: 919/1722 cut-off events. [2024-11-23 23:30:03,197 INFO L125 PetriNetUnfolderBase]: For 513/519 co-relation queries the response was YES. [2024-11-23 23:30:03,203 INFO L83 FinitePrefix]: Finished finitePrefix Result has 4049 conditions, 1722 events. 919/1722 cut-off events. For 513/519 co-relation queries the response was YES. Maximal size of possible extension queue 115. Compared 9976 event pairs, 215 based on Foata normal form. 12/1673 useless extension candidates. Maximal degree in co-relation 4036. Up to 650 conditions per place. [2024-11-23 23:30:03,207 INFO L140 encePairwiseOnDemand]: 37/46 looper letters, 31 selfloop transitions, 4 changer transitions 38/92 dead transitions. [2024-11-23 23:30:03,207 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 64 places, 92 transitions, 453 flow [2024-11-23 23:30:03,208 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2024-11-23 23:30:03,208 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 8 states. [2024-11-23 23:30:03,208 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 8 states to 8 states and 207 transitions. [2024-11-23 23:30:03,209 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.5625 [2024-11-23 23:30:03,209 INFO L175 Difference]: Start difference. First operand has 59 places, 50 transitions, 183 flow. Second operand 8 states and 207 transitions. [2024-11-23 23:30:03,209 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 64 places, 92 transitions, 453 flow [2024-11-23 23:30:03,212 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 62 places, 92 transitions, 447 flow, removed 3 selfloop flow, removed 2 redundant places. [2024-11-23 23:30:03,214 INFO L231 Difference]: Finished difference. Result has 65 places, 44 transitions, 157 flow [2024-11-23 23:30:03,215 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=46, PETRI_DIFFERENCE_MINUEND_FLOW=179, PETRI_DIFFERENCE_MINUEND_PLACES=55, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=50, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=4, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=46, PETRI_DIFFERENCE_SUBTRAHEND_STATES=8, PETRI_FLOW=157, PETRI_PLACES=65, PETRI_TRANSITIONS=44} [2024-11-23 23:30:03,216 INFO L279 CegarLoopForPetriNet]: 51 programPoint places, 14 predicate places. [2024-11-23 23:30:03,217 INFO L471 AbstractCegarLoop]: Abstraction has has 65 places, 44 transitions, 157 flow [2024-11-23 23:30:03,217 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 7 states, 7 states have (on average 19.857142857142858) internal successors, (139), 7 states have internal predecessors, (139), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-23 23:30:03,217 INFO L198 CegarLoopForPetriNet]: Found error trace [2024-11-23 23:30:03,217 INFO L206 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-23 23:30:03,217 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable6 [2024-11-23 23:30:03,217 INFO L396 AbstractCegarLoop]: === Iteration 8 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONMEMORY_LEAK === [P2Err0ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr1ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr0ASSERT_VIOLATIONMEMORY_LEAK (and 4 more)] === [2024-11-23 23:30:03,218 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-23 23:30:03,218 INFO L85 PathProgramCache]: Analyzing trace with hash 1079484437, now seen corresponding path program 3 times [2024-11-23 23:30:03,218 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-23 23:30:03,218 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [966559189] [2024-11-23 23:30:03,219 INFO L95 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST2 [2024-11-23 23:30:03,219 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-23 23:30:03,364 INFO L229 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued 1 check-sat command(s) [2024-11-23 23:30:03,366 INFO L230 tOrderPrioritization]: Conjunction of SSA is unsat [2024-11-23 23:30:03,773 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-23 23:30:03,774 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-23 23:30:03,774 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [966559189] [2024-11-23 23:30:03,774 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [966559189] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-23 23:30:03,774 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-23 23:30:03,774 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2024-11-23 23:30:03,774 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [47025528] [2024-11-23 23:30:03,774 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-23 23:30:03,774 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2024-11-23 23:30:03,775 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-23 23:30:03,775 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2024-11-23 23:30:03,775 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2024-11-23 23:30:03,799 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 17 out of 46 [2024-11-23 23:30:03,800 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 65 places, 44 transitions, 157 flow. Second operand has 6 states, 6 states have (on average 20.333333333333332) internal successors, (122), 6 states have internal predecessors, (122), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-23 23:30:03,800 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-11-23 23:30:03,800 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 17 of 46 [2024-11-23 23:30:03,800 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-11-23 23:30:04,302 INFO L124 PetriNetUnfolderBase]: 639/1315 cut-off events. [2024-11-23 23:30:04,302 INFO L125 PetriNetUnfolderBase]: For 322/342 co-relation queries the response was YES. [2024-11-23 23:30:04,308 INFO L83 FinitePrefix]: Finished finitePrefix Result has 2953 conditions, 1315 events. 639/1315 cut-off events. For 322/342 co-relation queries the response was YES. Maximal size of possible extension queue 92. Compared 7683 event pairs, 161 based on Foata normal form. 8/1263 useless extension candidates. Maximal degree in co-relation 2937. Up to 553 conditions per place. [2024-11-23 23:30:04,312 INFO L140 encePairwiseOnDemand]: 37/46 looper letters, 37 selfloop transitions, 9 changer transitions 12/77 dead transitions. [2024-11-23 23:30:04,312 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 66 places, 77 transitions, 368 flow [2024-11-23 23:30:04,312 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2024-11-23 23:30:04,313 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 7 states. [2024-11-23 23:30:04,314 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 7 states to 7 states and 176 transitions. [2024-11-23 23:30:04,315 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.546583850931677 [2024-11-23 23:30:04,315 INFO L175 Difference]: Start difference. First operand has 65 places, 44 transitions, 157 flow. Second operand 7 states and 176 transitions. [2024-11-23 23:30:04,315 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 66 places, 77 transitions, 368 flow [2024-11-23 23:30:04,318 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 61 places, 77 transitions, 345 flow, removed 7 selfloop flow, removed 5 redundant places. [2024-11-23 23:30:04,319 INFO L231 Difference]: Finished difference. Result has 65 places, 49 transitions, 207 flow [2024-11-23 23:30:04,319 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=46, PETRI_DIFFERENCE_MINUEND_FLOW=142, PETRI_DIFFERENCE_MINUEND_PLACES=55, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=44, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=4, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=37, PETRI_DIFFERENCE_SUBTRAHEND_STATES=7, PETRI_FLOW=207, PETRI_PLACES=65, PETRI_TRANSITIONS=49} [2024-11-23 23:30:04,320 INFO L279 CegarLoopForPetriNet]: 51 programPoint places, 14 predicate places. [2024-11-23 23:30:04,320 INFO L471 AbstractCegarLoop]: Abstraction has has 65 places, 49 transitions, 207 flow [2024-11-23 23:30:04,320 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 20.333333333333332) internal successors, (122), 6 states have internal predecessors, (122), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-23 23:30:04,320 INFO L198 CegarLoopForPetriNet]: Found error trace [2024-11-23 23:30:04,320 INFO L206 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-23 23:30:04,320 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable7 [2024-11-23 23:30:04,321 INFO L396 AbstractCegarLoop]: === Iteration 9 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONMEMORY_LEAK === [P2Err0ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr1ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr0ASSERT_VIOLATIONMEMORY_LEAK (and 4 more)] === [2024-11-23 23:30:04,321 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-23 23:30:04,321 INFO L85 PathProgramCache]: Analyzing trace with hash 896733257, now seen corresponding path program 4 times [2024-11-23 23:30:04,321 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-23 23:30:04,321 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [620762797] [2024-11-23 23:30:04,321 INFO L95 rtionOrderModulation]: Changing assertion order to TERMS_WITH_SMALL_CONSTANTS_FIRST [2024-11-23 23:30:04,321 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-23 23:30:04,365 INFO L229 tOrderPrioritization]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 0 check-sat command(s) [2024-11-23 23:30:04,365 INFO L230 tOrderPrioritization]: Conjunction of SSA is unsat [2024-11-23 23:30:04,683 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-23 23:30:04,684 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-23 23:30:04,684 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [620762797] [2024-11-23 23:30:04,684 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [620762797] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-23 23:30:04,684 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-23 23:30:04,684 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2024-11-23 23:30:04,684 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1837863504] [2024-11-23 23:30:04,684 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-23 23:30:04,685 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2024-11-23 23:30:04,685 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-23 23:30:04,685 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2024-11-23 23:30:04,685 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2024-11-23 23:30:04,701 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 18 out of 46 [2024-11-23 23:30:04,702 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 65 places, 49 transitions, 207 flow. Second operand has 6 states, 6 states have (on average 21.0) internal successors, (126), 6 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-23 23:30:04,703 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-11-23 23:30:04,703 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 18 of 46 [2024-11-23 23:30:04,703 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-11-23 23:30:05,154 INFO L124 PetriNetUnfolderBase]: 711/1501 cut-off events. [2024-11-23 23:30:05,155 INFO L125 PetriNetUnfolderBase]: For 708/778 co-relation queries the response was YES. [2024-11-23 23:30:05,161 INFO L83 FinitePrefix]: Finished finitePrefix Result has 3512 conditions, 1501 events. 711/1501 cut-off events. For 708/778 co-relation queries the response was YES. Maximal size of possible extension queue 104. Compared 9407 event pairs, 199 based on Foata normal form. 18/1423 useless extension candidates. Maximal degree in co-relation 3495. Up to 577 conditions per place. [2024-11-23 23:30:05,164 INFO L140 encePairwiseOnDemand]: 40/46 looper letters, 24 selfloop transitions, 1 changer transitions 35/80 dead transitions. [2024-11-23 23:30:05,164 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 69 places, 80 transitions, 403 flow [2024-11-23 23:30:05,165 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2024-11-23 23:30:05,165 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 7 states. [2024-11-23 23:30:05,166 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 7 states to 7 states and 182 transitions. [2024-11-23 23:30:05,166 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.5652173913043478 [2024-11-23 23:30:05,166 INFO L175 Difference]: Start difference. First operand has 65 places, 49 transitions, 207 flow. Second operand 7 states and 182 transitions. [2024-11-23 23:30:05,166 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 69 places, 80 transitions, 403 flow [2024-11-23 23:30:05,169 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 67 places, 80 transitions, 391 flow, removed 6 selfloop flow, removed 2 redundant places. [2024-11-23 23:30:05,171 INFO L231 Difference]: Finished difference. Result has 70 places, 41 transitions, 150 flow [2024-11-23 23:30:05,171 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=46, PETRI_DIFFERENCE_MINUEND_FLOW=197, PETRI_DIFFERENCE_MINUEND_PLACES=61, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=49, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=1, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=48, PETRI_DIFFERENCE_SUBTRAHEND_STATES=7, PETRI_FLOW=150, PETRI_PLACES=70, PETRI_TRANSITIONS=41} [2024-11-23 23:30:05,172 INFO L279 CegarLoopForPetriNet]: 51 programPoint places, 19 predicate places. [2024-11-23 23:30:05,172 INFO L471 AbstractCegarLoop]: Abstraction has has 70 places, 41 transitions, 150 flow [2024-11-23 23:30:05,172 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 21.0) internal successors, (126), 6 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-23 23:30:05,172 INFO L198 CegarLoopForPetriNet]: Found error trace [2024-11-23 23:30:05,172 INFO L206 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-23 23:30:05,172 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable8 [2024-11-23 23:30:05,173 INFO L396 AbstractCegarLoop]: === Iteration 10 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONMEMORY_LEAK === [P2Err0ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr1ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr0ASSERT_VIOLATIONMEMORY_LEAK (and 4 more)] === [2024-11-23 23:30:05,173 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-23 23:30:05,173 INFO L85 PathProgramCache]: Analyzing trace with hash 641228725, now seen corresponding path program 5 times [2024-11-23 23:30:05,174 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-23 23:30:05,174 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2113435361] [2024-11-23 23:30:05,174 INFO L95 rtionOrderModulation]: Changing assertion order to INSIDE_LOOP_FIRST1 [2024-11-23 23:30:05,174 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-23 23:30:05,301 INFO L229 tOrderPrioritization]: Assert order INSIDE_LOOP_FIRST1 issued 1 check-sat command(s) [2024-11-23 23:30:05,302 INFO L230 tOrderPrioritization]: Conjunction of SSA is unsat [2024-11-23 23:30:08,328 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-23 23:30:08,329 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-23 23:30:08,329 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2113435361] [2024-11-23 23:30:08,329 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2113435361] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-23 23:30:08,329 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-23 23:30:08,329 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [9] imperfect sequences [] total 9 [2024-11-23 23:30:08,329 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [254662297] [2024-11-23 23:30:08,330 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-23 23:30:08,330 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 10 states [2024-11-23 23:30:08,330 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-23 23:30:08,330 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2024-11-23 23:30:08,331 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=19, Invalid=71, Unknown=0, NotChecked=0, Total=90 [2024-11-23 23:30:08,351 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 21 out of 46 [2024-11-23 23:30:08,351 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 70 places, 41 transitions, 150 flow. Second operand has 10 states, 10 states have (on average 22.6) internal successors, (226), 10 states have internal predecessors, (226), 0 states have call successors, (0), 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-23 23:30:08,351 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-11-23 23:30:08,351 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 21 of 46 [2024-11-23 23:30:08,352 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-11-23 23:30:08,925 INFO L124 PetriNetUnfolderBase]: 278/604 cut-off events. [2024-11-23 23:30:08,926 INFO L125 PetriNetUnfolderBase]: For 94/118 co-relation queries the response was YES. [2024-11-23 23:30:08,928 INFO L83 FinitePrefix]: Finished finitePrefix Result has 1314 conditions, 604 events. 278/604 cut-off events. For 94/118 co-relation queries the response was YES. Maximal size of possible extension queue 43. Compared 2867 event pairs, 92 based on Foata normal form. 8/575 useless extension candidates. Maximal degree in co-relation 1295. Up to 209 conditions per place. [2024-11-23 23:30:08,930 INFO L140 encePairwiseOnDemand]: 38/46 looper letters, 20 selfloop transitions, 4 changer transitions 15/61 dead transitions. [2024-11-23 23:30:08,930 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 72 places, 61 transitions, 278 flow [2024-11-23 23:30:08,930 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2024-11-23 23:30:08,930 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 9 states. [2024-11-23 23:30:08,932 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 9 states to 9 states and 229 transitions. [2024-11-23 23:30:08,932 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.5531400966183575 [2024-11-23 23:30:08,932 INFO L175 Difference]: Start difference. First operand has 70 places, 41 transitions, 150 flow. Second operand 9 states and 229 transitions. [2024-11-23 23:30:08,932 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 72 places, 61 transitions, 278 flow [2024-11-23 23:30:08,934 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 63 places, 61 transitions, 243 flow, removed 14 selfloop flow, removed 9 redundant places. [2024-11-23 23:30:08,935 INFO L231 Difference]: Finished difference. Result has 67 places, 41 transitions, 142 flow [2024-11-23 23:30:08,935 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=46, PETRI_DIFFERENCE_MINUEND_FLOW=125, PETRI_DIFFERENCE_MINUEND_PLACES=55, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=41, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=4, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=37, PETRI_DIFFERENCE_SUBTRAHEND_STATES=9, PETRI_FLOW=142, PETRI_PLACES=67, PETRI_TRANSITIONS=41} [2024-11-23 23:30:08,936 INFO L279 CegarLoopForPetriNet]: 51 programPoint places, 16 predicate places. [2024-11-23 23:30:08,936 INFO L471 AbstractCegarLoop]: Abstraction has has 67 places, 41 transitions, 142 flow [2024-11-23 23:30:08,936 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 10 states, 10 states have (on average 22.6) internal successors, (226), 10 states have internal predecessors, (226), 0 states have call successors, (0), 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-23 23:30:08,937 INFO L198 CegarLoopForPetriNet]: Found error trace [2024-11-23 23:30:08,937 INFO L206 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-23 23:30:08,937 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable9 [2024-11-23 23:30:08,937 INFO L396 AbstractCegarLoop]: === Iteration 11 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONMEMORY_LEAK === [P2Err0ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr1ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr0ASSERT_VIOLATIONMEMORY_LEAK (and 4 more)] === [2024-11-23 23:30:08,938 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-23 23:30:08,938 INFO L85 PathProgramCache]: Analyzing trace with hash 579988017, now seen corresponding path program 6 times [2024-11-23 23:30:08,938 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-23 23:30:08,938 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1603710414] [2024-11-23 23:30:08,938 INFO L95 rtionOrderModulation]: Changing assertion order to MIX_INSIDE_OUTSIDE [2024-11-23 23:30:08,938 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-23 23:30:09,030 INFO L229 tOrderPrioritization]: Assert order MIX_INSIDE_OUTSIDE issued 1 check-sat command(s) [2024-11-23 23:30:09,030 INFO L230 tOrderPrioritization]: Conjunction of SSA is sat [2024-11-23 23:30:09,030 INFO L357 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2024-11-23 23:30:09,113 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-11-23 23:30:09,148 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2024-11-23 23:30:09,148 INFO L340 BasicCegarLoop]: Counterexample is feasible [2024-11-23 23:30:09,150 INFO L782 garLoopResultBuilder]: Registering result UNSAFE for location ULTIMATE.startErr0ASSERT_VIOLATIONMEMORY_LEAK (6 of 7 remaining) [2024-11-23 23:30:09,152 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location P2Err0ASSERT_VIOLATIONMEMORY_LEAK (5 of 7 remaining) [2024-11-23 23:30:09,153 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr1ASSERT_VIOLATIONMEMORY_LEAK (4 of 7 remaining) [2024-11-23 23:30:09,153 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (3 of 7 remaining) [2024-11-23 23:30:09,153 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (2 of 7 remaining) [2024-11-23 23:30:09,153 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr2INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (1 of 7 remaining) [2024-11-23 23:30:09,153 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location P2Err0ASSERT_VIOLATIONMEMORY_LEAK (0 of 7 remaining) [2024-11-23 23:30:09,153 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable10 [2024-11-23 23:30:09,154 INFO L422 BasicCegarLoop]: Path program histogram: [6, 1, 1, 1, 1, 1] [2024-11-23 23:30:09,246 INFO L241 ceAbstractionStarter]: Analysis of concurrent program completed with 1 thread instances [2024-11-23 23:30:09,247 INFO L170 ceAbstractionStarter]: Computing trace abstraction results [2024-11-23 23:30:09,254 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 23.11 11:30:09 BasicIcfg [2024-11-23 23:30:09,256 INFO L131 PluginConnector]: ------------------------ END TraceAbstraction---------------------------- [2024-11-23 23:30:09,257 INFO L112 PluginConnector]: ------------------------Witness Printer---------------------------- [2024-11-23 23:30:09,257 INFO L270 PluginConnector]: Initializing Witness Printer... [2024-11-23 23:30:09,258 INFO L274 PluginConnector]: Witness Printer initialized [2024-11-23 23:30:09,258 INFO L184 PluginConnector]: Executing the observer RCFGCatcher from plugin Witness Printer for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 23.11 11:29:56" (3/4) ... [2024-11-23 23:30:09,260 INFO L149 WitnessPrinter]: No result that supports witness generation found [2024-11-23 23:30:09,261 INFO L131 PluginConnector]: ------------------------ END Witness Printer---------------------------- [2024-11-23 23:30:09,263 INFO L158 Benchmark]: Toolchain (without parser) took 15042.77ms. Allocated memory was 117.4MB in the beginning and 520.1MB in the end (delta: 402.7MB). Free memory was 91.9MB in the beginning and 194.4MB in the end (delta: -102.5MB). Peak memory consumption was 304.4MB. Max. memory is 16.1GB. [2024-11-23 23:30:09,263 INFO L158 Benchmark]: CDTParser took 0.35ms. Allocated memory is still 167.8MB. Free memory is still 103.6MB. There was no memory consumed. Max. memory is 16.1GB. [2024-11-23 23:30:09,263 INFO L158 Benchmark]: CACSL2BoogieTranslator took 651.65ms. Allocated memory is still 117.4MB. Free memory was 91.5MB in the beginning and 67.8MB in the end (delta: 23.7MB). Peak memory consumption was 25.2MB. Max. memory is 16.1GB. [2024-11-23 23:30:09,263 INFO L158 Benchmark]: Boogie Procedure Inliner took 84.11ms. Allocated memory is still 117.4MB. Free memory was 67.8MB in the beginning and 65.2MB in the end (delta: 2.6MB). There was no memory consumed. Max. memory is 16.1GB. [2024-11-23 23:30:09,264 INFO L158 Benchmark]: Boogie Preprocessor took 78.67ms. Allocated memory is still 117.4MB. Free memory was 65.2MB in the beginning and 61.9MB in the end (delta: 3.3MB). Peak memory consumption was 8.4MB. Max. memory is 16.1GB. [2024-11-23 23:30:09,264 INFO L158 Benchmark]: RCFGBuilder took 1062.18ms. Allocated memory is still 117.4MB. Free memory was 61.5MB in the beginning and 58.6MB in the end (delta: 3.0MB). Peak memory consumption was 32.7MB. Max. memory is 16.1GB. [2024-11-23 23:30:09,264 INFO L158 Benchmark]: TraceAbstraction took 13154.02ms. Allocated memory was 117.4MB in the beginning and 520.1MB in the end (delta: 402.7MB). Free memory was 58.0MB in the beginning and 194.4MB in the end (delta: -136.4MB). Peak memory consumption was 265.8MB. Max. memory is 16.1GB. [2024-11-23 23:30:09,265 INFO L158 Benchmark]: Witness Printer took 4.46ms. Allocated memory is still 520.1MB. Free memory was 194.4MB in the beginning and 194.4MB in the end (delta: 36.8kB). Peak memory consumption was 8.4MB. Max. memory is 16.1GB. [2024-11-23 23:30:09,270 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.35ms. Allocated memory is still 167.8MB. Free memory is still 103.6MB. There was no memory consumed. Max. memory is 16.1GB. * CACSL2BoogieTranslator took 651.65ms. Allocated memory is still 117.4MB. Free memory was 91.5MB in the beginning and 67.8MB in the end (delta: 23.7MB). Peak memory consumption was 25.2MB. Max. memory is 16.1GB. * Boogie Procedure Inliner took 84.11ms. Allocated memory is still 117.4MB. Free memory was 67.8MB in the beginning and 65.2MB in the end (delta: 2.6MB). There was no memory consumed. Max. memory is 16.1GB. * Boogie Preprocessor took 78.67ms. Allocated memory is still 117.4MB. Free memory was 65.2MB in the beginning and 61.9MB in the end (delta: 3.3MB). Peak memory consumption was 8.4MB. Max. memory is 16.1GB. * RCFGBuilder took 1062.18ms. Allocated memory is still 117.4MB. Free memory was 61.5MB in the beginning and 58.6MB in the end (delta: 3.0MB). Peak memory consumption was 32.7MB. Max. memory is 16.1GB. * TraceAbstraction took 13154.02ms. Allocated memory was 117.4MB in the beginning and 520.1MB in the end (delta: 402.7MB). Free memory was 58.0MB in the beginning and 194.4MB in the end (delta: -136.4MB). Peak memory consumption was 265.8MB. Max. memory is 16.1GB. * Witness Printer took 4.46ms. Allocated memory is still 520.1MB. Free memory was 194.4MB in the beginning and 194.4MB in the end (delta: 36.8kB). Peak memory consumption was 8.4MB. Max. memory is 16.1GB. * Results from de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: - UnprovableResult [Line: 17]: Unable to prove that all allocated memory was freed Unable to prove that all allocated memory was freed Reason: overapproximation of memtrack at line 17. Possible FailurePath: [L709] 0 int __unbuffered_cnt = 0; [L711] 0 int __unbuffered_p0_EAX = 0; [L713] 0 int __unbuffered_p1_EAX = 0; [L715] 0 int __unbuffered_p1_EBX = 0; [L717] 0 int __unbuffered_p2_EAX = 0; [L719] 0 int __unbuffered_p2_EBX = 0; [L720] 0 _Bool main$tmp_guard0; [L721] 0 _Bool main$tmp_guard1; [L723] 0 int x = 0; [L725] 0 int y = 0; [L726] 0 _Bool y$flush_delayed; [L727] 0 int y$mem_tmp; [L728] 0 _Bool y$r_buff0_thd0; [L729] 0 _Bool y$r_buff0_thd1; [L730] 0 _Bool y$r_buff0_thd2; [L731] 0 _Bool y$r_buff0_thd3; [L732] 0 _Bool y$r_buff1_thd0; [L733] 0 _Bool y$r_buff1_thd1; [L734] 0 _Bool y$r_buff1_thd2; [L735] 0 _Bool y$r_buff1_thd3; [L736] 0 _Bool y$read_delayed; [L737] 0 int *y$read_delayed_var; [L738] 0 int y$w_buff0; [L739] 0 _Bool y$w_buff0_used; [L740] 0 int y$w_buff1; [L741] 0 _Bool y$w_buff1_used; [L743] 0 int z = 0; [L744] 0 _Bool weak$$choice0; [L745] 0 _Bool weak$$choice2; [L848] 0 pthread_t t65; [L849] FCALL, FORK 0 pthread_create(&t65, ((void *)0), P0, ((void *)0)) VAL [\old(arg)={0:0}, __unbuffered_cnt=0, __unbuffered_p0_EAX=0, __unbuffered_p1_EAX=0, __unbuffered_p1_EBX=0, __unbuffered_p2_EAX=0, __unbuffered_p2_EBX=0, main$tmp_guard0=0, main$tmp_guard1=0, t65=-1, weak$$choice0=0, weak$$choice2=0, x=0, y$flush_delayed=0, y$mem_tmp=0, y$r_buff0_thd0=0, y$r_buff0_thd1=0, y$r_buff0_thd2=0, y$r_buff0_thd3=0, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$r_buff1_thd3=0, y$read_delayed=0, y$read_delayed_var={0:0}, y$w_buff0=0, y$w_buff0_used=0, y$w_buff1=0, y$w_buff1_used=0, y=0, z=0] [L850] 0 pthread_t t66; [L851] FCALL, FORK 0 pthread_create(&t66, ((void *)0), P1, ((void *)0)) VAL [\old(arg)={0:0}, \old(arg)={0:0}, __unbuffered_cnt=0, __unbuffered_p0_EAX=0, __unbuffered_p1_EAX=0, __unbuffered_p1_EBX=0, __unbuffered_p2_EAX=0, __unbuffered_p2_EBX=0, main$tmp_guard0=0, main$tmp_guard1=0, t65=-1, t66=0, weak$$choice0=0, weak$$choice2=0, x=0, y$flush_delayed=0, y$mem_tmp=0, y$r_buff0_thd0=0, y$r_buff0_thd1=0, y$r_buff0_thd2=0, y$r_buff0_thd3=0, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$r_buff1_thd3=0, y$read_delayed=0, y$read_delayed_var={0:0}, y$w_buff0=0, y$w_buff0_used=0, y$w_buff1=0, y$w_buff1_used=0, y=0, z=0] [L852] 0 pthread_t t67; [L853] FCALL, FORK 0 pthread_create(&t67, ((void *)0), P2, ((void *)0)) VAL [\old(arg)={0:0}, \old(arg)={0:0}, __unbuffered_cnt=0, __unbuffered_p0_EAX=0, __unbuffered_p1_EAX=0, __unbuffered_p1_EBX=0, __unbuffered_p2_EAX=0, __unbuffered_p2_EBX=0, main$tmp_guard0=0, main$tmp_guard1=0, t65=-1, t66=0, t67=1, weak$$choice0=0, weak$$choice2=0, x=0, y$flush_delayed=0, y$mem_tmp=0, y$r_buff0_thd0=0, y$r_buff0_thd1=0, y$r_buff0_thd2=0, y$r_buff0_thd3=0, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$r_buff1_thd3=0, y$read_delayed=0, y$read_delayed_var={0:0}, y$w_buff0=0, y$w_buff0_used=0, y$w_buff1=0, y$w_buff1_used=0, y=0, z=0] [L795] 3 y$w_buff1 = y$w_buff0 [L796] 3 y$w_buff0 = 1 [L797] 3 y$w_buff1_used = y$w_buff0_used [L798] 3 y$w_buff0_used = (_Bool)1 [L799] CALL 3 __VERIFIER_assert(!(y$w_buff1_used && y$w_buff0_used)) [L18] COND FALSE 3 !(!expression) [L799] RET 3 __VERIFIER_assert(!(y$w_buff1_used && y$w_buff0_used)) [L800] 3 y$r_buff1_thd0 = y$r_buff0_thd0 [L801] 3 y$r_buff1_thd1 = y$r_buff0_thd1 [L802] 3 y$r_buff1_thd2 = y$r_buff0_thd2 [L803] 3 y$r_buff1_thd3 = y$r_buff0_thd3 [L804] 3 y$r_buff0_thd3 = (_Bool)1 VAL [\old(arg)={0:0}, \old(arg)={0:0}, \old(arg)={0:0}, __unbuffered_cnt=0, __unbuffered_p0_EAX=0, __unbuffered_p1_EAX=0, __unbuffered_p1_EBX=0, __unbuffered_p2_EAX=0, __unbuffered_p2_EBX=0, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=0, x=0, y$flush_delayed=0, y$mem_tmp=0, y$r_buff0_thd0=0, y$r_buff0_thd1=0, y$r_buff0_thd2=0, y$r_buff0_thd3=1, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$r_buff1_thd3=0, y$read_delayed=0, y$read_delayed_var={0:0}, y$w_buff0=1, y$w_buff0_used=1, y$w_buff1=0, y$w_buff1_used=0, y=0, z=0] [L807] 3 weak$$choice0 = __VERIFIER_nondet_bool() [L808] 3 weak$$choice2 = __VERIFIER_nondet_bool() [L809] 3 y$flush_delayed = weak$$choice2 [L810] 3 y$mem_tmp = y [L811] 3 y = !y$w_buff0_used || !y$r_buff0_thd3 && !y$w_buff1_used || !y$r_buff0_thd3 && !y$r_buff1_thd3 ? y : (y$w_buff0_used && y$r_buff0_thd3 ? y$w_buff0 : y$w_buff1) [L812] 3 y$w_buff0 = weak$$choice2 ? y$w_buff0 : (!y$w_buff0_used || !y$r_buff0_thd3 && !y$w_buff1_used || !y$r_buff0_thd3 && !y$r_buff1_thd3 ? y$w_buff0 : (y$w_buff0_used && y$r_buff0_thd3 ? y$w_buff0 : y$w_buff0)) [L813] 3 y$w_buff1 = weak$$choice2 ? y$w_buff1 : (!y$w_buff0_used || !y$r_buff0_thd3 && !y$w_buff1_used || !y$r_buff0_thd3 && !y$r_buff1_thd3 ? y$w_buff1 : (y$w_buff0_used && y$r_buff0_thd3 ? y$w_buff1 : y$w_buff1)) [L814] 3 y$w_buff0_used = weak$$choice2 ? y$w_buff0_used : (!y$w_buff0_used || !y$r_buff0_thd3 && !y$w_buff1_used || !y$r_buff0_thd3 && !y$r_buff1_thd3 ? y$w_buff0_used : (y$w_buff0_used && y$r_buff0_thd3 ? (_Bool)0 : y$w_buff0_used)) [L815] 3 y$w_buff1_used = weak$$choice2 ? y$w_buff1_used : (!y$w_buff0_used || !y$r_buff0_thd3 && !y$w_buff1_used || !y$r_buff0_thd3 && !y$r_buff1_thd3 ? y$w_buff1_used : (y$w_buff0_used && y$r_buff0_thd3 ? (_Bool)0 : (_Bool)0)) [L816] 3 y$r_buff0_thd3 = weak$$choice2 ? y$r_buff0_thd3 : (!y$w_buff0_used || !y$r_buff0_thd3 && !y$w_buff1_used || !y$r_buff0_thd3 && !y$r_buff1_thd3 ? y$r_buff0_thd3 : (y$w_buff0_used && y$r_buff0_thd3 ? (_Bool)0 : y$r_buff0_thd3)) [L817] 3 y$r_buff1_thd3 = weak$$choice2 ? y$r_buff1_thd3 : (!y$w_buff0_used || !y$r_buff0_thd3 && !y$w_buff1_used || !y$r_buff0_thd3 && !y$r_buff1_thd3 ? y$r_buff1_thd3 : (y$w_buff0_used && y$r_buff0_thd3 ? (_Bool)0 : (_Bool)0)) [L818] 3 __unbuffered_p2_EAX = y [L819] 3 y = y$flush_delayed ? y$mem_tmp : y [L820] 3 y$flush_delayed = (_Bool)0 VAL [\old(arg)={0:0}, \old(arg)={0:0}, \old(arg)={0:0}, __unbuffered_cnt=0, __unbuffered_p0_EAX=0, __unbuffered_p1_EAX=0, __unbuffered_p1_EBX=0, __unbuffered_p2_EAX=1, __unbuffered_p2_EBX=0, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=1, x=0, y$flush_delayed=0, y$mem_tmp=0, y$r_buff0_thd0=0, y$r_buff0_thd1=0, y$r_buff0_thd2=0, y$r_buff0_thd3=1, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$r_buff1_thd3=0, y$read_delayed=0, y$read_delayed_var={0:0}, y$w_buff0=1, y$w_buff0_used=1, y$w_buff1=0, y$w_buff1_used=0, y=0, z=0] [L823] 3 __unbuffered_p2_EBX = z VAL [\old(arg)={0:0}, \old(arg)={0:0}, \old(arg)={0:0}, __unbuffered_cnt=0, __unbuffered_p0_EAX=0, __unbuffered_p1_EAX=0, __unbuffered_p1_EBX=0, __unbuffered_p2_EAX=1, __unbuffered_p2_EBX=0, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=1, x=0, y$flush_delayed=0, y$mem_tmp=0, y$r_buff0_thd0=0, y$r_buff0_thd1=0, y$r_buff0_thd2=0, y$r_buff0_thd3=1, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$r_buff1_thd3=0, y$read_delayed=0, y$read_delayed_var={0:0}, y$w_buff0=1, y$w_buff0_used=1, y$w_buff1=0, y$w_buff1_used=0, y=0, z=0] [L749] 1 z = 1 VAL [\old(arg)={0:0}, \old(arg)={0:0}, __unbuffered_cnt=0, __unbuffered_p0_EAX=0, __unbuffered_p1_EAX=0, __unbuffered_p1_EBX=0, __unbuffered_p2_EAX=1, __unbuffered_p2_EBX=0, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=1, x=0, y$flush_delayed=0, y$mem_tmp=0, y$r_buff0_thd0=0, y$r_buff0_thd1=0, y$r_buff0_thd2=0, y$r_buff0_thd3=1, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$r_buff1_thd3=0, y$read_delayed=0, y$read_delayed_var={0:0}, y$w_buff0=1, y$w_buff0_used=1, y$w_buff1=0, y$w_buff1_used=0, y=0, z=1] [L752] 1 __unbuffered_p0_EAX = x VAL [\old(arg)={0:0}, \old(arg)={0:0}, __unbuffered_cnt=0, __unbuffered_p0_EAX=0, __unbuffered_p1_EAX=0, __unbuffered_p1_EBX=0, __unbuffered_p2_EAX=1, __unbuffered_p2_EBX=0, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=1, x=0, y$flush_delayed=0, y$mem_tmp=0, y$r_buff0_thd0=0, y$r_buff0_thd1=0, y$r_buff0_thd2=0, y$r_buff0_thd3=1, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$r_buff1_thd3=0, y$read_delayed=0, y$read_delayed_var={0:0}, y$w_buff0=1, y$w_buff0_used=1, y$w_buff1=0, y$w_buff1_used=0, y=0, z=1] [L764] 2 x = 1 VAL [\old(arg)={0:0}, \old(arg)={0:0}, __unbuffered_cnt=0, __unbuffered_p0_EAX=0, __unbuffered_p1_EAX=0, __unbuffered_p1_EBX=0, __unbuffered_p2_EAX=1, __unbuffered_p2_EBX=0, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=1, x=1, y$flush_delayed=0, y$mem_tmp=0, y$r_buff0_thd0=0, y$r_buff0_thd1=0, y$r_buff0_thd2=0, y$r_buff0_thd3=1, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$r_buff1_thd3=0, y$read_delayed=0, y$read_delayed_var={0:0}, y$w_buff0=1, y$w_buff0_used=1, y$w_buff1=0, y$w_buff1_used=0, y=0, z=1] [L767] 2 __unbuffered_p1_EAX = x VAL [\old(arg)={0:0}, \old(arg)={0:0}, __unbuffered_cnt=0, __unbuffered_p0_EAX=0, __unbuffered_p1_EAX=1, __unbuffered_p1_EBX=0, __unbuffered_p2_EAX=1, __unbuffered_p2_EBX=0, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=1, x=1, y$flush_delayed=0, y$mem_tmp=0, y$r_buff0_thd0=0, y$r_buff0_thd1=0, y$r_buff0_thd2=0, y$r_buff0_thd3=1, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$r_buff1_thd3=0, y$read_delayed=0, y$read_delayed_var={0:0}, y$w_buff0=1, y$w_buff0_used=1, y$w_buff1=0, y$w_buff1_used=0, y=0, z=1] [L770] 2 weak$$choice0 = __VERIFIER_nondet_bool() [L771] 2 weak$$choice2 = __VERIFIER_nondet_bool() [L772] 2 y$flush_delayed = weak$$choice2 [L773] 2 y$mem_tmp = y [L774] 2 y = !y$w_buff0_used || !y$r_buff0_thd2 && !y$w_buff1_used || !y$r_buff0_thd2 && !y$r_buff1_thd2 ? y : (y$w_buff0_used && y$r_buff0_thd2 ? y$w_buff0 : y$w_buff1) [L775] 2 y$w_buff0 = weak$$choice2 ? y$w_buff0 : (!y$w_buff0_used || !y$r_buff0_thd2 && !y$w_buff1_used || !y$r_buff0_thd2 && !y$r_buff1_thd2 ? y$w_buff0 : (y$w_buff0_used && y$r_buff0_thd2 ? y$w_buff0 : y$w_buff0)) [L776] 2 y$w_buff1 = weak$$choice2 ? y$w_buff1 : (!y$w_buff0_used || !y$r_buff0_thd2 && !y$w_buff1_used || !y$r_buff0_thd2 && !y$r_buff1_thd2 ? y$w_buff1 : (y$w_buff0_used && y$r_buff0_thd2 ? y$w_buff1 : y$w_buff1)) [L777] 2 y$w_buff0_used = weak$$choice2 ? y$w_buff0_used : (!y$w_buff0_used || !y$r_buff0_thd2 && !y$w_buff1_used || !y$r_buff0_thd2 && !y$r_buff1_thd2 ? y$w_buff0_used : (y$w_buff0_used && y$r_buff0_thd2 ? (_Bool)0 : y$w_buff0_used)) [L778] 2 y$w_buff1_used = weak$$choice2 ? y$w_buff1_used : (!y$w_buff0_used || !y$r_buff0_thd2 && !y$w_buff1_used || !y$r_buff0_thd2 && !y$r_buff1_thd2 ? y$w_buff1_used : (y$w_buff0_used && y$r_buff0_thd2 ? (_Bool)0 : (_Bool)0)) [L779] 2 y$r_buff0_thd2 = weak$$choice2 ? y$r_buff0_thd2 : (!y$w_buff0_used || !y$r_buff0_thd2 && !y$w_buff1_used || !y$r_buff0_thd2 && !y$r_buff1_thd2 ? y$r_buff0_thd2 : (y$w_buff0_used && y$r_buff0_thd2 ? (_Bool)0 : y$r_buff0_thd2)) [L780] 2 y$r_buff1_thd2 = weak$$choice2 ? y$r_buff1_thd2 : (!y$w_buff0_used || !y$r_buff0_thd2 && !y$w_buff1_used || !y$r_buff0_thd2 && !y$r_buff1_thd2 ? y$r_buff1_thd2 : (y$w_buff0_used && y$r_buff0_thd2 ? (_Bool)0 : (_Bool)0)) [L781] 2 __unbuffered_p1_EBX = y [L782] 2 y = y$flush_delayed ? y$mem_tmp : y [L783] 2 y$flush_delayed = (_Bool)0 VAL [\old(arg)={0:0}, \old(arg)={0:0}, __unbuffered_cnt=0, __unbuffered_p0_EAX=0, __unbuffered_p1_EAX=1, __unbuffered_p1_EBX=0, __unbuffered_p2_EAX=1, __unbuffered_p2_EBX=0, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=1, weak$$choice2=1, x=1, y$flush_delayed=0, y$mem_tmp=0, y$r_buff0_thd0=0, y$r_buff0_thd1=0, y$r_buff0_thd2=0, y$r_buff0_thd3=1, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$r_buff1_thd3=0, y$read_delayed=0, y$read_delayed_var={0:0}, y$w_buff0=1, y$w_buff0_used=1, y$w_buff1=0, y$w_buff1_used=0, y=0, z=1] [L826] 3 y = y$w_buff0_used && y$r_buff0_thd3 ? y$w_buff0 : (y$w_buff1_used && y$r_buff1_thd3 ? y$w_buff1 : y) [L827] 3 y$w_buff0_used = y$w_buff0_used && y$r_buff0_thd3 ? (_Bool)0 : y$w_buff0_used [L828] 3 y$w_buff1_used = y$w_buff0_used && y$r_buff0_thd3 || y$w_buff1_used && y$r_buff1_thd3 ? (_Bool)0 : y$w_buff1_used [L829] 3 y$r_buff0_thd3 = y$w_buff0_used && y$r_buff0_thd3 ? (_Bool)0 : y$r_buff0_thd3 [L830] 3 y$r_buff1_thd3 = y$w_buff0_used && y$r_buff0_thd3 || y$w_buff1_used && y$r_buff1_thd3 ? (_Bool)0 : y$r_buff1_thd3 VAL [\old(arg)={0:0}, \old(arg)={0:0}, \old(arg)={0:0}, __unbuffered_cnt=0, __unbuffered_p0_EAX=0, __unbuffered_p1_EAX=1, __unbuffered_p1_EBX=0, __unbuffered_p2_EAX=1, __unbuffered_p2_EBX=0, arg={0:0}, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=1, weak$$choice2=1, x=1, y$flush_delayed=0, y$mem_tmp=0, y$r_buff0_thd0=0, y$r_buff0_thd1=0, y$r_buff0_thd2=0, y$r_buff0_thd3=1, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$r_buff1_thd3=0, y$read_delayed=0, y$read_delayed_var={0:0}, y$w_buff0=1, y$w_buff0_used=0, y$w_buff1=0, y$w_buff1_used=0, y=1, z=1] [L833] 3 __unbuffered_cnt = __unbuffered_cnt + 1 VAL [\old(arg)={0:0}, \old(arg)={0:0}, \old(arg)={0:0}, __unbuffered_cnt=1, __unbuffered_p0_EAX=0, __unbuffered_p1_EAX=1, __unbuffered_p1_EBX=0, __unbuffered_p2_EAX=1, __unbuffered_p2_EBX=0, arg={0:0}, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=1, weak$$choice2=1, x=1, y$flush_delayed=0, y$mem_tmp=0, y$r_buff0_thd0=0, y$r_buff0_thd1=0, y$r_buff0_thd2=0, y$r_buff0_thd3=1, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$r_buff1_thd3=0, y$read_delayed=0, y$read_delayed_var={0:0}, y$w_buff0=1, y$w_buff0_used=0, y$w_buff1=0, y$w_buff1_used=0, y=1, z=1] [L757] 1 __unbuffered_cnt = __unbuffered_cnt + 1 VAL [\old(arg)={0:0}, \old(arg)={0:0}, __unbuffered_cnt=2, __unbuffered_p0_EAX=0, __unbuffered_p1_EAX=1, __unbuffered_p1_EBX=0, __unbuffered_p2_EAX=1, __unbuffered_p2_EBX=0, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=1, weak$$choice2=1, x=1, y$flush_delayed=0, y$mem_tmp=0, y$r_buff0_thd0=0, y$r_buff0_thd1=0, y$r_buff0_thd2=0, y$r_buff0_thd3=1, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$r_buff1_thd3=0, y$read_delayed=0, y$read_delayed_var={0:0}, y$w_buff0=1, y$w_buff0_used=0, y$w_buff1=0, y$w_buff1_used=0, y=1, z=1] [L788] 2 __unbuffered_cnt = __unbuffered_cnt + 1 VAL [\old(arg)={0:0}, \old(arg)={0:0}, __unbuffered_cnt=3, __unbuffered_p0_EAX=0, __unbuffered_p1_EAX=1, __unbuffered_p1_EBX=0, __unbuffered_p2_EAX=1, __unbuffered_p2_EBX=0, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=1, weak$$choice2=1, x=1, y$flush_delayed=0, y$mem_tmp=0, y$r_buff0_thd0=0, y$r_buff0_thd1=0, y$r_buff0_thd2=0, y$r_buff0_thd3=1, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$r_buff1_thd3=0, y$read_delayed=0, y$read_delayed_var={0:0}, y$w_buff0=1, y$w_buff0_used=0, y$w_buff1=0, y$w_buff1_used=0, y=1, z=1] [L855] 0 main$tmp_guard0 = __unbuffered_cnt == 3 VAL [\old(arg)={0:0}, \old(arg)={0:0}, __unbuffered_cnt=3, __unbuffered_p0_EAX=0, __unbuffered_p1_EAX=1, __unbuffered_p1_EBX=0, __unbuffered_p2_EAX=1, __unbuffered_p2_EBX=0, arg={0:0}, arg={0:0}, main$tmp_guard0=1, main$tmp_guard1=0, t65=-1, t66=0, t67=1, weak$$choice0=1, weak$$choice2=1, x=1, y$flush_delayed=0, y$mem_tmp=0, y$r_buff0_thd0=0, y$r_buff0_thd1=0, y$r_buff0_thd2=0, y$r_buff0_thd3=1, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$r_buff1_thd3=0, y$read_delayed=0, y$read_delayed_var={0:0}, y$w_buff0=1, y$w_buff0_used=0, y$w_buff1=0, y$w_buff1_used=0, y=1, z=1] [L857] CALL 0 assume_abort_if_not(main$tmp_guard0) [L3] COND FALSE 0 !(!cond) [L857] RET 0 assume_abort_if_not(main$tmp_guard0) [L859] 0 y = y$w_buff0_used && y$r_buff0_thd0 ? y$w_buff0 : (y$w_buff1_used && y$r_buff1_thd0 ? y$w_buff1 : y) [L860] 0 y$w_buff0_used = y$w_buff0_used && y$r_buff0_thd0 ? (_Bool)0 : y$w_buff0_used [L861] 0 y$w_buff1_used = y$w_buff0_used && y$r_buff0_thd0 || y$w_buff1_used && y$r_buff1_thd0 ? (_Bool)0 : y$w_buff1_used [L862] 0 y$r_buff0_thd0 = y$w_buff0_used && y$r_buff0_thd0 ? (_Bool)0 : y$r_buff0_thd0 [L863] 0 y$r_buff1_thd0 = y$w_buff0_used && y$r_buff0_thd0 || y$w_buff1_used && y$r_buff1_thd0 ? (_Bool)0 : y$r_buff1_thd0 VAL [\old(arg)={0:0}, \old(arg)={0:0}, __unbuffered_cnt=3, __unbuffered_p0_EAX=0, __unbuffered_p1_EAX=1, __unbuffered_p1_EBX=0, __unbuffered_p2_EAX=1, __unbuffered_p2_EBX=0, arg={0:0}, arg={0:0}, main$tmp_guard0=1, main$tmp_guard1=0, t65=-1, t66=0, t67=1, weak$$choice0=1, weak$$choice2=1, x=1, y$flush_delayed=0, y$mem_tmp=0, y$r_buff0_thd0=0, y$r_buff0_thd1=0, y$r_buff0_thd2=0, y$r_buff0_thd3=1, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$r_buff1_thd3=0, y$read_delayed=0, y$read_delayed_var={0:0}, y$w_buff0=1, y$w_buff0_used=0, y$w_buff1=0, y$w_buff1_used=0, y=1, z=1] [L866] 0 main$tmp_guard1 = !(__unbuffered_p0_EAX == 0 && __unbuffered_p1_EAX == 1 && __unbuffered_p1_EBX == 0 && __unbuffered_p2_EAX == 1 && __unbuffered_p2_EBX == 0) VAL [\old(arg)={0:0}, \old(arg)={0:0}, __unbuffered_cnt=3, __unbuffered_p0_EAX=0, __unbuffered_p1_EAX=1, __unbuffered_p1_EBX=0, __unbuffered_p2_EAX=1, __unbuffered_p2_EBX=0, arg={0:0}, arg={0:0}, main$tmp_guard0=1, main$tmp_guard1=0, t65=-1, t66=0, t67=1, weak$$choice0=1, weak$$choice2=1, x=1, y$flush_delayed=0, y$mem_tmp=0, y$r_buff0_thd0=0, y$r_buff0_thd1=0, y$r_buff0_thd2=0, y$r_buff0_thd3=1, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$r_buff1_thd3=0, y$read_delayed=0, y$read_delayed_var={0:0}, y$w_buff0=1, y$w_buff0_used=0, y$w_buff1=0, y$w_buff1_used=0, y=1, z=1] [L868] CALL 0 __VERIFIER_assert(main$tmp_guard1) [L18] COND TRUE 0 !expression [L18] CALL 0 reach_error() [L17] COND FALSE 0 !(0) VAL [\old(arg)={0:0}, \old(arg)={0:0}, __unbuffered_cnt=3, __unbuffered_p0_EAX=0, __unbuffered_p1_EAX=1, __unbuffered_p1_EBX=0, __unbuffered_p2_EAX=1, __unbuffered_p2_EBX=0, arg={0:0}, arg={0:0}, main$tmp_guard0=1, main$tmp_guard1=0, weak$$choice0=1, weak$$choice2=1, x=1, y$flush_delayed=0, y$mem_tmp=0, y$r_buff0_thd0=0, y$r_buff0_thd1=0, y$r_buff0_thd2=0, y$r_buff0_thd3=1, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$r_buff1_thd3=0, y$read_delayed=0, y$read_delayed_var={0:0}, y$w_buff0=1, y$w_buff0_used=0, y$w_buff1=0, y$w_buff1_used=0, y=1, z=1] [L17] 0 __assert_fail ("0", "mix003_power.opt_pso.opt_rmo.opt_tso.opt.c", 8, __extension__ __PRETTY_FUNCTION__) VAL [\old(arg)={0:0}, \old(arg)={0:0}, __unbuffered_cnt=3, __unbuffered_p0_EAX=0, __unbuffered_p1_EAX=1, __unbuffered_p1_EBX=0, __unbuffered_p2_EAX=1, __unbuffered_p2_EBX=0, arg={0:0}, arg={0:0}, main$tmp_guard0=1, main$tmp_guard1=0, weak$$choice0=1, weak$$choice2=1, x=1, y$flush_delayed=0, y$mem_tmp=0, y$r_buff0_thd0=0, y$r_buff0_thd1=0, y$r_buff0_thd2=0, y$r_buff0_thd3=1, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$r_buff1_thd3=0, y$read_delayed=0, y$read_delayed_var={0:0}, y$w_buff0=1, y$w_buff0_used=0, y$w_buff1=0, y$w_buff1_used=0, y=1, z=1] - UnprovableResult [Line: 17]: Unable to prove that all allocated memory was freed Unable to prove that all allocated memory was freed Reason: Not analyzed. - UnprovableResult [Line: 846]: Unable to prove that all allocated memory was freed Unable to prove that all allocated memory was freed Reason: Not analyzed. - UnprovableResult [Line: 851]: Unable to prove that petrification did provide enough thread instances (tool internal message) Unable to prove that petrification did provide enough thread instances (tool internal message) Reason: Not analyzed. - UnprovableResult [Line: 853]: Unable to prove that petrification did provide enough thread instances (tool internal message) Unable to prove that petrification did provide enough thread instances (tool internal message) Reason: Not analyzed. - UnprovableResult [Line: 849]: 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, 72 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: 12.9s, OverallIterations: 11, TraceHistogramMax: 1, PathProgramHistogramMax: 6, EmptinessCheckTime: 0.0s, AutomataDifference: 5.2s, DeadEndRemovalTime: 0.0s, HoareAnnotationTime: 0.0s, InitialAbstractionConstructionTime: 0.1s, HoareTripleCheckerStatistics: 0 mSolverCounterUnknown, 453 SdHoareTripleChecker+Valid, 2.1s IncrementalHoareTripleChecker+Time, 0 mSdLazyCounter, 429 mSDsluCounter, 156 SdHoareTripleChecker+Invalid, 1.8s Time, 0 mProtectedAction, 0 SdHoareTripleChecker+Unchecked, 0 IncrementalHoareTripleChecker+Unchecked, 141 mSDsCounter, 20 IncrementalHoareTripleChecker+Valid, 0 mProtectedPredicate, 1250 IncrementalHoareTripleChecker+Invalid, 1270 SdHoareTripleChecker+Unknown, 0 mSolverCounterNotChecked, 20 mSolverCounterUnsat, 15 mSDtfsCounter, 1250 mSolverCounterSat, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Unknown, PredicateUnifierStatistics: 0 DeclaredPredicates, 76 GetRequests, 17 SyntacticMatches, 0 SemanticMatches, 59 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 19 ImplicationChecksByTransitivity, 0.9s Time, 0.0s BasicInterpolantAutomatonTime, BiggestAbstraction: size=207occurred in iteration=8, InterpolantAutomatonStates: 59, 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.9s SatisfiabilityAnalysisTime, 6.2s InterpolantComputationTime, 276 NumberOfCodeBlocks, 276 NumberOfCodeBlocksAsserted, 12 NumberOfCheckSat, 234 ConstructedInterpolants, 0 QuantifiedInterpolants, 1980 SizeOfPredicates, 0 NumberOfNonLiveVariables, 0 ConjunctsInSsa, 0 ConjunctsInUnsatCore, 10 InterpolantComputations, 10 PerfectInterpolantSequences, 0/0 InterpolantCoveringCapability, INVARIANT_SYNTHESIS: No data available, INTERPOLANT_CONSOLIDATION: No data available, ABSTRACT_INTERPRETATION: No data available, PDR: No data available, ACCELERATED_INTERPOLATION: No data available, SIFA: No data available, ReuseStatistics: No data available, ConComCheckerStatistics: No data available RESULT: Ultimate could not prove your program: unable to determine feasibility of some traces [2024-11-23 23:30:09,299 INFO L540 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_10321ffd-2a79-4b20-bf29-0d8ff17e75fa/bin/uautomizer-verify-LYvppIcaGC/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 (1)] Forceful destruction successful, exit code 0 Received shutdown request... --- End real Ultimate output --- Execution finished normally Using bit-precise analysis Retrying with bit-precise analysis ### Bit-precise run ### Calling Ultimate with: /usr/bin/java -Dosgi.configuration.area=/tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_10321ffd-2a79-4b20-bf29-0d8ff17e75fa/bin/uautomizer-verify-LYvppIcaGC/data/config -Xmx15G -Xms4m -jar /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_10321ffd-2a79-4b20-bf29-0d8ff17e75fa/bin/uautomizer-verify-LYvppIcaGC/plugins/org.eclipse.equinox.launcher_1.6.800.v20240513-1750.jar -data @noDefault -ultimatedata /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_10321ffd-2a79-4b20-bf29-0d8ff17e75fa/bin/uautomizer-verify-LYvppIcaGC/data -tc /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_10321ffd-2a79-4b20-bf29-0d8ff17e75fa/bin/uautomizer-verify-LYvppIcaGC/config/AutomizerMemDerefMemtrack.xml -i ../../sv-benchmarks/c/pthread-wmm/mix003_power.opt_pso.opt_rmo.opt_tso.opt.i -s /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_10321ffd-2a79-4b20-bf29-0d8ff17e75fa/bin/uautomizer-verify-LYvppIcaGC/config/svcomp-DerefFreeMemtrack-32bit-Automizer_Bitvector.epf --cacsl2boogietranslator.entry.function main --witnessprinter.witness.directory /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_10321ffd-2a79-4b20-bf29-0d8ff17e75fa/bin/uautomizer-verify-LYvppIcaGC --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 80bd490b89eb696c85e417e2f0348670cfb7c8195637276a01d1016d9277f95a --- Real Ultimate output --- This is Ultimate 0.3.0-dev-6497de0 [2024-11-23 23:30:12,154 INFO L188 SettingsManager]: Resetting all preferences to default values... [2024-11-23 23:30:12,323 INFO L114 SettingsManager]: Loading settings from /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_10321ffd-2a79-4b20-bf29-0d8ff17e75fa/bin/uautomizer-verify-LYvppIcaGC/config/svcomp-DerefFreeMemtrack-32bit-Automizer_Bitvector.epf [2024-11-23 23:30:12,337 WARN L101 SettingsManager]: Preference file contains the following unknown settings: [2024-11-23 23:30:12,337 WARN L103 SettingsManager]: * de.uni_freiburg.informatik.ultimate.core.Log level for class [2024-11-23 23:30:12,383 INFO L130 SettingsManager]: Preferences different from defaults after loading the file: [2024-11-23 23:30:12,384 INFO L151 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2024-11-23 23:30:12,384 INFO L153 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2024-11-23 23:30:12,385 INFO L151 SettingsManager]: Preferences of Boogie Preprocessor differ from their defaults: [2024-11-23 23:30:12,385 INFO L153 SettingsManager]: * Use memory slicer=true [2024-11-23 23:30:12,385 INFO L151 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2024-11-23 23:30:12,385 INFO L153 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2024-11-23 23:30:12,386 INFO L151 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2024-11-23 23:30:12,386 INFO L153 SettingsManager]: * Create parallel compositions if possible=false [2024-11-23 23:30:12,386 INFO L153 SettingsManager]: * Use SBE=true [2024-11-23 23:30:12,386 INFO L151 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2024-11-23 23:30:12,386 INFO L153 SettingsManager]: * sizeof long=4 [2024-11-23 23:30:12,386 INFO L153 SettingsManager]: * Overapproximate operations on floating types=true [2024-11-23 23:30:12,387 INFO L153 SettingsManager]: * sizeof POINTER=4 [2024-11-23 23:30:12,387 INFO L153 SettingsManager]: * Check division by zero=IGNORE [2024-11-23 23:30:12,387 INFO L153 SettingsManager]: * Check for the main procedure if all allocated memory was freed=true [2024-11-23 23:30:12,387 INFO L153 SettingsManager]: * Bitprecise bitfields=true [2024-11-23 23:30:12,387 INFO L153 SettingsManager]: * SV-COMP memtrack compatibility mode=true [2024-11-23 23:30:12,387 INFO L153 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2024-11-23 23:30:12,387 INFO L153 SettingsManager]: * Adapt memory model on pointer casts if necessary=true [2024-11-23 23:30:12,387 INFO L153 SettingsManager]: * Use bitvectors instead of ints=true [2024-11-23 23:30:12,387 INFO L153 SettingsManager]: * Memory model=HoenickeLindenmann_4ByteResolution [2024-11-23 23:30:12,387 INFO L153 SettingsManager]: * Check unreachability of reach_error function=false [2024-11-23 23:30:12,388 INFO L153 SettingsManager]: * sizeof long double=12 [2024-11-23 23:30:12,388 INFO L153 SettingsManager]: * Behaviour of calls to undefined functions=OVERAPPROXIMATE_BEHAVIOUR [2024-11-23 23:30:12,388 INFO L153 SettingsManager]: * Use constant arrays=true [2024-11-23 23:30:12,388 INFO L151 SettingsManager]: Preferences of IcfgBuilder differ from their defaults: [2024-11-23 23:30:12,388 INFO L153 SettingsManager]: * Size of a code block=SequenceOfStatements [2024-11-23 23:30:12,388 INFO L153 SettingsManager]: * Only consider context switches at boundaries of atomic blocks=true [2024-11-23 23:30:12,388 INFO L153 SettingsManager]: * SMT solver=External_DefaultMode [2024-11-23 23:30:12,388 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2024-11-23 23:30:12,388 INFO L151 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2024-11-23 23:30:12,389 INFO L153 SettingsManager]: * Size of a code block=SequenceOfStatements [2024-11-23 23:30:12,389 INFO L153 SettingsManager]: * Only consider context switches at boundaries of atomic blocks=true [2024-11-23 23:30:12,391 INFO L153 SettingsManager]: * SMT solver=External_DefaultMode [2024-11-23 23:30:12,391 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2024-11-23 23:30:12,392 INFO L151 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2024-11-23 23:30:12,392 INFO L153 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2024-11-23 23:30:12,392 INFO L153 SettingsManager]: * Trace refinement strategy=FOX [2024-11-23 23:30:12,393 INFO L153 SettingsManager]: * Command for external solver=cvc4 --incremental --print-success --lang smt [2024-11-23 23:30:12,393 INFO L153 SettingsManager]: * Apply one-shot large block encoding in concurrent analysis=false [2024-11-23 23:30:12,393 INFO L153 SettingsManager]: * Automaton type used in concurrency analysis=PETRI_NET [2024-11-23 23:30:12,393 INFO L153 SettingsManager]: * Order on configurations for Petri net unfoldings=DBO [2024-11-23 23:30:12,393 INFO L153 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2024-11-23 23:30:12,393 INFO L153 SettingsManager]: * Looper check in Petri net analysis=SEMANTIC Applying setting for plugin de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator: Entry function -> main Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Witness directory -> /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_10321ffd-2a79-4b20-bf29-0d8ff17e75fa/bin/uautomizer-verify-LYvppIcaGC 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 -> 80bd490b89eb696c85e417e2f0348670cfb7c8195637276a01d1016d9277f95a [2024-11-23 23:30:12,744 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2024-11-23 23:30:12,753 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2024-11-23 23:30:12,756 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2024-11-23 23:30:12,757 INFO L270 PluginConnector]: Initializing CDTParser... [2024-11-23 23:30:12,757 INFO L274 PluginConnector]: CDTParser initialized [2024-11-23 23:30:12,759 INFO L431 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_10321ffd-2a79-4b20-bf29-0d8ff17e75fa/bin/uautomizer-verify-LYvppIcaGC/../../sv-benchmarks/c/pthread-wmm/mix003_power.opt_pso.opt_rmo.opt_tso.opt.i [2024-11-23 23:30:15,759 INFO L533 CDTParser]: Created temporary CDT project at /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_10321ffd-2a79-4b20-bf29-0d8ff17e75fa/bin/uautomizer-verify-LYvppIcaGC/data/503295563/0214ebb6563a47779d8549d290f2c056/FLAGde661785e [2024-11-23 23:30:16,145 INFO L384 CDTParser]: Found 1 translation units. [2024-11-23 23:30:16,146 INFO L180 CDTParser]: Scanning /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_10321ffd-2a79-4b20-bf29-0d8ff17e75fa/sv-benchmarks/c/pthread-wmm/mix003_power.opt_pso.opt_rmo.opt_tso.opt.i [2024-11-23 23:30:16,169 INFO L427 CDTParser]: About to delete temporary CDT project at /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_10321ffd-2a79-4b20-bf29-0d8ff17e75fa/bin/uautomizer-verify-LYvppIcaGC/data/503295563/0214ebb6563a47779d8549d290f2c056/FLAGde661785e [2024-11-23 23:30:16,321 INFO L435 CDTParser]: Successfully deleted /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_10321ffd-2a79-4b20-bf29-0d8ff17e75fa/bin/uautomizer-verify-LYvppIcaGC/data/503295563/0214ebb6563a47779d8549d290f2c056 [2024-11-23 23:30:16,325 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2024-11-23 23:30:16,328 INFO L133 ToolchainWalker]: Walking toolchain with 6 elements. [2024-11-23 23:30:16,330 INFO L112 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2024-11-23 23:30:16,331 INFO L270 PluginConnector]: Initializing CACSL2BoogieTranslator... [2024-11-23 23:30:16,337 INFO L274 PluginConnector]: CACSL2BoogieTranslator initialized [2024-11-23 23:30:16,338 INFO L184 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 23.11 11:30:16" (1/1) ... [2024-11-23 23:30:16,338 INFO L204 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@17b20844 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 23.11 11:30:16, skipping insertion in model container [2024-11-23 23:30:16,339 INFO L184 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 23.11 11:30:16" (1/1) ... [2024-11-23 23:30:16,390 INFO L175 MainTranslator]: Built tables and reachable declarations [2024-11-23 23:30:16,888 INFO L210 PostProcessor]: Analyzing one entry point: main [2024-11-23 23:30:16,902 INFO L200 MainTranslator]: Completed pre-run [2024-11-23 23:30:16,993 INFO L210 PostProcessor]: Analyzing one entry point: main [2024-11-23 23:30:17,032 INFO L204 MainTranslator]: Completed translation [2024-11-23 23:30:17,032 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 23.11 11:30:17 WrapperNode [2024-11-23 23:30:17,033 INFO L131 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2024-11-23 23:30:17,034 INFO L112 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2024-11-23 23:30:17,034 INFO L270 PluginConnector]: Initializing Boogie Procedure Inliner... [2024-11-23 23:30:17,034 INFO L274 PluginConnector]: Boogie Procedure Inliner initialized [2024-11-23 23:30:17,040 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 23.11 11:30:17" (1/1) ... [2024-11-23 23:30:17,054 INFO L184 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 23.11 11:30:17" (1/1) ... [2024-11-23 23:30:17,078 INFO L138 Inliner]: procedures = 176, calls = 47, calls flagged for inlining = 6, calls inlined = 7, statements flattened = 145 [2024-11-23 23:30:17,079 INFO L131 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2024-11-23 23:30:17,079 INFO L112 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2024-11-23 23:30:17,079 INFO L270 PluginConnector]: Initializing Boogie Preprocessor... [2024-11-23 23:30:17,079 INFO L274 PluginConnector]: Boogie Preprocessor initialized [2024-11-23 23:30:17,088 INFO L184 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 23.11 11:30:17" (1/1) ... [2024-11-23 23:30:17,088 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 23.11 11:30:17" (1/1) ... [2024-11-23 23:30:17,092 INFO L184 PluginConnector]: Executing the observer MemorySlicer from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 23.11 11:30:17" (1/1) ... [2024-11-23 23:30:17,107 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-23 23:30:17,107 INFO L184 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 23.11 11:30:17" (1/1) ... [2024-11-23 23:30:17,107 INFO L184 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 23.11 11:30:17" (1/1) ... [2024-11-23 23:30:17,116 INFO L184 PluginConnector]: Executing the observer ReplaceArrayAssignments from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 23.11 11:30:17" (1/1) ... [2024-11-23 23:30:17,120 INFO L184 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 23.11 11:30:17" (1/1) ... [2024-11-23 23:30:17,122 INFO L184 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 23.11 11:30:17" (1/1) ... [2024-11-23 23:30:17,129 INFO L184 PluginConnector]: Executing the observer LTLStepAnnotator from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 23.11 11:30:17" (1/1) ... [2024-11-23 23:30:17,130 INFO L184 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 23.11 11:30:17" (1/1) ... [2024-11-23 23:30:17,137 INFO L131 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2024-11-23 23:30:17,138 INFO L112 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2024-11-23 23:30:17,138 INFO L270 PluginConnector]: Initializing RCFGBuilder... [2024-11-23 23:30:17,138 INFO L274 PluginConnector]: RCFGBuilder initialized [2024-11-23 23:30:17,139 INFO L184 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 23.11 11:30:17" (1/1) ... [2024-11-23 23:30:17,152 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2024-11-23 23:30:17,167 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_10321ffd-2a79-4b20-bf29-0d8ff17e75fa/bin/uautomizer-verify-LYvppIcaGC/z3 [2024-11-23 23:30:17,184 INFO L229 MonitoredProcess]: Starting monitored process 1 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_10321ffd-2a79-4b20-bf29-0d8ff17e75fa/bin/uautomizer-verify-LYvppIcaGC/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 (exit command is (exit), workingDir is null) [2024-11-23 23:30:17,189 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_10321ffd-2a79-4b20-bf29-0d8ff17e75fa/bin/uautomizer-verify-LYvppIcaGC/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 (1)] Waiting until timeout for monitored process [2024-11-23 23:30:17,218 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_atomic_begin [2024-11-23 23:30:17,218 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2024-11-23 23:30:17,218 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~intINTTYPE1#0 [2024-11-23 23:30:17,218 INFO L130 BoogieDeclarations]: Found specification of procedure P0 [2024-11-23 23:30:17,218 INFO L138 BoogieDeclarations]: Found implementation of procedure P0 [2024-11-23 23:30:17,219 INFO L130 BoogieDeclarations]: Found specification of procedure P1 [2024-11-23 23:30:17,219 INFO L138 BoogieDeclarations]: Found implementation of procedure P1 [2024-11-23 23:30:17,219 INFO L130 BoogieDeclarations]: Found specification of procedure P2 [2024-11-23 23:30:17,219 INFO L138 BoogieDeclarations]: Found implementation of procedure P2 [2024-11-23 23:30:17,219 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_atomic_end [2024-11-23 23:30:17,220 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2024-11-23 23:30:17,220 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2024-11-23 23:30:17,221 WARN L203 CfgBuilder]: User set CodeBlockSize to SequenceOfStatements but program contains fork statements. Overwriting the user preferences and setting CodeBlockSize to OneNontrivialStatement. [2024-11-23 23:30:17,392 INFO L234 CfgBuilder]: Building ICFG [2024-11-23 23:30:17,394 INFO L260 CfgBuilder]: Building CFG for each procedure with an implementation [2024-11-23 23:30:17,931 INFO L279 CfgBuilder]: Omitted future-live optimization because the input is a concurrent program. [2024-11-23 23:30:17,932 INFO L283 CfgBuilder]: Performing block encoding [2024-11-23 23:30:18,368 INFO L307 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2024-11-23 23:30:18,369 INFO L312 CfgBuilder]: Removed 0 assume(true) statements. [2024-11-23 23:30:18,370 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 23.11 11:30:18 BoogieIcfgContainer [2024-11-23 23:30:18,370 INFO L131 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2024-11-23 23:30:18,372 INFO L112 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2024-11-23 23:30:18,372 INFO L270 PluginConnector]: Initializing TraceAbstraction... [2024-11-23 23:30:18,379 INFO L274 PluginConnector]: TraceAbstraction initialized [2024-11-23 23:30:18,379 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 23.11 11:30:16" (1/3) ... [2024-11-23 23:30:18,380 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@21f3b9a and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 23.11 11:30:18, skipping insertion in model container [2024-11-23 23:30:18,380 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 23.11 11:30:17" (2/3) ... [2024-11-23 23:30:18,381 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@21f3b9a and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 23.11 11:30:18, skipping insertion in model container [2024-11-23 23:30:18,381 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 23.11 11:30:18" (3/3) ... [2024-11-23 23:30:18,382 INFO L128 eAbstractionObserver]: Analyzing ICFG mix003_power.opt_pso.opt_rmo.opt_tso.opt.i [2024-11-23 23:30:18,400 INFO L216 ceAbstractionStarter]: Automizer settings: Hoare:None NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2024-11-23 23:30:18,401 INFO L151 ceAbstractionStarter]: Applying trace abstraction to ICFG mix003_power.opt_pso.opt_rmo.opt_tso.opt.i that has 4 procedures, 45 locations, 1 initial locations, 0 loop locations, and 3 error locations. [2024-11-23 23:30:18,402 INFO L491 ceAbstractionStarter]: Constructing petrified ICFG for 1 thread instances. [2024-11-23 23:30:18,501 INFO L143 ThreadInstanceAdder]: Constructed 0 joinOtherThreadTransitions. [2024-11-23 23:30:18,547 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 54 places, 46 transitions, 104 flow [2024-11-23 23:30:18,614 INFO L124 PetriNetUnfolderBase]: 2/43 cut-off events. [2024-11-23 23:30:18,618 INFO L125 PetriNetUnfolderBase]: For 0/0 co-relation queries the response was YES. [2024-11-23 23:30:18,623 INFO L83 FinitePrefix]: Finished finitePrefix Result has 53 conditions, 43 events. 2/43 cut-off events. For 0/0 co-relation queries the response was YES. Maximal size of possible extension queue 5. Compared 87 event pairs, 0 based on Foata normal form. 0/38 useless extension candidates. Maximal degree in co-relation 45. Up to 2 conditions per place. [2024-11-23 23:30:18,623 INFO L82 GeneralOperation]: Start removeDead. Operand has 54 places, 46 transitions, 104 flow [2024-11-23 23:30:18,629 INFO L88 GeneralOperation]: Finished RemoveDead, result has has 51 places, 43 transitions, 95 flow [2024-11-23 23:30:18,643 INFO L332 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2024-11-23 23:30:18,662 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;@6cb74a04, mLbeIndependenceSettings=[IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=false, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2024-11-23 23:30:18,662 INFO L334 AbstractCegarLoop]: Starting to check reachability of 7 error locations. [2024-11-23 23:30:18,676 INFO L185 PetriNetUnfolderBase]: Found word, exiting Unfolder. [2024-11-23 23:30:18,677 INFO L124 PetriNetUnfolderBase]: 0/18 cut-off events. [2024-11-23 23:30:18,677 INFO L125 PetriNetUnfolderBase]: For 0/0 co-relation queries the response was YES. [2024-11-23 23:30:18,677 INFO L198 CegarLoopForPetriNet]: Found error trace [2024-11-23 23:30:18,677 INFO L206 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1] [2024-11-23 23:30:18,678 INFO L396 AbstractCegarLoop]: === Iteration 1 === Targeting P2Err0ASSERT_VIOLATIONMEMORY_LEAK === [P2Err0ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr1ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr0ASSERT_VIOLATIONMEMORY_LEAK (and 4 more)] === [2024-11-23 23:30:18,686 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-23 23:30:18,687 INFO L85 PathProgramCache]: Analyzing trace with hash -2044748991, now seen corresponding path program 1 times [2024-11-23 23:30:18,701 INFO L118 FreeRefinementEngine]: Executing refinement strategy FOX [2024-11-23 23:30:18,701 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleZ3 [1713946793] [2024-11-23 23:30:18,702 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-23 23:30:18,702 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-11-23 23:30:18,702 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_10321ffd-2a79-4b20-bf29-0d8ff17e75fa/bin/uautomizer-verify-LYvppIcaGC/z3 [2024-11-23 23:30:18,707 INFO L229 MonitoredProcess]: Starting monitored process 2 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_10321ffd-2a79-4b20-bf29-0d8ff17e75fa/bin/uautomizer-verify-LYvppIcaGC/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2024-11-23 23:30:18,709 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_10321ffd-2a79-4b20-bf29-0d8ff17e75fa/bin/uautomizer-verify-LYvppIcaGC/z3 -smt2 -in SMTLIB2_COMPLIANT=true (2)] Waiting until timeout for monitored process [2024-11-23 23:30:18,879 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-23 23:30:18,882 INFO L256 TraceCheckSpWp]: Trace formula consists of 75 conjuncts, 5 conjuncts are in the unsatisfiable core [2024-11-23 23:30:18,886 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2024-11-23 23:30:18,941 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-23 23:30:18,942 INFO L308 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2024-11-23 23:30:18,943 INFO L136 FreeRefinementEngine]: Strategy FOX found an infeasible trace [2024-11-23 23:30:18,943 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1713946793] [2024-11-23 23:30:18,943 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1713946793] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-23 23:30:18,946 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-23 23:30:18,946 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [1] imperfect sequences [] total 1 [2024-11-23 23:30:18,949 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [423407386] [2024-11-23 23:30:18,949 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-23 23:30:18,954 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2024-11-23 23:30:18,958 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy FOX [2024-11-23 23:30:18,980 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-11-23 23:30:18,980 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-11-23 23:30:18,982 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 22 out of 46 [2024-11-23 23:30:18,984 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 51 places, 43 transitions, 95 flow. Second operand has 3 states, 3 states have (on average 24.333333333333332) internal successors, (73), 3 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-23 23:30:18,985 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-11-23 23:30:18,985 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 22 of 46 [2024-11-23 23:30:18,986 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-11-23 23:30:19,479 INFO L124 PetriNetUnfolderBase]: 459/869 cut-off events. [2024-11-23 23:30:19,480 INFO L125 PetriNetUnfolderBase]: For 0/0 co-relation queries the response was YES. [2024-11-23 23:30:19,486 INFO L83 FinitePrefix]: Finished finitePrefix Result has 1608 conditions, 869 events. 459/869 cut-off events. For 0/0 co-relation queries the response was YES. Maximal size of possible extension queue 87. Compared 5853 event pairs, 67 based on Foata normal form. 60/916 useless extension candidates. Maximal degree in co-relation 1597. Up to 585 conditions per place. [2024-11-23 23:30:19,496 INFO L140 encePairwiseOnDemand]: 41/46 looper letters, 26 selfloop transitions, 2 changer transitions 2/49 dead transitions. [2024-11-23 23:30:19,496 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 51 places, 49 transitions, 167 flow [2024-11-23 23:30:19,499 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-11-23 23:30:19,501 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2024-11-23 23:30:19,513 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 101 transitions. [2024-11-23 23:30:19,515 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.7318840579710145 [2024-11-23 23:30:19,517 INFO L175 Difference]: Start difference. First operand has 51 places, 43 transitions, 95 flow. Second operand 3 states and 101 transitions. [2024-11-23 23:30:19,518 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 51 places, 49 transitions, 167 flow [2024-11-23 23:30:19,525 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 48 places, 49 transitions, 164 flow, removed 0 selfloop flow, removed 3 redundant places. [2024-11-23 23:30:19,529 INFO L231 Difference]: Finished difference. Result has 48 places, 38 transitions, 86 flow [2024-11-23 23:30:19,534 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=46, PETRI_DIFFERENCE_MINUEND_FLOW=84, PETRI_DIFFERENCE_MINUEND_PLACES=46, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=39, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=2, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=37, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=86, PETRI_PLACES=48, PETRI_TRANSITIONS=38} [2024-11-23 23:30:19,538 INFO L279 CegarLoopForPetriNet]: 51 programPoint places, -3 predicate places. [2024-11-23 23:30:19,539 INFO L471 AbstractCegarLoop]: Abstraction has has 48 places, 38 transitions, 86 flow [2024-11-23 23:30:19,540 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 24.333333333333332) internal successors, (73), 3 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-23 23:30:19,540 INFO L198 CegarLoopForPetriNet]: Found error trace [2024-11-23 23:30:19,540 INFO L206 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-23 23:30:19,555 INFO L540 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_10321ffd-2a79-4b20-bf29-0d8ff17e75fa/bin/uautomizer-verify-LYvppIcaGC/z3 -smt2 -in SMTLIB2_COMPLIANT=true (2)] Forceful destruction successful, exit code 0 [2024-11-23 23:30:19,745 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 2 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_10321ffd-2a79-4b20-bf29-0d8ff17e75fa/bin/uautomizer-verify-LYvppIcaGC/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-11-23 23:30:19,745 INFO L396 AbstractCegarLoop]: === Iteration 2 === Targeting ULTIMATE.startErr1ASSERT_VIOLATIONMEMORY_LEAK === [P2Err0ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr1ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr0ASSERT_VIOLATIONMEMORY_LEAK (and 4 more)] === [2024-11-23 23:30:19,746 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-23 23:30:19,746 INFO L85 PathProgramCache]: Analyzing trace with hash 830248526, now seen corresponding path program 1 times [2024-11-23 23:30:19,747 INFO L118 FreeRefinementEngine]: Executing refinement strategy FOX [2024-11-23 23:30:19,747 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleZ3 [180409474] [2024-11-23 23:30:19,747 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-23 23:30:19,747 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-11-23 23:30:19,747 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_10321ffd-2a79-4b20-bf29-0d8ff17e75fa/bin/uautomizer-verify-LYvppIcaGC/z3 [2024-11-23 23:30:19,749 INFO L229 MonitoredProcess]: Starting monitored process 3 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_10321ffd-2a79-4b20-bf29-0d8ff17e75fa/bin/uautomizer-verify-LYvppIcaGC/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2024-11-23 23:30:19,752 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_10321ffd-2a79-4b20-bf29-0d8ff17e75fa/bin/uautomizer-verify-LYvppIcaGC/z3 -smt2 -in SMTLIB2_COMPLIANT=true (3)] Waiting until timeout for monitored process [2024-11-23 23:30:19,869 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-23 23:30:19,871 INFO L256 TraceCheckSpWp]: Trace formula consists of 80 conjuncts, 2 conjuncts are in the unsatisfiable core [2024-11-23 23:30:19,872 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2024-11-23 23:30:19,926 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-23 23:30:19,926 INFO L308 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2024-11-23 23:30:19,926 INFO L136 FreeRefinementEngine]: Strategy FOX found an infeasible trace [2024-11-23 23:30:19,927 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [180409474] [2024-11-23 23:30:19,927 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [180409474] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-23 23:30:19,927 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-23 23:30:19,927 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [1] imperfect sequences [] total 1 [2024-11-23 23:30:19,927 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1415155622] [2024-11-23 23:30:19,927 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-23 23:30:19,928 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2024-11-23 23:30:19,928 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy FOX [2024-11-23 23:30:19,929 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-11-23 23:30:19,929 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-11-23 23:30:19,930 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 21 out of 46 [2024-11-23 23:30:19,933 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 48 places, 38 transitions, 86 flow. Second operand has 3 states, 3 states have (on average 25.0) internal successors, (75), 3 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-23 23:30:19,933 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-11-23 23:30:19,933 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 21 of 46 [2024-11-23 23:30:19,933 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-11-23 23:30:20,212 INFO L124 PetriNetUnfolderBase]: 400/816 cut-off events. [2024-11-23 23:30:20,212 INFO L125 PetriNetUnfolderBase]: For 42/42 co-relation queries the response was YES. [2024-11-23 23:30:20,219 INFO L83 FinitePrefix]: Finished finitePrefix Result has 1507 conditions, 816 events. 400/816 cut-off events. For 42/42 co-relation queries the response was YES. Maximal size of possible extension queue 82. Compared 5702 event pairs, 400 based on Foata normal form. 30/827 useless extension candidates. Maximal degree in co-relation 1497. Up to 627 conditions per place. [2024-11-23 23:30:20,225 INFO L140 encePairwiseOnDemand]: 44/46 looper letters, 17 selfloop transitions, 1 changer transitions 1/37 dead transitions. [2024-11-23 23:30:20,225 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 48 places, 37 transitions, 122 flow [2024-11-23 23:30:20,225 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-11-23 23:30:20,225 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2024-11-23 23:30:20,227 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 83 transitions. [2024-11-23 23:30:20,227 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.6014492753623188 [2024-11-23 23:30:20,227 INFO L175 Difference]: Start difference. First operand has 48 places, 38 transitions, 86 flow. Second operand 3 states and 83 transitions. [2024-11-23 23:30:20,227 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 48 places, 37 transitions, 122 flow [2024-11-23 23:30:20,228 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 46 places, 37 transitions, 118 flow, removed 0 selfloop flow, removed 2 redundant places. [2024-11-23 23:30:20,229 INFO L231 Difference]: Finished difference. Result has 46 places, 36 transitions, 80 flow [2024-11-23 23:30:20,231 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=46, PETRI_DIFFERENCE_MINUEND_FLOW=80, PETRI_DIFFERENCE_MINUEND_PLACES=44, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=37, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=1, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=36, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=80, PETRI_PLACES=46, PETRI_TRANSITIONS=36} [2024-11-23 23:30:20,233 INFO L279 CegarLoopForPetriNet]: 51 programPoint places, -5 predicate places. [2024-11-23 23:30:20,233 INFO L471 AbstractCegarLoop]: Abstraction has has 46 places, 36 transitions, 80 flow [2024-11-23 23:30:20,234 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 25.0) internal successors, (75), 3 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-23 23:30:20,234 INFO L198 CegarLoopForPetriNet]: Found error trace [2024-11-23 23:30:20,234 INFO L206 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-23 23:30:20,247 INFO L552 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_10321ffd-2a79-4b20-bf29-0d8ff17e75fa/bin/uautomizer-verify-LYvppIcaGC/z3 -smt2 -in SMTLIB2_COMPLIANT=true (3)] Ended with exit code 0 [2024-11-23 23:30:20,434 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 3 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_10321ffd-2a79-4b20-bf29-0d8ff17e75fa/bin/uautomizer-verify-LYvppIcaGC/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-11-23 23:30:20,435 INFO L396 AbstractCegarLoop]: === Iteration 3 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONMEMORY_LEAK === [P2Err0ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr1ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr0ASSERT_VIOLATIONMEMORY_LEAK (and 4 more)] === [2024-11-23 23:30:20,435 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-23 23:30:20,435 INFO L85 PathProgramCache]: Analyzing trace with hash 830249895, now seen corresponding path program 1 times [2024-11-23 23:30:20,436 INFO L118 FreeRefinementEngine]: Executing refinement strategy FOX [2024-11-23 23:30:20,436 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleZ3 [255869350] [2024-11-23 23:30:20,436 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-23 23:30:20,436 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-11-23 23:30:20,436 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_10321ffd-2a79-4b20-bf29-0d8ff17e75fa/bin/uautomizer-verify-LYvppIcaGC/z3 [2024-11-23 23:30:20,438 INFO L229 MonitoredProcess]: Starting monitored process 4 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_10321ffd-2a79-4b20-bf29-0d8ff17e75fa/bin/uautomizer-verify-LYvppIcaGC/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2024-11-23 23:30:20,439 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_10321ffd-2a79-4b20-bf29-0d8ff17e75fa/bin/uautomizer-verify-LYvppIcaGC/z3 -smt2 -in SMTLIB2_COMPLIANT=true (4)] Waiting until timeout for monitored process [2024-11-23 23:30:20,555 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-23 23:30:20,556 INFO L256 TraceCheckSpWp]: Trace formula consists of 80 conjuncts, 3 conjuncts are in the unsatisfiable core [2024-11-23 23:30:20,558 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2024-11-23 23:30:20,617 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-23 23:30:20,617 INFO L308 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2024-11-23 23:30:20,617 INFO L136 FreeRefinementEngine]: Strategy FOX found an infeasible trace [2024-11-23 23:30:20,617 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [255869350] [2024-11-23 23:30:20,617 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [255869350] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-23 23:30:20,617 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-23 23:30:20,617 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2024-11-23 23:30:20,618 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [167120856] [2024-11-23 23:30:20,618 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-23 23:30:20,618 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2024-11-23 23:30:20,618 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy FOX [2024-11-23 23:30:20,618 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2024-11-23 23:30:20,619 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2024-11-23 23:30:20,626 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 18 out of 46 [2024-11-23 23:30:20,627 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 46 places, 36 transitions, 80 flow. Second operand has 4 states, 4 states have (on average 21.0) internal successors, (84), 4 states have internal predecessors, (84), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-23 23:30:20,627 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-11-23 23:30:20,627 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 18 of 46 [2024-11-23 23:30:20,627 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-11-23 23:30:21,045 INFO L124 PetriNetUnfolderBase]: 1079/1918 cut-off events. [2024-11-23 23:30:21,045 INFO L125 PetriNetUnfolderBase]: For 0/0 co-relation queries the response was YES. [2024-11-23 23:30:21,051 INFO L83 FinitePrefix]: Finished finitePrefix Result has 3600 conditions, 1918 events. 1079/1918 cut-off events. For 0/0 co-relation queries the response was YES. Maximal size of possible extension queue 151. Compared 12328 event pairs, 107 based on Foata normal form. 72/1983 useless extension candidates. Maximal degree in co-relation 3594. Up to 1011 conditions per place. [2024-11-23 23:30:21,060 INFO L140 encePairwiseOnDemand]: 40/46 looper letters, 39 selfloop transitions, 5 changer transitions 1/59 dead transitions. [2024-11-23 23:30:21,060 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 48 places, 59 transitions, 220 flow [2024-11-23 23:30:21,061 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2024-11-23 23:30:21,061 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 4 states. [2024-11-23 23:30:21,062 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 119 transitions. [2024-11-23 23:30:21,063 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.6467391304347826 [2024-11-23 23:30:21,063 INFO L175 Difference]: Start difference. First operand has 46 places, 36 transitions, 80 flow. Second operand 4 states and 119 transitions. [2024-11-23 23:30:21,064 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 48 places, 59 transitions, 220 flow [2024-11-23 23:30:21,064 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 47 places, 59 transitions, 219 flow, removed 0 selfloop flow, removed 1 redundant places. [2024-11-23 23:30:21,066 INFO L231 Difference]: Finished difference. Result has 49 places, 39 transitions, 113 flow [2024-11-23 23:30:21,066 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=46, PETRI_DIFFERENCE_MINUEND_FLOW=79, PETRI_DIFFERENCE_MINUEND_PLACES=44, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=36, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=2, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=31, PETRI_DIFFERENCE_SUBTRAHEND_STATES=4, PETRI_FLOW=113, PETRI_PLACES=49, PETRI_TRANSITIONS=39} [2024-11-23 23:30:21,069 INFO L279 CegarLoopForPetriNet]: 51 programPoint places, -2 predicate places. [2024-11-23 23:30:21,069 INFO L471 AbstractCegarLoop]: Abstraction has has 49 places, 39 transitions, 113 flow [2024-11-23 23:30:21,069 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 21.0) internal successors, (84), 4 states have internal predecessors, (84), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-23 23:30:21,069 INFO L198 CegarLoopForPetriNet]: Found error trace [2024-11-23 23:30:21,069 INFO L206 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-23 23:30:21,081 INFO L552 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_10321ffd-2a79-4b20-bf29-0d8ff17e75fa/bin/uautomizer-verify-LYvppIcaGC/z3 -smt2 -in SMTLIB2_COMPLIANT=true (4)] Ended with exit code 0 [2024-11-23 23:30:21,270 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 4 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_10321ffd-2a79-4b20-bf29-0d8ff17e75fa/bin/uautomizer-verify-LYvppIcaGC/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-11-23 23:30:21,270 INFO L396 AbstractCegarLoop]: === Iteration 4 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONMEMORY_LEAK === [P2Err0ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr1ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr0ASSERT_VIOLATIONMEMORY_LEAK (and 4 more)] === [2024-11-23 23:30:21,271 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-23 23:30:21,271 INFO L85 PathProgramCache]: Analyzing trace with hash -580170692, now seen corresponding path program 1 times [2024-11-23 23:30:21,272 INFO L118 FreeRefinementEngine]: Executing refinement strategy FOX [2024-11-23 23:30:21,272 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleZ3 [285269340] [2024-11-23 23:30:21,272 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-23 23:30:21,272 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-11-23 23:30:21,272 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_10321ffd-2a79-4b20-bf29-0d8ff17e75fa/bin/uautomizer-verify-LYvppIcaGC/z3 [2024-11-23 23:30:21,274 INFO L229 MonitoredProcess]: Starting monitored process 5 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_10321ffd-2a79-4b20-bf29-0d8ff17e75fa/bin/uautomizer-verify-LYvppIcaGC/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2024-11-23 23:30:21,284 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_10321ffd-2a79-4b20-bf29-0d8ff17e75fa/bin/uautomizer-verify-LYvppIcaGC/z3 -smt2 -in SMTLIB2_COMPLIANT=true (5)] Waiting until timeout for monitored process [2024-11-23 23:30:21,387 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-23 23:30:21,388 INFO L256 TraceCheckSpWp]: Trace formula consists of 86 conjuncts, 4 conjuncts are in the unsatisfiable core [2024-11-23 23:30:21,390 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2024-11-23 23:30:21,454 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-23 23:30:21,454 INFO L308 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2024-11-23 23:30:21,454 INFO L136 FreeRefinementEngine]: Strategy FOX found an infeasible trace [2024-11-23 23:30:21,455 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [285269340] [2024-11-23 23:30:21,455 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [285269340] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-23 23:30:21,455 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-23 23:30:21,455 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2024-11-23 23:30:21,455 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2134546351] [2024-11-23 23:30:21,455 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-23 23:30:21,455 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2024-11-23 23:30:21,455 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy FOX [2024-11-23 23:30:21,456 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2024-11-23 23:30:21,456 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2024-11-23 23:30:21,469 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 18 out of 46 [2024-11-23 23:30:21,470 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 49 places, 39 transitions, 113 flow. Second operand has 5 states, 5 states have (on average 20.6) internal successors, (103), 5 states have internal predecessors, (103), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-23 23:30:21,470 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-11-23 23:30:21,470 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 18 of 46 [2024-11-23 23:30:21,470 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-11-23 23:30:21,873 INFO L124 PetriNetUnfolderBase]: 733/1310 cut-off events. [2024-11-23 23:30:21,873 INFO L125 PetriNetUnfolderBase]: For 354/354 co-relation queries the response was YES. [2024-11-23 23:30:21,877 INFO L83 FinitePrefix]: Finished finitePrefix Result has 2961 conditions, 1310 events. 733/1310 cut-off events. For 354/354 co-relation queries the response was YES. Maximal size of possible extension queue 79. Compared 7310 event pairs, 41 based on Foata normal form. 64/1367 useless extension candidates. Maximal degree in co-relation 2952. Up to 521 conditions per place. [2024-11-23 23:30:21,885 INFO L140 encePairwiseOnDemand]: 40/46 looper letters, 49 selfloop transitions, 8 changer transitions 1/72 dead transitions. [2024-11-23 23:30:21,885 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 53 places, 72 transitions, 316 flow [2024-11-23 23:30:21,886 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2024-11-23 23:30:21,886 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 5 states. [2024-11-23 23:30:21,887 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 150 transitions. [2024-11-23 23:30:21,889 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.6521739130434783 [2024-11-23 23:30:21,889 INFO L175 Difference]: Start difference. First operand has 49 places, 39 transitions, 113 flow. Second operand 5 states and 150 transitions. [2024-11-23 23:30:21,889 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 53 places, 72 transitions, 316 flow [2024-11-23 23:30:21,890 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 51 places, 72 transitions, 306 flow, removed 1 selfloop flow, removed 2 redundant places. [2024-11-23 23:30:21,894 INFO L231 Difference]: Finished difference. Result has 53 places, 42 transitions, 153 flow [2024-11-23 23:30:21,894 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=46, PETRI_DIFFERENCE_MINUEND_FLOW=105, PETRI_DIFFERENCE_MINUEND_PLACES=47, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=39, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=5, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=31, PETRI_DIFFERENCE_SUBTRAHEND_STATES=5, PETRI_FLOW=153, PETRI_PLACES=53, PETRI_TRANSITIONS=42} [2024-11-23 23:30:21,895 INFO L279 CegarLoopForPetriNet]: 51 programPoint places, 2 predicate places. [2024-11-23 23:30:21,896 INFO L471 AbstractCegarLoop]: Abstraction has has 53 places, 42 transitions, 153 flow [2024-11-23 23:30:21,896 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 20.6) internal successors, (103), 5 states have internal predecessors, (103), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-23 23:30:21,896 INFO L198 CegarLoopForPetriNet]: Found error trace [2024-11-23 23:30:21,896 INFO L206 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-23 23:30:21,906 INFO L552 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_10321ffd-2a79-4b20-bf29-0d8ff17e75fa/bin/uautomizer-verify-LYvppIcaGC/z3 -smt2 -in SMTLIB2_COMPLIANT=true (5)] Ended with exit code 0 [2024-11-23 23:30:22,097 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 5 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_10321ffd-2a79-4b20-bf29-0d8ff17e75fa/bin/uautomizer-verify-LYvppIcaGC/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-11-23 23:30:22,097 INFO L396 AbstractCegarLoop]: === Iteration 5 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONMEMORY_LEAK === [P2Err0ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr1ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr0ASSERT_VIOLATIONMEMORY_LEAK (and 4 more)] === [2024-11-23 23:30:22,097 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-23 23:30:22,097 INFO L85 PathProgramCache]: Analyzing trace with hash 853438349, now seen corresponding path program 1 times [2024-11-23 23:30:22,098 INFO L118 FreeRefinementEngine]: Executing refinement strategy FOX [2024-11-23 23:30:22,098 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleZ3 [304554032] [2024-11-23 23:30:22,098 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-23 23:30:22,098 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-11-23 23:30:22,098 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_10321ffd-2a79-4b20-bf29-0d8ff17e75fa/bin/uautomizer-verify-LYvppIcaGC/z3 [2024-11-23 23:30:22,102 INFO L229 MonitoredProcess]: Starting monitored process 6 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_10321ffd-2a79-4b20-bf29-0d8ff17e75fa/bin/uautomizer-verify-LYvppIcaGC/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2024-11-23 23:30:22,103 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_10321ffd-2a79-4b20-bf29-0d8ff17e75fa/bin/uautomizer-verify-LYvppIcaGC/z3 -smt2 -in SMTLIB2_COMPLIANT=true (6)] Waiting until timeout for monitored process [2024-11-23 23:30:22,220 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-23 23:30:22,221 INFO L256 TraceCheckSpWp]: Trace formula consists of 106 conjuncts, 5 conjuncts are in the unsatisfiable core [2024-11-23 23:30:22,223 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2024-11-23 23:30:22,297 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-23 23:30:22,299 INFO L308 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2024-11-23 23:30:22,299 INFO L136 FreeRefinementEngine]: Strategy FOX found an infeasible trace [2024-11-23 23:30:22,299 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [304554032] [2024-11-23 23:30:22,300 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [304554032] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-23 23:30:22,300 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-23 23:30:22,300 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2024-11-23 23:30:22,300 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [378916490] [2024-11-23 23:30:22,300 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-23 23:30:22,300 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2024-11-23 23:30:22,300 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy FOX [2024-11-23 23:30:22,301 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2024-11-23 23:30:22,305 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2024-11-23 23:30:22,313 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 18 out of 46 [2024-11-23 23:30:22,313 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 53 places, 42 transitions, 153 flow. Second operand has 6 states, 6 states have (on average 20.5) internal successors, (123), 6 states have internal predecessors, (123), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-23 23:30:22,314 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-11-23 23:30:22,314 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 18 of 46 [2024-11-23 23:30:22,314 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-11-23 23:30:22,680 INFO L124 PetriNetUnfolderBase]: 411/708 cut-off events. [2024-11-23 23:30:22,680 INFO L125 PetriNetUnfolderBase]: For 644/644 co-relation queries the response was YES. [2024-11-23 23:30:22,682 INFO L83 FinitePrefix]: Finished finitePrefix Result has 1879 conditions, 708 events. 411/708 cut-off events. For 644/644 co-relation queries the response was YES. Maximal size of possible extension queue 43. Compared 3119 event pairs, 29 based on Foata normal form. 36/737 useless extension candidates. Maximal degree in co-relation 1868. Up to 268 conditions per place. [2024-11-23 23:30:22,685 INFO L140 encePairwiseOnDemand]: 40/46 looper letters, 43 selfloop transitions, 11 changer transitions 1/69 dead transitions. [2024-11-23 23:30:22,685 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 58 places, 69 transitions, 327 flow [2024-11-23 23:30:22,685 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2024-11-23 23:30:22,685 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 6 states. [2024-11-23 23:30:22,686 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6 states to 6 states and 165 transitions. [2024-11-23 23:30:22,686 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.5978260869565217 [2024-11-23 23:30:22,686 INFO L175 Difference]: Start difference. First operand has 53 places, 42 transitions, 153 flow. Second operand 6 states and 165 transitions. [2024-11-23 23:30:22,687 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 58 places, 69 transitions, 327 flow [2024-11-23 23:30:22,690 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 54 places, 69 transitions, 302 flow, removed 4 selfloop flow, removed 4 redundant places. [2024-11-23 23:30:22,691 INFO L231 Difference]: Finished difference. Result has 56 places, 42 transitions, 167 flow [2024-11-23 23:30:22,692 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=46, PETRI_DIFFERENCE_MINUEND_FLOW=131, PETRI_DIFFERENCE_MINUEND_PLACES=49, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=42, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=11, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=31, PETRI_DIFFERENCE_SUBTRAHEND_STATES=6, PETRI_FLOW=167, PETRI_PLACES=56, PETRI_TRANSITIONS=42} [2024-11-23 23:30:22,692 INFO L279 CegarLoopForPetriNet]: 51 programPoint places, 5 predicate places. [2024-11-23 23:30:22,692 INFO L471 AbstractCegarLoop]: Abstraction has has 56 places, 42 transitions, 167 flow [2024-11-23 23:30:22,692 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 20.5) internal successors, (123), 6 states have internal predecessors, (123), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-23 23:30:22,693 INFO L198 CegarLoopForPetriNet]: Found error trace [2024-11-23 23:30:22,693 INFO L206 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-23 23:30:22,702 INFO L540 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_10321ffd-2a79-4b20-bf29-0d8ff17e75fa/bin/uautomizer-verify-LYvppIcaGC/z3 -smt2 -in SMTLIB2_COMPLIANT=true (6)] Forceful destruction successful, exit code 0 [2024-11-23 23:30:22,897 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 6 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_10321ffd-2a79-4b20-bf29-0d8ff17e75fa/bin/uautomizer-verify-LYvppIcaGC/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-11-23 23:30:22,897 INFO L396 AbstractCegarLoop]: === Iteration 6 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONMEMORY_LEAK === [P2Err0ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr1ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr0ASSERT_VIOLATIONMEMORY_LEAK (and 4 more)] === [2024-11-23 23:30:22,898 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-23 23:30:22,898 INFO L85 PathProgramCache]: Analyzing trace with hash -2102345477, now seen corresponding path program 1 times [2024-11-23 23:30:22,898 INFO L118 FreeRefinementEngine]: Executing refinement strategy FOX [2024-11-23 23:30:22,898 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleZ3 [1027191832] [2024-11-23 23:30:22,899 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-23 23:30:22,899 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-11-23 23:30:22,899 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_10321ffd-2a79-4b20-bf29-0d8ff17e75fa/bin/uautomizer-verify-LYvppIcaGC/z3 [2024-11-23 23:30:22,900 INFO L229 MonitoredProcess]: Starting monitored process 7 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_10321ffd-2a79-4b20-bf29-0d8ff17e75fa/bin/uautomizer-verify-LYvppIcaGC/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2024-11-23 23:30:22,901 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_10321ffd-2a79-4b20-bf29-0d8ff17e75fa/bin/uautomizer-verify-LYvppIcaGC/z3 -smt2 -in SMTLIB2_COMPLIANT=true (7)] Waiting until timeout for monitored process [2024-11-23 23:30:23,007 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-23 23:30:23,009 INFO L256 TraceCheckSpWp]: Trace formula consists of 141 conjuncts, 11 conjuncts are in the unsatisfiable core [2024-11-23 23:30:23,011 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2024-11-23 23:30:23,290 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-23 23:30:23,291 INFO L308 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2024-11-23 23:30:23,291 INFO L136 FreeRefinementEngine]: Strategy FOX found an infeasible trace [2024-11-23 23:30:23,291 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1027191832] [2024-11-23 23:30:23,291 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1027191832] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-23 23:30:23,291 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-23 23:30:23,291 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2024-11-23 23:30:23,291 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [229433489] [2024-11-23 23:30:23,292 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-23 23:30:23,292 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 9 states [2024-11-23 23:30:23,292 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy FOX [2024-11-23 23:30:23,293 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2024-11-23 23:30:23,294 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=19, Invalid=53, Unknown=0, NotChecked=0, Total=72 [2024-11-23 23:30:23,345 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 15 out of 46 [2024-11-23 23:30:23,345 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 56 places, 42 transitions, 167 flow. Second operand has 9 states, 9 states have (on average 17.444444444444443) internal successors, (157), 9 states have internal predecessors, (157), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-23 23:30:23,346 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-11-23 23:30:23,346 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 15 of 46 [2024-11-23 23:30:23,346 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-11-23 23:30:23,896 INFO L124 PetriNetUnfolderBase]: 763/1303 cut-off events. [2024-11-23 23:30:23,896 INFO L125 PetriNetUnfolderBase]: For 1256/1264 co-relation queries the response was YES. [2024-11-23 23:30:23,900 INFO L83 FinitePrefix]: Finished finitePrefix Result has 3437 conditions, 1303 events. 763/1303 cut-off events. For 1256/1264 co-relation queries the response was YES. Maximal size of possible extension queue 76. Compared 6475 event pairs, 183 based on Foata normal form. 16/1314 useless extension candidates. Maximal degree in co-relation 3425. Up to 741 conditions per place. [2024-11-23 23:30:23,905 INFO L140 encePairwiseOnDemand]: 36/46 looper letters, 46 selfloop transitions, 7 changer transitions 33/97 dead transitions. [2024-11-23 23:30:23,905 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 64 places, 97 transitions, 541 flow [2024-11-23 23:30:23,906 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2024-11-23 23:30:23,906 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 9 states. [2024-11-23 23:30:23,907 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 9 states to 9 states and 216 transitions. [2024-11-23 23:30:23,907 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.5217391304347826 [2024-11-23 23:30:23,907 INFO L175 Difference]: Start difference. First operand has 56 places, 42 transitions, 167 flow. Second operand 9 states and 216 transitions. [2024-11-23 23:30:23,907 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 64 places, 97 transitions, 541 flow [2024-11-23 23:30:23,918 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 56 places, 97 transitions, 424 flow, removed 20 selfloop flow, removed 8 redundant places. [2024-11-23 23:30:23,919 INFO L231 Difference]: Finished difference. Result has 62 places, 45 transitions, 155 flow [2024-11-23 23:30:23,919 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=46, PETRI_DIFFERENCE_MINUEND_FLOW=111, PETRI_DIFFERENCE_MINUEND_PLACES=48, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=42, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=4, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=37, PETRI_DIFFERENCE_SUBTRAHEND_STATES=9, PETRI_FLOW=155, PETRI_PLACES=62, PETRI_TRANSITIONS=45} [2024-11-23 23:30:23,919 INFO L279 CegarLoopForPetriNet]: 51 programPoint places, 11 predicate places. [2024-11-23 23:30:23,920 INFO L471 AbstractCegarLoop]: Abstraction has has 62 places, 45 transitions, 155 flow [2024-11-23 23:30:23,920 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 9 states, 9 states have (on average 17.444444444444443) internal successors, (157), 9 states have internal predecessors, (157), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-23 23:30:23,920 INFO L198 CegarLoopForPetriNet]: Found error trace [2024-11-23 23:30:23,920 INFO L206 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-23 23:30:23,930 INFO L552 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_10321ffd-2a79-4b20-bf29-0d8ff17e75fa/bin/uautomizer-verify-LYvppIcaGC/z3 -smt2 -in SMTLIB2_COMPLIANT=true (7)] Ended with exit code 0 [2024-11-23 23:30:24,124 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 7 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_10321ffd-2a79-4b20-bf29-0d8ff17e75fa/bin/uautomizer-verify-LYvppIcaGC/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-11-23 23:30:24,124 INFO L396 AbstractCegarLoop]: === Iteration 7 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONMEMORY_LEAK === [P2Err0ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr1ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr0ASSERT_VIOLATIONMEMORY_LEAK (and 4 more)] === [2024-11-23 23:30:24,125 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-23 23:30:24,125 INFO L85 PathProgramCache]: Analyzing trace with hash 260993131, now seen corresponding path program 2 times [2024-11-23 23:30:24,125 INFO L118 FreeRefinementEngine]: Executing refinement strategy FOX [2024-11-23 23:30:24,126 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleZ3 [1053295147] [2024-11-23 23:30:24,126 INFO L95 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2024-11-23 23:30:24,126 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-11-23 23:30:24,126 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_10321ffd-2a79-4b20-bf29-0d8ff17e75fa/bin/uautomizer-verify-LYvppIcaGC/z3 [2024-11-23 23:30:24,127 INFO L229 MonitoredProcess]: Starting monitored process 8 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_10321ffd-2a79-4b20-bf29-0d8ff17e75fa/bin/uautomizer-verify-LYvppIcaGC/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2024-11-23 23:30:24,129 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_10321ffd-2a79-4b20-bf29-0d8ff17e75fa/bin/uautomizer-verify-LYvppIcaGC/z3 -smt2 -in SMTLIB2_COMPLIANT=true (8)] Waiting until timeout for monitored process [2024-11-23 23:30:24,247 INFO L229 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 1 check-sat command(s) [2024-11-23 23:30:24,247 INFO L230 tOrderPrioritization]: Conjunction of SSA is unsat [2024-11-23 23:30:24,250 INFO L256 TraceCheckSpWp]: Trace formula consists of 141 conjuncts, 11 conjuncts are in the unsatisfiable core [2024-11-23 23:30:24,252 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2024-11-23 23:30:24,503 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-23 23:30:24,503 INFO L308 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2024-11-23 23:30:24,503 INFO L136 FreeRefinementEngine]: Strategy FOX found an infeasible trace [2024-11-23 23:30:24,503 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1053295147] [2024-11-23 23:30:24,503 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1053295147] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-23 23:30:24,504 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-23 23:30:24,504 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2024-11-23 23:30:24,504 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [533129156] [2024-11-23 23:30:24,504 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-23 23:30:24,504 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 9 states [2024-11-23 23:30:24,505 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy FOX [2024-11-23 23:30:24,505 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2024-11-23 23:30:24,505 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=19, Invalid=53, Unknown=0, NotChecked=0, Total=72 [2024-11-23 23:30:24,547 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 15 out of 46 [2024-11-23 23:30:24,547 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 62 places, 45 transitions, 155 flow. Second operand has 9 states, 9 states have (on average 17.444444444444443) internal successors, (157), 9 states have internal predecessors, (157), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-23 23:30:24,548 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-11-23 23:30:24,548 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 15 of 46 [2024-11-23 23:30:24,548 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-11-23 23:30:25,167 INFO L124 PetriNetUnfolderBase]: 1063/1811 cut-off events. [2024-11-23 23:30:25,168 INFO L125 PetriNetUnfolderBase]: For 525/529 co-relation queries the response was YES. [2024-11-23 23:30:25,174 INFO L83 FinitePrefix]: Finished finitePrefix Result has 4261 conditions, 1811 events. 1063/1811 cut-off events. For 525/529 co-relation queries the response was YES. Maximal size of possible extension queue 96. Compared 9313 event pairs, 218 based on Foata normal form. 10/1806 useless extension candidates. Maximal degree in co-relation 4247. Up to 902 conditions per place. [2024-11-23 23:30:25,180 INFO L140 encePairwiseOnDemand]: 36/46 looper letters, 43 selfloop transitions, 10 changer transitions 41/106 dead transitions. [2024-11-23 23:30:25,180 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 65 places, 106 transitions, 524 flow [2024-11-23 23:30:25,181 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2024-11-23 23:30:25,183 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 9 states. [2024-11-23 23:30:25,186 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 9 states to 9 states and 221 transitions. [2024-11-23 23:30:25,186 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.533816425120773 [2024-11-23 23:30:25,187 INFO L175 Difference]: Start difference. First operand has 62 places, 45 transitions, 155 flow. Second operand 9 states and 221 transitions. [2024-11-23 23:30:25,187 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 65 places, 106 transitions, 524 flow [2024-11-23 23:30:25,190 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 59 places, 106 transitions, 486 flow, removed 7 selfloop flow, removed 6 redundant places. [2024-11-23 23:30:25,191 INFO L231 Difference]: Finished difference. Result has 65 places, 49 transitions, 195 flow [2024-11-23 23:30:25,192 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=46, PETRI_DIFFERENCE_MINUEND_FLOW=135, PETRI_DIFFERENCE_MINUEND_PLACES=51, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=45, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=6, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=38, PETRI_DIFFERENCE_SUBTRAHEND_STATES=9, PETRI_FLOW=195, PETRI_PLACES=65, PETRI_TRANSITIONS=49} [2024-11-23 23:30:25,194 INFO L279 CegarLoopForPetriNet]: 51 programPoint places, 14 predicate places. [2024-11-23 23:30:25,194 INFO L471 AbstractCegarLoop]: Abstraction has has 65 places, 49 transitions, 195 flow [2024-11-23 23:30:25,194 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 9 states, 9 states have (on average 17.444444444444443) internal successors, (157), 9 states have internal predecessors, (157), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-23 23:30:25,197 INFO L198 CegarLoopForPetriNet]: Found error trace [2024-11-23 23:30:25,197 INFO L206 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-23 23:30:25,208 INFO L552 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_10321ffd-2a79-4b20-bf29-0d8ff17e75fa/bin/uautomizer-verify-LYvppIcaGC/z3 -smt2 -in SMTLIB2_COMPLIANT=true (8)] Ended with exit code 0 [2024-11-23 23:30:25,398 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 8 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_10321ffd-2a79-4b20-bf29-0d8ff17e75fa/bin/uautomizer-verify-LYvppIcaGC/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-11-23 23:30:25,398 INFO L396 AbstractCegarLoop]: === Iteration 8 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONMEMORY_LEAK === [P2Err0ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr1ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr0ASSERT_VIOLATIONMEMORY_LEAK (and 4 more)] === [2024-11-23 23:30:25,398 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-23 23:30:25,399 INFO L85 PathProgramCache]: Analyzing trace with hash 881698267, now seen corresponding path program 3 times [2024-11-23 23:30:25,399 INFO L118 FreeRefinementEngine]: Executing refinement strategy FOX [2024-11-23 23:30:25,399 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleZ3 [1633773389] [2024-11-23 23:30:25,399 INFO L95 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST2 [2024-11-23 23:30:25,399 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-11-23 23:30:25,399 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_10321ffd-2a79-4b20-bf29-0d8ff17e75fa/bin/uautomizer-verify-LYvppIcaGC/z3 [2024-11-23 23:30:25,401 INFO L229 MonitoredProcess]: Starting monitored process 9 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_10321ffd-2a79-4b20-bf29-0d8ff17e75fa/bin/uautomizer-verify-LYvppIcaGC/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2024-11-23 23:30:25,403 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_10321ffd-2a79-4b20-bf29-0d8ff17e75fa/bin/uautomizer-verify-LYvppIcaGC/z3 -smt2 -in SMTLIB2_COMPLIANT=true (9)] Waiting until timeout for monitored process [2024-11-23 23:30:25,519 INFO L229 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued 1 check-sat command(s) [2024-11-23 23:30:25,520 INFO L230 tOrderPrioritization]: Conjunction of SSA is unsat [2024-11-23 23:30:25,522 INFO L256 TraceCheckSpWp]: Trace formula consists of 141 conjuncts, 22 conjuncts are in the unsatisfiable core [2024-11-23 23:30:25,526 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2024-11-23 23:30:26,874 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-23 23:30:26,874 INFO L308 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2024-11-23 23:30:26,874 INFO L136 FreeRefinementEngine]: Strategy FOX found an infeasible trace [2024-11-23 23:30:26,874 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1633773389] [2024-11-23 23:30:26,874 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1633773389] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-23 23:30:26,874 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-23 23:30:26,874 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [10] imperfect sequences [] total 10 [2024-11-23 23:30:26,875 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1407201947] [2024-11-23 23:30:26,875 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-23 23:30:26,875 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 11 states [2024-11-23 23:30:26,875 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy FOX [2024-11-23 23:30:26,876 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 11 interpolants. [2024-11-23 23:30:26,876 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=22, Invalid=88, Unknown=0, NotChecked=0, Total=110 [2024-11-23 23:30:26,937 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 17 out of 46 [2024-11-23 23:30:26,937 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 65 places, 49 transitions, 195 flow. Second operand has 11 states, 11 states have (on average 18.818181818181817) internal successors, (207), 11 states have internal predecessors, (207), 0 states have call successors, (0), 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-23 23:30:26,937 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-11-23 23:30:26,937 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 17 of 46 [2024-11-23 23:30:26,938 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-11-23 23:30:27,818 INFO L124 PetriNetUnfolderBase]: 732/1307 cut-off events. [2024-11-23 23:30:27,818 INFO L125 PetriNetUnfolderBase]: For 451/464 co-relation queries the response was YES. [2024-11-23 23:30:27,823 INFO L83 FinitePrefix]: Finished finitePrefix Result has 3275 conditions, 1307 events. 732/1307 cut-off events. For 451/464 co-relation queries the response was YES. Maximal size of possible extension queue 71. Compared 6522 event pairs, 222 based on Foata normal form. 18/1305 useless extension candidates. Maximal degree in co-relation 3259. Up to 747 conditions per place. [2024-11-23 23:30:27,828 INFO L140 encePairwiseOnDemand]: 34/46 looper letters, 43 selfloop transitions, 32 changer transitions 30/120 dead transitions. [2024-11-23 23:30:27,828 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 72 places, 120 transitions, 688 flow [2024-11-23 23:30:27,829 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 13 states. [2024-11-23 23:30:27,829 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 13 states. [2024-11-23 23:30:27,831 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 13 states to 13 states and 308 transitions. [2024-11-23 23:30:27,832 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.5150501672240803 [2024-11-23 23:30:27,832 INFO L175 Difference]: Start difference. First operand has 65 places, 49 transitions, 195 flow. Second operand 13 states and 308 transitions. [2024-11-23 23:30:27,832 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 72 places, 120 transitions, 688 flow [2024-11-23 23:30:27,836 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 67 places, 120 transitions, 646 flow, removed 7 selfloop flow, removed 5 redundant places. [2024-11-23 23:30:27,838 INFO L231 Difference]: Finished difference. Result has 74 places, 73 transitions, 403 flow [2024-11-23 23:30:27,839 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=46, PETRI_DIFFERENCE_MINUEND_FLOW=178, PETRI_DIFFERENCE_MINUEND_PLACES=55, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=49, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=11, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=36, PETRI_DIFFERENCE_SUBTRAHEND_STATES=13, PETRI_FLOW=403, PETRI_PLACES=74, PETRI_TRANSITIONS=73} [2024-11-23 23:30:27,840 INFO L279 CegarLoopForPetriNet]: 51 programPoint places, 23 predicate places. [2024-11-23 23:30:27,841 INFO L471 AbstractCegarLoop]: Abstraction has has 74 places, 73 transitions, 403 flow [2024-11-23 23:30:27,842 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 11 states, 11 states have (on average 18.818181818181817) internal successors, (207), 11 states have internal predecessors, (207), 0 states have call successors, (0), 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-23 23:30:27,842 INFO L198 CegarLoopForPetriNet]: Found error trace [2024-11-23 23:30:27,842 INFO L206 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-23 23:30:27,850 INFO L540 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_10321ffd-2a79-4b20-bf29-0d8ff17e75fa/bin/uautomizer-verify-LYvppIcaGC/z3 -smt2 -in SMTLIB2_COMPLIANT=true (9)] Forceful destruction successful, exit code 0 [2024-11-23 23:30:28,042 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 9 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_10321ffd-2a79-4b20-bf29-0d8ff17e75fa/bin/uautomizer-verify-LYvppIcaGC/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-11-23 23:30:28,043 INFO L396 AbstractCegarLoop]: === Iteration 9 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONMEMORY_LEAK === [P2Err0ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr1ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr0ASSERT_VIOLATIONMEMORY_LEAK (and 4 more)] === [2024-11-23 23:30:28,043 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-23 23:30:28,043 INFO L85 PathProgramCache]: Analyzing trace with hash 1600149403, now seen corresponding path program 4 times [2024-11-23 23:30:28,043 INFO L118 FreeRefinementEngine]: Executing refinement strategy FOX [2024-11-23 23:30:28,043 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleZ3 [533443104] [2024-11-23 23:30:28,043 INFO L95 rtionOrderModulation]: Changing assertion order to TERMS_WITH_SMALL_CONSTANTS_FIRST [2024-11-23 23:30:28,044 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-11-23 23:30:28,044 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_10321ffd-2a79-4b20-bf29-0d8ff17e75fa/bin/uautomizer-verify-LYvppIcaGC/z3 [2024-11-23 23:30:28,046 INFO L229 MonitoredProcess]: Starting monitored process 10 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_10321ffd-2a79-4b20-bf29-0d8ff17e75fa/bin/uautomizer-verify-LYvppIcaGC/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2024-11-23 23:30:28,047 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_10321ffd-2a79-4b20-bf29-0d8ff17e75fa/bin/uautomizer-verify-LYvppIcaGC/z3 -smt2 -in SMTLIB2_COMPLIANT=true (10)] Waiting until timeout for monitored process [2024-11-23 23:30:28,139 INFO L229 tOrderPrioritization]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 0 check-sat command(s) [2024-11-23 23:30:28,139 INFO L230 tOrderPrioritization]: Conjunction of SSA is unsat [2024-11-23 23:30:28,141 INFO L256 TraceCheckSpWp]: Trace formula consists of 98 conjuncts, 9 conjuncts are in the unsatisfiable core [2024-11-23 23:30:28,142 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2024-11-23 23:30:28,229 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-23 23:30:28,230 INFO L308 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2024-11-23 23:30:28,230 INFO L136 FreeRefinementEngine]: Strategy FOX found an infeasible trace [2024-11-23 23:30:28,230 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [533443104] [2024-11-23 23:30:28,230 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [533443104] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-23 23:30:28,230 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-23 23:30:28,230 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2024-11-23 23:30:28,230 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1413428731] [2024-11-23 23:30:28,231 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-23 23:30:28,231 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2024-11-23 23:30:28,231 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy FOX [2024-11-23 23:30:28,231 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2024-11-23 23:30:28,231 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=12, Invalid=30, Unknown=0, NotChecked=0, Total=42 [2024-11-23 23:30:28,251 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 18 out of 46 [2024-11-23 23:30:28,251 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 74 places, 73 transitions, 403 flow. Second operand has 7 states, 7 states have (on average 20.714285714285715) internal successors, (145), 7 states have internal predecessors, (145), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-23 23:30:28,251 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-11-23 23:30:28,251 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 18 of 46 [2024-11-23 23:30:28,252 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-11-23 23:30:28,705 INFO L124 PetriNetUnfolderBase]: 662/1286 cut-off events. [2024-11-23 23:30:28,705 INFO L125 PetriNetUnfolderBase]: For 698/698 co-relation queries the response was YES. [2024-11-23 23:30:28,710 INFO L83 FinitePrefix]: Finished finitePrefix Result has 3315 conditions, 1286 events. 662/1286 cut-off events. For 698/698 co-relation queries the response was YES. Maximal size of possible extension queue 72. Compared 6986 event pairs, 163 based on Foata normal form. 8/1252 useless extension candidates. Maximal degree in co-relation 3295. Up to 578 conditions per place. [2024-11-23 23:30:28,714 INFO L140 encePairwiseOnDemand]: 40/46 looper letters, 36 selfloop transitions, 2 changer transitions 43/113 dead transitions. [2024-11-23 23:30:28,714 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 76 places, 113 transitions, 679 flow [2024-11-23 23:30:28,715 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2024-11-23 23:30:28,715 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 7 states. [2024-11-23 23:30:28,715 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 7 states to 7 states and 181 transitions. [2024-11-23 23:30:28,715 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.562111801242236 [2024-11-23 23:30:28,715 INFO L175 Difference]: Start difference. First operand has 74 places, 73 transitions, 403 flow. Second operand 7 states and 181 transitions. [2024-11-23 23:30:28,715 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 76 places, 113 transitions, 679 flow [2024-11-23 23:30:28,718 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 72 places, 113 transitions, 659 flow, removed 7 selfloop flow, removed 4 redundant places. [2024-11-23 23:30:28,720 INFO L231 Difference]: Finished difference. Result has 77 places, 63 transitions, 321 flow [2024-11-23 23:30:28,720 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=46, PETRI_DIFFERENCE_MINUEND_FLOW=389, PETRI_DIFFERENCE_MINUEND_PLACES=66, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=73, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=2, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=71, PETRI_DIFFERENCE_SUBTRAHEND_STATES=7, PETRI_FLOW=321, PETRI_PLACES=77, PETRI_TRANSITIONS=63} [2024-11-23 23:30:28,721 INFO L279 CegarLoopForPetriNet]: 51 programPoint places, 26 predicate places. [2024-11-23 23:30:28,721 INFO L471 AbstractCegarLoop]: Abstraction has has 77 places, 63 transitions, 321 flow [2024-11-23 23:30:28,721 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 7 states, 7 states have (on average 20.714285714285715) internal successors, (145), 7 states have internal predecessors, (145), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-23 23:30:28,721 INFO L198 CegarLoopForPetriNet]: Found error trace [2024-11-23 23:30:28,721 INFO L206 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-23 23:30:28,733 INFO L552 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_10321ffd-2a79-4b20-bf29-0d8ff17e75fa/bin/uautomizer-verify-LYvppIcaGC/z3 -smt2 -in SMTLIB2_COMPLIANT=true (10)] Ended with exit code 0 [2024-11-23 23:30:28,922 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 10 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_10321ffd-2a79-4b20-bf29-0d8ff17e75fa/bin/uautomizer-verify-LYvppIcaGC/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-11-23 23:30:28,923 INFO L396 AbstractCegarLoop]: === Iteration 10 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONMEMORY_LEAK === [P2Err0ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr1ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr0ASSERT_VIOLATIONMEMORY_LEAK (and 4 more)] === [2024-11-23 23:30:28,923 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-23 23:30:28,923 INFO L85 PathProgramCache]: Analyzing trace with hash 2125264439, now seen corresponding path program 5 times [2024-11-23 23:30:28,924 INFO L118 FreeRefinementEngine]: Executing refinement strategy FOX [2024-11-23 23:30:28,924 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleZ3 [226108382] [2024-11-23 23:30:28,924 INFO L95 rtionOrderModulation]: Changing assertion order to INSIDE_LOOP_FIRST1 [2024-11-23 23:30:28,924 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-11-23 23:30:28,924 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_10321ffd-2a79-4b20-bf29-0d8ff17e75fa/bin/uautomizer-verify-LYvppIcaGC/z3 [2024-11-23 23:30:28,926 INFO L229 MonitoredProcess]: Starting monitored process 11 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_10321ffd-2a79-4b20-bf29-0d8ff17e75fa/bin/uautomizer-verify-LYvppIcaGC/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2024-11-23 23:30:28,931 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_10321ffd-2a79-4b20-bf29-0d8ff17e75fa/bin/uautomizer-verify-LYvppIcaGC/z3 -smt2 -in SMTLIB2_COMPLIANT=true (11)] Waiting until timeout for monitored process [2024-11-23 23:30:29,036 INFO L229 tOrderPrioritization]: Assert order INSIDE_LOOP_FIRST1 issued 1 check-sat command(s) [2024-11-23 23:30:29,036 INFO L230 tOrderPrioritization]: Conjunction of SSA is unsat [2024-11-23 23:30:29,040 INFO L256 TraceCheckSpWp]: Trace formula consists of 141 conjuncts, 11 conjuncts are in the unsatisfiable core [2024-11-23 23:30:29,042 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2024-11-23 23:30:29,220 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-23 23:30:29,220 INFO L308 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2024-11-23 23:30:29,220 INFO L136 FreeRefinementEngine]: Strategy FOX found an infeasible trace [2024-11-23 23:30:29,221 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [226108382] [2024-11-23 23:30:29,221 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [226108382] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-23 23:30:29,221 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-23 23:30:29,221 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2024-11-23 23:30:29,221 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1181437108] [2024-11-23 23:30:29,221 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-23 23:30:29,222 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 9 states [2024-11-23 23:30:29,222 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy FOX [2024-11-23 23:30:29,222 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2024-11-23 23:30:29,223 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=18, Invalid=54, Unknown=0, NotChecked=0, Total=72 [2024-11-23 23:30:29,278 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 15 out of 46 [2024-11-23 23:30:29,278 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 77 places, 63 transitions, 321 flow. Second operand has 9 states, 9 states have (on average 17.444444444444443) internal successors, (157), 9 states have internal predecessors, (157), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-23 23:30:29,279 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-11-23 23:30:29,279 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 15 of 46 [2024-11-23 23:30:29,279 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-11-23 23:30:29,850 INFO L124 PetriNetUnfolderBase]: 736/1354 cut-off events. [2024-11-23 23:30:29,851 INFO L125 PetriNetUnfolderBase]: For 748/766 co-relation queries the response was YES. [2024-11-23 23:30:29,856 INFO L83 FinitePrefix]: Finished finitePrefix Result has 3510 conditions, 1354 events. 736/1354 cut-off events. For 748/766 co-relation queries the response was YES. Maximal size of possible extension queue 70. Compared 6742 event pairs, 164 based on Foata normal form. 16/1362 useless extension candidates. Maximal degree in co-relation 3488. Up to 576 conditions per place. [2024-11-23 23:30:29,859 INFO L140 encePairwiseOnDemand]: 36/46 looper letters, 38 selfloop transitions, 12 changer transitions 48/110 dead transitions. [2024-11-23 23:30:29,859 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 80 places, 110 transitions, 665 flow [2024-11-23 23:30:29,859 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2024-11-23 23:30:29,860 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 9 states. [2024-11-23 23:30:29,860 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 9 states to 9 states and 215 transitions. [2024-11-23 23:30:29,860 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.5193236714975845 [2024-11-23 23:30:29,861 INFO L175 Difference]: Start difference. First operand has 77 places, 63 transitions, 321 flow. Second operand 9 states and 215 transitions. [2024-11-23 23:30:29,861 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 80 places, 110 transitions, 665 flow [2024-11-23 23:30:29,863 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 74 places, 110 transitions, 638 flow, removed 8 selfloop flow, removed 6 redundant places. [2024-11-23 23:30:29,865 INFO L231 Difference]: Finished difference. Result has 79 places, 52 transitions, 263 flow [2024-11-23 23:30:29,865 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=46, PETRI_DIFFERENCE_MINUEND_FLOW=300, PETRI_DIFFERENCE_MINUEND_PLACES=66, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=63, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=12, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=51, PETRI_DIFFERENCE_SUBTRAHEND_STATES=9, PETRI_FLOW=263, PETRI_PLACES=79, PETRI_TRANSITIONS=52} [2024-11-23 23:30:29,866 INFO L279 CegarLoopForPetriNet]: 51 programPoint places, 28 predicate places. [2024-11-23 23:30:29,866 INFO L471 AbstractCegarLoop]: Abstraction has has 79 places, 52 transitions, 263 flow [2024-11-23 23:30:29,866 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 9 states, 9 states have (on average 17.444444444444443) internal successors, (157), 9 states have internal predecessors, (157), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-23 23:30:29,866 INFO L198 CegarLoopForPetriNet]: Found error trace [2024-11-23 23:30:29,866 INFO L206 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-23 23:30:29,876 INFO L540 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_10321ffd-2a79-4b20-bf29-0d8ff17e75fa/bin/uautomizer-verify-LYvppIcaGC/z3 -smt2 -in SMTLIB2_COMPLIANT=true (11)] Forceful destruction successful, exit code 0 [2024-11-23 23:30:30,070 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 11 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_10321ffd-2a79-4b20-bf29-0d8ff17e75fa/bin/uautomizer-verify-LYvppIcaGC/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-11-23 23:30:30,070 INFO L396 AbstractCegarLoop]: === Iteration 11 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONMEMORY_LEAK === [P2Err0ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr1ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr0ASSERT_VIOLATIONMEMORY_LEAK (and 4 more)] === [2024-11-23 23:30:30,071 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-23 23:30:30,071 INFO L85 PathProgramCache]: Analyzing trace with hash 43885275, now seen corresponding path program 6 times [2024-11-23 23:30:30,071 INFO L118 FreeRefinementEngine]: Executing refinement strategy FOX [2024-11-23 23:30:30,071 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleZ3 [441705332] [2024-11-23 23:30:30,071 INFO L95 rtionOrderModulation]: Changing assertion order to MIX_INSIDE_OUTSIDE [2024-11-23 23:30:30,071 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-11-23 23:30:30,072 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_10321ffd-2a79-4b20-bf29-0d8ff17e75fa/bin/uautomizer-verify-LYvppIcaGC/z3 [2024-11-23 23:30:30,075 INFO L229 MonitoredProcess]: Starting monitored process 12 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_10321ffd-2a79-4b20-bf29-0d8ff17e75fa/bin/uautomizer-verify-LYvppIcaGC/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2024-11-23 23:30:30,077 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_10321ffd-2a79-4b20-bf29-0d8ff17e75fa/bin/uautomizer-verify-LYvppIcaGC/z3 -smt2 -in SMTLIB2_COMPLIANT=true (12)] Waiting until timeout for monitored process [2024-11-23 23:30:30,179 INFO L229 tOrderPrioritization]: Assert order MIX_INSIDE_OUTSIDE issued 1 check-sat command(s) [2024-11-23 23:30:30,180 INFO L230 tOrderPrioritization]: Conjunction of SSA is unsat [2024-11-23 23:30:30,181 INFO L256 TraceCheckSpWp]: Trace formula consists of 141 conjuncts, 22 conjuncts are in the unsatisfiable core [2024-11-23 23:30:30,183 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2024-11-23 23:30:31,147 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-23 23:30:31,147 INFO L308 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2024-11-23 23:30:31,148 INFO L136 FreeRefinementEngine]: Strategy FOX found an infeasible trace [2024-11-23 23:30:31,148 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [441705332] [2024-11-23 23:30:31,148 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [441705332] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-23 23:30:31,148 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-23 23:30:31,148 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [10] imperfect sequences [] total 10 [2024-11-23 23:30:31,148 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [425055180] [2024-11-23 23:30:31,148 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-23 23:30:31,149 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 11 states [2024-11-23 23:30:31,149 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy FOX [2024-11-23 23:30:31,149 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 11 interpolants. [2024-11-23 23:30:31,149 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=22, Invalid=88, Unknown=0, NotChecked=0, Total=110 [2024-11-23 23:30:31,225 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 17 out of 46 [2024-11-23 23:30:31,225 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 79 places, 52 transitions, 263 flow. Second operand has 11 states, 11 states have (on average 18.818181818181817) internal successors, (207), 11 states have internal predecessors, (207), 0 states have call successors, (0), 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-23 23:30:31,225 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-11-23 23:30:31,226 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 17 of 46 [2024-11-23 23:30:31,226 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-11-23 23:30:32,034 INFO L124 PetriNetUnfolderBase]: 610/1145 cut-off events. [2024-11-23 23:30:32,035 INFO L125 PetriNetUnfolderBase]: For 799/835 co-relation queries the response was YES. [2024-11-23 23:30:32,040 INFO L83 FinitePrefix]: Finished finitePrefix Result has 2812 conditions, 1145 events. 610/1145 cut-off events. For 799/835 co-relation queries the response was YES. Maximal size of possible extension queue 72. Compared 5667 event pairs, 202 based on Foata normal form. 30/1168 useless extension candidates. Maximal degree in co-relation 2796. Up to 453 conditions per place. [2024-11-23 23:30:32,043 INFO L140 encePairwiseOnDemand]: 33/46 looper letters, 40 selfloop transitions, 11 changer transitions 32/97 dead transitions. [2024-11-23 23:30:32,043 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 84 places, 97 transitions, 553 flow [2024-11-23 23:30:32,044 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 12 states. [2024-11-23 23:30:32,044 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 12 states. [2024-11-23 23:30:32,045 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 12 states to 12 states and 274 transitions. [2024-11-23 23:30:32,046 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.4963768115942029 [2024-11-23 23:30:32,046 INFO L175 Difference]: Start difference. First operand has 79 places, 52 transitions, 263 flow. Second operand 12 states and 274 transitions. [2024-11-23 23:30:32,046 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 84 places, 97 transitions, 553 flow [2024-11-23 23:30:32,049 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 74 places, 97 transitions, 511 flow, removed 9 selfloop flow, removed 10 redundant places. [2024-11-23 23:30:32,050 INFO L231 Difference]: Finished difference. Result has 80 places, 49 transitions, 240 flow [2024-11-23 23:30:32,051 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=46, PETRI_DIFFERENCE_MINUEND_FLOW=229, PETRI_DIFFERENCE_MINUEND_PLACES=63, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=52, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=10, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=41, PETRI_DIFFERENCE_SUBTRAHEND_STATES=12, PETRI_FLOW=240, PETRI_PLACES=80, PETRI_TRANSITIONS=49} [2024-11-23 23:30:32,051 INFO L279 CegarLoopForPetriNet]: 51 programPoint places, 29 predicate places. [2024-11-23 23:30:32,051 INFO L471 AbstractCegarLoop]: Abstraction has has 80 places, 49 transitions, 240 flow [2024-11-23 23:30:32,052 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 11 states, 11 states have (on average 18.818181818181817) internal successors, (207), 11 states have internal predecessors, (207), 0 states have call successors, (0), 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-23 23:30:32,052 INFO L198 CegarLoopForPetriNet]: Found error trace [2024-11-23 23:30:32,052 INFO L206 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-23 23:30:32,062 INFO L540 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_10321ffd-2a79-4b20-bf29-0d8ff17e75fa/bin/uautomizer-verify-LYvppIcaGC/z3 -smt2 -in SMTLIB2_COMPLIANT=true (12)] Forceful destruction successful, exit code 0 [2024-11-23 23:30:32,252 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 12 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_10321ffd-2a79-4b20-bf29-0d8ff17e75fa/bin/uautomizer-verify-LYvppIcaGC/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-11-23 23:30:32,252 INFO L396 AbstractCegarLoop]: === Iteration 12 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONMEMORY_LEAK === [P2Err0ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr1ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr0ASSERT_VIOLATIONMEMORY_LEAK (and 4 more)] === [2024-11-23 23:30:32,253 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-23 23:30:32,253 INFO L85 PathProgramCache]: Analyzing trace with hash -108372671, now seen corresponding path program 7 times [2024-11-23 23:30:32,253 INFO L118 FreeRefinementEngine]: Executing refinement strategy FOX [2024-11-23 23:30:32,254 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleZ3 [96940734] [2024-11-23 23:30:32,254 INFO L95 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2024-11-23 23:30:32,254 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-11-23 23:30:32,254 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_10321ffd-2a79-4b20-bf29-0d8ff17e75fa/bin/uautomizer-verify-LYvppIcaGC/z3 [2024-11-23 23:30:32,255 INFO L229 MonitoredProcess]: Starting monitored process 13 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_10321ffd-2a79-4b20-bf29-0d8ff17e75fa/bin/uautomizer-verify-LYvppIcaGC/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2024-11-23 23:30:32,257 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_10321ffd-2a79-4b20-bf29-0d8ff17e75fa/bin/uautomizer-verify-LYvppIcaGC/z3 -smt2 -in SMTLIB2_COMPLIANT=true (13)] Waiting until timeout for monitored process [2024-11-23 23:30:32,360 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-11-23 23:30:32,360 INFO L357 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2024-11-23 23:30:32,399 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-11-23 23:30:32,482 INFO L130 FreeRefinementEngine]: Strategy FOX found a feasible trace [2024-11-23 23:30:32,482 INFO L340 BasicCegarLoop]: Counterexample is feasible [2024-11-23 23:30:32,483 INFO L782 garLoopResultBuilder]: Registering result UNSAFE for location ULTIMATE.startErr0ASSERT_VIOLATIONMEMORY_LEAK (6 of 7 remaining) [2024-11-23 23:30:32,485 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location P2Err0ASSERT_VIOLATIONMEMORY_LEAK (5 of 7 remaining) [2024-11-23 23:30:32,486 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr1ASSERT_VIOLATIONMEMORY_LEAK (4 of 7 remaining) [2024-11-23 23:30:32,486 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (3 of 7 remaining) [2024-11-23 23:30:32,487 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (2 of 7 remaining) [2024-11-23 23:30:32,487 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr2INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (1 of 7 remaining) [2024-11-23 23:30:32,487 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location P2Err0ASSERT_VIOLATIONMEMORY_LEAK (0 of 7 remaining) [2024-11-23 23:30:32,498 INFO L540 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_10321ffd-2a79-4b20-bf29-0d8ff17e75fa/bin/uautomizer-verify-LYvppIcaGC/z3 -smt2 -in SMTLIB2_COMPLIANT=true (13)] Forceful destruction successful, exit code 0 [2024-11-23 23:30:32,687 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 13 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_10321ffd-2a79-4b20-bf29-0d8ff17e75fa/bin/uautomizer-verify-LYvppIcaGC/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-11-23 23:30:32,688 INFO L422 BasicCegarLoop]: Path program histogram: [7, 1, 1, 1, 1, 1] [2024-11-23 23:30:32,786 INFO L241 ceAbstractionStarter]: Analysis of concurrent program completed with 1 thread instances [2024-11-23 23:30:32,788 INFO L170 ceAbstractionStarter]: Computing trace abstraction results [2024-11-23 23:30:32,796 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 23.11 11:30:32 BasicIcfg [2024-11-23 23:30:32,796 INFO L131 PluginConnector]: ------------------------ END TraceAbstraction---------------------------- [2024-11-23 23:30:32,797 INFO L112 PluginConnector]: ------------------------Witness Printer---------------------------- [2024-11-23 23:30:32,799 INFO L270 PluginConnector]: Initializing Witness Printer... [2024-11-23 23:30:32,799 INFO L274 PluginConnector]: Witness Printer initialized [2024-11-23 23:30:32,800 INFO L184 PluginConnector]: Executing the observer RCFGCatcher from plugin Witness Printer for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 23.11 11:30:18" (3/4) ... [2024-11-23 23:30:32,801 INFO L149 WitnessPrinter]: No result that supports witness generation found [2024-11-23 23:30:32,802 INFO L131 PluginConnector]: ------------------------ END Witness Printer---------------------------- [2024-11-23 23:30:32,803 INFO L158 Benchmark]: Toolchain (without parser) took 16475.43ms. Allocated memory was 117.4MB in the beginning and 369.1MB in the end (delta: 251.7MB). Free memory was 91.3MB in the beginning and 238.5MB in the end (delta: -147.1MB). Peak memory consumption was 101.8MB. Max. memory is 16.1GB. [2024-11-23 23:30:32,803 INFO L158 Benchmark]: CDTParser took 0.42ms. Allocated memory is still 117.4MB. Free memory is still 81.9MB. There was no memory consumed. Max. memory is 16.1GB. [2024-11-23 23:30:32,804 INFO L158 Benchmark]: CACSL2BoogieTranslator took 702.74ms. Allocated memory is still 117.4MB. Free memory was 91.1MB in the beginning and 67.1MB in the end (delta: 24.0MB). Peak memory consumption was 25.2MB. Max. memory is 16.1GB. [2024-11-23 23:30:32,804 INFO L158 Benchmark]: Boogie Procedure Inliner took 45.20ms. Allocated memory is still 117.4MB. Free memory was 67.1MB in the beginning and 64.6MB in the end (delta: 2.5MB). There was no memory consumed. Max. memory is 16.1GB. [2024-11-23 23:30:32,804 INFO L158 Benchmark]: Boogie Preprocessor took 58.20ms. Allocated memory is still 117.4MB. Free memory was 64.6MB in the beginning and 61.4MB in the end (delta: 3.2MB). Peak memory consumption was 8.4MB. Max. memory is 16.1GB. [2024-11-23 23:30:32,804 INFO L158 Benchmark]: RCFGBuilder took 1231.98ms. Allocated memory was 117.4MB in the beginning and 251.7MB in the end (delta: 134.2MB). Free memory was 61.4MB in the beginning and 215.8MB in the end (delta: -154.4MB). Peak memory consumption was 26.9MB. Max. memory is 16.1GB. [2024-11-23 23:30:32,805 INFO L158 Benchmark]: TraceAbstraction took 14424.22ms. Allocated memory was 251.7MB in the beginning and 369.1MB in the end (delta: 117.4MB). Free memory was 215.1MB in the beginning and 238.6MB in the end (delta: -23.4MB). Peak memory consumption was 95.1MB. Max. memory is 16.1GB. [2024-11-23 23:30:32,805 INFO L158 Benchmark]: Witness Printer took 5.53ms. Allocated memory is still 369.1MB. Free memory was 238.6MB in the beginning and 238.5MB in the end (delta: 92.2kB). There was no memory consumed. Max. memory is 16.1GB. [2024-11-23 23:30:32,807 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.42ms. Allocated memory is still 117.4MB. Free memory is still 81.9MB. There was no memory consumed. Max. memory is 16.1GB. * CACSL2BoogieTranslator took 702.74ms. Allocated memory is still 117.4MB. Free memory was 91.1MB in the beginning and 67.1MB in the end (delta: 24.0MB). Peak memory consumption was 25.2MB. Max. memory is 16.1GB. * Boogie Procedure Inliner took 45.20ms. Allocated memory is still 117.4MB. Free memory was 67.1MB in the beginning and 64.6MB in the end (delta: 2.5MB). There was no memory consumed. Max. memory is 16.1GB. * Boogie Preprocessor took 58.20ms. Allocated memory is still 117.4MB. Free memory was 64.6MB in the beginning and 61.4MB in the end (delta: 3.2MB). Peak memory consumption was 8.4MB. Max. memory is 16.1GB. * RCFGBuilder took 1231.98ms. Allocated memory was 117.4MB in the beginning and 251.7MB in the end (delta: 134.2MB). Free memory was 61.4MB in the beginning and 215.8MB in the end (delta: -154.4MB). Peak memory consumption was 26.9MB. Max. memory is 16.1GB. * TraceAbstraction took 14424.22ms. Allocated memory was 251.7MB in the beginning and 369.1MB in the end (delta: 117.4MB). Free memory was 215.1MB in the beginning and 238.6MB in the end (delta: -23.4MB). Peak memory consumption was 95.1MB. Max. memory is 16.1GB. * Witness Printer took 5.53ms. Allocated memory is still 369.1MB. Free memory was 238.6MB in the beginning and 238.5MB in the end (delta: 92.2kB). There was no memory consumed. Max. memory is 16.1GB. * Results from de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: - UnprovableResult [Line: 17]: Unable to prove that all allocated memory was freed Unable to prove that all allocated memory was freed Reason: overapproximation of memtrack at line 17. Possible FailurePath: [L709] 0 int __unbuffered_cnt = 0; [L711] 0 int __unbuffered_p0_EAX = 0; [L713] 0 int __unbuffered_p1_EAX = 0; [L715] 0 int __unbuffered_p1_EBX = 0; [L717] 0 int __unbuffered_p2_EAX = 0; [L719] 0 int __unbuffered_p2_EBX = 0; [L720] 0 _Bool main$tmp_guard0; [L721] 0 _Bool main$tmp_guard1; [L723] 0 int x = 0; [L725] 0 int y = 0; [L726] 0 _Bool y$flush_delayed; [L727] 0 int y$mem_tmp; [L728] 0 _Bool y$r_buff0_thd0; [L729] 0 _Bool y$r_buff0_thd1; [L730] 0 _Bool y$r_buff0_thd2; [L731] 0 _Bool y$r_buff0_thd3; [L732] 0 _Bool y$r_buff1_thd0; [L733] 0 _Bool y$r_buff1_thd1; [L734] 0 _Bool y$r_buff1_thd2; [L735] 0 _Bool y$r_buff1_thd3; [L736] 0 _Bool y$read_delayed; [L737] 0 int *y$read_delayed_var; [L738] 0 int y$w_buff0; [L739] 0 _Bool y$w_buff0_used; [L740] 0 int y$w_buff1; [L741] 0 _Bool y$w_buff1_used; [L743] 0 int z = 0; [L744] 0 _Bool weak$$choice0; [L745] 0 _Bool weak$$choice2; [L848] 0 pthread_t t65; [L849] FCALL, FORK 0 pthread_create(&t65, ((void *)0), P0, ((void *)0)) VAL [\old(arg)={0:0}, __unbuffered_cnt=0, __unbuffered_p0_EAX=0, __unbuffered_p1_EAX=0, __unbuffered_p1_EBX=0, __unbuffered_p2_EAX=0, __unbuffered_p2_EBX=0, main$tmp_guard0=0, main$tmp_guard1=0, t65=-1, weak$$choice0=0, weak$$choice2=0, x=0, y$flush_delayed=0, y$mem_tmp=0, y$r_buff0_thd0=0, y$r_buff0_thd1=0, y$r_buff0_thd2=0, y$r_buff0_thd3=0, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$r_buff1_thd3=0, y$read_delayed=0, y$read_delayed_var={0:0}, y$w_buff0=0, y$w_buff0_used=0, y$w_buff1=0, y$w_buff1_used=0, y=0, z=0] [L850] 0 pthread_t t66; [L851] FCALL, FORK 0 pthread_create(&t66, ((void *)0), P1, ((void *)0)) VAL [\old(arg)={0:0}, \old(arg)={0:0}, __unbuffered_cnt=0, __unbuffered_p0_EAX=0, __unbuffered_p1_EAX=0, __unbuffered_p1_EBX=0, __unbuffered_p2_EAX=0, __unbuffered_p2_EBX=0, main$tmp_guard0=0, main$tmp_guard1=0, t65=-1, t66=0, weak$$choice0=0, weak$$choice2=0, x=0, y$flush_delayed=0, y$mem_tmp=0, y$r_buff0_thd0=0, y$r_buff0_thd1=0, y$r_buff0_thd2=0, y$r_buff0_thd3=0, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$r_buff1_thd3=0, y$read_delayed=0, y$read_delayed_var={0:0}, y$w_buff0=0, y$w_buff0_used=0, y$w_buff1=0, y$w_buff1_used=0, y=0, z=0] [L852] 0 pthread_t t67; [L853] FCALL, FORK 0 pthread_create(&t67, ((void *)0), P2, ((void *)0)) VAL [\old(arg)={0:0}, \old(arg)={0:0}, __unbuffered_cnt=0, __unbuffered_p0_EAX=0, __unbuffered_p1_EAX=0, __unbuffered_p1_EBX=0, __unbuffered_p2_EAX=0, __unbuffered_p2_EBX=0, main$tmp_guard0=0, main$tmp_guard1=0, t65=-1, t66=0, t67=1, weak$$choice0=0, weak$$choice2=0, x=0, y$flush_delayed=0, y$mem_tmp=0, y$r_buff0_thd0=0, y$r_buff0_thd1=0, y$r_buff0_thd2=0, y$r_buff0_thd3=0, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$r_buff1_thd3=0, y$read_delayed=0, y$read_delayed_var={0:0}, y$w_buff0=0, y$w_buff0_used=0, y$w_buff1=0, y$w_buff1_used=0, y=0, z=0] [L795] 3 y$w_buff1 = y$w_buff0 [L796] 3 y$w_buff0 = 1 [L797] 3 y$w_buff1_used = y$w_buff0_used [L798] 3 y$w_buff0_used = (_Bool)1 [L799] CALL 3 __VERIFIER_assert(!(y$w_buff1_used && y$w_buff0_used)) [L18] COND FALSE 3 !(!expression) [L799] RET 3 __VERIFIER_assert(!(y$w_buff1_used && y$w_buff0_used)) [L800] 3 y$r_buff1_thd0 = y$r_buff0_thd0 [L801] 3 y$r_buff1_thd1 = y$r_buff0_thd1 [L802] 3 y$r_buff1_thd2 = y$r_buff0_thd2 [L803] 3 y$r_buff1_thd3 = y$r_buff0_thd3 [L804] 3 y$r_buff0_thd3 = (_Bool)1 VAL [\old(arg)={0:0}, \old(arg)={0:0}, \old(arg)={0:0}, __unbuffered_cnt=0, __unbuffered_p0_EAX=0, __unbuffered_p1_EAX=0, __unbuffered_p1_EBX=0, __unbuffered_p2_EAX=0, __unbuffered_p2_EBX=0, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=0, x=0, y$flush_delayed=0, y$mem_tmp=0, y$r_buff0_thd0=0, y$r_buff0_thd1=0, y$r_buff0_thd2=0, y$r_buff0_thd3=1, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$r_buff1_thd3=0, y$read_delayed=0, y$read_delayed_var={0:0}, y$w_buff0=1, y$w_buff0_used=1, y$w_buff1=0, y$w_buff1_used=0, y=0, z=0] [L807] 3 weak$$choice0 = __VERIFIER_nondet_bool() [L808] 3 weak$$choice2 = __VERIFIER_nondet_bool() [L809] 3 y$flush_delayed = weak$$choice2 [L810] 3 y$mem_tmp = y [L811] 3 y = !y$w_buff0_used || !y$r_buff0_thd3 && !y$w_buff1_used || !y$r_buff0_thd3 && !y$r_buff1_thd3 ? y : (y$w_buff0_used && y$r_buff0_thd3 ? y$w_buff0 : y$w_buff1) [L812] 3 y$w_buff0 = weak$$choice2 ? y$w_buff0 : (!y$w_buff0_used || !y$r_buff0_thd3 && !y$w_buff1_used || !y$r_buff0_thd3 && !y$r_buff1_thd3 ? y$w_buff0 : (y$w_buff0_used && y$r_buff0_thd3 ? y$w_buff0 : y$w_buff0)) [L813] 3 y$w_buff1 = weak$$choice2 ? y$w_buff1 : (!y$w_buff0_used || !y$r_buff0_thd3 && !y$w_buff1_used || !y$r_buff0_thd3 && !y$r_buff1_thd3 ? y$w_buff1 : (y$w_buff0_used && y$r_buff0_thd3 ? y$w_buff1 : y$w_buff1)) [L814] 3 y$w_buff0_used = weak$$choice2 ? y$w_buff0_used : (!y$w_buff0_used || !y$r_buff0_thd3 && !y$w_buff1_used || !y$r_buff0_thd3 && !y$r_buff1_thd3 ? y$w_buff0_used : (y$w_buff0_used && y$r_buff0_thd3 ? (_Bool)0 : y$w_buff0_used)) [L815] 3 y$w_buff1_used = weak$$choice2 ? y$w_buff1_used : (!y$w_buff0_used || !y$r_buff0_thd3 && !y$w_buff1_used || !y$r_buff0_thd3 && !y$r_buff1_thd3 ? y$w_buff1_used : (y$w_buff0_used && y$r_buff0_thd3 ? (_Bool)0 : (_Bool)0)) [L816] 3 y$r_buff0_thd3 = weak$$choice2 ? y$r_buff0_thd3 : (!y$w_buff0_used || !y$r_buff0_thd3 && !y$w_buff1_used || !y$r_buff0_thd3 && !y$r_buff1_thd3 ? y$r_buff0_thd3 : (y$w_buff0_used && y$r_buff0_thd3 ? (_Bool)0 : y$r_buff0_thd3)) [L817] 3 y$r_buff1_thd3 = weak$$choice2 ? y$r_buff1_thd3 : (!y$w_buff0_used || !y$r_buff0_thd3 && !y$w_buff1_used || !y$r_buff0_thd3 && !y$r_buff1_thd3 ? y$r_buff1_thd3 : (y$w_buff0_used && y$r_buff0_thd3 ? (_Bool)0 : (_Bool)0)) [L818] 3 __unbuffered_p2_EAX = y [L819] 3 y = y$flush_delayed ? y$mem_tmp : y [L820] 3 y$flush_delayed = (_Bool)0 VAL [\old(arg)={0:0}, \old(arg)={0:0}, \old(arg)={0:0}, __unbuffered_cnt=0, __unbuffered_p0_EAX=0, __unbuffered_p1_EAX=0, __unbuffered_p1_EBX=0, __unbuffered_p2_EAX=1, __unbuffered_p2_EBX=0, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=1, x=0, y$flush_delayed=0, y$mem_tmp=0, y$r_buff0_thd0=0, y$r_buff0_thd1=0, y$r_buff0_thd2=0, y$r_buff0_thd3=1, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$r_buff1_thd3=0, y$read_delayed=0, y$read_delayed_var={0:0}, y$w_buff0=1, y$w_buff0_used=1, y$w_buff1=0, y$w_buff1_used=0, y=0, z=0] [L823] 3 __unbuffered_p2_EBX = z VAL [\old(arg)={0:0}, \old(arg)={0:0}, \old(arg)={0:0}, __unbuffered_cnt=0, __unbuffered_p0_EAX=0, __unbuffered_p1_EAX=0, __unbuffered_p1_EBX=0, __unbuffered_p2_EAX=1, __unbuffered_p2_EBX=0, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=1, x=0, y$flush_delayed=0, y$mem_tmp=0, y$r_buff0_thd0=0, y$r_buff0_thd1=0, y$r_buff0_thd2=0, y$r_buff0_thd3=1, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$r_buff1_thd3=0, y$read_delayed=0, y$read_delayed_var={0:0}, y$w_buff0=1, y$w_buff0_used=1, y$w_buff1=0, y$w_buff1_used=0, y=0, z=0] [L749] 1 z = 1 VAL [\old(arg)={0:0}, \old(arg)={0:0}, __unbuffered_cnt=0, __unbuffered_p0_EAX=0, __unbuffered_p1_EAX=0, __unbuffered_p1_EBX=0, __unbuffered_p2_EAX=1, __unbuffered_p2_EBX=0, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=1, x=0, y$flush_delayed=0, y$mem_tmp=0, y$r_buff0_thd0=0, y$r_buff0_thd1=0, y$r_buff0_thd2=0, y$r_buff0_thd3=1, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$r_buff1_thd3=0, y$read_delayed=0, y$read_delayed_var={0:0}, y$w_buff0=1, y$w_buff0_used=1, y$w_buff1=0, y$w_buff1_used=0, y=0, z=1] [L752] 1 __unbuffered_p0_EAX = x VAL [\old(arg)={0:0}, \old(arg)={0:0}, __unbuffered_cnt=0, __unbuffered_p0_EAX=0, __unbuffered_p1_EAX=0, __unbuffered_p1_EBX=0, __unbuffered_p2_EAX=1, __unbuffered_p2_EBX=0, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=1, x=0, y$flush_delayed=0, y$mem_tmp=0, y$r_buff0_thd0=0, y$r_buff0_thd1=0, y$r_buff0_thd2=0, y$r_buff0_thd3=1, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$r_buff1_thd3=0, y$read_delayed=0, y$read_delayed_var={0:0}, y$w_buff0=1, y$w_buff0_used=1, y$w_buff1=0, y$w_buff1_used=0, y=0, z=1] [L764] 2 x = 1 VAL [\old(arg)={0:0}, \old(arg)={0:0}, __unbuffered_cnt=0, __unbuffered_p0_EAX=0, __unbuffered_p1_EAX=0, __unbuffered_p1_EBX=0, __unbuffered_p2_EAX=1, __unbuffered_p2_EBX=0, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=1, x=1, y$flush_delayed=0, y$mem_tmp=0, y$r_buff0_thd0=0, y$r_buff0_thd1=0, y$r_buff0_thd2=0, y$r_buff0_thd3=1, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$r_buff1_thd3=0, y$read_delayed=0, y$read_delayed_var={0:0}, y$w_buff0=1, y$w_buff0_used=1, y$w_buff1=0, y$w_buff1_used=0, y=0, z=1] [L767] 2 __unbuffered_p1_EAX = x VAL [\old(arg)={0:0}, \old(arg)={0:0}, __unbuffered_cnt=0, __unbuffered_p0_EAX=0, __unbuffered_p1_EAX=1, __unbuffered_p1_EBX=0, __unbuffered_p2_EAX=1, __unbuffered_p2_EBX=0, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=1, x=1, y$flush_delayed=0, y$mem_tmp=0, y$r_buff0_thd0=0, y$r_buff0_thd1=0, y$r_buff0_thd2=0, y$r_buff0_thd3=1, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$r_buff1_thd3=0, y$read_delayed=0, y$read_delayed_var={0:0}, y$w_buff0=1, y$w_buff0_used=1, y$w_buff1=0, y$w_buff1_used=0, y=0, z=1] [L770] 2 weak$$choice0 = __VERIFIER_nondet_bool() [L771] 2 weak$$choice2 = __VERIFIER_nondet_bool() [L772] 2 y$flush_delayed = weak$$choice2 [L773] 2 y$mem_tmp = y [L774] 2 y = !y$w_buff0_used || !y$r_buff0_thd2 && !y$w_buff1_used || !y$r_buff0_thd2 && !y$r_buff1_thd2 ? y : (y$w_buff0_used && y$r_buff0_thd2 ? y$w_buff0 : y$w_buff1) [L775] 2 y$w_buff0 = weak$$choice2 ? y$w_buff0 : (!y$w_buff0_used || !y$r_buff0_thd2 && !y$w_buff1_used || !y$r_buff0_thd2 && !y$r_buff1_thd2 ? y$w_buff0 : (y$w_buff0_used && y$r_buff0_thd2 ? y$w_buff0 : y$w_buff0)) [L776] 2 y$w_buff1 = weak$$choice2 ? y$w_buff1 : (!y$w_buff0_used || !y$r_buff0_thd2 && !y$w_buff1_used || !y$r_buff0_thd2 && !y$r_buff1_thd2 ? y$w_buff1 : (y$w_buff0_used && y$r_buff0_thd2 ? y$w_buff1 : y$w_buff1)) [L777] 2 y$w_buff0_used = weak$$choice2 ? y$w_buff0_used : (!y$w_buff0_used || !y$r_buff0_thd2 && !y$w_buff1_used || !y$r_buff0_thd2 && !y$r_buff1_thd2 ? y$w_buff0_used : (y$w_buff0_used && y$r_buff0_thd2 ? (_Bool)0 : y$w_buff0_used)) [L778] 2 y$w_buff1_used = weak$$choice2 ? y$w_buff1_used : (!y$w_buff0_used || !y$r_buff0_thd2 && !y$w_buff1_used || !y$r_buff0_thd2 && !y$r_buff1_thd2 ? y$w_buff1_used : (y$w_buff0_used && y$r_buff0_thd2 ? (_Bool)0 : (_Bool)0)) [L779] 2 y$r_buff0_thd2 = weak$$choice2 ? y$r_buff0_thd2 : (!y$w_buff0_used || !y$r_buff0_thd2 && !y$w_buff1_used || !y$r_buff0_thd2 && !y$r_buff1_thd2 ? y$r_buff0_thd2 : (y$w_buff0_used && y$r_buff0_thd2 ? (_Bool)0 : y$r_buff0_thd2)) [L780] 2 y$r_buff1_thd2 = weak$$choice2 ? y$r_buff1_thd2 : (!y$w_buff0_used || !y$r_buff0_thd2 && !y$w_buff1_used || !y$r_buff0_thd2 && !y$r_buff1_thd2 ? y$r_buff1_thd2 : (y$w_buff0_used && y$r_buff0_thd2 ? (_Bool)0 : (_Bool)0)) [L781] 2 __unbuffered_p1_EBX = y [L782] 2 y = y$flush_delayed ? y$mem_tmp : y [L783] 2 y$flush_delayed = (_Bool)0 VAL [\old(arg)={0:0}, \old(arg)={0:0}, __unbuffered_cnt=0, __unbuffered_p0_EAX=0, __unbuffered_p1_EAX=1, __unbuffered_p1_EBX=0, __unbuffered_p2_EAX=1, __unbuffered_p2_EBX=0, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=1, x=1, y$flush_delayed=0, y$mem_tmp=0, y$r_buff0_thd0=0, y$r_buff0_thd1=0, y$r_buff0_thd2=0, y$r_buff0_thd3=1, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$r_buff1_thd3=0, y$read_delayed=0, y$read_delayed_var={0:0}, y$w_buff0=1, y$w_buff0_used=1, y$w_buff1=0, y$w_buff1_used=0, y=0, z=1] [L757] 1 __unbuffered_cnt = __unbuffered_cnt + 1 VAL [\old(arg)={0:0}, \old(arg)={0:0}, __unbuffered_cnt=1, __unbuffered_p0_EAX=0, __unbuffered_p1_EAX=1, __unbuffered_p1_EBX=0, __unbuffered_p2_EAX=1, __unbuffered_p2_EBX=0, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=1, x=1, y$flush_delayed=0, y$mem_tmp=0, y$r_buff0_thd0=0, y$r_buff0_thd1=0, y$r_buff0_thd2=0, y$r_buff0_thd3=1, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$r_buff1_thd3=0, y$read_delayed=0, y$read_delayed_var={0:0}, y$w_buff0=1, y$w_buff0_used=1, y$w_buff1=0, y$w_buff1_used=0, y=0, z=1] [L826] 3 y = y$w_buff0_used && y$r_buff0_thd3 ? y$w_buff0 : (y$w_buff1_used && y$r_buff1_thd3 ? y$w_buff1 : y) [L827] 3 y$w_buff0_used = y$w_buff0_used && y$r_buff0_thd3 ? (_Bool)0 : y$w_buff0_used [L828] 3 y$w_buff1_used = y$w_buff0_used && y$r_buff0_thd3 || y$w_buff1_used && y$r_buff1_thd3 ? (_Bool)0 : y$w_buff1_used [L829] 3 y$r_buff0_thd3 = y$w_buff0_used && y$r_buff0_thd3 ? (_Bool)0 : y$r_buff0_thd3 [L830] 3 y$r_buff1_thd3 = y$w_buff0_used && y$r_buff0_thd3 || y$w_buff1_used && y$r_buff1_thd3 ? (_Bool)0 : y$r_buff1_thd3 VAL [\old(arg)={0:0}, \old(arg)={0:0}, \old(arg)={0:0}, __unbuffered_cnt=1, __unbuffered_p0_EAX=0, __unbuffered_p1_EAX=1, __unbuffered_p1_EBX=0, __unbuffered_p2_EAX=1, __unbuffered_p2_EBX=0, arg={0:0}, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=1, x=1, y$flush_delayed=0, y$mem_tmp=0, y$r_buff0_thd0=0, y$r_buff0_thd1=0, y$r_buff0_thd2=0, y$r_buff0_thd3=1, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$r_buff1_thd3=0, y$read_delayed=0, y$read_delayed_var={0:0}, y$w_buff0=1, y$w_buff0_used=0, y$w_buff1=0, y$w_buff1_used=0, y=1, z=1] [L833] 3 __unbuffered_cnt = __unbuffered_cnt + 1 VAL [\old(arg)={0:0}, \old(arg)={0:0}, \old(arg)={0:0}, __unbuffered_cnt=2, __unbuffered_p0_EAX=0, __unbuffered_p1_EAX=1, __unbuffered_p1_EBX=0, __unbuffered_p2_EAX=1, __unbuffered_p2_EBX=0, arg={0:0}, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=1, x=1, y$flush_delayed=0, y$mem_tmp=0, y$r_buff0_thd0=0, y$r_buff0_thd1=0, y$r_buff0_thd2=0, y$r_buff0_thd3=1, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$r_buff1_thd3=0, y$read_delayed=0, y$read_delayed_var={0:0}, y$w_buff0=1, y$w_buff0_used=0, y$w_buff1=0, y$w_buff1_used=0, y=1, z=1] [L788] 2 __unbuffered_cnt = __unbuffered_cnt + 1 VAL [\old(arg)={0:0}, \old(arg)={0:0}, __unbuffered_cnt=3, __unbuffered_p0_EAX=0, __unbuffered_p1_EAX=1, __unbuffered_p1_EBX=0, __unbuffered_p2_EAX=1, __unbuffered_p2_EBX=0, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=1, x=1, y$flush_delayed=0, y$mem_tmp=0, y$r_buff0_thd0=0, y$r_buff0_thd1=0, y$r_buff0_thd2=0, y$r_buff0_thd3=1, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$r_buff1_thd3=0, y$read_delayed=0, y$read_delayed_var={0:0}, y$w_buff0=1, y$w_buff0_used=0, y$w_buff1=0, y$w_buff1_used=0, y=1, z=1] [L855] 0 main$tmp_guard0 = __unbuffered_cnt == 3 VAL [\old(arg)={0:0}, \old(arg)={0:0}, __unbuffered_cnt=3, __unbuffered_p0_EAX=0, __unbuffered_p1_EAX=1, __unbuffered_p1_EBX=0, __unbuffered_p2_EAX=1, __unbuffered_p2_EBX=0, arg={0:0}, arg={0:0}, main$tmp_guard0=1, main$tmp_guard1=0, t65=-1, t66=0, t67=1, weak$$choice0=0, weak$$choice2=1, x=1, y$flush_delayed=0, y$mem_tmp=0, y$r_buff0_thd0=0, y$r_buff0_thd1=0, y$r_buff0_thd2=0, y$r_buff0_thd3=1, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$r_buff1_thd3=0, y$read_delayed=0, y$read_delayed_var={0:0}, y$w_buff0=1, y$w_buff0_used=0, y$w_buff1=0, y$w_buff1_used=0, y=1, z=1] [L857] CALL 0 assume_abort_if_not(main$tmp_guard0) [L3] COND FALSE 0 !(!cond) [L857] RET 0 assume_abort_if_not(main$tmp_guard0) [L859] 0 y = y$w_buff0_used && y$r_buff0_thd0 ? y$w_buff0 : (y$w_buff1_used && y$r_buff1_thd0 ? y$w_buff1 : y) [L860] 0 y$w_buff0_used = y$w_buff0_used && y$r_buff0_thd0 ? (_Bool)0 : y$w_buff0_used [L861] 0 y$w_buff1_used = y$w_buff0_used && y$r_buff0_thd0 || y$w_buff1_used && y$r_buff1_thd0 ? (_Bool)0 : y$w_buff1_used [L862] 0 y$r_buff0_thd0 = y$w_buff0_used && y$r_buff0_thd0 ? (_Bool)0 : y$r_buff0_thd0 [L863] 0 y$r_buff1_thd0 = y$w_buff0_used && y$r_buff0_thd0 || y$w_buff1_used && y$r_buff1_thd0 ? (_Bool)0 : y$r_buff1_thd0 VAL [\old(arg)={0:0}, \old(arg)={0:0}, __unbuffered_cnt=3, __unbuffered_p0_EAX=0, __unbuffered_p1_EAX=1, __unbuffered_p1_EBX=0, __unbuffered_p2_EAX=1, __unbuffered_p2_EBX=0, arg={0:0}, arg={0:0}, main$tmp_guard0=1, main$tmp_guard1=0, t65=-1, t66=0, t67=1, weak$$choice0=0, weak$$choice2=1, x=1, y$flush_delayed=0, y$mem_tmp=0, y$r_buff0_thd0=0, y$r_buff0_thd1=0, y$r_buff0_thd2=0, y$r_buff0_thd3=1, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$r_buff1_thd3=0, y$read_delayed=0, y$read_delayed_var={0:0}, y$w_buff0=1, y$w_buff0_used=0, y$w_buff1=0, y$w_buff1_used=0, y=1, z=1] [L866] 0 main$tmp_guard1 = !(__unbuffered_p0_EAX == 0 && __unbuffered_p1_EAX == 1 && __unbuffered_p1_EBX == 0 && __unbuffered_p2_EAX == 1 && __unbuffered_p2_EBX == 0) VAL [\old(arg)={0:0}, \old(arg)={0:0}, __unbuffered_cnt=3, __unbuffered_p0_EAX=0, __unbuffered_p1_EAX=1, __unbuffered_p1_EBX=0, __unbuffered_p2_EAX=1, __unbuffered_p2_EBX=0, arg={0:0}, arg={0:0}, main$tmp_guard0=1, main$tmp_guard1=0, t65=-1, t66=0, t67=1, weak$$choice0=0, weak$$choice2=1, x=1, y$flush_delayed=0, y$mem_tmp=0, y$r_buff0_thd0=0, y$r_buff0_thd1=0, y$r_buff0_thd2=0, y$r_buff0_thd3=1, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$r_buff1_thd3=0, y$read_delayed=0, y$read_delayed_var={0:0}, y$w_buff0=1, y$w_buff0_used=0, y$w_buff1=0, y$w_buff1_used=0, y=1, z=1] [L868] CALL 0 __VERIFIER_assert(main$tmp_guard1) [L18] COND TRUE 0 !expression [L18] CALL 0 reach_error() [L17] COND FALSE 0 !(0) VAL [\old(arg)={0:0}, \old(arg)={0:0}, __unbuffered_cnt=3, __unbuffered_p0_EAX=0, __unbuffered_p1_EAX=1, __unbuffered_p1_EBX=0, __unbuffered_p2_EAX=1, __unbuffered_p2_EBX=0, arg={0:0}, arg={0:0}, main$tmp_guard0=1, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=1, x=1, y$flush_delayed=0, y$mem_tmp=0, y$r_buff0_thd0=0, y$r_buff0_thd1=0, y$r_buff0_thd2=0, y$r_buff0_thd3=1, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$r_buff1_thd3=0, y$read_delayed=0, y$read_delayed_var={0:0}, y$w_buff0=1, y$w_buff0_used=0, y$w_buff1=0, y$w_buff1_used=0, y=1, z=1] [L17] 0 __assert_fail ("0", "mix003_power.opt_pso.opt_rmo.opt_tso.opt.c", 8, __extension__ __PRETTY_FUNCTION__) VAL [\old(arg)={0:0}, \old(arg)={0:0}, __unbuffered_cnt=3, __unbuffered_p0_EAX=0, __unbuffered_p1_EAX=1, __unbuffered_p1_EBX=0, __unbuffered_p2_EAX=1, __unbuffered_p2_EBX=0, arg={0:0}, arg={0:0}, main$tmp_guard0=1, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=1, x=1, y$flush_delayed=0, y$mem_tmp=0, y$r_buff0_thd0=0, y$r_buff0_thd1=0, y$r_buff0_thd2=0, y$r_buff0_thd3=1, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$r_buff1_thd3=0, y$read_delayed=0, y$read_delayed_var={0:0}, y$w_buff0=1, y$w_buff0_used=0, y$w_buff1=0, y$w_buff1_used=0, y=1, z=1] - UnprovableResult [Line: 17]: Unable to prove that all allocated memory was freed Unable to prove that all allocated memory was freed Reason: Not analyzed. - UnprovableResult [Line: 846]: Unable to prove that all allocated memory was freed Unable to prove that all allocated memory was freed Reason: Not analyzed. - UnprovableResult [Line: 851]: Unable to prove that petrification did provide enough thread instances (tool internal message) Unable to prove that petrification did provide enough thread instances (tool internal message) Reason: Not analyzed. - UnprovableResult [Line: 853]: Unable to prove that petrification did provide enough thread instances (tool internal message) Unable to prove that petrification did provide enough thread instances (tool internal message) Reason: Not analyzed. - UnprovableResult [Line: 849]: 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, 72 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: 14.2s, OverallIterations: 12, TraceHistogramMax: 1, PathProgramHistogramMax: 7, EmptinessCheckTime: 0.0s, AutomataDifference: 6.5s, DeadEndRemovalTime: 0.0s, HoareAnnotationTime: 0.0s, InitialAbstractionConstructionTime: 0.1s, HoareTripleCheckerStatistics: 0 mSolverCounterUnknown, 578 SdHoareTripleChecker+Valid, 3.2s IncrementalHoareTripleChecker+Time, 0 mSdLazyCounter, 544 mSDsluCounter, 406 SdHoareTripleChecker+Invalid, 2.6s Time, 0 mProtectedAction, 0 SdHoareTripleChecker+Unchecked, 0 IncrementalHoareTripleChecker+Unchecked, 389 mSDsCounter, 29 IncrementalHoareTripleChecker+Valid, 0 mProtectedPredicate, 2554 IncrementalHoareTripleChecker+Invalid, 2583 SdHoareTripleChecker+Unknown, 0 mSolverCounterNotChecked, 29 mSolverCounterUnsat, 17 mSDtfsCounter, 2554 mSolverCounterSat, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Unknown, PredicateUnifierStatistics: 0 DeclaredPredicates, 299 GetRequests, 211 SyntacticMatches, 0 SemanticMatches, 88 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 116 ImplicationChecksByTransitivity, 1.2s Time, 0.0s BasicInterpolantAutomatonTime, BiggestAbstraction: size=403occurred in iteration=8, InterpolantAutomatonStates: 80, traceCheckStatistics: No data available, InterpolantConsolidationStatistics: No data available, PathInvariantsStatistics: No data available, 0/0 InterpolantCoveringCapability, TotalInterpolationStatistics: No data available, 0.0s DumpTime, AutomataMinimizationStatistics: No data available, HoareAnnotationStatistics: No data available, RefinementEngineStatistics: TRACE_CHECK: 0.3s SsaConstructionTime, 0.3s SatisfiabilityAnalysisTime, 3.5s InterpolantComputationTime, 308 NumberOfCodeBlocks, 307 NumberOfCodeBlocksAsserted, 12 NumberOfCheckSat, 265 ConstructedInterpolants, 0 QuantifiedInterpolants, 1672 SizeOfPredicates, 58 NumberOfNonLiveVariables, 1230 ConjunctsInSsa, 105 ConjunctsInUnsatCore, 11 InterpolantComputations, 11 PerfectInterpolantSequences, 0/0 InterpolantCoveringCapability, INVARIANT_SYNTHESIS: No data available, INTERPOLANT_CONSOLIDATION: No data available, ABSTRACT_INTERPRETATION: No data available, PDR: No data available, ACCELERATED_INTERPOLATION: No data available, SIFA: No data available, ReuseStatistics: No data available, ConComCheckerStatistics: No data available RESULT: Ultimate could not prove your program: unable to determine feasibility of some traces [2024-11-23 23:30:32,827 INFO L552 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_10321ffd-2a79-4b20-bf29-0d8ff17e75fa/bin/uautomizer-verify-LYvppIcaGC/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