./Ultimate.py --spec ../../sv-benchmarks/c/properties/valid-memsafety.prp --file ../../sv-benchmarks/c/pthread-wmm/safe011_power.oepc_pso.oepc_rmo.oepc_rmo.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_6dde6ab7-fc66-4d3a-b16e-411b0308ee99/bin/uautomizer-verify-LYvppIcaGC/data/config -Xmx15G -Xms4m -jar /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_6dde6ab7-fc66-4d3a-b16e-411b0308ee99/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_6dde6ab7-fc66-4d3a-b16e-411b0308ee99/bin/uautomizer-verify-LYvppIcaGC/data -tc /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_6dde6ab7-fc66-4d3a-b16e-411b0308ee99/bin/uautomizer-verify-LYvppIcaGC/config/AutomizerMemDerefMemtrack.xml -i ../../sv-benchmarks/c/pthread-wmm/safe011_power.oepc_pso.oepc_rmo.oepc_rmo.opt.i -s /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_6dde6ab7-fc66-4d3a-b16e-411b0308ee99/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_6dde6ab7-fc66-4d3a-b16e-411b0308ee99/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 2bbc774c97831725ad05d6c2dc910981cb4ce0a2559ec0561efc45418b96b7a4 --- Real Ultimate output --- This is Ultimate 0.3.0-dev-6497de0 [2024-11-24 00:51:05,681 INFO L188 SettingsManager]: Resetting all preferences to default values... [2024-11-24 00:51:05,769 INFO L114 SettingsManager]: Loading settings from /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_6dde6ab7-fc66-4d3a-b16e-411b0308ee99/bin/uautomizer-verify-LYvppIcaGC/config/svcomp-DerefFreeMemtrack-32bit-Automizer_Default.epf [2024-11-24 00:51:05,775 WARN L101 SettingsManager]: Preference file contains the following unknown settings: [2024-11-24 00:51:05,775 WARN L103 SettingsManager]: * de.uni_freiburg.informatik.ultimate.core.Log level for class [2024-11-24 00:51:05,803 INFO L130 SettingsManager]: Preferences different from defaults after loading the file: [2024-11-24 00:51:05,803 INFO L151 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2024-11-24 00:51:05,804 INFO L153 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2024-11-24 00:51:05,804 INFO L151 SettingsManager]: Preferences of Boogie Preprocessor differ from their defaults: [2024-11-24 00:51:05,804 INFO L153 SettingsManager]: * Use memory slicer=true [2024-11-24 00:51:05,804 INFO L151 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2024-11-24 00:51:05,804 INFO L153 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2024-11-24 00:51:05,805 INFO L151 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2024-11-24 00:51:05,805 INFO L153 SettingsManager]: * Create parallel compositions if possible=false [2024-11-24 00:51:05,805 INFO L153 SettingsManager]: * Use SBE=true [2024-11-24 00:51:05,805 INFO L151 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2024-11-24 00:51:05,805 INFO L153 SettingsManager]: * sizeof long=4 [2024-11-24 00:51:05,805 INFO L153 SettingsManager]: * Overapproximate operations on floating types=true [2024-11-24 00:51:05,805 INFO L153 SettingsManager]: * sizeof POINTER=4 [2024-11-24 00:51:05,805 INFO L153 SettingsManager]: * Check division by zero=IGNORE [2024-11-24 00:51:05,805 INFO L153 SettingsManager]: * Check for the main procedure if all allocated memory was freed=true [2024-11-24 00:51:05,806 INFO L153 SettingsManager]: * Bitprecise bitfields=true [2024-11-24 00:51:05,806 INFO L153 SettingsManager]: * SV-COMP memtrack compatibility mode=true [2024-11-24 00:51:05,806 INFO L153 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2024-11-24 00:51:05,806 INFO L153 SettingsManager]: * Adapt memory model on pointer casts if necessary=true [2024-11-24 00:51:05,806 INFO L153 SettingsManager]: * Check unreachability of reach_error function=false [2024-11-24 00:51:05,806 INFO L153 SettingsManager]: * sizeof long double=12 [2024-11-24 00:51:05,806 INFO L153 SettingsManager]: * Behaviour of calls to undefined functions=OVERAPPROXIMATE_BEHAVIOUR [2024-11-24 00:51:05,806 INFO L153 SettingsManager]: * Use constant arrays=true [2024-11-24 00:51:05,806 INFO L151 SettingsManager]: Preferences of IcfgBuilder differ from their defaults: [2024-11-24 00:51:05,806 INFO L153 SettingsManager]: * Size of a code block=SequenceOfStatements [2024-11-24 00:51:05,807 INFO L153 SettingsManager]: * Only consider context switches at boundaries of atomic blocks=true [2024-11-24 00:51:05,807 INFO L153 SettingsManager]: * SMT solver=External_DefaultMode [2024-11-24 00:51:05,807 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2024-11-24 00:51:05,807 INFO L151 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2024-11-24 00:51:05,807 INFO L153 SettingsManager]: * Size of a code block=SequenceOfStatements [2024-11-24 00:51:05,807 INFO L153 SettingsManager]: * Only consider context switches at boundaries of atomic blocks=true [2024-11-24 00:51:05,807 INFO L153 SettingsManager]: * SMT solver=External_DefaultMode [2024-11-24 00:51:05,807 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2024-11-24 00:51:05,807 INFO L151 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2024-11-24 00:51:05,807 INFO L153 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2024-11-24 00:51:05,807 INFO L153 SettingsManager]: * Trace refinement strategy=CAMEL [2024-11-24 00:51:05,808 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2024-11-24 00:51:05,808 INFO L153 SettingsManager]: * Apply one-shot large block encoding in concurrent analysis=false [2024-11-24 00:51:05,808 INFO L153 SettingsManager]: * Automaton type used in concurrency analysis=PETRI_NET [2024-11-24 00:51:05,808 INFO L153 SettingsManager]: * Order on configurations for Petri net unfoldings=DBO [2024-11-24 00:51:05,808 INFO L153 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2024-11-24 00:51:05,808 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_6dde6ab7-fc66-4d3a-b16e-411b0308ee99/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 -> 2bbc774c97831725ad05d6c2dc910981cb4ce0a2559ec0561efc45418b96b7a4 [2024-11-24 00:51:06,101 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2024-11-24 00:51:06,112 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2024-11-24 00:51:06,117 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2024-11-24 00:51:06,119 INFO L270 PluginConnector]: Initializing CDTParser... [2024-11-24 00:51:06,120 INFO L274 PluginConnector]: CDTParser initialized [2024-11-24 00:51:06,121 INFO L431 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_6dde6ab7-fc66-4d3a-b16e-411b0308ee99/bin/uautomizer-verify-LYvppIcaGC/../../sv-benchmarks/c/pthread-wmm/safe011_power.oepc_pso.oepc_rmo.oepc_rmo.opt.i [2024-11-24 00:51:09,028 INFO L533 CDTParser]: Created temporary CDT project at /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_6dde6ab7-fc66-4d3a-b16e-411b0308ee99/bin/uautomizer-verify-LYvppIcaGC/data/fef9b6297/f72dd77b79a844e1b0c96e73c1453e00/FLAGbdcf818a9 [2024-11-24 00:51:09,422 INFO L384 CDTParser]: Found 1 translation units. [2024-11-24 00:51:09,422 INFO L180 CDTParser]: Scanning /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_6dde6ab7-fc66-4d3a-b16e-411b0308ee99/sv-benchmarks/c/pthread-wmm/safe011_power.oepc_pso.oepc_rmo.oepc_rmo.opt.i [2024-11-24 00:51:09,438 INFO L427 CDTParser]: About to delete temporary CDT project at /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_6dde6ab7-fc66-4d3a-b16e-411b0308ee99/bin/uautomizer-verify-LYvppIcaGC/data/fef9b6297/f72dd77b79a844e1b0c96e73c1453e00/FLAGbdcf818a9 [2024-11-24 00:51:09,461 INFO L435 CDTParser]: Successfully deleted /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_6dde6ab7-fc66-4d3a-b16e-411b0308ee99/bin/uautomizer-verify-LYvppIcaGC/data/fef9b6297/f72dd77b79a844e1b0c96e73c1453e00 [2024-11-24 00:51:09,465 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2024-11-24 00:51:09,468 INFO L133 ToolchainWalker]: Walking toolchain with 6 elements. [2024-11-24 00:51:09,469 INFO L112 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2024-11-24 00:51:09,469 INFO L270 PluginConnector]: Initializing CACSL2BoogieTranslator... [2024-11-24 00:51:09,475 INFO L274 PluginConnector]: CACSL2BoogieTranslator initialized [2024-11-24 00:51:09,476 INFO L184 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 24.11 12:51:09" (1/1) ... [2024-11-24 00:51:09,479 INFO L204 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@8b899ac and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 24.11 12:51:09, skipping insertion in model container [2024-11-24 00:51:09,479 INFO L184 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 24.11 12:51:09" (1/1) ... [2024-11-24 00:51:09,542 INFO L175 MainTranslator]: Built tables and reachable declarations [2024-11-24 00:51:10,007 INFO L210 PostProcessor]: Analyzing one entry point: main [2024-11-24 00:51:10,019 INFO L200 MainTranslator]: Completed pre-run [2024-11-24 00:51:10,079 INFO L210 PostProcessor]: Analyzing one entry point: main [2024-11-24 00:51:10,116 INFO L204 MainTranslator]: Completed translation [2024-11-24 00:51:10,117 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 24.11 12:51:10 WrapperNode [2024-11-24 00:51:10,117 INFO L131 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2024-11-24 00:51:10,118 INFO L112 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2024-11-24 00:51:10,118 INFO L270 PluginConnector]: Initializing Boogie Procedure Inliner... [2024-11-24 00:51:10,118 INFO L274 PluginConnector]: Boogie Procedure Inliner initialized [2024-11-24 00:51:10,125 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 24.11 12:51:10" (1/1) ... [2024-11-24 00:51:10,143 INFO L184 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 24.11 12:51:10" (1/1) ... [2024-11-24 00:51:10,171 INFO L138 Inliner]: procedures = 175, calls = 43, calls flagged for inlining = 6, calls inlined = 7, statements flattened = 137 [2024-11-24 00:51:10,172 INFO L131 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2024-11-24 00:51:10,172 INFO L112 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2024-11-24 00:51:10,173 INFO L270 PluginConnector]: Initializing Boogie Preprocessor... [2024-11-24 00:51:10,173 INFO L274 PluginConnector]: Boogie Preprocessor initialized [2024-11-24 00:51:10,182 INFO L184 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 24.11 12:51:10" (1/1) ... [2024-11-24 00:51:10,182 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 24.11 12:51:10" (1/1) ... [2024-11-24 00:51:10,186 INFO L184 PluginConnector]: Executing the observer MemorySlicer from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 24.11 12:51:10" (1/1) ... [2024-11-24 00:51:10,202 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-24 00:51:10,202 INFO L184 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 24.11 12:51:10" (1/1) ... [2024-11-24 00:51:10,202 INFO L184 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 24.11 12:51:10" (1/1) ... [2024-11-24 00:51:10,210 INFO L184 PluginConnector]: Executing the observer ReplaceArrayAssignments from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 24.11 12:51:10" (1/1) ... [2024-11-24 00:51:10,211 INFO L184 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 24.11 12:51:10" (1/1) ... [2024-11-24 00:51:10,213 INFO L184 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 24.11 12:51:10" (1/1) ... [2024-11-24 00:51:10,215 INFO L184 PluginConnector]: Executing the observer LTLStepAnnotator from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 24.11 12:51:10" (1/1) ... [2024-11-24 00:51:10,216 INFO L184 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 24.11 12:51:10" (1/1) ... [2024-11-24 00:51:10,220 INFO L131 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2024-11-24 00:51:10,220 INFO L112 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2024-11-24 00:51:10,221 INFO L270 PluginConnector]: Initializing RCFGBuilder... [2024-11-24 00:51:10,221 INFO L274 PluginConnector]: RCFGBuilder initialized [2024-11-24 00:51:10,222 INFO L184 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 24.11 12:51:10" (1/1) ... [2024-11-24 00:51:10,228 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2024-11-24 00:51:10,247 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_6dde6ab7-fc66-4d3a-b16e-411b0308ee99/bin/uautomizer-verify-LYvppIcaGC/z3 [2024-11-24 00:51:10,268 INFO L229 MonitoredProcess]: Starting monitored process 1 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_6dde6ab7-fc66-4d3a-b16e-411b0308ee99/bin/uautomizer-verify-LYvppIcaGC/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 (exit command is (exit), workingDir is null) [2024-11-24 00:51:10,272 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_6dde6ab7-fc66-4d3a-b16e-411b0308ee99/bin/uautomizer-verify-LYvppIcaGC/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 (1)] Waiting until timeout for monitored process [2024-11-24 00:51:10,306 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_atomic_begin [2024-11-24 00:51:10,307 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2024-11-24 00:51:10,307 INFO L130 BoogieDeclarations]: Found specification of procedure P0 [2024-11-24 00:51:10,308 INFO L138 BoogieDeclarations]: Found implementation of procedure P0 [2024-11-24 00:51:10,308 INFO L130 BoogieDeclarations]: Found specification of procedure P1 [2024-11-24 00:51:10,308 INFO L138 BoogieDeclarations]: Found implementation of procedure P1 [2024-11-24 00:51:10,308 INFO L130 BoogieDeclarations]: Found specification of procedure P2 [2024-11-24 00:51:10,308 INFO L138 BoogieDeclarations]: Found implementation of procedure P2 [2024-11-24 00:51:10,308 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#0 [2024-11-24 00:51:10,308 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_atomic_end [2024-11-24 00:51:10,308 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2024-11-24 00:51:10,308 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2024-11-24 00:51:10,310 WARN L203 CfgBuilder]: User set CodeBlockSize to SequenceOfStatements but program contains fork statements. Overwriting the user preferences and setting CodeBlockSize to OneNontrivialStatement. [2024-11-24 00:51:10,502 INFO L234 CfgBuilder]: Building ICFG [2024-11-24 00:51:10,505 INFO L260 CfgBuilder]: Building CFG for each procedure with an implementation [2024-11-24 00:51:10,949 INFO L279 CfgBuilder]: Omitted future-live optimization because the input is a concurrent program. [2024-11-24 00:51:10,949 INFO L283 CfgBuilder]: Performing block encoding [2024-11-24 00:51:11,286 INFO L307 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2024-11-24 00:51:11,286 INFO L312 CfgBuilder]: Removed 0 assume(true) statements. [2024-11-24 00:51:11,287 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 24.11 12:51:11 BoogieIcfgContainer [2024-11-24 00:51:11,287 INFO L131 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2024-11-24 00:51:11,290 INFO L112 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2024-11-24 00:51:11,291 INFO L270 PluginConnector]: Initializing TraceAbstraction... [2024-11-24 00:51:11,297 INFO L274 PluginConnector]: TraceAbstraction initialized [2024-11-24 00:51:11,297 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 24.11 12:51:09" (1/3) ... [2024-11-24 00:51:11,298 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@4e2341b0 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 24.11 12:51:11, skipping insertion in model container [2024-11-24 00:51:11,298 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 24.11 12:51:10" (2/3) ... [2024-11-24 00:51:11,299 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@4e2341b0 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 24.11 12:51:11, skipping insertion in model container [2024-11-24 00:51:11,299 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 24.11 12:51:11" (3/3) ... [2024-11-24 00:51:11,300 INFO L128 eAbstractionObserver]: Analyzing ICFG safe011_power.oepc_pso.oepc_rmo.oepc_rmo.opt.i [2024-11-24 00:51:11,318 INFO L216 ceAbstractionStarter]: Automizer settings: Hoare:None NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2024-11-24 00:51:11,322 INFO L151 ceAbstractionStarter]: Applying trace abstraction to ICFG safe011_power.oepc_pso.oepc_rmo.oepc_rmo.opt.i that has 4 procedures, 43 locations, 1 initial locations, 0 loop locations, and 3 error locations. [2024-11-24 00:51:11,323 INFO L491 ceAbstractionStarter]: Constructing petrified ICFG for 1 thread instances. [2024-11-24 00:51:11,397 INFO L143 ThreadInstanceAdder]: Constructed 0 joinOtherThreadTransitions. [2024-11-24 00:51:11,445 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 52 places, 44 transitions, 100 flow [2024-11-24 00:51:11,497 INFO L124 PetriNetUnfolderBase]: 2/41 cut-off events. [2024-11-24 00:51:11,500 INFO L125 PetriNetUnfolderBase]: For 0/0 co-relation queries the response was YES. [2024-11-24 00:51:11,506 INFO L83 FinitePrefix]: Finished finitePrefix Result has 51 conditions, 41 events. 2/41 cut-off events. For 0/0 co-relation queries the response was YES. Maximal size of possible extension queue 4. Compared 76 event pairs, 0 based on Foata normal form. 0/36 useless extension candidates. Maximal degree in co-relation 43. Up to 2 conditions per place. [2024-11-24 00:51:11,506 INFO L82 GeneralOperation]: Start removeDead. Operand has 52 places, 44 transitions, 100 flow [2024-11-24 00:51:11,511 INFO L88 GeneralOperation]: Finished RemoveDead, result has has 49 places, 41 transitions, 91 flow [2024-11-24 00:51:11,525 INFO L332 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2024-11-24 00:51:11,545 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;@65b9de88, mLbeIndependenceSettings=[IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=false, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2024-11-24 00:51:11,545 INFO L334 AbstractCegarLoop]: Starting to check reachability of 7 error locations. [2024-11-24 00:51:11,557 INFO L185 PetriNetUnfolderBase]: Found word, exiting Unfolder. [2024-11-24 00:51:11,557 INFO L124 PetriNetUnfolderBase]: 0/5 cut-off events. [2024-11-24 00:51:11,557 INFO L125 PetriNetUnfolderBase]: For 0/0 co-relation queries the response was YES. [2024-11-24 00:51:11,558 INFO L198 CegarLoopForPetriNet]: Found error trace [2024-11-24 00:51:11,558 INFO L206 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1] [2024-11-24 00:51:11,559 INFO L396 AbstractCegarLoop]: === Iteration 1 === Targeting P0Err0ASSERT_VIOLATIONMEMORY_LEAK === [P0Err0ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr1ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr0ASSERT_VIOLATIONMEMORY_LEAK (and 4 more)] === [2024-11-24 00:51:11,567 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-24 00:51:11,568 INFO L85 PathProgramCache]: Analyzing trace with hash 11936538, now seen corresponding path program 1 times [2024-11-24 00:51:11,576 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-24 00:51:11,577 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1810624799] [2024-11-24 00:51:11,577 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-24 00:51:11,578 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-24 00:51:11,730 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-24 00:51:12,117 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-24 00:51:12,118 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-24 00:51:12,118 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1810624799] [2024-11-24 00:51:12,120 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1810624799] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-24 00:51:12,121 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-24 00:51:12,121 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [1] imperfect sequences [] total 1 [2024-11-24 00:51:12,122 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [430119022] [2024-11-24 00:51:12,123 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-24 00:51:12,153 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2024-11-24 00:51:12,158 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-24 00:51:12,180 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-11-24 00:51:12,180 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-11-24 00:51:12,182 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 19 out of 44 [2024-11-24 00:51:12,185 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 49 places, 41 transitions, 91 flow. Second operand has 3 states, 3 states have (on average 20.0) internal successors, (60), 3 states have internal predecessors, (60), 0 states have call successors, (0), 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-24 00:51:12,187 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-11-24 00:51:12,187 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 19 of 44 [2024-11-24 00:51:12,188 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-11-24 00:51:12,786 INFO L124 PetriNetUnfolderBase]: 680/1277 cut-off events. [2024-11-24 00:51:12,787 INFO L125 PetriNetUnfolderBase]: For 12/12 co-relation queries the response was YES. [2024-11-24 00:51:12,794 INFO L83 FinitePrefix]: Finished finitePrefix Result has 2353 conditions, 1277 events. 680/1277 cut-off events. For 12/12 co-relation queries the response was YES. Maximal size of possible extension queue 97. Compared 8336 event pairs, 104 based on Foata normal form. 72/1334 useless extension candidates. Maximal degree in co-relation 2342. Up to 844 conditions per place. [2024-11-24 00:51:12,806 INFO L140 encePairwiseOnDemand]: 39/44 looper letters, 33 selfloop transitions, 2 changer transitions 2/53 dead transitions. [2024-11-24 00:51:12,808 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 49 places, 53 transitions, 195 flow [2024-11-24 00:51:12,810 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-11-24 00:51:12,814 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2024-11-24 00:51:12,821 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 99 transitions. [2024-11-24 00:51:12,824 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.75 [2024-11-24 00:51:12,827 INFO L175 Difference]: Start difference. First operand has 49 places, 41 transitions, 91 flow. Second operand 3 states and 99 transitions. [2024-11-24 00:51:12,828 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 49 places, 53 transitions, 195 flow [2024-11-24 00:51:12,833 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 46 places, 53 transitions, 190 flow, removed 0 selfloop flow, removed 3 redundant places. [2024-11-24 00:51:12,837 INFO L231 Difference]: Finished difference. Result has 46 places, 36 transitions, 82 flow [2024-11-24 00:51:12,841 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=44, PETRI_DIFFERENCE_MINUEND_FLOW=80, PETRI_DIFFERENCE_MINUEND_PLACES=44, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=37, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=2, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=35, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=82, PETRI_PLACES=46, PETRI_TRANSITIONS=36} [2024-11-24 00:51:12,848 INFO L279 CegarLoopForPetriNet]: 49 programPoint places, -3 predicate places. [2024-11-24 00:51:12,848 INFO L471 AbstractCegarLoop]: Abstraction has has 46 places, 36 transitions, 82 flow [2024-11-24 00:51:12,849 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 20.0) internal successors, (60), 3 states have internal predecessors, (60), 0 states have call successors, (0), 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-24 00:51:12,849 INFO L198 CegarLoopForPetriNet]: Found error trace [2024-11-24 00:51:12,849 INFO L206 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-24 00:51:12,850 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable0 [2024-11-24 00:51:12,850 INFO L396 AbstractCegarLoop]: === Iteration 2 === Targeting ULTIMATE.startErr1ASSERT_VIOLATIONMEMORY_LEAK === [P0Err0ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr1ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr0ASSERT_VIOLATIONMEMORY_LEAK (and 4 more)] === [2024-11-24 00:51:12,851 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-24 00:51:12,852 INFO L85 PathProgramCache]: Analyzing trace with hash -1110516793, now seen corresponding path program 1 times [2024-11-24 00:51:12,852 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-24 00:51:12,852 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [3046591] [2024-11-24 00:51:12,852 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-24 00:51:12,853 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-24 00:51:12,926 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-24 00:51:13,045 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-24 00:51:13,045 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-24 00:51:13,045 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [3046591] [2024-11-24 00:51:13,046 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [3046591] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-24 00:51:13,046 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-24 00:51:13,046 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [1] imperfect sequences [] total 1 [2024-11-24 00:51:13,046 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1834785799] [2024-11-24 00:51:13,046 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-24 00:51:13,047 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2024-11-24 00:51:13,047 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-24 00:51:13,048 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-11-24 00:51:13,048 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-11-24 00:51:13,049 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 18 out of 44 [2024-11-24 00:51:13,050 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 46 places, 36 transitions, 82 flow. Second operand has 3 states, 3 states have (on average 22.333333333333332) internal successors, (67), 3 states have internal predecessors, (67), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-24 00:51:13,050 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-11-24 00:51:13,050 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 18 of 44 [2024-11-24 00:51:13,050 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-11-24 00:51:13,448 INFO L124 PetriNetUnfolderBase]: 605/1137 cut-off events. [2024-11-24 00:51:13,448 INFO L125 PetriNetUnfolderBase]: For 80/80 co-relation queries the response was YES. [2024-11-24 00:51:13,457 INFO L83 FinitePrefix]: Finished finitePrefix Result has 2181 conditions, 1137 events. 605/1137 cut-off events. For 80/80 co-relation queries the response was YES. Maximal size of possible extension queue 84. Compared 7025 event pairs, 605 based on Foata normal form. 36/1130 useless extension candidates. Maximal degree in co-relation 2171. Up to 926 conditions per place. [2024-11-24 00:51:13,466 INFO L140 encePairwiseOnDemand]: 42/44 looper letters, 18 selfloop transitions, 1 changer transitions 1/35 dead transitions. [2024-11-24 00:51:13,467 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 46 places, 35 transitions, 120 flow [2024-11-24 00:51:13,468 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-11-24 00:51:13,468 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2024-11-24 00:51:13,468 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 75 transitions. [2024-11-24 00:51:13,469 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.5681818181818182 [2024-11-24 00:51:13,469 INFO L175 Difference]: Start difference. First operand has 46 places, 36 transitions, 82 flow. Second operand 3 states and 75 transitions. [2024-11-24 00:51:13,469 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 46 places, 35 transitions, 120 flow [2024-11-24 00:51:13,470 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 44 places, 35 transitions, 116 flow, removed 0 selfloop flow, removed 2 redundant places. [2024-11-24 00:51:13,471 INFO L231 Difference]: Finished difference. Result has 44 places, 34 transitions, 76 flow [2024-11-24 00:51:13,471 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=44, PETRI_DIFFERENCE_MINUEND_FLOW=76, PETRI_DIFFERENCE_MINUEND_PLACES=42, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=35, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=1, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=34, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=76, PETRI_PLACES=44, PETRI_TRANSITIONS=34} [2024-11-24 00:51:13,473 INFO L279 CegarLoopForPetriNet]: 49 programPoint places, -5 predicate places. [2024-11-24 00:51:13,473 INFO L471 AbstractCegarLoop]: Abstraction has has 44 places, 34 transitions, 76 flow [2024-11-24 00:51:13,474 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 22.333333333333332) internal successors, (67), 3 states have internal predecessors, (67), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-24 00:51:13,474 INFO L198 CegarLoopForPetriNet]: Found error trace [2024-11-24 00:51:13,474 INFO L206 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-24 00:51:13,474 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1 [2024-11-24 00:51:13,474 INFO L396 AbstractCegarLoop]: === Iteration 3 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONMEMORY_LEAK === [P0Err0ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr1ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr0ASSERT_VIOLATIONMEMORY_LEAK (and 4 more)] === [2024-11-24 00:51:13,475 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-24 00:51:13,475 INFO L85 PathProgramCache]: Analyzing trace with hash -1110515302, now seen corresponding path program 1 times [2024-11-24 00:51:13,475 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-24 00:51:13,476 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [756122396] [2024-11-24 00:51:13,477 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-24 00:51:13,477 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-24 00:51:13,540 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-24 00:51:14,973 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-24 00:51:14,973 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-24 00:51:14,973 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [756122396] [2024-11-24 00:51:14,973 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [756122396] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-24 00:51:14,974 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-24 00:51:14,974 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2024-11-24 00:51:14,974 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [765496151] [2024-11-24 00:51:14,974 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-24 00:51:14,974 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2024-11-24 00:51:14,975 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-24 00:51:14,975 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2024-11-24 00:51:14,975 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=10, Invalid=20, Unknown=0, NotChecked=0, Total=30 [2024-11-24 00:51:14,997 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 15 out of 44 [2024-11-24 00:51:14,997 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 44 places, 34 transitions, 76 flow. Second operand has 6 states, 6 states have (on average 17.0) internal successors, (102), 6 states have internal predecessors, (102), 0 states have call successors, (0), 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-24 00:51:14,998 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-11-24 00:51:14,998 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 15 of 44 [2024-11-24 00:51:14,998 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-11-24 00:51:16,368 INFO L124 PetriNetUnfolderBase]: 2046/3482 cut-off events. [2024-11-24 00:51:16,369 INFO L125 PetriNetUnfolderBase]: For 0/0 co-relation queries the response was YES. [2024-11-24 00:51:16,379 INFO L83 FinitePrefix]: Finished finitePrefix Result has 6567 conditions, 3482 events. 2046/3482 cut-off events. For 0/0 co-relation queries the response was YES. Maximal size of possible extension queue 198. Compared 22482 event pairs, 295 based on Foata normal form. 0/3393 useless extension candidates. Maximal degree in co-relation 6561. Up to 1454 conditions per place. [2024-11-24 00:51:16,394 INFO L140 encePairwiseOnDemand]: 32/44 looper letters, 35 selfloop transitions, 8 changer transitions 71/125 dead transitions. [2024-11-24 00:51:16,395 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 54 places, 125 transitions, 486 flow [2024-11-24 00:51:16,395 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 12 states. [2024-11-24 00:51:16,395 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 12 states. [2024-11-24 00:51:16,397 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 12 states to 12 states and 297 transitions. [2024-11-24 00:51:16,397 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.5625 [2024-11-24 00:51:16,398 INFO L175 Difference]: Start difference. First operand has 44 places, 34 transitions, 76 flow. Second operand 12 states and 297 transitions. [2024-11-24 00:51:16,398 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 54 places, 125 transitions, 486 flow [2024-11-24 00:51:16,400 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 53 places, 125 transitions, 485 flow, removed 0 selfloop flow, removed 1 redundant places. [2024-11-24 00:51:16,404 INFO L231 Difference]: Finished difference. Result has 64 places, 39 transitions, 175 flow [2024-11-24 00:51:16,404 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=44, PETRI_DIFFERENCE_MINUEND_FLOW=75, PETRI_DIFFERENCE_MINUEND_PLACES=42, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=34, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=2, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=26, PETRI_DIFFERENCE_SUBTRAHEND_STATES=12, PETRI_FLOW=175, PETRI_PLACES=64, PETRI_TRANSITIONS=39} [2024-11-24 00:51:16,405 INFO L279 CegarLoopForPetriNet]: 49 programPoint places, 15 predicate places. [2024-11-24 00:51:16,405 INFO L471 AbstractCegarLoop]: Abstraction has has 64 places, 39 transitions, 175 flow [2024-11-24 00:51:16,406 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 17.0) internal successors, (102), 6 states have internal predecessors, (102), 0 states have call successors, (0), 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-24 00:51:16,406 INFO L198 CegarLoopForPetriNet]: Found error trace [2024-11-24 00:51:16,406 INFO L206 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-24 00:51:16,406 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2 [2024-11-24 00:51:16,406 INFO L396 AbstractCegarLoop]: === Iteration 4 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONMEMORY_LEAK === [P0Err0ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr1ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr0ASSERT_VIOLATIONMEMORY_LEAK (and 4 more)] === [2024-11-24 00:51:16,407 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-24 00:51:16,407 INFO L85 PathProgramCache]: Analyzing trace with hash -187697849, now seen corresponding path program 1 times [2024-11-24 00:51:16,407 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-24 00:51:16,407 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [256939851] [2024-11-24 00:51:16,407 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-24 00:51:16,407 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-24 00:51:16,439 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-24 00:51:17,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-24 00:51:17,314 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-24 00:51:17,315 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [256939851] [2024-11-24 00:51:17,315 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [256939851] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-24 00:51:17,315 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-24 00:51:17,315 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2024-11-24 00:51:17,315 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2017954527] [2024-11-24 00:51:17,315 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-24 00:51:17,315 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2024-11-24 00:51:17,316 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-24 00:51:17,316 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2024-11-24 00:51:17,316 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2024-11-24 00:51:17,347 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 14 out of 44 [2024-11-24 00:51:17,347 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 64 places, 39 transitions, 175 flow. Second operand has 6 states, 6 states have (on average 16.166666666666668) internal successors, (97), 6 states have internal predecessors, (97), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-24 00:51:17,347 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-11-24 00:51:17,347 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 14 of 44 [2024-11-24 00:51:17,348 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-11-24 00:51:18,975 INFO L124 PetriNetUnfolderBase]: 2257/3687 cut-off events. [2024-11-24 00:51:18,975 INFO L125 PetriNetUnfolderBase]: For 8772/8796 co-relation queries the response was YES. [2024-11-24 00:51:18,992 INFO L83 FinitePrefix]: Finished finitePrefix Result has 13006 conditions, 3687 events. 2257/3687 cut-off events. For 8772/8796 co-relation queries the response was YES. Maximal size of possible extension queue 188. Compared 22804 event pairs, 193 based on Foata normal form. 103/3777 useless extension candidates. Maximal degree in co-relation 12988. Up to 1470 conditions per place. [2024-11-24 00:51:19,013 INFO L140 encePairwiseOnDemand]: 31/44 looper letters, 55 selfloop transitions, 27 changer transitions 82/174 dead transitions. [2024-11-24 00:51:19,013 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 67 places, 174 transitions, 1239 flow [2024-11-24 00:51:19,013 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 13 states. [2024-11-24 00:51:19,014 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 13 states. [2024-11-24 00:51:19,017 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 13 states to 13 states and 328 transitions. [2024-11-24 00:51:19,018 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.5734265734265734 [2024-11-24 00:51:19,018 INFO L175 Difference]: Start difference. First operand has 64 places, 39 transitions, 175 flow. Second operand 13 states and 328 transitions. [2024-11-24 00:51:19,018 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 67 places, 174 transitions, 1239 flow [2024-11-24 00:51:19,083 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 62 places, 174 transitions, 1110 flow, removed 62 selfloop flow, removed 5 redundant places. [2024-11-24 00:51:19,087 INFO L231 Difference]: Finished difference. Result has 74 places, 58 transitions, 461 flow [2024-11-24 00:51:19,087 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=44, PETRI_DIFFERENCE_MINUEND_FLOW=155, PETRI_DIFFERENCE_MINUEND_PLACES=50, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=39, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=8, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=23, PETRI_DIFFERENCE_SUBTRAHEND_STATES=13, PETRI_FLOW=461, PETRI_PLACES=74, PETRI_TRANSITIONS=58} [2024-11-24 00:51:19,088 INFO L279 CegarLoopForPetriNet]: 49 programPoint places, 25 predicate places. [2024-11-24 00:51:19,089 INFO L471 AbstractCegarLoop]: Abstraction has has 74 places, 58 transitions, 461 flow [2024-11-24 00:51:19,089 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 16.166666666666668) internal successors, (97), 6 states have internal predecessors, (97), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-24 00:51:19,089 INFO L198 CegarLoopForPetriNet]: Found error trace [2024-11-24 00:51:19,090 INFO L206 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-24 00:51:19,090 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable3 [2024-11-24 00:51:19,090 INFO L396 AbstractCegarLoop]: === Iteration 5 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONMEMORY_LEAK === [P0Err0ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr1ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr0ASSERT_VIOLATIONMEMORY_LEAK (and 4 more)] === [2024-11-24 00:51:19,090 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-24 00:51:19,090 INFO L85 PathProgramCache]: Analyzing trace with hash -633034119, now seen corresponding path program 2 times [2024-11-24 00:51:19,090 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-24 00:51:19,090 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2068866600] [2024-11-24 00:51:19,091 INFO L95 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2024-11-24 00:51:19,091 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-24 00:51:19,118 INFO L229 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 1 check-sat command(s) [2024-11-24 00:51:19,118 INFO L230 tOrderPrioritization]: Conjunction of SSA is unsat [2024-11-24 00:51:19,930 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-24 00:51:19,930 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-24 00:51:19,931 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2068866600] [2024-11-24 00:51:19,931 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2068866600] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-24 00:51:19,931 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-24 00:51:19,931 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2024-11-24 00:51:19,931 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1073379856] [2024-11-24 00:51:19,931 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-24 00:51:19,931 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2024-11-24 00:51:19,931 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-24 00:51:19,932 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2024-11-24 00:51:19,932 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=12, Invalid=30, Unknown=0, NotChecked=0, Total=42 [2024-11-24 00:51:19,963 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 14 out of 44 [2024-11-24 00:51:19,964 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 74 places, 58 transitions, 461 flow. Second operand has 7 states, 7 states have (on average 15.857142857142858) internal successors, (111), 7 states have internal predecessors, (111), 0 states have call successors, (0), 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-24 00:51:19,964 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-11-24 00:51:19,964 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 14 of 44 [2024-11-24 00:51:19,964 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-11-24 00:51:21,159 INFO L124 PetriNetUnfolderBase]: 2408/3969 cut-off events. [2024-11-24 00:51:21,159 INFO L125 PetriNetUnfolderBase]: For 27601/27639 co-relation queries the response was YES. [2024-11-24 00:51:21,178 INFO L83 FinitePrefix]: Finished finitePrefix Result has 20073 conditions, 3969 events. 2408/3969 cut-off events. For 27601/27639 co-relation queries the response was YES. Maximal size of possible extension queue 218. Compared 25048 event pairs, 319 based on Foata normal form. 90/4041 useless extension candidates. Maximal degree in co-relation 20046. Up to 1482 conditions per place. [2024-11-24 00:51:21,195 INFO L140 encePairwiseOnDemand]: 33/44 looper letters, 50 selfloop transitions, 10 changer transitions 71/141 dead transitions. [2024-11-24 00:51:21,196 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 74 places, 141 transitions, 1514 flow [2024-11-24 00:51:21,197 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2024-11-24 00:51:21,197 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 9 states. [2024-11-24 00:51:21,198 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 9 states to 9 states and 220 transitions. [2024-11-24 00:51:21,198 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.5555555555555556 [2024-11-24 00:51:21,198 INFO L175 Difference]: Start difference. First operand has 74 places, 58 transitions, 461 flow. Second operand 9 states and 220 transitions. [2024-11-24 00:51:21,198 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 74 places, 141 transitions, 1514 flow [2024-11-24 00:51:21,236 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 70 places, 141 transitions, 1468 flow, removed 23 selfloop flow, removed 4 redundant places. [2024-11-24 00:51:21,238 INFO L231 Difference]: Finished difference. Result has 76 places, 48 transitions, 373 flow [2024-11-24 00:51:21,238 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=44, PETRI_DIFFERENCE_MINUEND_FLOW=435, PETRI_DIFFERENCE_MINUEND_PLACES=62, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=58, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=10, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=48, PETRI_DIFFERENCE_SUBTRAHEND_STATES=9, PETRI_FLOW=373, PETRI_PLACES=76, PETRI_TRANSITIONS=48} [2024-11-24 00:51:21,241 INFO L279 CegarLoopForPetriNet]: 49 programPoint places, 27 predicate places. [2024-11-24 00:51:21,241 INFO L471 AbstractCegarLoop]: Abstraction has has 76 places, 48 transitions, 373 flow [2024-11-24 00:51:21,242 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 7 states, 7 states have (on average 15.857142857142858) internal successors, (111), 7 states have internal predecessors, (111), 0 states have call successors, (0), 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-24 00:51:21,242 INFO L198 CegarLoopForPetriNet]: Found error trace [2024-11-24 00:51:21,242 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-24 00:51:21,242 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable4 [2024-11-24 00:51:21,242 INFO L396 AbstractCegarLoop]: === Iteration 6 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONMEMORY_LEAK === [P0Err0ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr1ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr0ASSERT_VIOLATIONMEMORY_LEAK (and 4 more)] === [2024-11-24 00:51:21,243 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-24 00:51:21,243 INFO L85 PathProgramCache]: Analyzing trace with hash 1363118346, now seen corresponding path program 1 times [2024-11-24 00:51:21,243 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-24 00:51:21,243 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2068167697] [2024-11-24 00:51:21,243 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-24 00:51:21,243 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-24 00:51:21,280 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-24 00:51:22,401 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-24 00:51:22,402 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-24 00:51:22,402 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2068167697] [2024-11-24 00:51:22,402 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2068167697] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-24 00:51:22,402 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-24 00:51:22,402 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2024-11-24 00:51:22,402 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1448438906] [2024-11-24 00:51:22,403 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-24 00:51:22,403 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2024-11-24 00:51:22,403 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-24 00:51:22,403 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2024-11-24 00:51:22,404 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=14, Invalid=28, Unknown=0, NotChecked=0, Total=42 [2024-11-24 00:51:22,424 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 14 out of 44 [2024-11-24 00:51:22,424 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 76 places, 48 transitions, 373 flow. Second operand has 7 states, 7 states have (on average 16.0) internal successors, (112), 7 states have internal predecessors, (112), 0 states have call successors, (0), 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-24 00:51:22,426 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-11-24 00:51:22,426 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 14 of 44 [2024-11-24 00:51:22,426 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-11-24 00:51:23,637 INFO L124 PetriNetUnfolderBase]: 1593/2685 cut-off events. [2024-11-24 00:51:23,637 INFO L125 PetriNetUnfolderBase]: For 19128/19128 co-relation queries the response was YES. [2024-11-24 00:51:23,652 INFO L83 FinitePrefix]: Finished finitePrefix Result has 13755 conditions, 2685 events. 1593/2685 cut-off events. For 19128/19128 co-relation queries the response was YES. Maximal size of possible extension queue 141. Compared 15590 event pairs, 537 based on Foata normal form. 72/2750 useless extension candidates. Maximal degree in co-relation 13731. Up to 1643 conditions per place. [2024-11-24 00:51:23,673 INFO L140 encePairwiseOnDemand]: 31/44 looper letters, 45 selfloop transitions, 22 changer transitions 49/127 dead transitions. [2024-11-24 00:51:23,674 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 81 places, 127 transitions, 1291 flow [2024-11-24 00:51:23,674 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2024-11-24 00:51:23,674 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 10 states. [2024-11-24 00:51:23,675 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 10 states to 10 states and 242 transitions. [2024-11-24 00:51:23,676 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.55 [2024-11-24 00:51:23,676 INFO L175 Difference]: Start difference. First operand has 76 places, 48 transitions, 373 flow. Second operand 10 states and 242 transitions. [2024-11-24 00:51:23,676 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 81 places, 127 transitions, 1291 flow [2024-11-24 00:51:23,705 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 70 places, 127 transitions, 1160 flow, removed 31 selfloop flow, removed 11 redundant places. [2024-11-24 00:51:23,707 INFO L231 Difference]: Finished difference. Result has 78 places, 56 transitions, 497 flow [2024-11-24 00:51:23,708 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=44, PETRI_DIFFERENCE_MINUEND_FLOW=306, PETRI_DIFFERENCE_MINUEND_PLACES=61, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=48, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=15, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=27, PETRI_DIFFERENCE_SUBTRAHEND_STATES=10, PETRI_FLOW=497, PETRI_PLACES=78, PETRI_TRANSITIONS=56} [2024-11-24 00:51:23,708 INFO L279 CegarLoopForPetriNet]: 49 programPoint places, 29 predicate places. [2024-11-24 00:51:23,709 INFO L471 AbstractCegarLoop]: Abstraction has has 78 places, 56 transitions, 497 flow [2024-11-24 00:51:23,709 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 7 states, 7 states have (on average 16.0) internal successors, (112), 7 states have internal predecessors, (112), 0 states have call successors, (0), 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-24 00:51:23,709 INFO L198 CegarLoopForPetriNet]: Found error trace [2024-11-24 00:51:23,709 INFO L206 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-24 00:51:23,710 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable5 [2024-11-24 00:51:23,710 INFO L396 AbstractCegarLoop]: === Iteration 7 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONMEMORY_LEAK === [P0Err0ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr1ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr0ASSERT_VIOLATIONMEMORY_LEAK (and 4 more)] === [2024-11-24 00:51:23,710 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-24 00:51:23,711 INFO L85 PathProgramCache]: Analyzing trace with hash 383827254, now seen corresponding path program 1 times [2024-11-24 00:51:23,711 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-24 00:51:23,711 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1155953690] [2024-11-24 00:51:23,711 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-24 00:51:23,711 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-24 00:51:23,745 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-24 00:51:24,371 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-24 00:51:24,371 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-24 00:51:24,371 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1155953690] [2024-11-24 00:51:24,371 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1155953690] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-24 00:51:24,371 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-24 00:51:24,371 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2024-11-24 00:51:24,371 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [142688996] [2024-11-24 00:51:24,372 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-24 00:51:24,372 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2024-11-24 00:51:24,372 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-24 00:51:24,372 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2024-11-24 00:51:24,372 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=13, Invalid=29, Unknown=0, NotChecked=0, Total=42 [2024-11-24 00:51:24,380 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 17 out of 44 [2024-11-24 00:51:24,380 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 78 places, 56 transitions, 497 flow. Second operand has 7 states, 7 states have (on average 18.857142857142858) internal successors, (132), 7 states have internal predecessors, (132), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-24 00:51:24,380 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-11-24 00:51:24,380 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 17 of 44 [2024-11-24 00:51:24,381 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-11-24 00:51:25,381 INFO L124 PetriNetUnfolderBase]: 1293/2235 cut-off events. [2024-11-24 00:51:25,381 INFO L125 PetriNetUnfolderBase]: For 25640/25824 co-relation queries the response was YES. [2024-11-24 00:51:25,393 INFO L83 FinitePrefix]: Finished finitePrefix Result has 13424 conditions, 2235 events. 1293/2235 cut-off events. For 25640/25824 co-relation queries the response was YES. Maximal size of possible extension queue 126. Compared 13107 event pairs, 551 based on Foata normal form. 214/2392 useless extension candidates. Maximal degree in co-relation 13399. Up to 1371 conditions per place. [2024-11-24 00:51:25,414 INFO L140 encePairwiseOnDemand]: 36/44 looper letters, 46 selfloop transitions, 11 changer transitions 40/116 dead transitions. [2024-11-24 00:51:25,414 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 81 places, 116 transitions, 1409 flow [2024-11-24 00:51:25,414 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2024-11-24 00:51:25,415 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 10 states. [2024-11-24 00:51:25,415 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 10 states to 10 states and 249 transitions. [2024-11-24 00:51:25,416 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.5659090909090909 [2024-11-24 00:51:25,416 INFO L175 Difference]: Start difference. First operand has 78 places, 56 transitions, 497 flow. Second operand 10 states and 249 transitions. [2024-11-24 00:51:25,416 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 81 places, 116 transitions, 1409 flow [2024-11-24 00:51:25,438 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 77 places, 116 transitions, 1309 flow, removed 50 selfloop flow, removed 4 redundant places. [2024-11-24 00:51:25,441 INFO L231 Difference]: Finished difference. Result has 84 places, 59 transitions, 590 flow [2024-11-24 00:51:25,441 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=44, PETRI_DIFFERENCE_MINUEND_FLOW=481, PETRI_DIFFERENCE_MINUEND_PLACES=68, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=56, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=8, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=46, PETRI_DIFFERENCE_SUBTRAHEND_STATES=10, PETRI_FLOW=590, PETRI_PLACES=84, PETRI_TRANSITIONS=59} [2024-11-24 00:51:25,443 INFO L279 CegarLoopForPetriNet]: 49 programPoint places, 35 predicate places. [2024-11-24 00:51:25,443 INFO L471 AbstractCegarLoop]: Abstraction has has 84 places, 59 transitions, 590 flow [2024-11-24 00:51:25,444 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 7 states, 7 states have (on average 18.857142857142858) internal successors, (132), 7 states have internal predecessors, (132), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-24 00:51:25,444 INFO L198 CegarLoopForPetriNet]: Found error trace [2024-11-24 00:51:25,444 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] [2024-11-24 00:51:25,444 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable6 [2024-11-24 00:51:25,444 INFO L396 AbstractCegarLoop]: === Iteration 8 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONMEMORY_LEAK === [P0Err0ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr1ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr0ASSERT_VIOLATIONMEMORY_LEAK (and 4 more)] === [2024-11-24 00:51:25,445 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-24 00:51:25,445 INFO L85 PathProgramCache]: Analyzing trace with hash 1042347252, now seen corresponding path program 1 times [2024-11-24 00:51:25,445 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-24 00:51:25,445 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1544476339] [2024-11-24 00:51:25,445 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-24 00:51:25,445 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-24 00:51:25,500 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-24 00:51:26,219 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-24 00:51:26,219 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-24 00:51:26,219 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1544476339] [2024-11-24 00:51:26,220 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1544476339] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-24 00:51:26,220 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-24 00:51:26,220 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2024-11-24 00:51:26,220 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1591069076] [2024-11-24 00:51:26,220 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-24 00:51:26,220 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2024-11-24 00:51:26,220 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-24 00:51:26,221 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2024-11-24 00:51:26,221 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=12, Invalid=30, Unknown=0, NotChecked=0, Total=42 [2024-11-24 00:51:26,229 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 17 out of 44 [2024-11-24 00:51:26,229 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 84 places, 59 transitions, 590 flow. Second operand has 7 states, 7 states have (on average 18.857142857142858) internal successors, (132), 7 states have internal predecessors, (132), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-24 00:51:26,229 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-11-24 00:51:26,229 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 17 of 44 [2024-11-24 00:51:26,229 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-11-24 00:51:27,096 INFO L124 PetriNetUnfolderBase]: 1360/2364 cut-off events. [2024-11-24 00:51:27,097 INFO L125 PetriNetUnfolderBase]: For 30657/30833 co-relation queries the response was YES. [2024-11-24 00:51:27,115 INFO L83 FinitePrefix]: Finished finitePrefix Result has 14751 conditions, 2364 events. 1360/2364 cut-off events. For 30657/30833 co-relation queries the response was YES. Maximal size of possible extension queue 132. Compared 13956 event pairs, 440 based on Foata normal form. 221/2544 useless extension candidates. Maximal degree in co-relation 14722. Up to 1501 conditions per place. [2024-11-24 00:51:27,130 INFO L140 encePairwiseOnDemand]: 36/44 looper letters, 53 selfloop transitions, 12 changer transitions 35/119 dead transitions. [2024-11-24 00:51:27,130 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 85 places, 119 transitions, 1418 flow [2024-11-24 00:51:27,131 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2024-11-24 00:51:27,131 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 8 states. [2024-11-24 00:51:27,132 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 8 states to 8 states and 205 transitions. [2024-11-24 00:51:27,134 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.5823863636363636 [2024-11-24 00:51:27,134 INFO L175 Difference]: Start difference. First operand has 84 places, 59 transitions, 590 flow. Second operand 8 states and 205 transitions. [2024-11-24 00:51:27,134 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 85 places, 119 transitions, 1418 flow [2024-11-24 00:51:27,174 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 78 places, 119 transitions, 1292 flow, removed 60 selfloop flow, removed 7 redundant places. [2024-11-24 00:51:27,177 INFO L231 Difference]: Finished difference. Result has 83 places, 65 transitions, 668 flow [2024-11-24 00:51:27,177 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=44, PETRI_DIFFERENCE_MINUEND_FLOW=508, PETRI_DIFFERENCE_MINUEND_PLACES=71, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=59, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=6, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=47, PETRI_DIFFERENCE_SUBTRAHEND_STATES=8, PETRI_FLOW=668, PETRI_PLACES=83, PETRI_TRANSITIONS=65} [2024-11-24 00:51:27,180 INFO L279 CegarLoopForPetriNet]: 49 programPoint places, 34 predicate places. [2024-11-24 00:51:27,180 INFO L471 AbstractCegarLoop]: Abstraction has has 83 places, 65 transitions, 668 flow [2024-11-24 00:51:27,180 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 7 states, 7 states have (on average 18.857142857142858) internal successors, (132), 7 states have internal predecessors, (132), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-24 00:51:27,180 INFO L198 CegarLoopForPetriNet]: Found error trace [2024-11-24 00:51:27,180 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] [2024-11-24 00:51:27,180 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable7 [2024-11-24 00:51:27,181 INFO L396 AbstractCegarLoop]: === Iteration 9 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONMEMORY_LEAK === [P0Err0ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr1ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr0ASSERT_VIOLATIONMEMORY_LEAK (and 4 more)] === [2024-11-24 00:51:27,181 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-24 00:51:27,181 INFO L85 PathProgramCache]: Analyzing trace with hash 1580354623, now seen corresponding path program 1 times [2024-11-24 00:51:27,181 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-24 00:51:27,181 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2068827908] [2024-11-24 00:51:27,181 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-24 00:51:27,182 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-24 00:51:27,220 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-24 00:51:27,701 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-24 00:51:27,701 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-24 00:51:27,701 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2068827908] [2024-11-24 00:51:27,702 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2068827908] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-24 00:51:27,702 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-24 00:51:27,702 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2024-11-24 00:51:27,702 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1100468505] [2024-11-24 00:51:27,702 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-24 00:51:27,702 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2024-11-24 00:51:27,703 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-24 00:51:27,703 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2024-11-24 00:51:27,703 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=14, Invalid=28, Unknown=0, NotChecked=0, Total=42 [2024-11-24 00:51:27,705 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 17 out of 44 [2024-11-24 00:51:27,705 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 83 places, 65 transitions, 668 flow. Second operand has 7 states, 7 states have (on average 19.0) internal successors, (133), 7 states have internal predecessors, (133), 0 states have call successors, (0), 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-24 00:51:27,705 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-11-24 00:51:27,705 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 17 of 44 [2024-11-24 00:51:27,705 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-11-24 00:51:28,614 INFO L124 PetriNetUnfolderBase]: 1239/2149 cut-off events. [2024-11-24 00:51:28,615 INFO L125 PetriNetUnfolderBase]: For 29753/29904 co-relation queries the response was YES. [2024-11-24 00:51:28,629 INFO L83 FinitePrefix]: Finished finitePrefix Result has 13958 conditions, 2149 events. 1239/2149 cut-off events. For 29753/29904 co-relation queries the response was YES. Maximal size of possible extension queue 105. Compared 12470 event pairs, 482 based on Foata normal form. 160/2266 useless extension candidates. Maximal degree in co-relation 13930. Up to 1394 conditions per place. [2024-11-24 00:51:28,643 INFO L140 encePairwiseOnDemand]: 35/44 looper letters, 50 selfloop transitions, 10 changer transitions 31/110 dead transitions. [2024-11-24 00:51:28,644 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 86 places, 110 transitions, 1374 flow [2024-11-24 00:51:28,644 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2024-11-24 00:51:28,644 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 8 states. [2024-11-24 00:51:28,645 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 8 states to 8 states and 202 transitions. [2024-11-24 00:51:28,645 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.5738636363636364 [2024-11-24 00:51:28,646 INFO L175 Difference]: Start difference. First operand has 83 places, 65 transitions, 668 flow. Second operand 8 states and 202 transitions. [2024-11-24 00:51:28,646 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 86 places, 110 transitions, 1374 flow [2024-11-24 00:51:28,672 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 82 places, 110 transitions, 1336 flow, removed 12 selfloop flow, removed 4 redundant places. [2024-11-24 00:51:28,674 INFO L231 Difference]: Finished difference. Result has 87 places, 65 transitions, 673 flow [2024-11-24 00:51:28,675 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=44, PETRI_DIFFERENCE_MINUEND_FLOW=634, PETRI_DIFFERENCE_MINUEND_PLACES=75, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=65, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=10, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=55, PETRI_DIFFERENCE_SUBTRAHEND_STATES=8, PETRI_FLOW=673, PETRI_PLACES=87, PETRI_TRANSITIONS=65} [2024-11-24 00:51:28,675 INFO L279 CegarLoopForPetriNet]: 49 programPoint places, 38 predicate places. [2024-11-24 00:51:28,675 INFO L471 AbstractCegarLoop]: Abstraction has has 87 places, 65 transitions, 673 flow [2024-11-24 00:51:28,676 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 7 states, 7 states have (on average 19.0) internal successors, (133), 7 states have internal predecessors, (133), 0 states have call successors, (0), 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-24 00:51:28,676 INFO L198 CegarLoopForPetriNet]: Found error trace [2024-11-24 00:51:28,676 INFO L206 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-24 00:51:28,676 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable8 [2024-11-24 00:51:28,676 INFO L396 AbstractCegarLoop]: === Iteration 10 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONMEMORY_LEAK === [P0Err0ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr1ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr0ASSERT_VIOLATIONMEMORY_LEAK (and 4 more)] === [2024-11-24 00:51:28,677 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-24 00:51:28,677 INFO L85 PathProgramCache]: Analyzing trace with hash 1328354205, now seen corresponding path program 1 times [2024-11-24 00:51:28,677 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-24 00:51:28,677 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [723329565] [2024-11-24 00:51:28,677 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-24 00:51:28,677 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-24 00:51:28,715 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-24 00:51:29,632 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-24 00:51:29,632 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-24 00:51:29,632 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [723329565] [2024-11-24 00:51:29,632 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [723329565] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-24 00:51:29,632 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-24 00:51:29,632 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2024-11-24 00:51:29,632 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1059515745] [2024-11-24 00:51:29,632 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-24 00:51:29,633 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 8 states [2024-11-24 00:51:29,633 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-24 00:51:29,633 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2024-11-24 00:51:29,633 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=16, Invalid=40, Unknown=0, NotChecked=0, Total=56 [2024-11-24 00:51:29,640 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 17 out of 44 [2024-11-24 00:51:29,641 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 87 places, 65 transitions, 673 flow. Second operand has 8 states, 8 states have (on average 18.75) internal successors, (150), 8 states have internal predecessors, (150), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-24 00:51:29,641 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-11-24 00:51:29,641 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 17 of 44 [2024-11-24 00:51:29,642 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-11-24 00:51:30,402 INFO L124 PetriNetUnfolderBase]: 1186/2070 cut-off events. [2024-11-24 00:51:30,403 INFO L125 PetriNetUnfolderBase]: For 28768/28912 co-relation queries the response was YES. [2024-11-24 00:51:30,415 INFO L83 FinitePrefix]: Finished finitePrefix Result has 13392 conditions, 2070 events. 1186/2070 cut-off events. For 28768/28912 co-relation queries the response was YES. Maximal size of possible extension queue 100. Compared 11908 event pairs, 345 based on Foata normal form. 169/2198 useless extension candidates. Maximal degree in co-relation 13361. Up to 1302 conditions per place. [2024-11-24 00:51:30,429 INFO L140 encePairwiseOnDemand]: 37/44 looper letters, 54 selfloop transitions, 13 changer transitions 27/113 dead transitions. [2024-11-24 00:51:30,429 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 90 places, 113 transitions, 1383 flow [2024-11-24 00:51:30,430 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2024-11-24 00:51:30,430 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 8 states. [2024-11-24 00:51:30,431 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 8 states to 8 states and 201 transitions. [2024-11-24 00:51:30,431 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.5710227272727273 [2024-11-24 00:51:30,431 INFO L175 Difference]: Start difference. First operand has 87 places, 65 transitions, 673 flow. Second operand 8 states and 201 transitions. [2024-11-24 00:51:30,431 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 90 places, 113 transitions, 1383 flow [2024-11-24 00:51:30,466 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 83 places, 113 transitions, 1309 flow, removed 34 selfloop flow, removed 7 redundant places. [2024-11-24 00:51:30,468 INFO L231 Difference]: Finished difference. Result has 88 places, 68 transitions, 750 flow [2024-11-24 00:51:30,469 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=44, PETRI_DIFFERENCE_MINUEND_FLOW=631, PETRI_DIFFERENCE_MINUEND_PLACES=76, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=65, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=10, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=52, PETRI_DIFFERENCE_SUBTRAHEND_STATES=8, PETRI_FLOW=750, PETRI_PLACES=88, PETRI_TRANSITIONS=68} [2024-11-24 00:51:30,469 INFO L279 CegarLoopForPetriNet]: 49 programPoint places, 39 predicate places. [2024-11-24 00:51:30,469 INFO L471 AbstractCegarLoop]: Abstraction has has 88 places, 68 transitions, 750 flow [2024-11-24 00:51:30,470 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 8 states, 8 states have (on average 18.75) internal successors, (150), 8 states have internal predecessors, (150), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-24 00:51:30,470 INFO L198 CegarLoopForPetriNet]: Found error trace [2024-11-24 00:51:30,470 INFO L206 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-24 00:51:30,470 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable9 [2024-11-24 00:51:30,470 INFO L396 AbstractCegarLoop]: === Iteration 11 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONMEMORY_LEAK === [P0Err0ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr1ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr0ASSERT_VIOLATIONMEMORY_LEAK (and 4 more)] === [2024-11-24 00:51:30,471 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-24 00:51:30,471 INFO L85 PathProgramCache]: Analyzing trace with hash -616261378, now seen corresponding path program 1 times [2024-11-24 00:51:30,471 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-24 00:51:30,471 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1527811998] [2024-11-24 00:51:30,471 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-24 00:51:30,472 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-24 00:51:30,504 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-24 00:51:31,092 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-24 00:51:31,093 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-24 00:51:31,093 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1527811998] [2024-11-24 00:51:31,093 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1527811998] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-24 00:51:31,093 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-24 00:51:31,093 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2024-11-24 00:51:31,093 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1707014826] [2024-11-24 00:51:31,094 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-24 00:51:31,094 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 8 states [2024-11-24 00:51:31,094 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-24 00:51:31,094 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2024-11-24 00:51:31,095 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=15, Invalid=41, Unknown=0, NotChecked=0, Total=56 [2024-11-24 00:51:31,101 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 17 out of 44 [2024-11-24 00:51:31,102 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 88 places, 68 transitions, 750 flow. Second operand has 8 states, 8 states have (on average 18.75) internal successors, (150), 8 states have internal predecessors, (150), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-24 00:51:31,103 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-11-24 00:51:31,103 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 17 of 44 [2024-11-24 00:51:31,103 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-11-24 00:51:32,026 INFO L124 PetriNetUnfolderBase]: 1986/3452 cut-off events. [2024-11-24 00:51:32,027 INFO L125 PetriNetUnfolderBase]: For 58541/58670 co-relation queries the response was YES. [2024-11-24 00:51:32,039 INFO L83 FinitePrefix]: Finished finitePrefix Result has 23919 conditions, 3452 events. 1986/3452 cut-off events. For 58541/58670 co-relation queries the response was YES. Maximal size of possible extension queue 193. Compared 22207 event pairs, 539 based on Foata normal form. 158/3567 useless extension candidates. Maximal degree in co-relation 23889. Up to 1472 conditions per place. [2024-11-24 00:51:32,060 INFO L140 encePairwiseOnDemand]: 34/44 looper letters, 81 selfloop transitions, 33 changer transitions 20/153 dead transitions. [2024-11-24 00:51:32,060 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 91 places, 153 transitions, 2114 flow [2024-11-24 00:51:32,060 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2024-11-24 00:51:32,060 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 8 states. [2024-11-24 00:51:32,062 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 8 states to 8 states and 217 transitions. [2024-11-24 00:51:32,063 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.6164772727272727 [2024-11-24 00:51:32,063 INFO L175 Difference]: Start difference. First operand has 88 places, 68 transitions, 750 flow. Second operand 8 states and 217 transitions. [2024-11-24 00:51:32,063 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 91 places, 153 transitions, 2114 flow [2024-11-24 00:51:32,116 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 85 places, 153 transitions, 1961 flow, removed 63 selfloop flow, removed 6 redundant places. [2024-11-24 00:51:32,119 INFO L231 Difference]: Finished difference. Result has 91 places, 90 transitions, 1208 flow [2024-11-24 00:51:32,119 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=44, PETRI_DIFFERENCE_MINUEND_FLOW=683, PETRI_DIFFERENCE_MINUEND_PLACES=78, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=68, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=11, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=39, PETRI_DIFFERENCE_SUBTRAHEND_STATES=8, PETRI_FLOW=1208, PETRI_PLACES=91, PETRI_TRANSITIONS=90} [2024-11-24 00:51:32,120 INFO L279 CegarLoopForPetriNet]: 49 programPoint places, 42 predicate places. [2024-11-24 00:51:32,120 INFO L471 AbstractCegarLoop]: Abstraction has has 91 places, 90 transitions, 1208 flow [2024-11-24 00:51:32,120 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 8 states, 8 states have (on average 18.75) internal successors, (150), 8 states have internal predecessors, (150), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-24 00:51:32,120 INFO L198 CegarLoopForPetriNet]: Found error trace [2024-11-24 00:51:32,120 INFO L206 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-24 00:51:32,120 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable10 [2024-11-24 00:51:32,120 INFO L396 AbstractCegarLoop]: === Iteration 12 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONMEMORY_LEAK === [P0Err0ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr1ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr0ASSERT_VIOLATIONMEMORY_LEAK (and 4 more)] === [2024-11-24 00:51:32,122 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-24 00:51:32,123 INFO L85 PathProgramCache]: Analyzing trace with hash 1612613360, now seen corresponding path program 2 times [2024-11-24 00:51:32,123 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-24 00:51:32,123 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [117677067] [2024-11-24 00:51:32,123 INFO L95 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2024-11-24 00:51:32,123 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-24 00:51:32,153 INFO L229 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 1 check-sat command(s) [2024-11-24 00:51:32,153 INFO L230 tOrderPrioritization]: Conjunction of SSA is unsat [2024-11-24 00:51:32,696 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-24 00:51:32,696 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-24 00:51:32,696 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [117677067] [2024-11-24 00:51:32,696 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [117677067] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-24 00:51:32,696 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-24 00:51:32,696 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2024-11-24 00:51:32,697 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1866359304] [2024-11-24 00:51:32,697 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-24 00:51:32,697 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 8 states [2024-11-24 00:51:32,697 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-24 00:51:32,698 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2024-11-24 00:51:32,698 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=13, Invalid=43, Unknown=0, NotChecked=0, Total=56 [2024-11-24 00:51:32,702 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 17 out of 44 [2024-11-24 00:51:32,702 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 91 places, 90 transitions, 1208 flow. Second operand has 8 states, 8 states have (on average 18.75) internal successors, (150), 8 states have internal predecessors, (150), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-24 00:51:32,702 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-11-24 00:51:32,702 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 17 of 44 [2024-11-24 00:51:32,702 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-11-24 00:51:34,051 INFO L124 PetriNetUnfolderBase]: 2414/4176 cut-off events. [2024-11-24 00:51:34,052 INFO L125 PetriNetUnfolderBase]: For 79785/79944 co-relation queries the response was YES. [2024-11-24 00:51:34,062 INFO L83 FinitePrefix]: Finished finitePrefix Result has 30827 conditions, 4176 events. 2414/4176 cut-off events. For 79785/79944 co-relation queries the response was YES. Maximal size of possible extension queue 259. Compared 27758 event pairs, 461 based on Foata normal form. 256/4385 useless extension candidates. Maximal degree in co-relation 30795. Up to 2219 conditions per place. [2024-11-24 00:51:34,076 INFO L140 encePairwiseOnDemand]: 35/44 looper letters, 65 selfloop transitions, 37 changer transitions 39/160 dead transitions. [2024-11-24 00:51:34,076 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 97 places, 160 transitions, 2434 flow [2024-11-24 00:51:34,077 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2024-11-24 00:51:34,077 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 9 states. [2024-11-24 00:51:34,078 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 9 states to 9 states and 230 transitions. [2024-11-24 00:51:34,078 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.5808080808080808 [2024-11-24 00:51:34,078 INFO L175 Difference]: Start difference. First operand has 91 places, 90 transitions, 1208 flow. Second operand 9 states and 230 transitions. [2024-11-24 00:51:34,078 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 97 places, 160 transitions, 2434 flow [2024-11-24 00:51:34,134 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 94 places, 160 transitions, 2371 flow, removed 29 selfloop flow, removed 3 redundant places. [2024-11-24 00:51:34,137 INFO L231 Difference]: Finished difference. Result has 99 places, 96 transitions, 1449 flow [2024-11-24 00:51:34,137 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=44, PETRI_DIFFERENCE_MINUEND_FLOW=1153, PETRI_DIFFERENCE_MINUEND_PLACES=86, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=90, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=31, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=53, PETRI_DIFFERENCE_SUBTRAHEND_STATES=9, PETRI_FLOW=1449, PETRI_PLACES=99, PETRI_TRANSITIONS=96} [2024-11-24 00:51:34,138 INFO L279 CegarLoopForPetriNet]: 49 programPoint places, 50 predicate places. [2024-11-24 00:51:34,138 INFO L471 AbstractCegarLoop]: Abstraction has has 99 places, 96 transitions, 1449 flow [2024-11-24 00:51:34,138 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 8 states, 8 states have (on average 18.75) internal successors, (150), 8 states have internal predecessors, (150), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-24 00:51:34,138 INFO L198 CegarLoopForPetriNet]: Found error trace [2024-11-24 00:51:34,139 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] [2024-11-24 00:51:34,139 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable11 [2024-11-24 00:51:34,139 INFO L396 AbstractCegarLoop]: === Iteration 13 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONMEMORY_LEAK === [P0Err0ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr1ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr0ASSERT_VIOLATIONMEMORY_LEAK (and 4 more)] === [2024-11-24 00:51:34,139 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-24 00:51:34,139 INFO L85 PathProgramCache]: Analyzing trace with hash 981761535, now seen corresponding path program 1 times [2024-11-24 00:51:34,140 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-24 00:51:34,140 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1562943153] [2024-11-24 00:51:34,140 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-24 00:51:34,140 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-24 00:51:34,160 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-24 00:51:34,345 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-24 00:51:34,345 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-24 00:51:34,346 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1562943153] [2024-11-24 00:51:34,346 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1562943153] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-24 00:51:34,346 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-24 00:51:34,346 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2024-11-24 00:51:34,346 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [479055191] [2024-11-24 00:51:34,346 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-24 00:51:34,346 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2024-11-24 00:51:34,347 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-24 00:51:34,347 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2024-11-24 00:51:34,347 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2024-11-24 00:51:34,352 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 16 out of 44 [2024-11-24 00:51:34,352 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 99 places, 96 transitions, 1449 flow. Second operand has 5 states, 5 states have (on average 19.2) internal successors, (96), 5 states have internal predecessors, (96), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-24 00:51:34,353 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-11-24 00:51:34,353 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 16 of 44 [2024-11-24 00:51:34,353 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-11-24 00:51:35,460 INFO L124 PetriNetUnfolderBase]: 3122/5392 cut-off events. [2024-11-24 00:51:35,460 INFO L125 PetriNetUnfolderBase]: For 139217/139575 co-relation queries the response was YES. [2024-11-24 00:51:35,482 INFO L83 FinitePrefix]: Finished finitePrefix Result has 42611 conditions, 5392 events. 3122/5392 cut-off events. For 139217/139575 co-relation queries the response was YES. Maximal size of possible extension queue 296. Compared 38246 event pairs, 971 based on Foata normal form. 256/5481 useless extension candidates. Maximal degree in co-relation 42576. Up to 2202 conditions per place. [2024-11-24 00:51:35,499 INFO L140 encePairwiseOnDemand]: 39/44 looper letters, 68 selfloop transitions, 4 changer transitions 55/146 dead transitions. [2024-11-24 00:51:35,499 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 99 places, 146 transitions, 2675 flow [2024-11-24 00:51:35,500 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2024-11-24 00:51:35,500 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 5 states. [2024-11-24 00:51:35,501 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 132 transitions. [2024-11-24 00:51:35,501 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.6 [2024-11-24 00:51:35,501 INFO L175 Difference]: Start difference. First operand has 99 places, 96 transitions, 1449 flow. Second operand 5 states and 132 transitions. [2024-11-24 00:51:35,501 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 99 places, 146 transitions, 2675 flow [2024-11-24 00:51:35,632 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 95 places, 146 transitions, 2625 flow, removed 21 selfloop flow, removed 4 redundant places. [2024-11-24 00:51:35,635 INFO L231 Difference]: Finished difference. Result has 98 places, 75 transitions, 1054 flow [2024-11-24 00:51:35,635 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=44, PETRI_DIFFERENCE_MINUEND_FLOW=1429, PETRI_DIFFERENCE_MINUEND_PLACES=91, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=96, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=3, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=92, PETRI_DIFFERENCE_SUBTRAHEND_STATES=5, PETRI_FLOW=1054, PETRI_PLACES=98, PETRI_TRANSITIONS=75} [2024-11-24 00:51:35,636 INFO L279 CegarLoopForPetriNet]: 49 programPoint places, 49 predicate places. [2024-11-24 00:51:35,636 INFO L471 AbstractCegarLoop]: Abstraction has has 98 places, 75 transitions, 1054 flow [2024-11-24 00:51:35,636 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 19.2) internal successors, (96), 5 states have internal predecessors, (96), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-24 00:51:35,636 INFO L198 CegarLoopForPetriNet]: Found error trace [2024-11-24 00:51:35,636 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] [2024-11-24 00:51:35,637 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable12 [2024-11-24 00:51:35,637 INFO L396 AbstractCegarLoop]: === Iteration 14 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONMEMORY_LEAK === [P0Err0ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr1ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr0ASSERT_VIOLATIONMEMORY_LEAK (and 4 more)] === [2024-11-24 00:51:35,637 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-24 00:51:35,637 INFO L85 PathProgramCache]: Analyzing trace with hash -791735071, now seen corresponding path program 2 times [2024-11-24 00:51:35,638 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-24 00:51:35,638 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1929882785] [2024-11-24 00:51:35,638 INFO L95 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2024-11-24 00:51:35,638 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-24 00:51:35,696 INFO L229 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 1 check-sat command(s) [2024-11-24 00:51:35,697 INFO L230 tOrderPrioritization]: Conjunction of SSA is unsat [2024-11-24 00:51:35,857 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-24 00:51:35,859 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-24 00:51:35,859 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1929882785] [2024-11-24 00:51:35,859 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1929882785] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-24 00:51:35,859 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-24 00:51:35,859 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2024-11-24 00:51:35,859 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1202748427] [2024-11-24 00:51:35,860 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-24 00:51:35,860 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2024-11-24 00:51:35,860 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-24 00:51:35,860 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2024-11-24 00:51:35,860 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2024-11-24 00:51:35,868 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 15 out of 44 [2024-11-24 00:51:35,868 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 98 places, 75 transitions, 1054 flow. Second operand has 4 states, 4 states have (on average 18.75) internal successors, (75), 4 states have internal predecessors, (75), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-24 00:51:35,868 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-11-24 00:51:35,868 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 15 of 44 [2024-11-24 00:51:35,868 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-11-24 00:51:37,026 INFO L124 PetriNetUnfolderBase]: 4677/7598 cut-off events. [2024-11-24 00:51:37,027 INFO L125 PetriNetUnfolderBase]: For 212347/213763 co-relation queries the response was YES. [2024-11-24 00:51:37,048 INFO L83 FinitePrefix]: Finished finitePrefix Result has 50530 conditions, 7598 events. 4677/7598 cut-off events. For 212347/213763 co-relation queries the response was YES. Maximal size of possible extension queue 389. Compared 49698 event pairs, 796 based on Foata normal form. 1079/8458 useless extension candidates. Maximal degree in co-relation 50494. Up to 4250 conditions per place. [2024-11-24 00:51:37,066 INFO L140 encePairwiseOnDemand]: 38/44 looper letters, 80 selfloop transitions, 5 changer transitions 9/113 dead transitions. [2024-11-24 00:51:37,066 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 99 places, 113 transitions, 1975 flow [2024-11-24 00:51:37,067 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2024-11-24 00:51:37,067 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 4 states. [2024-11-24 00:51:37,067 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 108 transitions. [2024-11-24 00:51:37,067 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.6136363636363636 [2024-11-24 00:51:37,067 INFO L175 Difference]: Start difference. First operand has 98 places, 75 transitions, 1054 flow. Second operand 4 states and 108 transitions. [2024-11-24 00:51:37,068 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 99 places, 113 transitions, 1975 flow [2024-11-24 00:51:37,169 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 92 places, 113 transitions, 1864 flow, removed 22 selfloop flow, removed 7 redundant places. [2024-11-24 00:51:37,170 INFO L231 Difference]: Finished difference. Result has 94 places, 69 transitions, 893 flow [2024-11-24 00:51:37,170 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=44, PETRI_DIFFERENCE_MINUEND_FLOW=862, PETRI_DIFFERENCE_MINUEND_PLACES=89, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=66, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=1, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=61, PETRI_DIFFERENCE_SUBTRAHEND_STATES=4, PETRI_FLOW=893, PETRI_PLACES=94, PETRI_TRANSITIONS=69} [2024-11-24 00:51:37,171 INFO L279 CegarLoopForPetriNet]: 49 programPoint places, 45 predicate places. [2024-11-24 00:51:37,171 INFO L471 AbstractCegarLoop]: Abstraction has has 94 places, 69 transitions, 893 flow [2024-11-24 00:51:37,171 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 18.75) internal successors, (75), 4 states have internal predecessors, (75), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-24 00:51:37,171 INFO L198 CegarLoopForPetriNet]: Found error trace [2024-11-24 00:51:37,171 INFO L206 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-24 00:51:37,171 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable13 [2024-11-24 00:51:37,172 INFO L396 AbstractCegarLoop]: === Iteration 15 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONMEMORY_LEAK === [P0Err0ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr1ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr0ASSERT_VIOLATIONMEMORY_LEAK (and 4 more)] === [2024-11-24 00:51:37,172 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-24 00:51:37,172 INFO L85 PathProgramCache]: Analyzing trace with hash -140433251, now seen corresponding path program 1 times [2024-11-24 00:51:37,172 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-24 00:51:37,172 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [368042753] [2024-11-24 00:51:37,173 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-24 00:51:37,173 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-24 00:51:37,219 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-24 00:51:37,372 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-24 00:51:37,373 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-24 00:51:37,373 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [368042753] [2024-11-24 00:51:37,373 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [368042753] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-24 00:51:37,373 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-24 00:51:37,373 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2024-11-24 00:51:37,373 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [768418818] [2024-11-24 00:51:37,374 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-24 00:51:37,374 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2024-11-24 00:51:37,374 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-24 00:51:37,374 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2024-11-24 00:51:37,375 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=8, Invalid=12, Unknown=0, NotChecked=0, Total=20 [2024-11-24 00:51:37,379 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 15 out of 44 [2024-11-24 00:51:37,380 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 94 places, 69 transitions, 893 flow. Second operand has 5 states, 5 states have (on average 18.2) internal successors, (91), 5 states have internal predecessors, (91), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-24 00:51:37,380 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-11-24 00:51:37,380 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 15 of 44 [2024-11-24 00:51:37,380 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-11-24 00:51:38,645 INFO L124 PetriNetUnfolderBase]: 3300/5419 cut-off events. [2024-11-24 00:51:38,645 INFO L125 PetriNetUnfolderBase]: For 152042/153090 co-relation queries the response was YES. [2024-11-24 00:51:38,666 INFO L83 FinitePrefix]: Finished finitePrefix Result has 35632 conditions, 5419 events. 3300/5419 cut-off events. For 152042/153090 co-relation queries the response was YES. Maximal size of possible extension queue 301. Compared 33484 event pairs, 436 based on Foata normal form. 885/6116 useless extension candidates. Maximal degree in co-relation 35598. Up to 1697 conditions per place. [2024-11-24 00:51:38,683 INFO L140 encePairwiseOnDemand]: 38/44 looper letters, 79 selfloop transitions, 8 changer transitions 10/116 dead transitions. [2024-11-24 00:51:38,683 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 98 places, 116 transitions, 1862 flow [2024-11-24 00:51:38,684 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2024-11-24 00:51:38,684 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 5 states. [2024-11-24 00:51:38,685 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 137 transitions. [2024-11-24 00:51:38,685 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.6227272727272727 [2024-11-24 00:51:38,685 INFO L175 Difference]: Start difference. First operand has 94 places, 69 transitions, 893 flow. Second operand 5 states and 137 transitions. [2024-11-24 00:51:38,685 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 98 places, 116 transitions, 1862 flow [2024-11-24 00:51:38,774 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 94 places, 116 transitions, 1789 flow, removed 21 selfloop flow, removed 4 redundant places. [2024-11-24 00:51:38,777 INFO L231 Difference]: Finished difference. Result has 96 places, 68 transitions, 805 flow [2024-11-24 00:51:38,777 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=44, PETRI_DIFFERENCE_MINUEND_FLOW=791, PETRI_DIFFERENCE_MINUEND_PLACES=90, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=66, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=4, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=58, PETRI_DIFFERENCE_SUBTRAHEND_STATES=5, PETRI_FLOW=805, PETRI_PLACES=96, PETRI_TRANSITIONS=68} [2024-11-24 00:51:38,778 INFO L279 CegarLoopForPetriNet]: 49 programPoint places, 47 predicate places. [2024-11-24 00:51:38,778 INFO L471 AbstractCegarLoop]: Abstraction has has 96 places, 68 transitions, 805 flow [2024-11-24 00:51:38,778 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 18.2) internal successors, (91), 5 states have internal predecessors, (91), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-24 00:51:38,778 INFO L198 CegarLoopForPetriNet]: Found error trace [2024-11-24 00:51:38,778 INFO L206 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-24 00:51:38,779 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable14 [2024-11-24 00:51:38,779 INFO L396 AbstractCegarLoop]: === Iteration 16 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONMEMORY_LEAK === [P0Err0ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr1ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr0ASSERT_VIOLATIONMEMORY_LEAK (and 4 more)] === [2024-11-24 00:51:38,779 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-24 00:51:38,779 INFO L85 PathProgramCache]: Analyzing trace with hash 1228726522, now seen corresponding path program 1 times [2024-11-24 00:51:38,780 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-24 00:51:38,780 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1234572248] [2024-11-24 00:51:38,780 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-24 00:51:38,780 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-24 00:51:38,862 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-24 00:51:39,126 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-24 00:51:39,126 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-24 00:51:39,127 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1234572248] [2024-11-24 00:51:39,127 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1234572248] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-24 00:51:39,127 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-24 00:51:39,127 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2024-11-24 00:51:39,127 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1754367312] [2024-11-24 00:51:39,127 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-24 00:51:39,128 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2024-11-24 00:51:39,128 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-24 00:51:39,128 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2024-11-24 00:51:39,128 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=12, Invalid=18, Unknown=0, NotChecked=0, Total=30 [2024-11-24 00:51:39,142 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 15 out of 44 [2024-11-24 00:51:39,142 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 96 places, 68 transitions, 805 flow. Second operand has 6 states, 6 states have (on average 18.0) internal successors, (108), 6 states have internal predecessors, (108), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-24 00:51:39,142 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-11-24 00:51:39,142 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 15 of 44 [2024-11-24 00:51:39,143 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-11-24 00:51:40,341 INFO L124 PetriNetUnfolderBase]: 2372/3873 cut-off events. [2024-11-24 00:51:40,341 INFO L125 PetriNetUnfolderBase]: For 109845/110693 co-relation queries the response was YES. [2024-11-24 00:51:40,357 INFO L83 FinitePrefix]: Finished finitePrefix Result has 26212 conditions, 3873 events. 2372/3873 cut-off events. For 109845/110693 co-relation queries the response was YES. Maximal size of possible extension queue 269. Compared 23330 event pairs, 340 based on Foata normal form. 598/4293 useless extension candidates. Maximal degree in co-relation 26177. Up to 1382 conditions per place. [2024-11-24 00:51:40,366 INFO L140 encePairwiseOnDemand]: 38/44 looper letters, 56 selfloop transitions, 11 changer transitions 26/106 dead transitions. [2024-11-24 00:51:40,367 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 101 places, 106 transitions, 1522 flow [2024-11-24 00:51:40,367 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2024-11-24 00:51:40,367 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 6 states. [2024-11-24 00:51:40,369 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6 states to 6 states and 150 transitions. [2024-11-24 00:51:40,371 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.5681818181818182 [2024-11-24 00:51:40,371 INFO L175 Difference]: Start difference. First operand has 96 places, 68 transitions, 805 flow. Second operand 6 states and 150 transitions. [2024-11-24 00:51:40,371 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 101 places, 106 transitions, 1522 flow [2024-11-24 00:51:40,560 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 94 places, 106 transitions, 1176 flow, removed 160 selfloop flow, removed 7 redundant places. [2024-11-24 00:51:40,562 INFO L231 Difference]: Finished difference. Result has 96 places, 51 transitions, 451 flow [2024-11-24 00:51:40,562 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=44, PETRI_DIFFERENCE_MINUEND_FLOW=603, PETRI_DIFFERENCE_MINUEND_PLACES=89, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=67, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=11, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=56, PETRI_DIFFERENCE_SUBTRAHEND_STATES=6, PETRI_FLOW=451, PETRI_PLACES=96, PETRI_TRANSITIONS=51} [2024-11-24 00:51:40,563 INFO L279 CegarLoopForPetriNet]: 49 programPoint places, 47 predicate places. [2024-11-24 00:51:40,563 INFO L471 AbstractCegarLoop]: Abstraction has has 96 places, 51 transitions, 451 flow [2024-11-24 00:51:40,563 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 18.0) internal successors, (108), 6 states have internal predecessors, (108), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-24 00:51:40,563 INFO L198 CegarLoopForPetriNet]: Found error trace [2024-11-24 00:51:40,563 INFO L206 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-24 00:51:40,563 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable15 [2024-11-24 00:51:40,563 INFO L396 AbstractCegarLoop]: === Iteration 17 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONMEMORY_LEAK === [P0Err0ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr1ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr0ASSERT_VIOLATIONMEMORY_LEAK (and 4 more)] === [2024-11-24 00:51:40,564 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-24 00:51:40,564 INFO L85 PathProgramCache]: Analyzing trace with hash 1331707633, now seen corresponding path program 1 times [2024-11-24 00:51:40,564 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-24 00:51:40,564 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1942000687] [2024-11-24 00:51:40,564 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-24 00:51:40,564 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-24 00:51:40,614 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-24 00:51:41,595 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-24 00:51:41,596 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-24 00:51:41,596 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1942000687] [2024-11-24 00:51:41,596 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1942000687] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-24 00:51:41,596 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-24 00:51:41,596 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2024-11-24 00:51:41,596 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1071095762] [2024-11-24 00:51:41,596 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-24 00:51:41,597 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 9 states [2024-11-24 00:51:41,597 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-24 00:51:41,598 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2024-11-24 00:51:41,598 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=19, Invalid=53, Unknown=0, NotChecked=0, Total=72 [2024-11-24 00:51:41,611 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 17 out of 44 [2024-11-24 00:51:41,611 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 96 places, 51 transitions, 451 flow. Second operand has 9 states, 9 states have (on average 18.88888888888889) internal successors, (170), 9 states have internal predecessors, (170), 0 states have call successors, (0), 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-24 00:51:41,611 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-11-24 00:51:41,611 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 17 of 44 [2024-11-24 00:51:41,611 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-11-24 00:51:42,198 INFO L124 PetriNetUnfolderBase]: 568/1168 cut-off events. [2024-11-24 00:51:42,199 INFO L125 PetriNetUnfolderBase]: For 13482/13679 co-relation queries the response was YES. [2024-11-24 00:51:42,207 INFO L83 FinitePrefix]: Finished finitePrefix Result has 5566 conditions, 1168 events. 568/1168 cut-off events. For 13482/13679 co-relation queries the response was YES. Maximal size of possible extension queue 121. Compared 6701 event pairs, 153 based on Foata normal form. 22/1086 useless extension candidates. Maximal degree in co-relation 5534. Up to 522 conditions per place. [2024-11-24 00:51:42,210 INFO L140 encePairwiseOnDemand]: 35/44 looper letters, 33 selfloop transitions, 13 changer transitions 11/79 dead transitions. [2024-11-24 00:51:42,211 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 101 places, 79 transitions, 699 flow [2024-11-24 00:51:42,212 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2024-11-24 00:51:42,212 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 8 states. [2024-11-24 00:51:42,213 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 8 states to 8 states and 189 transitions. [2024-11-24 00:51:42,213 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.5369318181818182 [2024-11-24 00:51:42,214 INFO L175 Difference]: Start difference. First operand has 96 places, 51 transitions, 451 flow. Second operand 8 states and 189 transitions. [2024-11-24 00:51:42,214 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 101 places, 79 transitions, 699 flow [2024-11-24 00:51:42,237 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 72 places, 79 transitions, 474 flow, removed 68 selfloop flow, removed 29 redundant places. [2024-11-24 00:51:42,238 INFO L231 Difference]: Finished difference. Result has 75 places, 52 transitions, 326 flow [2024-11-24 00:51:42,238 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=44, PETRI_DIFFERENCE_MINUEND_FLOW=272, PETRI_DIFFERENCE_MINUEND_PLACES=65, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=51, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=11, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=38, PETRI_DIFFERENCE_SUBTRAHEND_STATES=8, PETRI_FLOW=326, PETRI_PLACES=75, PETRI_TRANSITIONS=52} [2024-11-24 00:51:42,240 INFO L279 CegarLoopForPetriNet]: 49 programPoint places, 26 predicate places. [2024-11-24 00:51:42,240 INFO L471 AbstractCegarLoop]: Abstraction has has 75 places, 52 transitions, 326 flow [2024-11-24 00:51:42,240 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 9 states, 9 states have (on average 18.88888888888889) internal successors, (170), 9 states have internal predecessors, (170), 0 states have call successors, (0), 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-24 00:51:42,240 INFO L198 CegarLoopForPetriNet]: Found error trace [2024-11-24 00:51:42,240 INFO L206 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-24 00:51:42,240 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable16 [2024-11-24 00:51:42,241 INFO L396 AbstractCegarLoop]: === Iteration 18 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONMEMORY_LEAK === [P0Err0ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr1ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr0ASSERT_VIOLATIONMEMORY_LEAK (and 4 more)] === [2024-11-24 00:51:42,241 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-24 00:51:42,241 INFO L85 PathProgramCache]: Analyzing trace with hash 1937860551, now seen corresponding path program 2 times [2024-11-24 00:51:42,241 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-24 00:51:42,241 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [651550077] [2024-11-24 00:51:42,241 INFO L95 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2024-11-24 00:51:42,241 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-24 00:51:42,294 INFO L229 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 1 check-sat command(s) [2024-11-24 00:51:42,295 INFO L230 tOrderPrioritization]: Conjunction of SSA is unsat [2024-11-24 00:51:43,706 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-24 00:51:43,707 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-24 00:51:43,707 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [651550077] [2024-11-24 00:51:43,707 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [651550077] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-24 00:51:43,707 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-24 00:51:43,707 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [9] imperfect sequences [] total 9 [2024-11-24 00:51:43,707 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [796127066] [2024-11-24 00:51:43,707 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-24 00:51:43,708 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 10 states [2024-11-24 00:51:43,708 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-24 00:51:43,708 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2024-11-24 00:51:43,708 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=21, Invalid=69, Unknown=0, NotChecked=0, Total=90 [2024-11-24 00:51:43,712 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 17 out of 44 [2024-11-24 00:51:43,712 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 75 places, 52 transitions, 326 flow. Second operand has 10 states, 10 states have (on average 18.7) internal successors, (187), 10 states have internal predecessors, (187), 0 states have call successors, (0), 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-24 00:51:43,714 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-11-24 00:51:43,714 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 17 of 44 [2024-11-24 00:51:43,714 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-11-24 00:51:44,314 INFO L124 PetriNetUnfolderBase]: 668/1396 cut-off events. [2024-11-24 00:51:44,314 INFO L125 PetriNetUnfolderBase]: For 2718/2886 co-relation queries the response was YES. [2024-11-24 00:51:44,321 INFO L83 FinitePrefix]: Finished finitePrefix Result has 4339 conditions, 1396 events. 668/1396 cut-off events. For 2718/2886 co-relation queries the response was YES. Maximal size of possible extension queue 144. Compared 8643 event pairs, 219 based on Foata normal form. 25/1297 useless extension candidates. Maximal degree in co-relation 4321. Up to 538 conditions per place. [2024-11-24 00:51:44,324 INFO L140 encePairwiseOnDemand]: 37/44 looper letters, 31 selfloop transitions, 5 changer transitions 19/76 dead transitions. [2024-11-24 00:51:44,325 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 79 places, 76 transitions, 508 flow [2024-11-24 00:51:44,325 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2024-11-24 00:51:44,325 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 7 states. [2024-11-24 00:51:44,326 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 7 states to 7 states and 166 transitions. [2024-11-24 00:51:44,326 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.538961038961039 [2024-11-24 00:51:44,326 INFO L175 Difference]: Start difference. First operand has 75 places, 52 transitions, 326 flow. Second operand 7 states and 166 transitions. [2024-11-24 00:51:44,327 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 79 places, 76 transitions, 508 flow [2024-11-24 00:51:44,331 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 71 places, 76 transitions, 463 flow, removed 10 selfloop flow, removed 8 redundant places. [2024-11-24 00:51:44,332 INFO L231 Difference]: Finished difference. Result has 74 places, 48 transitions, 267 flow [2024-11-24 00:51:44,333 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=44, PETRI_DIFFERENCE_MINUEND_FLOW=283, PETRI_DIFFERENCE_MINUEND_PLACES=65, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=52, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=5, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=47, PETRI_DIFFERENCE_SUBTRAHEND_STATES=7, PETRI_FLOW=267, PETRI_PLACES=74, PETRI_TRANSITIONS=48} [2024-11-24 00:51:44,333 INFO L279 CegarLoopForPetriNet]: 49 programPoint places, 25 predicate places. [2024-11-24 00:51:44,333 INFO L471 AbstractCegarLoop]: Abstraction has has 74 places, 48 transitions, 267 flow [2024-11-24 00:51:44,334 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 10 states, 10 states have (on average 18.7) internal successors, (187), 10 states have internal predecessors, (187), 0 states have call successors, (0), 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-24 00:51:44,334 INFO L198 CegarLoopForPetriNet]: Found error trace [2024-11-24 00:51:44,334 INFO L206 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-24 00:51:44,334 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable17 [2024-11-24 00:51:44,334 INFO L396 AbstractCegarLoop]: === Iteration 19 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONMEMORY_LEAK === [P0Err0ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr1ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr0ASSERT_VIOLATIONMEMORY_LEAK (and 4 more)] === [2024-11-24 00:51:44,335 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-24 00:51:44,335 INFO L85 PathProgramCache]: Analyzing trace with hash 859623961, now seen corresponding path program 3 times [2024-11-24 00:51:44,335 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-24 00:51:44,335 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2042244704] [2024-11-24 00:51:44,335 INFO L95 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST2 [2024-11-24 00:51:44,335 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-24 00:51:44,430 INFO L229 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued 1 check-sat command(s) [2024-11-24 00:51:44,431 INFO L230 tOrderPrioritization]: Conjunction of SSA is sat [2024-11-24 00:51:44,431 INFO L357 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2024-11-24 00:51:44,514 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-11-24 00:51:44,558 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2024-11-24 00:51:44,559 INFO L340 BasicCegarLoop]: Counterexample is feasible [2024-11-24 00:51:44,560 INFO L782 garLoopResultBuilder]: Registering result UNSAFE for location ULTIMATE.startErr0ASSERT_VIOLATIONMEMORY_LEAK (6 of 7 remaining) [2024-11-24 00:51:44,562 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location P0Err0ASSERT_VIOLATIONMEMORY_LEAK (5 of 7 remaining) [2024-11-24 00:51:44,562 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr1ASSERT_VIOLATIONMEMORY_LEAK (4 of 7 remaining) [2024-11-24 00:51:44,562 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (3 of 7 remaining) [2024-11-24 00:51:44,563 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (2 of 7 remaining) [2024-11-24 00:51:44,563 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr2INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (1 of 7 remaining) [2024-11-24 00:51:44,563 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location P0Err0ASSERT_VIOLATIONMEMORY_LEAK (0 of 7 remaining) [2024-11-24 00:51:44,563 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable18 [2024-11-24 00:51:44,564 INFO L422 BasicCegarLoop]: Path program histogram: [3, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-24 00:51:44,667 INFO L241 ceAbstractionStarter]: Analysis of concurrent program completed with 1 thread instances [2024-11-24 00:51:44,667 INFO L170 ceAbstractionStarter]: Computing trace abstraction results [2024-11-24 00:51:44,674 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 24.11 12:51:44 BasicIcfg [2024-11-24 00:51:44,674 INFO L131 PluginConnector]: ------------------------ END TraceAbstraction---------------------------- [2024-11-24 00:51:44,676 INFO L112 PluginConnector]: ------------------------Witness Printer---------------------------- [2024-11-24 00:51:44,676 INFO L270 PluginConnector]: Initializing Witness Printer... [2024-11-24 00:51:44,677 INFO L274 PluginConnector]: Witness Printer initialized [2024-11-24 00:51:44,677 INFO L184 PluginConnector]: Executing the observer RCFGCatcher from plugin Witness Printer for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 24.11 12:51:11" (3/4) ... [2024-11-24 00:51:44,680 INFO L149 WitnessPrinter]: No result that supports witness generation found [2024-11-24 00:51:44,681 INFO L131 PluginConnector]: ------------------------ END Witness Printer---------------------------- [2024-11-24 00:51:44,683 INFO L158 Benchmark]: Toolchain (without parser) took 35214.79ms. Allocated memory was 142.6MB in the beginning and 1.2GB in the end (delta: 1.1GB). Free memory was 117.7MB in the beginning and 885.6MB in the end (delta: -767.9MB). Peak memory consumption was 334.6MB. Max. memory is 16.1GB. [2024-11-24 00:51:44,684 INFO L158 Benchmark]: CDTParser took 1.54ms. Allocated memory is still 142.6MB. Free memory is still 80.7MB. There was no memory consumed. Max. memory is 16.1GB. [2024-11-24 00:51:44,684 INFO L158 Benchmark]: CACSL2BoogieTranslator took 648.35ms. Allocated memory is still 142.6MB. Free memory was 117.4MB in the beginning and 94.5MB in the end (delta: 23.0MB). Peak memory consumption was 25.2MB. Max. memory is 16.1GB. [2024-11-24 00:51:44,685 INFO L158 Benchmark]: Boogie Procedure Inliner took 54.16ms. Allocated memory is still 142.6MB. Free memory was 94.2MB in the beginning and 91.8MB in the end (delta: 2.4MB). There was no memory consumed. Max. memory is 16.1GB. [2024-11-24 00:51:44,686 INFO L158 Benchmark]: Boogie Preprocessor took 47.37ms. Allocated memory is still 142.6MB. Free memory was 91.8MB in the beginning and 88.8MB in the end (delta: 2.9MB). There was no memory consumed. Max. memory is 16.1GB. [2024-11-24 00:51:44,686 INFO L158 Benchmark]: RCFGBuilder took 1067.34ms. Allocated memory is still 142.6MB. Free memory was 88.6MB in the beginning and 89.2MB in the end (delta: -585.1kB). Peak memory consumption was 38.9MB. Max. memory is 16.1GB. [2024-11-24 00:51:44,687 INFO L158 Benchmark]: TraceAbstraction took 33384.03ms. Allocated memory was 142.6MB in the beginning and 1.2GB in the end (delta: 1.1GB). Free memory was 88.6MB in the beginning and 885.8MB in the end (delta: -797.2MB). Peak memory consumption was 295.7MB. Max. memory is 16.1GB. [2024-11-24 00:51:44,688 INFO L158 Benchmark]: Witness Printer took 5.41ms. Allocated memory is still 1.2GB. Free memory was 885.8MB in the beginning and 885.6MB in the end (delta: 169.6kB). Peak memory consumption was 8.4MB. Max. memory is 16.1GB. [2024-11-24 00:51:44,690 INFO L338 ainManager$Toolchain]: ####################### End [Toolchain 1] ####################### --- Results --- * Results from de.uni_freiburg.informatik.ultimate.core: - StatisticsResult: Toolchain Benchmarks Benchmark results are: * CDTParser took 1.54ms. Allocated memory is still 142.6MB. Free memory is still 80.7MB. There was no memory consumed. Max. memory is 16.1GB. * CACSL2BoogieTranslator took 648.35ms. Allocated memory is still 142.6MB. Free memory was 117.4MB in the beginning and 94.5MB in the end (delta: 23.0MB). Peak memory consumption was 25.2MB. Max. memory is 16.1GB. * Boogie Procedure Inliner took 54.16ms. Allocated memory is still 142.6MB. Free memory was 94.2MB in the beginning and 91.8MB in the end (delta: 2.4MB). There was no memory consumed. Max. memory is 16.1GB. * Boogie Preprocessor took 47.37ms. Allocated memory is still 142.6MB. Free memory was 91.8MB in the beginning and 88.8MB in the end (delta: 2.9MB). There was no memory consumed. Max. memory is 16.1GB. * RCFGBuilder took 1067.34ms. Allocated memory is still 142.6MB. Free memory was 88.6MB in the beginning and 89.2MB in the end (delta: -585.1kB). Peak memory consumption was 38.9MB. Max. memory is 16.1GB. * TraceAbstraction took 33384.03ms. Allocated memory was 142.6MB in the beginning and 1.2GB in the end (delta: 1.1GB). Free memory was 88.6MB in the beginning and 885.8MB in the end (delta: -797.2MB). Peak memory consumption was 295.7MB. Max. memory is 16.1GB. * Witness Printer took 5.41ms. Allocated memory is still 1.2GB. Free memory was 885.8MB in the beginning and 885.6MB in the end (delta: 169.6kB). 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_p2_EAX = 0; [L712] 0 _Bool main$tmp_guard0; [L713] 0 _Bool main$tmp_guard1; [L715] 0 int x = 0; [L717] 0 int y = 0; [L719] 0 int z = 0; [L720] 0 _Bool z$flush_delayed; [L721] 0 int z$mem_tmp; [L722] 0 _Bool z$r_buff0_thd0; [L723] 0 _Bool z$r_buff0_thd1; [L724] 0 _Bool z$r_buff0_thd2; [L725] 0 _Bool z$r_buff0_thd3; [L726] 0 _Bool z$r_buff1_thd0; [L727] 0 _Bool z$r_buff1_thd1; [L728] 0 _Bool z$r_buff1_thd2; [L729] 0 _Bool z$r_buff1_thd3; [L730] 0 _Bool z$read_delayed; [L731] 0 int *z$read_delayed_var; [L732] 0 int z$w_buff0; [L733] 0 _Bool z$w_buff0_used; [L734] 0 int z$w_buff1; [L735] 0 _Bool z$w_buff1_used; [L736] 0 _Bool weak$$choice0; [L737] 0 _Bool weak$$choice2; [L818] 0 pthread_t t2025; [L819] FCALL, FORK 0 pthread_create(&t2025, ((void *)0), P0, ((void *)0)) VAL [__unbuffered_cnt=0, __unbuffered_p2_EAX=0, main$tmp_guard0=0, main$tmp_guard1=0, t2025=-1, weak$$choice0=0, weak$$choice2=0, x=0, y=0, z$flush_delayed=0, z$mem_tmp=0, z$r_buff0_thd0=0, z$r_buff0_thd1=0, z$r_buff0_thd2=0, z$r_buff0_thd3=0, z$r_buff1_thd0=0, z$r_buff1_thd1=0, z$r_buff1_thd2=0, z$r_buff1_thd3=0, z$read_delayed=0, z$read_delayed_var={0:0}, z$w_buff0=0, z$w_buff0_used=0, z$w_buff1=0, z$w_buff1_used=0, z=0] [L820] 0 pthread_t t2026; [L821] FCALL, FORK 0 pthread_create(&t2026, ((void *)0), P1, ((void *)0)) VAL [\old(arg)={0:0}, __unbuffered_cnt=0, __unbuffered_p2_EAX=0, main$tmp_guard0=0, main$tmp_guard1=0, t2025=-1, t2026=0, weak$$choice0=0, weak$$choice2=0, x=0, y=0, z$flush_delayed=0, z$mem_tmp=0, z$r_buff0_thd0=0, z$r_buff0_thd1=0, z$r_buff0_thd2=0, z$r_buff0_thd3=0, z$r_buff1_thd0=0, z$r_buff1_thd1=0, z$r_buff1_thd2=0, z$r_buff1_thd3=0, z$read_delayed=0, z$read_delayed_var={0:0}, z$w_buff0=0, z$w_buff0_used=0, z$w_buff1=0, z$w_buff1_used=0, z=0] [L822] 0 pthread_t t2027; [L823] FCALL, FORK 0 pthread_create(&t2027, ((void *)0), P2, ((void *)0)) VAL [\old(arg)={0:0}, \old(arg)={0:0}, __unbuffered_cnt=0, __unbuffered_p2_EAX=0, main$tmp_guard0=0, main$tmp_guard1=0, t2025=-1, t2026=0, t2027=1, weak$$choice0=0, weak$$choice2=0, x=0, y=0, z$flush_delayed=0, z$mem_tmp=0, z$r_buff0_thd0=0, z$r_buff0_thd1=0, z$r_buff0_thd2=0, z$r_buff0_thd3=0, z$r_buff1_thd0=0, z$r_buff1_thd1=0, z$r_buff1_thd2=0, z$r_buff1_thd3=0, z$read_delayed=0, z$read_delayed_var={0:0}, z$w_buff0=0, z$w_buff0_used=0, z$w_buff1=0, z$w_buff1_used=0, z=0] [L741] 1 z$w_buff1 = z$w_buff0 [L742] 1 z$w_buff0 = 2 [L743] 1 z$w_buff1_used = z$w_buff0_used [L744] 1 z$w_buff0_used = (_Bool)1 [L745] CALL 1 __VERIFIER_assert(!(z$w_buff1_used && z$w_buff0_used)) [L18] COND FALSE 1 !(!expression) [L745] RET 1 __VERIFIER_assert(!(z$w_buff1_used && z$w_buff0_used)) [L746] 1 z$r_buff1_thd0 = z$r_buff0_thd0 [L747] 1 z$r_buff1_thd1 = z$r_buff0_thd1 [L748] 1 z$r_buff1_thd2 = z$r_buff0_thd2 [L749] 1 z$r_buff1_thd3 = z$r_buff0_thd3 [L750] 1 z$r_buff0_thd1 = (_Bool)1 VAL [\old(arg)={0:0}, \old(arg)={0:0}, \old(arg)={0:0}, __unbuffered_cnt=0, __unbuffered_p2_EAX=0, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=0, x=0, y=0, z$flush_delayed=0, z$mem_tmp=0, z$r_buff0_thd0=0, z$r_buff0_thd1=1, z$r_buff0_thd2=0, z$r_buff0_thd3=0, z$r_buff1_thd0=0, z$r_buff1_thd1=0, z$r_buff1_thd2=0, z$r_buff1_thd3=0, z$read_delayed=0, z$read_delayed_var={0:0}, z$w_buff0=2, z$w_buff0_used=1, z$w_buff1=0, z$w_buff1_used=0, z=0] [L753] 1 x = 1 VAL [\old(arg)={0:0}, \old(arg)={0:0}, \old(arg)={0:0}, __unbuffered_cnt=0, __unbuffered_p2_EAX=0, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=0, x=1, y=0, z$flush_delayed=0, z$mem_tmp=0, z$r_buff0_thd0=0, z$r_buff0_thd1=1, z$r_buff0_thd2=0, z$r_buff0_thd3=0, z$r_buff1_thd0=0, z$r_buff1_thd1=0, z$r_buff1_thd2=0, z$r_buff1_thd3=0, z$read_delayed=0, z$read_delayed_var={0:0}, z$w_buff0=2, z$w_buff0_used=1, z$w_buff1=0, z$w_buff1_used=0, z=0] [L770] 2 x = 2 VAL [\old(arg)={0:0}, \old(arg)={0:0}, __unbuffered_cnt=0, __unbuffered_p2_EAX=0, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=0, x=2, y=0, z$flush_delayed=0, z$mem_tmp=0, z$r_buff0_thd0=0, z$r_buff0_thd1=1, z$r_buff0_thd2=0, z$r_buff0_thd3=0, z$r_buff1_thd0=0, z$r_buff1_thd1=0, z$r_buff1_thd2=0, z$r_buff1_thd3=0, z$read_delayed=0, z$read_delayed_var={0:0}, z$w_buff0=2, z$w_buff0_used=1, z$w_buff1=0, z$w_buff1_used=0, z=0] [L773] 2 y = 1 VAL [\old(arg)={0:0}, \old(arg)={0:0}, __unbuffered_cnt=0, __unbuffered_p2_EAX=0, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=0, x=2, y=1, z$flush_delayed=0, z$mem_tmp=0, z$r_buff0_thd0=0, z$r_buff0_thd1=1, z$r_buff0_thd2=0, z$r_buff0_thd3=0, z$r_buff1_thd0=0, z$r_buff1_thd1=0, z$r_buff1_thd2=0, z$r_buff1_thd3=0, z$read_delayed=0, z$read_delayed_var={0:0}, z$w_buff0=2, z$w_buff0_used=1, z$w_buff1=0, z$w_buff1_used=0, z=0] [L776] 2 z = z$w_buff0_used && z$r_buff0_thd2 ? z$w_buff0 : (z$w_buff1_used && z$r_buff1_thd2 ? z$w_buff1 : z) [L777] 2 z$w_buff0_used = z$w_buff0_used && z$r_buff0_thd2 ? (_Bool)0 : z$w_buff0_used [L778] 2 z$w_buff1_used = z$w_buff0_used && z$r_buff0_thd2 || z$w_buff1_used && z$r_buff1_thd2 ? (_Bool)0 : z$w_buff1_used [L779] 2 z$r_buff0_thd2 = z$w_buff0_used && z$r_buff0_thd2 ? (_Bool)0 : z$r_buff0_thd2 [L780] 2 z$r_buff1_thd2 = z$w_buff0_used && z$r_buff0_thd2 || z$w_buff1_used && z$r_buff1_thd2 ? (_Bool)0 : z$r_buff1_thd2 VAL [\old(arg)={0:0}, \old(arg)={0:0}, __unbuffered_cnt=0, __unbuffered_p2_EAX=0, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=0, x=2, y=1, z$flush_delayed=0, z$mem_tmp=0, z$r_buff0_thd0=0, z$r_buff0_thd1=1, z$r_buff0_thd2=0, z$r_buff0_thd3=0, z$r_buff1_thd0=0, z$r_buff1_thd1=0, z$r_buff1_thd2=0, z$r_buff1_thd3=0, z$read_delayed=0, z$read_delayed_var={0:0}, z$w_buff0=2, z$w_buff0_used=1, z$w_buff1=0, z$w_buff1_used=0, z=0] [L790] 3 __unbuffered_p2_EAX = y VAL [\old(arg)={0:0}, \old(arg)={0:0}, __unbuffered_cnt=0, __unbuffered_p2_EAX=1, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=0, x=2, y=1, z$flush_delayed=0, z$mem_tmp=0, z$r_buff0_thd0=0, z$r_buff0_thd1=1, z$r_buff0_thd2=0, z$r_buff0_thd3=0, z$r_buff1_thd0=0, z$r_buff1_thd1=0, z$r_buff1_thd2=0, z$r_buff1_thd3=0, z$read_delayed=0, z$read_delayed_var={0:0}, z$w_buff0=2, z$w_buff0_used=1, z$w_buff1=0, z$w_buff1_used=0, z=0] [L793] 3 z = 1 VAL [\old(arg)={0:0}, \old(arg)={0:0}, __unbuffered_cnt=0, __unbuffered_p2_EAX=1, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=0, x=2, y=1, z$flush_delayed=0, z$mem_tmp=0, z$r_buff0_thd0=0, z$r_buff0_thd1=1, z$r_buff0_thd2=0, z$r_buff0_thd3=0, z$r_buff1_thd0=0, z$r_buff1_thd1=0, z$r_buff1_thd2=0, z$r_buff1_thd3=0, z$read_delayed=0, z$read_delayed_var={0:0}, z$w_buff0=2, z$w_buff0_used=1, z$w_buff1=0, z$w_buff1_used=0, z=1] [L756] 1 z = z$w_buff0_used && z$r_buff0_thd1 ? z$w_buff0 : (z$w_buff1_used && z$r_buff1_thd1 ? z$w_buff1 : z) [L757] 1 z$w_buff0_used = z$w_buff0_used && z$r_buff0_thd1 ? (_Bool)0 : z$w_buff0_used [L758] 1 z$w_buff1_used = z$w_buff0_used && z$r_buff0_thd1 || z$w_buff1_used && z$r_buff1_thd1 ? (_Bool)0 : z$w_buff1_used [L759] 1 z$r_buff0_thd1 = z$w_buff0_used && z$r_buff0_thd1 ? (_Bool)0 : z$r_buff0_thd1 [L760] 1 z$r_buff1_thd1 = z$w_buff0_used && z$r_buff0_thd1 || z$w_buff1_used && z$r_buff1_thd1 ? (_Bool)0 : z$r_buff1_thd1 VAL [\old(arg)={0:0}, \old(arg)={0:0}, \old(arg)={0:0}, __unbuffered_cnt=0, __unbuffered_p2_EAX=1, arg={0:0}, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=0, x=2, y=1, z$flush_delayed=0, z$mem_tmp=0, z$r_buff0_thd0=0, z$r_buff0_thd1=1, z$r_buff0_thd2=0, z$r_buff0_thd3=0, z$r_buff1_thd0=0, z$r_buff1_thd1=0, z$r_buff1_thd2=0, z$r_buff1_thd3=0, z$read_delayed=0, z$read_delayed_var={0:0}, z$w_buff0=2, z$w_buff0_used=0, z$w_buff1=0, z$w_buff1_used=0, z=2] [L796] 3 z = z$w_buff0_used && z$r_buff0_thd3 ? z$w_buff0 : (z$w_buff1_used && z$r_buff1_thd3 ? z$w_buff1 : z) [L797] 3 z$w_buff0_used = z$w_buff0_used && z$r_buff0_thd3 ? (_Bool)0 : z$w_buff0_used [L798] 3 z$w_buff1_used = z$w_buff0_used && z$r_buff0_thd3 || z$w_buff1_used && z$r_buff1_thd3 ? (_Bool)0 : z$w_buff1_used [L799] 3 z$r_buff0_thd3 = z$w_buff0_used && z$r_buff0_thd3 ? (_Bool)0 : z$r_buff0_thd3 [L800] 3 z$r_buff1_thd3 = z$w_buff0_used && z$r_buff0_thd3 || z$w_buff1_used && z$r_buff1_thd3 ? (_Bool)0 : z$r_buff1_thd3 VAL [\old(arg)={0:0}, \old(arg)={0:0}, __unbuffered_cnt=0, __unbuffered_p2_EAX=1, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=0, x=2, y=1, z$flush_delayed=0, z$mem_tmp=0, z$r_buff0_thd0=0, z$r_buff0_thd1=1, z$r_buff0_thd2=0, z$r_buff0_thd3=0, z$r_buff1_thd0=0, z$r_buff1_thd1=0, z$r_buff1_thd2=0, z$r_buff1_thd3=0, z$read_delayed=0, z$read_delayed_var={0:0}, z$w_buff0=2, z$w_buff0_used=0, z$w_buff1=0, z$w_buff1_used=0, z=2] [L763] 1 __unbuffered_cnt = __unbuffered_cnt + 1 VAL [\old(arg)={0:0}, \old(arg)={0:0}, \old(arg)={0:0}, __unbuffered_cnt=1, __unbuffered_p2_EAX=1, arg={0:0}, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=0, x=2, y=1, z$flush_delayed=0, z$mem_tmp=0, z$r_buff0_thd0=0, z$r_buff0_thd1=1, z$r_buff0_thd2=0, z$r_buff0_thd3=0, z$r_buff1_thd0=0, z$r_buff1_thd1=0, z$r_buff1_thd2=0, z$r_buff1_thd3=0, z$read_delayed=0, z$read_delayed_var={0:0}, z$w_buff0=2, z$w_buff0_used=0, z$w_buff1=0, z$w_buff1_used=0, z=2] [L783] 2 __unbuffered_cnt = __unbuffered_cnt + 1 VAL [\old(arg)={0:0}, \old(arg)={0:0}, __unbuffered_cnt=2, __unbuffered_p2_EAX=1, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=0, x=2, y=1, z$flush_delayed=0, z$mem_tmp=0, z$r_buff0_thd0=0, z$r_buff0_thd1=1, z$r_buff0_thd2=0, z$r_buff0_thd3=0, z$r_buff1_thd0=0, z$r_buff1_thd1=0, z$r_buff1_thd2=0, z$r_buff1_thd3=0, z$read_delayed=0, z$read_delayed_var={0:0}, z$w_buff0=2, z$w_buff0_used=0, z$w_buff1=0, z$w_buff1_used=0, z=2] [L803] 3 __unbuffered_cnt = __unbuffered_cnt + 1 VAL [\old(arg)={0:0}, \old(arg)={0:0}, __unbuffered_cnt=3, __unbuffered_p2_EAX=1, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=0, x=2, y=1, z$flush_delayed=0, z$mem_tmp=0, z$r_buff0_thd0=0, z$r_buff0_thd1=1, z$r_buff0_thd2=0, z$r_buff0_thd3=0, z$r_buff1_thd0=0, z$r_buff1_thd1=0, z$r_buff1_thd2=0, z$r_buff1_thd3=0, z$read_delayed=0, z$read_delayed_var={0:0}, z$w_buff0=2, z$w_buff0_used=0, z$w_buff1=0, z$w_buff1_used=0, z=2] [L825] 0 main$tmp_guard0 = __unbuffered_cnt == 3 VAL [\old(arg)={0:0}, \old(arg)={0:0}, __unbuffered_cnt=3, __unbuffered_p2_EAX=1, arg={0:0}, arg={0:0}, main$tmp_guard0=1, main$tmp_guard1=0, t2025=-1, t2026=0, t2027=1, weak$$choice0=0, weak$$choice2=0, x=2, y=1, z$flush_delayed=0, z$mem_tmp=0, z$r_buff0_thd0=0, z$r_buff0_thd1=1, z$r_buff0_thd2=0, z$r_buff0_thd3=0, z$r_buff1_thd0=0, z$r_buff1_thd1=0, z$r_buff1_thd2=0, z$r_buff1_thd3=0, z$read_delayed=0, z$read_delayed_var={0:0}, z$w_buff0=2, z$w_buff0_used=0, z$w_buff1=0, z$w_buff1_used=0, z=2] [L827] CALL 0 assume_abort_if_not(main$tmp_guard0) [L3] COND FALSE 0 !(!cond) [L827] RET 0 assume_abort_if_not(main$tmp_guard0) [L829] 0 z = z$w_buff0_used && z$r_buff0_thd0 ? z$w_buff0 : (z$w_buff1_used && z$r_buff1_thd0 ? z$w_buff1 : z) [L830] 0 z$w_buff0_used = z$w_buff0_used && z$r_buff0_thd0 ? (_Bool)0 : z$w_buff0_used [L831] 0 z$w_buff1_used = z$w_buff0_used && z$r_buff0_thd0 || z$w_buff1_used && z$r_buff1_thd0 ? (_Bool)0 : z$w_buff1_used [L832] 0 z$r_buff0_thd0 = z$w_buff0_used && z$r_buff0_thd0 ? (_Bool)0 : z$r_buff0_thd0 [L833] 0 z$r_buff1_thd0 = z$w_buff0_used && z$r_buff0_thd0 || z$w_buff1_used && z$r_buff1_thd0 ? (_Bool)0 : z$r_buff1_thd0 VAL [\old(arg)={0:0}, \old(arg)={0:0}, __unbuffered_cnt=3, __unbuffered_p2_EAX=1, arg={0:0}, arg={0:0}, main$tmp_guard0=1, main$tmp_guard1=0, t2025=-1, t2026=0, t2027=1, weak$$choice0=0, weak$$choice2=0, x=2, y=1, z$flush_delayed=0, z$mem_tmp=0, z$r_buff0_thd0=0, z$r_buff0_thd1=1, z$r_buff0_thd2=0, z$r_buff0_thd3=0, z$r_buff1_thd0=0, z$r_buff1_thd1=0, z$r_buff1_thd2=0, z$r_buff1_thd3=0, z$read_delayed=0, z$read_delayed_var={0:0}, z$w_buff0=2, z$w_buff0_used=0, z$w_buff1=0, z$w_buff1_used=0, z=2] [L836] 0 weak$$choice0 = __VERIFIER_nondet_bool() [L837] 0 weak$$choice2 = __VERIFIER_nondet_bool() [L838] 0 z$flush_delayed = weak$$choice2 [L839] 0 z$mem_tmp = z [L840] 0 z = !z$w_buff0_used || !z$r_buff0_thd0 && !z$w_buff1_used || !z$r_buff0_thd0 && !z$r_buff1_thd0 ? z : (z$w_buff0_used && z$r_buff0_thd0 ? z$w_buff0 : z$w_buff1) [L841] 0 z$w_buff0 = weak$$choice2 ? z$w_buff0 : (!z$w_buff0_used || !z$r_buff0_thd0 && !z$w_buff1_used || !z$r_buff0_thd0 && !z$r_buff1_thd0 ? z$w_buff0 : (z$w_buff0_used && z$r_buff0_thd0 ? z$w_buff0 : z$w_buff0)) [L842] 0 z$w_buff1 = weak$$choice2 ? z$w_buff1 : (!z$w_buff0_used || !z$r_buff0_thd0 && !z$w_buff1_used || !z$r_buff0_thd0 && !z$r_buff1_thd0 ? z$w_buff1 : (z$w_buff0_used && z$r_buff0_thd0 ? z$w_buff1 : z$w_buff1)) [L843] 0 z$w_buff0_used = weak$$choice2 ? z$w_buff0_used : (!z$w_buff0_used || !z$r_buff0_thd0 && !z$w_buff1_used || !z$r_buff0_thd0 && !z$r_buff1_thd0 ? z$w_buff0_used : (z$w_buff0_used && z$r_buff0_thd0 ? (_Bool)0 : z$w_buff0_used)) [L844] 0 z$w_buff1_used = weak$$choice2 ? z$w_buff1_used : (!z$w_buff0_used || !z$r_buff0_thd0 && !z$w_buff1_used || !z$r_buff0_thd0 && !z$r_buff1_thd0 ? z$w_buff1_used : (z$w_buff0_used && z$r_buff0_thd0 ? (_Bool)0 : (_Bool)0)) [L845] 0 z$r_buff0_thd0 = weak$$choice2 ? z$r_buff0_thd0 : (!z$w_buff0_used || !z$r_buff0_thd0 && !z$w_buff1_used || !z$r_buff0_thd0 && !z$r_buff1_thd0 ? z$r_buff0_thd0 : (z$w_buff0_used && z$r_buff0_thd0 ? (_Bool)0 : z$r_buff0_thd0)) [L846] 0 z$r_buff1_thd0 = weak$$choice2 ? z$r_buff1_thd0 : (!z$w_buff0_used || !z$r_buff0_thd0 && !z$w_buff1_used || !z$r_buff0_thd0 && !z$r_buff1_thd0 ? z$r_buff1_thd0 : (z$w_buff0_used && z$r_buff0_thd0 ? (_Bool)0 : (_Bool)0)) [L847] 0 main$tmp_guard1 = !(x == 2 && z == 2 && __unbuffered_p2_EAX == 1) [L848] 0 z = z$flush_delayed ? z$mem_tmp : z [L849] 0 z$flush_delayed = (_Bool)0 VAL [\old(arg)={0:0}, \old(arg)={0:0}, __unbuffered_cnt=3, __unbuffered_p2_EAX=1, arg={0:0}, arg={0:0}, main$tmp_guard0=1, main$tmp_guard1=0, t2025=-1, t2026=0, t2027=1, weak$$choice0=0, weak$$choice2=0, x=2, y=1, z$flush_delayed=0, z$mem_tmp=2, z$r_buff0_thd0=0, z$r_buff0_thd1=1, z$r_buff0_thd2=0, z$r_buff0_thd3=0, z$r_buff1_thd0=0, z$r_buff1_thd1=0, z$r_buff1_thd2=0, z$r_buff1_thd3=0, z$read_delayed=0, z$read_delayed_var={0:0}, z$w_buff0=2, z$w_buff0_used=0, z$w_buff1=0, z$w_buff1_used=0, z=2] [L851] CALL 0 __VERIFIER_assert(main$tmp_guard1) [L18] COND TRUE 0 !expression [L18] CALL 0 reach_error() [L17] COND FALSE 0 !(0) VAL [\old(arg)={0:0}, \old(arg)={0:0}, __unbuffered_cnt=3, __unbuffered_p2_EAX=1, arg={0:0}, arg={0:0}, main$tmp_guard0=1, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=0, x=2, y=1, z$flush_delayed=0, z$mem_tmp=2, z$r_buff0_thd0=0, z$r_buff0_thd1=1, z$r_buff0_thd2=0, z$r_buff0_thd3=0, z$r_buff1_thd0=0, z$r_buff1_thd1=0, z$r_buff1_thd2=0, z$r_buff1_thd3=0, z$read_delayed=0, z$read_delayed_var={0:0}, z$w_buff0=2, z$w_buff0_used=0, z$w_buff1=0, z$w_buff1_used=0, z=2] [L17] 0 __assert_fail ("0", "safe011_power.oepc_pso.oepc_rmo.oepc_rmo.opt.c", 8, __extension__ __PRETTY_FUNCTION__) VAL [\old(arg)={0:0}, \old(arg)={0:0}, __unbuffered_cnt=3, __unbuffered_p2_EAX=1, arg={0:0}, arg={0:0}, main$tmp_guard0=1, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=0, x=2, y=1, z$flush_delayed=0, z$mem_tmp=2, z$r_buff0_thd0=0, z$r_buff0_thd1=1, z$r_buff0_thd2=0, z$r_buff0_thd3=0, z$r_buff1_thd0=0, z$r_buff1_thd1=0, z$r_buff1_thd2=0, z$r_buff1_thd3=0, z$read_delayed=0, z$read_delayed_var={0:0}, z$w_buff0=2, z$w_buff0_used=0, z$w_buff1=0, z$w_buff1_used=0, z=2] - UnprovableResult [Line: 17]: Unable to prove that all allocated memory was freed Unable to prove that all allocated memory was freed Reason: Not analyzed. - UnprovableResult [Line: 816]: Unable to prove that all allocated memory was freed Unable to prove that all allocated memory was freed Reason: Not analyzed. - UnprovableResult [Line: 823]: Unable to prove that petrification did provide enough thread instances (tool internal message) Unable to prove that petrification did provide enough thread instances (tool internal message) Reason: Not analyzed. - UnprovableResult [Line: 819]: Unable to prove that petrification did provide enough thread instances (tool internal message) Unable to prove that petrification did provide enough thread instances (tool internal message) Reason: Not analyzed. - UnprovableResult [Line: 821]: Unable to prove that petrification did provide enough thread instances (tool internal message) Unable to prove that petrification did provide enough thread instances (tool internal message) Reason: Not analyzed. - StatisticsResult: Ultimate Automizer benchmark data with 1 thread instances CFG has 7 procedures, 68 locations, 7 error locations. Started 1 CEGAR loops. EmptinessCheckTime: 0.0s, RemoveRedundantFlowTime: 0.0s, RemoveRedundantFlowUnfoldingTime: 0.0s, BackfoldingTime: 0.0s, BackfoldingUnfoldingTime: 0.0s, FlowIncreaseByBackfolding: 0, BasicCegarLoop: OverallTime: 33.1s, OverallIterations: 19, TraceHistogramMax: 1, PathProgramHistogramMax: 3, EmptinessCheckTime: 0.0s, AutomataDifference: 19.9s, DeadEndRemovalTime: 0.0s, HoareAnnotationTime: 0.0s, InitialAbstractionConstructionTime: 0.1s, HoareTripleCheckerStatistics: 0 mSolverCounterUnknown, 1002 SdHoareTripleChecker+Valid, 5.6s IncrementalHoareTripleChecker+Time, 0 mSdLazyCounter, 967 mSDsluCounter, 292 SdHoareTripleChecker+Invalid, 4.9s Time, 0 mProtectedAction, 0 SdHoareTripleChecker+Unchecked, 0 IncrementalHoareTripleChecker+Unchecked, 229 mSDsCounter, 140 IncrementalHoareTripleChecker+Valid, 0 mProtectedPredicate, 2778 IncrementalHoareTripleChecker+Invalid, 2918 SdHoareTripleChecker+Unknown, 0 mSolverCounterNotChecked, 140 mSolverCounterUnsat, 63 mSDtfsCounter, 2778 mSolverCounterSat, 0.1s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Unknown, PredicateUnifierStatistics: 0 DeclaredPredicates, 162 GetRequests, 17 SyntacticMatches, 0 SemanticMatches, 145 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 149 ImplicationChecksByTransitivity, 3.0s Time, 0.0s BasicInterpolantAutomatonTime, BiggestAbstraction: size=1449occurred in iteration=12, InterpolantAutomatonStates: 136, 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.7s SatisfiabilityAnalysisTime, 11.8s InterpolantComputationTime, 412 NumberOfCodeBlocks, 412 NumberOfCodeBlocksAsserted, 19 NumberOfCheckSat, 364 ConstructedInterpolants, 0 QuantifiedInterpolants, 3115 SizeOfPredicates, 0 NumberOfNonLiveVariables, 0 ConjunctsInSsa, 0 ConjunctsInUnsatCore, 18 InterpolantComputations, 18 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-24 00:51:44,720 INFO L552 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_6dde6ab7-fc66-4d3a-b16e-411b0308ee99/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 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_6dde6ab7-fc66-4d3a-b16e-411b0308ee99/bin/uautomizer-verify-LYvppIcaGC/data/config -Xmx15G -Xms4m -jar /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_6dde6ab7-fc66-4d3a-b16e-411b0308ee99/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_6dde6ab7-fc66-4d3a-b16e-411b0308ee99/bin/uautomizer-verify-LYvppIcaGC/data -tc /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_6dde6ab7-fc66-4d3a-b16e-411b0308ee99/bin/uautomizer-verify-LYvppIcaGC/config/AutomizerMemDerefMemtrack.xml -i ../../sv-benchmarks/c/pthread-wmm/safe011_power.oepc_pso.oepc_rmo.oepc_rmo.opt.i -s /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_6dde6ab7-fc66-4d3a-b16e-411b0308ee99/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_6dde6ab7-fc66-4d3a-b16e-411b0308ee99/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 2bbc774c97831725ad05d6c2dc910981cb4ce0a2559ec0561efc45418b96b7a4 --- Real Ultimate output --- This is Ultimate 0.3.0-dev-6497de0 [2024-11-24 00:51:47,793 INFO L188 SettingsManager]: Resetting all preferences to default values... [2024-11-24 00:51:47,948 INFO L114 SettingsManager]: Loading settings from /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_6dde6ab7-fc66-4d3a-b16e-411b0308ee99/bin/uautomizer-verify-LYvppIcaGC/config/svcomp-DerefFreeMemtrack-32bit-Automizer_Bitvector.epf [2024-11-24 00:51:47,955 WARN L101 SettingsManager]: Preference file contains the following unknown settings: [2024-11-24 00:51:47,956 WARN L103 SettingsManager]: * de.uni_freiburg.informatik.ultimate.core.Log level for class [2024-11-24 00:51:47,984 INFO L130 SettingsManager]: Preferences different from defaults after loading the file: [2024-11-24 00:51:47,985 INFO L151 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2024-11-24 00:51:47,986 INFO L153 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2024-11-24 00:51:47,986 INFO L151 SettingsManager]: Preferences of Boogie Preprocessor differ from their defaults: [2024-11-24 00:51:47,986 INFO L153 SettingsManager]: * Use memory slicer=true [2024-11-24 00:51:47,986 INFO L151 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2024-11-24 00:51:47,987 INFO L153 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2024-11-24 00:51:47,987 INFO L151 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2024-11-24 00:51:47,987 INFO L153 SettingsManager]: * Create parallel compositions if possible=false [2024-11-24 00:51:47,987 INFO L153 SettingsManager]: * Use SBE=true [2024-11-24 00:51:47,988 INFO L151 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2024-11-24 00:51:47,988 INFO L153 SettingsManager]: * sizeof long=4 [2024-11-24 00:51:47,988 INFO L153 SettingsManager]: * Overapproximate operations on floating types=true [2024-11-24 00:51:47,990 INFO L153 SettingsManager]: * sizeof POINTER=4 [2024-11-24 00:51:47,990 INFO L153 SettingsManager]: * Check division by zero=IGNORE [2024-11-24 00:51:47,990 INFO L153 SettingsManager]: * Check for the main procedure if all allocated memory was freed=true [2024-11-24 00:51:47,991 INFO L153 SettingsManager]: * Bitprecise bitfields=true [2024-11-24 00:51:47,991 INFO L153 SettingsManager]: * SV-COMP memtrack compatibility mode=true [2024-11-24 00:51:47,991 INFO L153 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2024-11-24 00:51:47,991 INFO L153 SettingsManager]: * Adapt memory model on pointer casts if necessary=true [2024-11-24 00:51:47,991 INFO L153 SettingsManager]: * Use bitvectors instead of ints=true [2024-11-24 00:51:47,991 INFO L153 SettingsManager]: * Memory model=HoenickeLindenmann_4ByteResolution [2024-11-24 00:51:47,992 INFO L153 SettingsManager]: * Check unreachability of reach_error function=false [2024-11-24 00:51:47,992 INFO L153 SettingsManager]: * sizeof long double=12 [2024-11-24 00:51:47,992 INFO L153 SettingsManager]: * Behaviour of calls to undefined functions=OVERAPPROXIMATE_BEHAVIOUR [2024-11-24 00:51:47,992 INFO L153 SettingsManager]: * Use constant arrays=true [2024-11-24 00:51:47,992 INFO L151 SettingsManager]: Preferences of IcfgBuilder differ from their defaults: [2024-11-24 00:51:47,992 INFO L153 SettingsManager]: * Size of a code block=SequenceOfStatements [2024-11-24 00:51:47,992 INFO L153 SettingsManager]: * Only consider context switches at boundaries of atomic blocks=true [2024-11-24 00:51:47,992 INFO L153 SettingsManager]: * SMT solver=External_DefaultMode [2024-11-24 00:51:47,992 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2024-11-24 00:51:47,992 INFO L151 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2024-11-24 00:51:47,993 INFO L153 SettingsManager]: * Size of a code block=SequenceOfStatements [2024-11-24 00:51:47,993 INFO L153 SettingsManager]: * Only consider context switches at boundaries of atomic blocks=true [2024-11-24 00:51:47,993 INFO L153 SettingsManager]: * SMT solver=External_DefaultMode [2024-11-24 00:51:47,993 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2024-11-24 00:51:47,993 INFO L151 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2024-11-24 00:51:47,993 INFO L153 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2024-11-24 00:51:47,993 INFO L153 SettingsManager]: * Trace refinement strategy=FOX [2024-11-24 00:51:47,993 INFO L153 SettingsManager]: * Command for external solver=cvc4 --incremental --print-success --lang smt [2024-11-24 00:51:47,993 INFO L153 SettingsManager]: * Apply one-shot large block encoding in concurrent analysis=false [2024-11-24 00:51:47,993 INFO L153 SettingsManager]: * Automaton type used in concurrency analysis=PETRI_NET [2024-11-24 00:51:47,993 INFO L153 SettingsManager]: * Order on configurations for Petri net unfoldings=DBO [2024-11-24 00:51:47,994 INFO L153 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2024-11-24 00:51:47,994 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_6dde6ab7-fc66-4d3a-b16e-411b0308ee99/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 -> 2bbc774c97831725ad05d6c2dc910981cb4ce0a2559ec0561efc45418b96b7a4 [2024-11-24 00:51:48,392 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2024-11-24 00:51:48,407 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2024-11-24 00:51:48,411 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2024-11-24 00:51:48,413 INFO L270 PluginConnector]: Initializing CDTParser... [2024-11-24 00:51:48,415 INFO L274 PluginConnector]: CDTParser initialized [2024-11-24 00:51:48,417 INFO L431 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_6dde6ab7-fc66-4d3a-b16e-411b0308ee99/bin/uautomizer-verify-LYvppIcaGC/../../sv-benchmarks/c/pthread-wmm/safe011_power.oepc_pso.oepc_rmo.oepc_rmo.opt.i [2024-11-24 00:51:51,576 INFO L533 CDTParser]: Created temporary CDT project at /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_6dde6ab7-fc66-4d3a-b16e-411b0308ee99/bin/uautomizer-verify-LYvppIcaGC/data/eb6726157/f9b5dfc7fd6e4be8a47764f80c8a94cf/FLAG3e119a5e4 [2024-11-24 00:51:51,927 INFO L384 CDTParser]: Found 1 translation units. [2024-11-24 00:51:51,928 INFO L180 CDTParser]: Scanning /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_6dde6ab7-fc66-4d3a-b16e-411b0308ee99/sv-benchmarks/c/pthread-wmm/safe011_power.oepc_pso.oepc_rmo.oepc_rmo.opt.i [2024-11-24 00:51:51,961 INFO L427 CDTParser]: About to delete temporary CDT project at /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_6dde6ab7-fc66-4d3a-b16e-411b0308ee99/bin/uautomizer-verify-LYvppIcaGC/data/eb6726157/f9b5dfc7fd6e4be8a47764f80c8a94cf/FLAG3e119a5e4 [2024-11-24 00:51:51,986 INFO L435 CDTParser]: Successfully deleted /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_6dde6ab7-fc66-4d3a-b16e-411b0308ee99/bin/uautomizer-verify-LYvppIcaGC/data/eb6726157/f9b5dfc7fd6e4be8a47764f80c8a94cf [2024-11-24 00:51:51,988 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2024-11-24 00:51:51,991 INFO L133 ToolchainWalker]: Walking toolchain with 6 elements. [2024-11-24 00:51:51,995 INFO L112 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2024-11-24 00:51:51,995 INFO L270 PluginConnector]: Initializing CACSL2BoogieTranslator... [2024-11-24 00:51:52,001 INFO L274 PluginConnector]: CACSL2BoogieTranslator initialized [2024-11-24 00:51:52,004 INFO L184 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 24.11 12:51:51" (1/1) ... [2024-11-24 00:51:52,005 INFO L204 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@2287f0b7 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 24.11 12:51:52, skipping insertion in model container [2024-11-24 00:51:52,005 INFO L184 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 24.11 12:51:51" (1/1) ... [2024-11-24 00:51:52,068 INFO L175 MainTranslator]: Built tables and reachable declarations [2024-11-24 00:51:52,579 INFO L210 PostProcessor]: Analyzing one entry point: main [2024-11-24 00:51:52,604 INFO L200 MainTranslator]: Completed pre-run [2024-11-24 00:51:52,683 INFO L210 PostProcessor]: Analyzing one entry point: main [2024-11-24 00:51:52,733 INFO L204 MainTranslator]: Completed translation [2024-11-24 00:51:52,734 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 24.11 12:51:52 WrapperNode [2024-11-24 00:51:52,735 INFO L131 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2024-11-24 00:51:52,737 INFO L112 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2024-11-24 00:51:52,737 INFO L270 PluginConnector]: Initializing Boogie Procedure Inliner... [2024-11-24 00:51:52,737 INFO L274 PluginConnector]: Boogie Procedure Inliner initialized [2024-11-24 00:51:52,745 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 24.11 12:51:52" (1/1) ... [2024-11-24 00:51:52,764 INFO L184 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 24.11 12:51:52" (1/1) ... [2024-11-24 00:51:52,813 INFO L138 Inliner]: procedures = 176, calls = 43, calls flagged for inlining = 6, calls inlined = 7, statements flattened = 138 [2024-11-24 00:51:52,817 INFO L131 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2024-11-24 00:51:52,817 INFO L112 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2024-11-24 00:51:52,817 INFO L270 PluginConnector]: Initializing Boogie Preprocessor... [2024-11-24 00:51:52,818 INFO L274 PluginConnector]: Boogie Preprocessor initialized [2024-11-24 00:51:52,831 INFO L184 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 24.11 12:51:52" (1/1) ... [2024-11-24 00:51:52,832 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 24.11 12:51:52" (1/1) ... [2024-11-24 00:51:52,836 INFO L184 PluginConnector]: Executing the observer MemorySlicer from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 24.11 12:51:52" (1/1) ... [2024-11-24 00:51:52,873 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-24 00:51:52,873 INFO L184 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 24.11 12:51:52" (1/1) ... [2024-11-24 00:51:52,873 INFO L184 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 24.11 12:51:52" (1/1) ... [2024-11-24 00:51:52,892 INFO L184 PluginConnector]: Executing the observer ReplaceArrayAssignments from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 24.11 12:51:52" (1/1) ... [2024-11-24 00:51:52,894 INFO L184 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 24.11 12:51:52" (1/1) ... [2024-11-24 00:51:52,898 INFO L184 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 24.11 12:51:52" (1/1) ... [2024-11-24 00:51:52,901 INFO L184 PluginConnector]: Executing the observer LTLStepAnnotator from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 24.11 12:51:52" (1/1) ... [2024-11-24 00:51:52,906 INFO L184 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 24.11 12:51:52" (1/1) ... [2024-11-24 00:51:52,913 INFO L131 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2024-11-24 00:51:52,917 INFO L112 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2024-11-24 00:51:52,917 INFO L270 PluginConnector]: Initializing RCFGBuilder... [2024-11-24 00:51:52,917 INFO L274 PluginConnector]: RCFGBuilder initialized [2024-11-24 00:51:52,919 INFO L184 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 24.11 12:51:52" (1/1) ... [2024-11-24 00:51:52,931 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2024-11-24 00:51:52,954 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_6dde6ab7-fc66-4d3a-b16e-411b0308ee99/bin/uautomizer-verify-LYvppIcaGC/z3 [2024-11-24 00:51:52,974 INFO L229 MonitoredProcess]: Starting monitored process 1 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_6dde6ab7-fc66-4d3a-b16e-411b0308ee99/bin/uautomizer-verify-LYvppIcaGC/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 (exit command is (exit), workingDir is null) [2024-11-24 00:51:52,979 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_6dde6ab7-fc66-4d3a-b16e-411b0308ee99/bin/uautomizer-verify-LYvppIcaGC/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 (1)] Waiting until timeout for monitored process [2024-11-24 00:51:53,014 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_atomic_begin [2024-11-24 00:51:53,014 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2024-11-24 00:51:53,014 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~intINTTYPE1#0 [2024-11-24 00:51:53,014 INFO L130 BoogieDeclarations]: Found specification of procedure P0 [2024-11-24 00:51:53,014 INFO L138 BoogieDeclarations]: Found implementation of procedure P0 [2024-11-24 00:51:53,015 INFO L130 BoogieDeclarations]: Found specification of procedure P1 [2024-11-24 00:51:53,015 INFO L138 BoogieDeclarations]: Found implementation of procedure P1 [2024-11-24 00:51:53,016 INFO L130 BoogieDeclarations]: Found specification of procedure P2 [2024-11-24 00:51:53,016 INFO L138 BoogieDeclarations]: Found implementation of procedure P2 [2024-11-24 00:51:53,016 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_atomic_end [2024-11-24 00:51:53,016 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2024-11-24 00:51:53,016 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2024-11-24 00:51:53,018 WARN L203 CfgBuilder]: User set CodeBlockSize to SequenceOfStatements but program contains fork statements. Overwriting the user preferences and setting CodeBlockSize to OneNontrivialStatement. [2024-11-24 00:51:53,236 INFO L234 CfgBuilder]: Building ICFG [2024-11-24 00:51:53,258 INFO L260 CfgBuilder]: Building CFG for each procedure with an implementation [2024-11-24 00:51:53,664 INFO L279 CfgBuilder]: Omitted future-live optimization because the input is a concurrent program. [2024-11-24 00:51:53,665 INFO L283 CfgBuilder]: Performing block encoding [2024-11-24 00:51:54,028 INFO L307 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2024-11-24 00:51:54,029 INFO L312 CfgBuilder]: Removed 0 assume(true) statements. [2024-11-24 00:51:54,030 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 24.11 12:51:54 BoogieIcfgContainer [2024-11-24 00:51:54,030 INFO L131 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2024-11-24 00:51:54,032 INFO L112 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2024-11-24 00:51:54,033 INFO L270 PluginConnector]: Initializing TraceAbstraction... [2024-11-24 00:51:54,042 INFO L274 PluginConnector]: TraceAbstraction initialized [2024-11-24 00:51:54,043 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 24.11 12:51:51" (1/3) ... [2024-11-24 00:51:54,043 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@2ab050d2 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 24.11 12:51:54, skipping insertion in model container [2024-11-24 00:51:54,043 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 24.11 12:51:52" (2/3) ... [2024-11-24 00:51:54,044 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@2ab050d2 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 24.11 12:51:54, skipping insertion in model container [2024-11-24 00:51:54,044 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 24.11 12:51:54" (3/3) ... [2024-11-24 00:51:54,045 INFO L128 eAbstractionObserver]: Analyzing ICFG safe011_power.oepc_pso.oepc_rmo.oepc_rmo.opt.i [2024-11-24 00:51:54,064 INFO L216 ceAbstractionStarter]: Automizer settings: Hoare:None NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2024-11-24 00:51:54,065 INFO L151 ceAbstractionStarter]: Applying trace abstraction to ICFG safe011_power.oepc_pso.oepc_rmo.oepc_rmo.opt.i that has 4 procedures, 43 locations, 1 initial locations, 0 loop locations, and 3 error locations. [2024-11-24 00:51:54,065 INFO L491 ceAbstractionStarter]: Constructing petrified ICFG for 1 thread instances. [2024-11-24 00:51:54,153 INFO L143 ThreadInstanceAdder]: Constructed 0 joinOtherThreadTransitions. [2024-11-24 00:51:54,199 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 52 places, 44 transitions, 100 flow [2024-11-24 00:51:54,256 INFO L124 PetriNetUnfolderBase]: 2/41 cut-off events. [2024-11-24 00:51:54,260 INFO L125 PetriNetUnfolderBase]: For 0/0 co-relation queries the response was YES. [2024-11-24 00:51:54,266 INFO L83 FinitePrefix]: Finished finitePrefix Result has 51 conditions, 41 events. 2/41 cut-off events. For 0/0 co-relation queries the response was YES. Maximal size of possible extension queue 4. Compared 77 event pairs, 0 based on Foata normal form. 0/36 useless extension candidates. Maximal degree in co-relation 43. Up to 2 conditions per place. [2024-11-24 00:51:54,267 INFO L82 GeneralOperation]: Start removeDead. Operand has 52 places, 44 transitions, 100 flow [2024-11-24 00:51:54,272 INFO L88 GeneralOperation]: Finished RemoveDead, result has has 49 places, 41 transitions, 91 flow [2024-11-24 00:51:54,282 INFO L332 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2024-11-24 00:51:54,294 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;@7f205ba5, mLbeIndependenceSettings=[IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=false, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2024-11-24 00:51:54,294 INFO L334 AbstractCegarLoop]: Starting to check reachability of 7 error locations. [2024-11-24 00:51:54,300 INFO L185 PetriNetUnfolderBase]: Found word, exiting Unfolder. [2024-11-24 00:51:54,300 INFO L124 PetriNetUnfolderBase]: 0/5 cut-off events. [2024-11-24 00:51:54,300 INFO L125 PetriNetUnfolderBase]: For 0/0 co-relation queries the response was YES. [2024-11-24 00:51:54,301 INFO L198 CegarLoopForPetriNet]: Found error trace [2024-11-24 00:51:54,301 INFO L206 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1] [2024-11-24 00:51:54,302 INFO L396 AbstractCegarLoop]: === Iteration 1 === Targeting P0Err0ASSERT_VIOLATIONMEMORY_LEAK === [P0Err0ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr1ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr0ASSERT_VIOLATIONMEMORY_LEAK (and 4 more)] === [2024-11-24 00:51:54,308 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-24 00:51:54,308 INFO L85 PathProgramCache]: Analyzing trace with hash 12000028, now seen corresponding path program 1 times [2024-11-24 00:51:54,323 INFO L118 FreeRefinementEngine]: Executing refinement strategy FOX [2024-11-24 00:51:54,324 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleZ3 [1202236989] [2024-11-24 00:51:54,324 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-24 00:51:54,325 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-11-24 00:51:54,325 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_6dde6ab7-fc66-4d3a-b16e-411b0308ee99/bin/uautomizer-verify-LYvppIcaGC/z3 [2024-11-24 00:51:54,330 INFO L229 MonitoredProcess]: Starting monitored process 2 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_6dde6ab7-fc66-4d3a-b16e-411b0308ee99/bin/uautomizer-verify-LYvppIcaGC/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2024-11-24 00:51:54,331 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_6dde6ab7-fc66-4d3a-b16e-411b0308ee99/bin/uautomizer-verify-LYvppIcaGC/z3 -smt2 -in SMTLIB2_COMPLIANT=true (2)] Waiting until timeout for monitored process [2024-11-24 00:51:54,490 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-24 00:51:54,493 INFO L256 TraceCheckSpWp]: Trace formula consists of 54 conjuncts, 5 conjuncts are in the unsatisfiable core [2024-11-24 00:51:54,498 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2024-11-24 00:51:54,538 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-24 00:51:54,540 INFO L308 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2024-11-24 00:51:54,541 INFO L136 FreeRefinementEngine]: Strategy FOX found an infeasible trace [2024-11-24 00:51:54,544 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1202236989] [2024-11-24 00:51:54,544 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1202236989] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-24 00:51:54,544 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-24 00:51:54,545 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [1] imperfect sequences [] total 1 [2024-11-24 00:51:54,546 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1278404007] [2024-11-24 00:51:54,547 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-24 00:51:54,553 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2024-11-24 00:51:54,559 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy FOX [2024-11-24 00:51:54,590 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-11-24 00:51:54,591 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-11-24 00:51:54,592 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 19 out of 44 [2024-11-24 00:51:54,596 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 49 places, 41 transitions, 91 flow. Second operand has 3 states, 3 states have (on average 20.0) internal successors, (60), 3 states have internal predecessors, (60), 0 states have call successors, (0), 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-24 00:51:54,597 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-11-24 00:51:54,597 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 19 of 44 [2024-11-24 00:51:54,598 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-11-24 00:51:55,290 INFO L124 PetriNetUnfolderBase]: 680/1277 cut-off events. [2024-11-24 00:51:55,291 INFO L125 PetriNetUnfolderBase]: For 12/12 co-relation queries the response was YES. [2024-11-24 00:51:55,299 INFO L83 FinitePrefix]: Finished finitePrefix Result has 2353 conditions, 1277 events. 680/1277 cut-off events. For 12/12 co-relation queries the response was YES. Maximal size of possible extension queue 97. Compared 8197 event pairs, 104 based on Foata normal form. 72/1336 useless extension candidates. Maximal degree in co-relation 2342. Up to 844 conditions per place. [2024-11-24 00:51:55,315 INFO L140 encePairwiseOnDemand]: 39/44 looper letters, 33 selfloop transitions, 2 changer transitions 2/53 dead transitions. [2024-11-24 00:51:55,316 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 49 places, 53 transitions, 195 flow [2024-11-24 00:51:55,317 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-11-24 00:51:55,320 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2024-11-24 00:51:55,332 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 99 transitions. [2024-11-24 00:51:55,335 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.75 [2024-11-24 00:51:55,337 INFO L175 Difference]: Start difference. First operand has 49 places, 41 transitions, 91 flow. Second operand 3 states and 99 transitions. [2024-11-24 00:51:55,338 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 49 places, 53 transitions, 195 flow [2024-11-24 00:51:55,345 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 46 places, 53 transitions, 190 flow, removed 0 selfloop flow, removed 3 redundant places. [2024-11-24 00:51:55,351 INFO L231 Difference]: Finished difference. Result has 46 places, 36 transitions, 82 flow [2024-11-24 00:51:55,356 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=44, PETRI_DIFFERENCE_MINUEND_FLOW=80, PETRI_DIFFERENCE_MINUEND_PLACES=44, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=37, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=2, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=35, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=82, PETRI_PLACES=46, PETRI_TRANSITIONS=36} [2024-11-24 00:51:55,362 INFO L279 CegarLoopForPetriNet]: 49 programPoint places, -3 predicate places. [2024-11-24 00:51:55,363 INFO L471 AbstractCegarLoop]: Abstraction has has 46 places, 36 transitions, 82 flow [2024-11-24 00:51:55,364 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 20.0) internal successors, (60), 3 states have internal predecessors, (60), 0 states have call successors, (0), 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-24 00:51:55,364 INFO L198 CegarLoopForPetriNet]: Found error trace [2024-11-24 00:51:55,364 INFO L206 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-24 00:51:55,376 INFO L552 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_6dde6ab7-fc66-4d3a-b16e-411b0308ee99/bin/uautomizer-verify-LYvppIcaGC/z3 -smt2 -in SMTLIB2_COMPLIANT=true (2)] Ended with exit code 0 [2024-11-24 00:51:55,567 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 2 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_6dde6ab7-fc66-4d3a-b16e-411b0308ee99/bin/uautomizer-verify-LYvppIcaGC/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-11-24 00:51:55,567 INFO L396 AbstractCegarLoop]: === Iteration 2 === Targeting ULTIMATE.startErr1ASSERT_VIOLATIONMEMORY_LEAK === [P0Err0ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr1ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr0ASSERT_VIOLATIONMEMORY_LEAK (and 4 more)] === [2024-11-24 00:51:55,568 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-24 00:51:55,568 INFO L85 PathProgramCache]: Analyzing trace with hash 657277449, now seen corresponding path program 1 times [2024-11-24 00:51:55,569 INFO L118 FreeRefinementEngine]: Executing refinement strategy FOX [2024-11-24 00:51:55,569 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleZ3 [2125905663] [2024-11-24 00:51:55,569 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-24 00:51:55,569 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-11-24 00:51:55,569 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_6dde6ab7-fc66-4d3a-b16e-411b0308ee99/bin/uautomizer-verify-LYvppIcaGC/z3 [2024-11-24 00:51:55,574 INFO L229 MonitoredProcess]: Starting monitored process 3 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_6dde6ab7-fc66-4d3a-b16e-411b0308ee99/bin/uautomizer-verify-LYvppIcaGC/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2024-11-24 00:51:55,575 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_6dde6ab7-fc66-4d3a-b16e-411b0308ee99/bin/uautomizer-verify-LYvppIcaGC/z3 -smt2 -in SMTLIB2_COMPLIANT=true (3)] Waiting until timeout for monitored process [2024-11-24 00:51:55,710 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-24 00:51:55,713 INFO L256 TraceCheckSpWp]: Trace formula consists of 89 conjuncts, 2 conjuncts are in the unsatisfiable core [2024-11-24 00:51:55,714 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2024-11-24 00:51:55,759 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-24 00:51:55,759 INFO L308 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2024-11-24 00:51:55,759 INFO L136 FreeRefinementEngine]: Strategy FOX found an infeasible trace [2024-11-24 00:51:55,759 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [2125905663] [2024-11-24 00:51:55,760 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [2125905663] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-24 00:51:55,760 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-24 00:51:55,760 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [1] imperfect sequences [] total 1 [2024-11-24 00:51:55,760 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [275241905] [2024-11-24 00:51:55,760 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-24 00:51:55,761 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2024-11-24 00:51:55,762 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy FOX [2024-11-24 00:51:55,762 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-11-24 00:51:55,762 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-11-24 00:51:55,763 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 18 out of 44 [2024-11-24 00:51:55,763 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 46 places, 36 transitions, 82 flow. Second operand has 3 states, 3 states have (on average 22.333333333333332) internal successors, (67), 3 states have internal predecessors, (67), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-24 00:51:55,764 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-11-24 00:51:55,764 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 18 of 44 [2024-11-24 00:51:55,764 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-11-24 00:51:56,108 INFO L124 PetriNetUnfolderBase]: 605/1137 cut-off events. [2024-11-24 00:51:56,108 INFO L125 PetriNetUnfolderBase]: For 80/80 co-relation queries the response was YES. [2024-11-24 00:51:56,113 INFO L83 FinitePrefix]: Finished finitePrefix Result has 2181 conditions, 1137 events. 605/1137 cut-off events. For 80/80 co-relation queries the response was YES. Maximal size of possible extension queue 84. Compared 7045 event pairs, 605 based on Foata normal form. 36/1135 useless extension candidates. Maximal degree in co-relation 2171. Up to 926 conditions per place. [2024-11-24 00:51:56,121 INFO L140 encePairwiseOnDemand]: 42/44 looper letters, 18 selfloop transitions, 1 changer transitions 1/35 dead transitions. [2024-11-24 00:51:56,122 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 46 places, 35 transitions, 120 flow [2024-11-24 00:51:56,122 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-11-24 00:51:56,122 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2024-11-24 00:51:56,123 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 75 transitions. [2024-11-24 00:51:56,124 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.5681818181818182 [2024-11-24 00:51:56,124 INFO L175 Difference]: Start difference. First operand has 46 places, 36 transitions, 82 flow. Second operand 3 states and 75 transitions. [2024-11-24 00:51:56,125 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 46 places, 35 transitions, 120 flow [2024-11-24 00:51:56,126 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 44 places, 35 transitions, 116 flow, removed 0 selfloop flow, removed 2 redundant places. [2024-11-24 00:51:56,128 INFO L231 Difference]: Finished difference. Result has 44 places, 34 transitions, 76 flow [2024-11-24 00:51:56,129 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=44, PETRI_DIFFERENCE_MINUEND_FLOW=76, PETRI_DIFFERENCE_MINUEND_PLACES=42, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=35, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=1, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=34, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=76, PETRI_PLACES=44, PETRI_TRANSITIONS=34} [2024-11-24 00:51:56,130 INFO L279 CegarLoopForPetriNet]: 49 programPoint places, -5 predicate places. [2024-11-24 00:51:56,130 INFO L471 AbstractCegarLoop]: Abstraction has has 44 places, 34 transitions, 76 flow [2024-11-24 00:51:56,130 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 22.333333333333332) internal successors, (67), 3 states have internal predecessors, (67), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-24 00:51:56,131 INFO L198 CegarLoopForPetriNet]: Found error trace [2024-11-24 00:51:56,131 INFO L206 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-24 00:51:56,142 INFO L552 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_6dde6ab7-fc66-4d3a-b16e-411b0308ee99/bin/uautomizer-verify-LYvppIcaGC/z3 -smt2 -in SMTLIB2_COMPLIANT=true (3)] Ended with exit code 0 [2024-11-24 00:51:56,332 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 3 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_6dde6ab7-fc66-4d3a-b16e-411b0308ee99/bin/uautomizer-verify-LYvppIcaGC/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-11-24 00:51:56,332 INFO L396 AbstractCegarLoop]: === Iteration 3 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONMEMORY_LEAK === [P0Err0ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr1ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr0ASSERT_VIOLATIONMEMORY_LEAK (and 4 more)] === [2024-11-24 00:51:56,333 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-24 00:51:56,333 INFO L85 PathProgramCache]: Analyzing trace with hash 657278940, now seen corresponding path program 1 times [2024-11-24 00:51:56,333 INFO L118 FreeRefinementEngine]: Executing refinement strategy FOX [2024-11-24 00:51:56,333 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleZ3 [491051051] [2024-11-24 00:51:56,334 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-24 00:51:56,334 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-11-24 00:51:56,334 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_6dde6ab7-fc66-4d3a-b16e-411b0308ee99/bin/uautomizer-verify-LYvppIcaGC/z3 [2024-11-24 00:51:56,338 INFO L229 MonitoredProcess]: Starting monitored process 4 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_6dde6ab7-fc66-4d3a-b16e-411b0308ee99/bin/uautomizer-verify-LYvppIcaGC/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2024-11-24 00:51:56,339 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_6dde6ab7-fc66-4d3a-b16e-411b0308ee99/bin/uautomizer-verify-LYvppIcaGC/z3 -smt2 -in SMTLIB2_COMPLIANT=true (4)] Waiting until timeout for monitored process [2024-11-24 00:51:56,469 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-24 00:51:56,471 INFO L256 TraceCheckSpWp]: Trace formula consists of 89 conjuncts, 3 conjuncts are in the unsatisfiable core [2024-11-24 00:51:56,473 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2024-11-24 00:51:56,533 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-24 00:51:56,533 INFO L308 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2024-11-24 00:51:56,533 INFO L136 FreeRefinementEngine]: Strategy FOX found an infeasible trace [2024-11-24 00:51:56,533 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [491051051] [2024-11-24 00:51:56,533 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [491051051] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-24 00:51:56,534 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-24 00:51:56,534 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2024-11-24 00:51:56,534 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [631151366] [2024-11-24 00:51:56,534 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-24 00:51:56,535 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2024-11-24 00:51:56,535 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy FOX [2024-11-24 00:51:56,536 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2024-11-24 00:51:56,536 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2024-11-24 00:51:56,552 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 15 out of 44 [2024-11-24 00:51:56,552 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 44 places, 34 transitions, 76 flow. Second operand has 4 states, 4 states have (on average 18.25) internal successors, (73), 4 states have internal predecessors, (73), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-24 00:51:56,553 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-11-24 00:51:56,554 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 15 of 44 [2024-11-24 00:51:56,554 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-11-24 00:51:57,117 INFO L124 PetriNetUnfolderBase]: 1363/2295 cut-off events. [2024-11-24 00:51:57,117 INFO L125 PetriNetUnfolderBase]: For 0/0 co-relation queries the response was YES. [2024-11-24 00:51:57,122 INFO L83 FinitePrefix]: Finished finitePrefix Result has 4413 conditions, 2295 events. 1363/2295 cut-off events. For 0/0 co-relation queries the response was YES. Maximal size of possible extension queue 160. Compared 13805 event pairs, 149 based on Foata normal form. 80/2335 useless extension candidates. Maximal degree in co-relation 4407. Up to 1297 conditions per place. [2024-11-24 00:51:57,131 INFO L140 encePairwiseOnDemand]: 38/44 looper letters, 40 selfloop transitions, 5 changer transitions 1/57 dead transitions. [2024-11-24 00:51:57,132 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 46 places, 57 transitions, 218 flow [2024-11-24 00:51:57,132 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2024-11-24 00:51:57,132 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 4 states. [2024-11-24 00:51:57,133 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 108 transitions. [2024-11-24 00:51:57,133 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.6136363636363636 [2024-11-24 00:51:57,133 INFO L175 Difference]: Start difference. First operand has 44 places, 34 transitions, 76 flow. Second operand 4 states and 108 transitions. [2024-11-24 00:51:57,134 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 46 places, 57 transitions, 218 flow [2024-11-24 00:51:57,134 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 45 places, 57 transitions, 217 flow, removed 0 selfloop flow, removed 1 redundant places. [2024-11-24 00:51:57,136 INFO L231 Difference]: Finished difference. Result has 47 places, 37 transitions, 109 flow [2024-11-24 00:51:57,136 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=44, PETRI_DIFFERENCE_MINUEND_FLOW=75, PETRI_DIFFERENCE_MINUEND_PLACES=42, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=34, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=2, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=29, PETRI_DIFFERENCE_SUBTRAHEND_STATES=4, PETRI_FLOW=109, PETRI_PLACES=47, PETRI_TRANSITIONS=37} [2024-11-24 00:51:57,137 INFO L279 CegarLoopForPetriNet]: 49 programPoint places, -2 predicate places. [2024-11-24 00:51:57,137 INFO L471 AbstractCegarLoop]: Abstraction has has 47 places, 37 transitions, 109 flow [2024-11-24 00:51:57,137 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 18.25) internal successors, (73), 4 states have internal predecessors, (73), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-24 00:51:57,137 INFO L198 CegarLoopForPetriNet]: Found error trace [2024-11-24 00:51:57,138 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-24 00:51:57,149 INFO L552 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_6dde6ab7-fc66-4d3a-b16e-411b0308ee99/bin/uautomizer-verify-LYvppIcaGC/z3 -smt2 -in SMTLIB2_COMPLIANT=true (4)] Ended with exit code 0 [2024-11-24 00:51:57,338 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 4 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_6dde6ab7-fc66-4d3a-b16e-411b0308ee99/bin/uautomizer-verify-LYvppIcaGC/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-11-24 00:51:57,339 INFO L396 AbstractCegarLoop]: === Iteration 4 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONMEMORY_LEAK === [P0Err0ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr1ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr0ASSERT_VIOLATIONMEMORY_LEAK (and 4 more)] === [2024-11-24 00:51:57,339 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-24 00:51:57,339 INFO L85 PathProgramCache]: Analyzing trace with hash 1631806119, now seen corresponding path program 1 times [2024-11-24 00:51:57,340 INFO L118 FreeRefinementEngine]: Executing refinement strategy FOX [2024-11-24 00:51:57,340 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleZ3 [1701020933] [2024-11-24 00:51:57,340 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-24 00:51:57,340 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-11-24 00:51:57,340 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_6dde6ab7-fc66-4d3a-b16e-411b0308ee99/bin/uautomizer-verify-LYvppIcaGC/z3 [2024-11-24 00:51:57,342 INFO L229 MonitoredProcess]: Starting monitored process 5 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_6dde6ab7-fc66-4d3a-b16e-411b0308ee99/bin/uautomizer-verify-LYvppIcaGC/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2024-11-24 00:51:57,343 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_6dde6ab7-fc66-4d3a-b16e-411b0308ee99/bin/uautomizer-verify-LYvppIcaGC/z3 -smt2 -in SMTLIB2_COMPLIANT=true (5)] Waiting until timeout for monitored process [2024-11-24 00:51:57,454 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-24 00:51:57,456 INFO L256 TraceCheckSpWp]: Trace formula consists of 110 conjuncts, 4 conjuncts are in the unsatisfiable core [2024-11-24 00:51:57,458 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2024-11-24 00:51:57,521 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-24 00:51:57,524 INFO L308 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2024-11-24 00:51:57,524 INFO L136 FreeRefinementEngine]: Strategy FOX found an infeasible trace [2024-11-24 00:51:57,524 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1701020933] [2024-11-24 00:51:57,524 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1701020933] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-24 00:51:57,524 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-24 00:51:57,524 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2024-11-24 00:51:57,524 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1061865271] [2024-11-24 00:51:57,525 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-24 00:51:57,525 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2024-11-24 00:51:57,525 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy FOX [2024-11-24 00:51:57,526 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2024-11-24 00:51:57,526 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2024-11-24 00:51:57,534 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 15 out of 44 [2024-11-24 00:51:57,534 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 47 places, 37 transitions, 109 flow. Second operand has 5 states, 5 states have (on average 18.2) internal successors, (91), 5 states have internal predecessors, (91), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-24 00:51:57,534 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-11-24 00:51:57,534 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 15 of 44 [2024-11-24 00:51:57,535 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-11-24 00:51:57,946 INFO L124 PetriNetUnfolderBase]: 879/1511 cut-off events. [2024-11-24 00:51:57,947 INFO L125 PetriNetUnfolderBase]: For 374/374 co-relation queries the response was YES. [2024-11-24 00:51:57,950 INFO L83 FinitePrefix]: Finished finitePrefix Result has 3440 conditions, 1511 events. 879/1511 cut-off events. For 374/374 co-relation queries the response was YES. Maximal size of possible extension queue 80. Compared 8056 event pairs, 75 based on Foata normal form. 68/1546 useless extension candidates. Maximal degree in co-relation 3431. Up to 625 conditions per place. [2024-11-24 00:51:57,956 INFO L140 encePairwiseOnDemand]: 38/44 looper letters, 50 selfloop transitions, 8 changer transitions 1/70 dead transitions. [2024-11-24 00:51:57,957 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 51 places, 70 transitions, 314 flow [2024-11-24 00:51:57,957 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2024-11-24 00:51:57,957 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 5 states. [2024-11-24 00:51:57,958 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 136 transitions. [2024-11-24 00:51:57,959 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.6181818181818182 [2024-11-24 00:51:57,959 INFO L175 Difference]: Start difference. First operand has 47 places, 37 transitions, 109 flow. Second operand 5 states and 136 transitions. [2024-11-24 00:51:57,959 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 51 places, 70 transitions, 314 flow [2024-11-24 00:51:57,961 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 49 places, 70 transitions, 304 flow, removed 1 selfloop flow, removed 2 redundant places. [2024-11-24 00:51:57,962 INFO L231 Difference]: Finished difference. Result has 51 places, 40 transitions, 149 flow [2024-11-24 00:51:57,963 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=44, PETRI_DIFFERENCE_MINUEND_FLOW=101, PETRI_DIFFERENCE_MINUEND_PLACES=45, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=37, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=5, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=29, PETRI_DIFFERENCE_SUBTRAHEND_STATES=5, PETRI_FLOW=149, PETRI_PLACES=51, PETRI_TRANSITIONS=40} [2024-11-24 00:51:57,963 INFO L279 CegarLoopForPetriNet]: 49 programPoint places, 2 predicate places. [2024-11-24 00:51:57,964 INFO L471 AbstractCegarLoop]: Abstraction has has 51 places, 40 transitions, 149 flow [2024-11-24 00:51:57,964 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 18.2) internal successors, (91), 5 states have internal predecessors, (91), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-24 00:51:57,964 INFO L198 CegarLoopForPetriNet]: Found error trace [2024-11-24 00:51:57,964 INFO L206 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-24 00:51:57,977 INFO L552 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_6dde6ab7-fc66-4d3a-b16e-411b0308ee99/bin/uautomizer-verify-LYvppIcaGC/z3 -smt2 -in SMTLIB2_COMPLIANT=true (5)] Ended with exit code 0 [2024-11-24 00:51:58,165 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 5 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_6dde6ab7-fc66-4d3a-b16e-411b0308ee99/bin/uautomizer-verify-LYvppIcaGC/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-11-24 00:51:58,165 INFO L396 AbstractCegarLoop]: === Iteration 5 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONMEMORY_LEAK === [P0Err0ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr1ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr0ASSERT_VIOLATIONMEMORY_LEAK (and 4 more)] === [2024-11-24 00:51:58,166 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-24 00:51:58,167 INFO L85 PathProgramCache]: Analyzing trace with hash -1019805667, now seen corresponding path program 1 times [2024-11-24 00:51:58,167 INFO L118 FreeRefinementEngine]: Executing refinement strategy FOX [2024-11-24 00:51:58,167 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleZ3 [1929348071] [2024-11-24 00:51:58,168 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-24 00:51:58,168 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-11-24 00:51:58,168 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_6dde6ab7-fc66-4d3a-b16e-411b0308ee99/bin/uautomizer-verify-LYvppIcaGC/z3 [2024-11-24 00:51:58,170 INFO L229 MonitoredProcess]: Starting monitored process 6 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_6dde6ab7-fc66-4d3a-b16e-411b0308ee99/bin/uautomizer-verify-LYvppIcaGC/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2024-11-24 00:51:58,171 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_6dde6ab7-fc66-4d3a-b16e-411b0308ee99/bin/uautomizer-verify-LYvppIcaGC/z3 -smt2 -in SMTLIB2_COMPLIANT=true (6)] Waiting until timeout for monitored process [2024-11-24 00:51:58,277 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-24 00:51:58,280 INFO L256 TraceCheckSpWp]: Trace formula consists of 120 conjuncts, 5 conjuncts are in the unsatisfiable core [2024-11-24 00:51:58,281 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2024-11-24 00:51:58,364 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-24 00:51:58,364 INFO L308 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2024-11-24 00:51:58,364 INFO L136 FreeRefinementEngine]: Strategy FOX found an infeasible trace [2024-11-24 00:51:58,364 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1929348071] [2024-11-24 00:51:58,364 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1929348071] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-24 00:51:58,365 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-24 00:51:58,365 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2024-11-24 00:51:58,365 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1354770679] [2024-11-24 00:51:58,365 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-24 00:51:58,365 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2024-11-24 00:51:58,366 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy FOX [2024-11-24 00:51:58,366 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2024-11-24 00:51:58,366 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2024-11-24 00:51:58,375 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 15 out of 44 [2024-11-24 00:51:58,375 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 51 places, 40 transitions, 149 flow. Second operand has 6 states, 6 states have (on average 18.0) internal successors, (108), 6 states have internal predecessors, (108), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-24 00:51:58,375 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-11-24 00:51:58,375 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 15 of 44 [2024-11-24 00:51:58,376 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-11-24 00:51:58,736 INFO L124 PetriNetUnfolderBase]: 491/839 cut-off events. [2024-11-24 00:51:58,736 INFO L125 PetriNetUnfolderBase]: For 674/674 co-relation queries the response was YES. [2024-11-24 00:51:58,738 INFO L83 FinitePrefix]: Finished finitePrefix Result has 2178 conditions, 839 events. 491/839 cut-off events. For 674/674 co-relation queries the response was YES. Maximal size of possible extension queue 49. Compared 3716 event pairs, 61 based on Foata normal form. 36/844 useless extension candidates. Maximal degree in co-relation 2167. Up to 268 conditions per place. [2024-11-24 00:51:58,742 INFO L140 encePairwiseOnDemand]: 38/44 looper letters, 44 selfloop transitions, 11 changer transitions 1/67 dead transitions. [2024-11-24 00:51:58,742 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 56 places, 67 transitions, 325 flow [2024-11-24 00:51:58,743 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2024-11-24 00:51:58,743 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 6 states. [2024-11-24 00:51:58,744 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6 states to 6 states and 148 transitions. [2024-11-24 00:51:58,744 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.5606060606060606 [2024-11-24 00:51:58,744 INFO L175 Difference]: Start difference. First operand has 51 places, 40 transitions, 149 flow. Second operand 6 states and 148 transitions. [2024-11-24 00:51:58,745 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 56 places, 67 transitions, 325 flow [2024-11-24 00:51:58,749 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 52 places, 67 transitions, 300 flow, removed 4 selfloop flow, removed 4 redundant places. [2024-11-24 00:51:58,750 INFO L231 Difference]: Finished difference. Result has 54 places, 40 transitions, 163 flow [2024-11-24 00:51:58,751 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=44, PETRI_DIFFERENCE_MINUEND_FLOW=127, PETRI_DIFFERENCE_MINUEND_PLACES=47, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=40, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=11, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=29, PETRI_DIFFERENCE_SUBTRAHEND_STATES=6, PETRI_FLOW=163, PETRI_PLACES=54, PETRI_TRANSITIONS=40} [2024-11-24 00:51:58,751 INFO L279 CegarLoopForPetriNet]: 49 programPoint places, 5 predicate places. [2024-11-24 00:51:58,752 INFO L471 AbstractCegarLoop]: Abstraction has has 54 places, 40 transitions, 163 flow [2024-11-24 00:51:58,752 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 18.0) internal successors, (108), 6 states have internal predecessors, (108), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-24 00:51:58,752 INFO L198 CegarLoopForPetriNet]: Found error trace [2024-11-24 00:51:58,752 INFO L206 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-24 00:51:58,763 INFO L552 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_6dde6ab7-fc66-4d3a-b16e-411b0308ee99/bin/uautomizer-verify-LYvppIcaGC/z3 -smt2 -in SMTLIB2_COMPLIANT=true (6)] Ended with exit code 0 [2024-11-24 00:51:58,956 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 6 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_6dde6ab7-fc66-4d3a-b16e-411b0308ee99/bin/uautomizer-verify-LYvppIcaGC/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-11-24 00:51:58,957 INFO L396 AbstractCegarLoop]: === Iteration 6 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONMEMORY_LEAK === [P0Err0ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr1ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr0ASSERT_VIOLATIONMEMORY_LEAK (and 4 more)] === [2024-11-24 00:51:58,958 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-24 00:51:58,958 INFO L85 PathProgramCache]: Analyzing trace with hash -1249127759, now seen corresponding path program 1 times [2024-11-24 00:51:58,958 INFO L118 FreeRefinementEngine]: Executing refinement strategy FOX [2024-11-24 00:51:58,959 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleZ3 [962215591] [2024-11-24 00:51:58,959 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-24 00:51:58,959 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-11-24 00:51:58,959 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_6dde6ab7-fc66-4d3a-b16e-411b0308ee99/bin/uautomizer-verify-LYvppIcaGC/z3 [2024-11-24 00:51:58,961 INFO L229 MonitoredProcess]: Starting monitored process 7 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_6dde6ab7-fc66-4d3a-b16e-411b0308ee99/bin/uautomizer-verify-LYvppIcaGC/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2024-11-24 00:51:58,965 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_6dde6ab7-fc66-4d3a-b16e-411b0308ee99/bin/uautomizer-verify-LYvppIcaGC/z3 -smt2 -in SMTLIB2_COMPLIANT=true (7)] Waiting until timeout for monitored process [2024-11-24 00:51:59,078 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-24 00:51:59,084 INFO L256 TraceCheckSpWp]: Trace formula consists of 130 conjuncts, 16 conjuncts are in the unsatisfiable core [2024-11-24 00:51:59,087 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2024-11-24 00:51:59,634 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-24 00:51:59,634 INFO L308 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2024-11-24 00:51:59,635 INFO L136 FreeRefinementEngine]: Strategy FOX found an infeasible trace [2024-11-24 00:51:59,635 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [962215591] [2024-11-24 00:51:59,635 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [962215591] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-24 00:51:59,635 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-24 00:51:59,635 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2024-11-24 00:51:59,635 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [993254801] [2024-11-24 00:51:59,635 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-24 00:51:59,636 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 9 states [2024-11-24 00:51:59,636 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy FOX [2024-11-24 00:51:59,636 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2024-11-24 00:51:59,636 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=20, Invalid=52, Unknown=0, NotChecked=0, Total=72 [2024-11-24 00:51:59,661 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 17 out of 44 [2024-11-24 00:51:59,661 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 54 places, 40 transitions, 163 flow. Second operand has 9 states, 9 states have (on average 19.0) internal successors, (171), 9 states have internal predecessors, (171), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-24 00:51:59,662 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-11-24 00:51:59,662 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 17 of 44 [2024-11-24 00:51:59,662 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-11-24 00:52:00,101 INFO L124 PetriNetUnfolderBase]: 505/962 cut-off events. [2024-11-24 00:52:00,101 INFO L125 PetriNetUnfolderBase]: For 390/411 co-relation queries the response was YES. [2024-11-24 00:52:00,104 INFO L83 FinitePrefix]: Finished finitePrefix Result has 2217 conditions, 962 events. 505/962 cut-off events. For 390/411 co-relation queries the response was YES. Maximal size of possible extension queue 60. Compared 4870 event pairs, 201 based on Foata normal form. 8/907 useless extension candidates. Maximal degree in co-relation 2205. Up to 484 conditions per place. [2024-11-24 00:52:00,108 INFO L140 encePairwiseOnDemand]: 36/44 looper letters, 25 selfloop transitions, 4 changer transitions 14/62 dead transitions. [2024-11-24 00:52:00,108 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 60 places, 62 transitions, 305 flow [2024-11-24 00:52:00,109 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2024-11-24 00:52:00,109 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 7 states. [2024-11-24 00:52:00,110 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 7 states to 7 states and 163 transitions. [2024-11-24 00:52:00,110 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.5292207792207793 [2024-11-24 00:52:00,110 INFO L175 Difference]: Start difference. First operand has 54 places, 40 transitions, 163 flow. Second operand 7 states and 163 transitions. [2024-11-24 00:52:00,110 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 60 places, 62 transitions, 305 flow [2024-11-24 00:52:00,115 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 52 places, 62 transitions, 238 flow, removed 14 selfloop flow, removed 8 redundant places. [2024-11-24 00:52:00,116 INFO L231 Difference]: Finished difference. Result has 56 places, 42 transitions, 134 flow [2024-11-24 00:52:00,116 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=44, PETRI_DIFFERENCE_MINUEND_FLOW=107, PETRI_DIFFERENCE_MINUEND_PLACES=46, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=40, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=2, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=36, PETRI_DIFFERENCE_SUBTRAHEND_STATES=7, PETRI_FLOW=134, PETRI_PLACES=56, PETRI_TRANSITIONS=42} [2024-11-24 00:52:00,117 INFO L279 CegarLoopForPetriNet]: 49 programPoint places, 7 predicate places. [2024-11-24 00:52:00,117 INFO L471 AbstractCegarLoop]: Abstraction has has 56 places, 42 transitions, 134 flow [2024-11-24 00:52:00,117 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 9 states, 9 states have (on average 19.0) internal successors, (171), 9 states have internal predecessors, (171), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-24 00:52:00,117 INFO L198 CegarLoopForPetriNet]: Found error trace [2024-11-24 00:52:00,118 INFO L206 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-24 00:52:00,129 INFO L552 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_6dde6ab7-fc66-4d3a-b16e-411b0308ee99/bin/uautomizer-verify-LYvppIcaGC/z3 -smt2 -in SMTLIB2_COMPLIANT=true (7)] Ended with exit code 0 [2024-11-24 00:52:00,322 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 7 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_6dde6ab7-fc66-4d3a-b16e-411b0308ee99/bin/uautomizer-verify-LYvppIcaGC/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-11-24 00:52:00,322 INFO L396 AbstractCegarLoop]: === Iteration 7 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONMEMORY_LEAK === [P0Err0ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr1ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr0ASSERT_VIOLATIONMEMORY_LEAK (and 4 more)] === [2024-11-24 00:52:00,323 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-24 00:52:00,323 INFO L85 PathProgramCache]: Analyzing trace with hash 303056897, now seen corresponding path program 2 times [2024-11-24 00:52:00,323 INFO L118 FreeRefinementEngine]: Executing refinement strategy FOX [2024-11-24 00:52:00,323 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleZ3 [2090423407] [2024-11-24 00:52:00,324 INFO L95 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2024-11-24 00:52:00,324 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-11-24 00:52:00,324 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_6dde6ab7-fc66-4d3a-b16e-411b0308ee99/bin/uautomizer-verify-LYvppIcaGC/z3 [2024-11-24 00:52:00,327 INFO L229 MonitoredProcess]: Starting monitored process 8 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_6dde6ab7-fc66-4d3a-b16e-411b0308ee99/bin/uautomizer-verify-LYvppIcaGC/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2024-11-24 00:52:00,330 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_6dde6ab7-fc66-4d3a-b16e-411b0308ee99/bin/uautomizer-verify-LYvppIcaGC/z3 -smt2 -in SMTLIB2_COMPLIANT=true (8)] Waiting until timeout for monitored process [2024-11-24 00:52:00,447 INFO L229 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 1 check-sat command(s) [2024-11-24 00:52:00,447 INFO L230 tOrderPrioritization]: Conjunction of SSA is unsat [2024-11-24 00:52:00,449 INFO L256 TraceCheckSpWp]: Trace formula consists of 130 conjuncts, 11 conjuncts are in the unsatisfiable core [2024-11-24 00:52:00,452 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2024-11-24 00:52:00,718 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-24 00:52:00,718 INFO L308 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2024-11-24 00:52:00,718 INFO L136 FreeRefinementEngine]: Strategy FOX found an infeasible trace [2024-11-24 00:52:00,718 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [2090423407] [2024-11-24 00:52:00,718 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [2090423407] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-24 00:52:00,718 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-24 00:52:00,719 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2024-11-24 00:52:00,719 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1105215447] [2024-11-24 00:52:00,719 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-24 00:52:00,719 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 8 states [2024-11-24 00:52:00,720 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy FOX [2024-11-24 00:52:00,720 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2024-11-24 00:52:00,721 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=15, Invalid=41, Unknown=0, NotChecked=0, Total=56 [2024-11-24 00:52:00,742 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 13 out of 44 [2024-11-24 00:52:00,743 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 56 places, 42 transitions, 134 flow. Second operand has 8 states, 8 states have (on average 15.75) internal successors, (126), 8 states have internal predecessors, (126), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-24 00:52:00,743 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-11-24 00:52:00,743 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 13 of 44 [2024-11-24 00:52:00,743 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-11-24 00:52:01,371 INFO L124 PetriNetUnfolderBase]: 1600/2583 cut-off events. [2024-11-24 00:52:01,372 INFO L125 PetriNetUnfolderBase]: For 583/583 co-relation queries the response was YES. [2024-11-24 00:52:01,377 INFO L83 FinitePrefix]: Finished finitePrefix Result has 6249 conditions, 2583 events. 1600/2583 cut-off events. For 583/583 co-relation queries the response was YES. Maximal size of possible extension queue 169. Compared 13623 event pairs, 362 based on Foata normal form. 8/2583 useless extension candidates. Maximal degree in co-relation 6237. Up to 1152 conditions per place. [2024-11-24 00:52:01,383 INFO L140 encePairwiseOnDemand]: 35/44 looper letters, 49 selfloop transitions, 7 changer transitions 31/96 dead transitions. [2024-11-24 00:52:01,383 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 59 places, 96 transitions, 476 flow [2024-11-24 00:52:01,384 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2024-11-24 00:52:01,386 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 7 states. [2024-11-24 00:52:01,387 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 7 states to 7 states and 163 transitions. [2024-11-24 00:52:01,388 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.5292207792207793 [2024-11-24 00:52:01,388 INFO L175 Difference]: Start difference. First operand has 56 places, 42 transitions, 134 flow. Second operand 7 states and 163 transitions. [2024-11-24 00:52:01,389 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 59 places, 96 transitions, 476 flow [2024-11-24 00:52:01,393 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 54 places, 96 transitions, 456 flow, removed 5 selfloop flow, removed 5 redundant places. [2024-11-24 00:52:01,394 INFO L231 Difference]: Finished difference. Result has 59 places, 47 transitions, 180 flow [2024-11-24 00:52:01,395 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=44, PETRI_DIFFERENCE_MINUEND_FLOW=123, PETRI_DIFFERENCE_MINUEND_PLACES=48, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=42, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=3, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=37, PETRI_DIFFERENCE_SUBTRAHEND_STATES=7, PETRI_FLOW=180, PETRI_PLACES=59, PETRI_TRANSITIONS=47} [2024-11-24 00:52:01,395 INFO L279 CegarLoopForPetriNet]: 49 programPoint places, 10 predicate places. [2024-11-24 00:52:01,396 INFO L471 AbstractCegarLoop]: Abstraction has has 59 places, 47 transitions, 180 flow [2024-11-24 00:52:01,396 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 8 states, 8 states have (on average 15.75) internal successors, (126), 8 states have internal predecessors, (126), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-24 00:52:01,396 INFO L198 CegarLoopForPetriNet]: Found error trace [2024-11-24 00:52:01,396 INFO L206 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-24 00:52:01,406 INFO L552 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_6dde6ab7-fc66-4d3a-b16e-411b0308ee99/bin/uautomizer-verify-LYvppIcaGC/z3 -smt2 -in SMTLIB2_COMPLIANT=true (8)] Ended with exit code 0 [2024-11-24 00:52:01,596 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 8 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_6dde6ab7-fc66-4d3a-b16e-411b0308ee99/bin/uautomizer-verify-LYvppIcaGC/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-11-24 00:52:01,597 INFO L396 AbstractCegarLoop]: === Iteration 8 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONMEMORY_LEAK === [P0Err0ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr1ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr0ASSERT_VIOLATIONMEMORY_LEAK (and 4 more)] === [2024-11-24 00:52:01,597 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-24 00:52:01,597 INFO L85 PathProgramCache]: Analyzing trace with hash -790266221, now seen corresponding path program 3 times [2024-11-24 00:52:01,598 INFO L118 FreeRefinementEngine]: Executing refinement strategy FOX [2024-11-24 00:52:01,598 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleZ3 [629760887] [2024-11-24 00:52:01,598 INFO L95 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST2 [2024-11-24 00:52:01,598 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-11-24 00:52:01,598 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_6dde6ab7-fc66-4d3a-b16e-411b0308ee99/bin/uautomizer-verify-LYvppIcaGC/z3 [2024-11-24 00:52:01,604 INFO L229 MonitoredProcess]: Starting monitored process 9 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_6dde6ab7-fc66-4d3a-b16e-411b0308ee99/bin/uautomizer-verify-LYvppIcaGC/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2024-11-24 00:52:01,606 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_6dde6ab7-fc66-4d3a-b16e-411b0308ee99/bin/uautomizer-verify-LYvppIcaGC/z3 -smt2 -in SMTLIB2_COMPLIANT=true (9)] Waiting until timeout for monitored process [2024-11-24 00:52:01,709 INFO L229 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued 1 check-sat command(s) [2024-11-24 00:52:01,709 INFO L230 tOrderPrioritization]: Conjunction of SSA is unsat [2024-11-24 00:52:01,711 INFO L256 TraceCheckSpWp]: Trace formula consists of 130 conjuncts, 19 conjuncts are in the unsatisfiable core [2024-11-24 00:52:01,714 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2024-11-24 00:52:02,485 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-24 00:52:02,485 INFO L308 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2024-11-24 00:52:02,485 INFO L136 FreeRefinementEngine]: Strategy FOX found an infeasible trace [2024-11-24 00:52:02,485 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [629760887] [2024-11-24 00:52:02,485 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [629760887] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-24 00:52:02,486 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-24 00:52:02,486 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [9] imperfect sequences [] total 9 [2024-11-24 00:52:02,486 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1933306031] [2024-11-24 00:52:02,486 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-24 00:52:02,486 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 10 states [2024-11-24 00:52:02,487 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy FOX [2024-11-24 00:52:02,487 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2024-11-24 00:52:02,487 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=24, Invalid=66, Unknown=0, NotChecked=0, Total=90 [2024-11-24 00:52:02,508 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 17 out of 44 [2024-11-24 00:52:02,509 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 59 places, 47 transitions, 180 flow. Second operand has 10 states, 10 states have (on average 18.8) internal successors, (188), 10 states have internal predecessors, (188), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-24 00:52:02,509 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-11-24 00:52:02,509 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 17 of 44 [2024-11-24 00:52:02,509 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-11-24 00:52:03,008 INFO L124 PetriNetUnfolderBase]: 657/1231 cut-off events. [2024-11-24 00:52:03,010 INFO L125 PetriNetUnfolderBase]: For 254/262 co-relation queries the response was YES. [2024-11-24 00:52:03,014 INFO L83 FinitePrefix]: Finished finitePrefix Result has 2746 conditions, 1231 events. 657/1231 cut-off events. For 254/262 co-relation queries the response was YES. Maximal size of possible extension queue 92. Compared 6642 event pairs, 249 based on Foata normal form. 8/1164 useless extension candidates. Maximal degree in co-relation 2732. Up to 447 conditions per place. [2024-11-24 00:52:03,018 INFO L140 encePairwiseOnDemand]: 37/44 looper letters, 25 selfloop transitions, 4 changer transitions 18/68 dead transitions. [2024-11-24 00:52:03,018 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 63 places, 68 transitions, 319 flow [2024-11-24 00:52:03,020 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2024-11-24 00:52:03,020 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 7 states. [2024-11-24 00:52:03,021 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 7 states to 7 states and 163 transitions. [2024-11-24 00:52:03,022 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.5292207792207793 [2024-11-24 00:52:03,022 INFO L175 Difference]: Start difference. First operand has 59 places, 47 transitions, 180 flow. Second operand 7 states and 163 transitions. [2024-11-24 00:52:03,022 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 63 places, 68 transitions, 319 flow [2024-11-24 00:52:03,024 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 60 places, 68 transitions, 305 flow, removed 5 selfloop flow, removed 3 redundant places. [2024-11-24 00:52:03,025 INFO L231 Difference]: Finished difference. Result has 64 places, 45 transitions, 177 flow [2024-11-24 00:52:03,025 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=44, PETRI_DIFFERENCE_MINUEND_FLOW=170, PETRI_DIFFERENCE_MINUEND_PLACES=54, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=47, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=3, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=43, PETRI_DIFFERENCE_SUBTRAHEND_STATES=7, PETRI_FLOW=177, PETRI_PLACES=64, PETRI_TRANSITIONS=45} [2024-11-24 00:52:03,026 INFO L279 CegarLoopForPetriNet]: 49 programPoint places, 15 predicate places. [2024-11-24 00:52:03,026 INFO L471 AbstractCegarLoop]: Abstraction has has 64 places, 45 transitions, 177 flow [2024-11-24 00:52:03,026 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 10 states, 10 states have (on average 18.8) internal successors, (188), 10 states have internal predecessors, (188), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-24 00:52:03,026 INFO L198 CegarLoopForPetriNet]: Found error trace [2024-11-24 00:52:03,027 INFO L206 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-24 00:52:03,039 INFO L540 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_6dde6ab7-fc66-4d3a-b16e-411b0308ee99/bin/uautomizer-verify-LYvppIcaGC/z3 -smt2 -in SMTLIB2_COMPLIANT=true (9)] Forceful destruction successful, exit code 0 [2024-11-24 00:52:03,227 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 9 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_6dde6ab7-fc66-4d3a-b16e-411b0308ee99/bin/uautomizer-verify-LYvppIcaGC/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-11-24 00:52:03,227 INFO L396 AbstractCegarLoop]: === Iteration 9 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONMEMORY_LEAK === [P0Err0ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr1ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr0ASSERT_VIOLATIONMEMORY_LEAK (and 4 more)] === [2024-11-24 00:52:03,228 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-24 00:52:03,228 INFO L85 PathProgramCache]: Analyzing trace with hash -1404025743, now seen corresponding path program 4 times [2024-11-24 00:52:03,228 INFO L118 FreeRefinementEngine]: Executing refinement strategy FOX [2024-11-24 00:52:03,228 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleZ3 [862289816] [2024-11-24 00:52:03,228 INFO L95 rtionOrderModulation]: Changing assertion order to TERMS_WITH_SMALL_CONSTANTS_FIRST [2024-11-24 00:52:03,229 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-11-24 00:52:03,229 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_6dde6ab7-fc66-4d3a-b16e-411b0308ee99/bin/uautomizer-verify-LYvppIcaGC/z3 [2024-11-24 00:52:03,232 INFO L229 MonitoredProcess]: Starting monitored process 10 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_6dde6ab7-fc66-4d3a-b16e-411b0308ee99/bin/uautomizer-verify-LYvppIcaGC/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2024-11-24 00:52:03,235 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_6dde6ab7-fc66-4d3a-b16e-411b0308ee99/bin/uautomizer-verify-LYvppIcaGC/z3 -smt2 -in SMTLIB2_COMPLIANT=true (10)] Waiting until timeout for monitored process [2024-11-24 00:52:03,332 INFO L229 tOrderPrioritization]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 0 check-sat command(s) [2024-11-24 00:52:03,333 INFO L230 tOrderPrioritization]: Conjunction of SSA is unsat [2024-11-24 00:52:03,334 INFO L256 TraceCheckSpWp]: Trace formula consists of 91 conjuncts, 8 conjuncts are in the unsatisfiable core [2024-11-24 00:52:03,336 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2024-11-24 00:52:03,548 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-24 00:52:03,549 INFO L308 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2024-11-24 00:52:03,549 INFO L136 FreeRefinementEngine]: Strategy FOX found an infeasible trace [2024-11-24 00:52:03,549 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [862289816] [2024-11-24 00:52:03,549 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [862289816] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-24 00:52:03,549 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-24 00:52:03,549 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2024-11-24 00:52:03,549 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [123953055] [2024-11-24 00:52:03,549 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-24 00:52:03,549 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2024-11-24 00:52:03,550 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy FOX [2024-11-24 00:52:03,550 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2024-11-24 00:52:03,550 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=10, Invalid=20, Unknown=0, NotChecked=0, Total=30 [2024-11-24 00:52:03,570 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 16 out of 44 [2024-11-24 00:52:03,571 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 64 places, 45 transitions, 177 flow. Second operand has 6 states, 6 states have (on average 19.166666666666668) internal successors, (115), 6 states have internal predecessors, (115), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-24 00:52:03,571 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-11-24 00:52:03,571 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 16 of 44 [2024-11-24 00:52:03,571 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-11-24 00:52:04,005 INFO L124 PetriNetUnfolderBase]: 999/1865 cut-off events. [2024-11-24 00:52:04,005 INFO L125 PetriNetUnfolderBase]: For 522/568 co-relation queries the response was YES. [2024-11-24 00:52:04,010 INFO L83 FinitePrefix]: Finished finitePrefix Result has 4334 conditions, 1865 events. 999/1865 cut-off events. For 522/568 co-relation queries the response was YES. Maximal size of possible extension queue 164. Compared 11495 event pairs, 507 based on Foata normal form. 12/1724 useless extension candidates. Maximal degree in co-relation 4317. Up to 838 conditions per place. [2024-11-24 00:52:04,014 INFO L140 encePairwiseOnDemand]: 38/44 looper letters, 28 selfloop transitions, 2 changer transitions 24/74 dead transitions. [2024-11-24 00:52:04,014 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 66 places, 74 transitions, 374 flow [2024-11-24 00:52:04,015 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2024-11-24 00:52:04,015 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 6 states. [2024-11-24 00:52:04,016 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6 states to 6 states and 145 transitions. [2024-11-24 00:52:04,016 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.5492424242424242 [2024-11-24 00:52:04,016 INFO L175 Difference]: Start difference. First operand has 64 places, 45 transitions, 177 flow. Second operand 6 states and 145 transitions. [2024-11-24 00:52:04,016 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 66 places, 74 transitions, 374 flow [2024-11-24 00:52:04,018 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 59 places, 74 transitions, 351 flow, removed 6 selfloop flow, removed 7 redundant places. [2024-11-24 00:52:04,021 INFO L231 Difference]: Finished difference. Result has 63 places, 45 transitions, 174 flow [2024-11-24 00:52:04,023 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=44, PETRI_DIFFERENCE_MINUEND_FLOW=160, PETRI_DIFFERENCE_MINUEND_PLACES=54, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=45, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=2, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=43, PETRI_DIFFERENCE_SUBTRAHEND_STATES=6, PETRI_FLOW=174, PETRI_PLACES=63, PETRI_TRANSITIONS=45} [2024-11-24 00:52:04,024 INFO L279 CegarLoopForPetriNet]: 49 programPoint places, 14 predicate places. [2024-11-24 00:52:04,024 INFO L471 AbstractCegarLoop]: Abstraction has has 63 places, 45 transitions, 174 flow [2024-11-24 00:52:04,024 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 19.166666666666668) internal successors, (115), 6 states have internal predecessors, (115), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-24 00:52:04,024 INFO L198 CegarLoopForPetriNet]: Found error trace [2024-11-24 00:52:04,024 INFO L206 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-24 00:52:04,036 INFO L552 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_6dde6ab7-fc66-4d3a-b16e-411b0308ee99/bin/uautomizer-verify-LYvppIcaGC/z3 -smt2 -in SMTLIB2_COMPLIANT=true (10)] Ended with exit code 0 [2024-11-24 00:52:04,225 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 10 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_6dde6ab7-fc66-4d3a-b16e-411b0308ee99/bin/uautomizer-verify-LYvppIcaGC/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-11-24 00:52:04,225 INFO L396 AbstractCegarLoop]: === Iteration 10 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONMEMORY_LEAK === [P0Err0ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr1ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr0ASSERT_VIOLATIONMEMORY_LEAK (and 4 more)] === [2024-11-24 00:52:04,225 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-24 00:52:04,226 INFO L85 PathProgramCache]: Analyzing trace with hash -309069191, now seen corresponding path program 5 times [2024-11-24 00:52:04,226 INFO L118 FreeRefinementEngine]: Executing refinement strategy FOX [2024-11-24 00:52:04,226 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleZ3 [328077699] [2024-11-24 00:52:04,226 INFO L95 rtionOrderModulation]: Changing assertion order to INSIDE_LOOP_FIRST1 [2024-11-24 00:52:04,226 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-11-24 00:52:04,226 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_6dde6ab7-fc66-4d3a-b16e-411b0308ee99/bin/uautomizer-verify-LYvppIcaGC/z3 [2024-11-24 00:52:04,228 INFO L229 MonitoredProcess]: Starting monitored process 11 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_6dde6ab7-fc66-4d3a-b16e-411b0308ee99/bin/uautomizer-verify-LYvppIcaGC/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2024-11-24 00:52:04,230 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_6dde6ab7-fc66-4d3a-b16e-411b0308ee99/bin/uautomizer-verify-LYvppIcaGC/z3 -smt2 -in SMTLIB2_COMPLIANT=true (11)] Waiting until timeout for monitored process [2024-11-24 00:52:04,332 INFO L229 tOrderPrioritization]: Assert order INSIDE_LOOP_FIRST1 issued 1 check-sat command(s) [2024-11-24 00:52:04,332 INFO L230 tOrderPrioritization]: Conjunction of SSA is sat [2024-11-24 00:52:04,332 INFO L357 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2024-11-24 00:52:04,372 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-11-24 00:52:04,430 INFO L130 FreeRefinementEngine]: Strategy FOX found a feasible trace [2024-11-24 00:52:04,430 INFO L340 BasicCegarLoop]: Counterexample is feasible [2024-11-24 00:52:04,431 INFO L782 garLoopResultBuilder]: Registering result UNSAFE for location ULTIMATE.startErr0ASSERT_VIOLATIONMEMORY_LEAK (6 of 7 remaining) [2024-11-24 00:52:04,437 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location P0Err0ASSERT_VIOLATIONMEMORY_LEAK (5 of 7 remaining) [2024-11-24 00:52:04,438 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr1ASSERT_VIOLATIONMEMORY_LEAK (4 of 7 remaining) [2024-11-24 00:52:04,438 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (3 of 7 remaining) [2024-11-24 00:52:04,438 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (2 of 7 remaining) [2024-11-24 00:52:04,438 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr2INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (1 of 7 remaining) [2024-11-24 00:52:04,438 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location P0Err0ASSERT_VIOLATIONMEMORY_LEAK (0 of 7 remaining) [2024-11-24 00:52:04,450 INFO L552 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_6dde6ab7-fc66-4d3a-b16e-411b0308ee99/bin/uautomizer-verify-LYvppIcaGC/z3 -smt2 -in SMTLIB2_COMPLIANT=true (11)] Ended with exit code 0 [2024-11-24 00:52:04,639 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 11 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_6dde6ab7-fc66-4d3a-b16e-411b0308ee99/bin/uautomizer-verify-LYvppIcaGC/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-11-24 00:52:04,639 INFO L422 BasicCegarLoop]: Path program histogram: [5, 1, 1, 1, 1, 1] [2024-11-24 00:52:04,751 INFO L241 ceAbstractionStarter]: Analysis of concurrent program completed with 1 thread instances [2024-11-24 00:52:04,751 INFO L170 ceAbstractionStarter]: Computing trace abstraction results [2024-11-24 00:52:04,761 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 24.11 12:52:04 BasicIcfg [2024-11-24 00:52:04,761 INFO L131 PluginConnector]: ------------------------ END TraceAbstraction---------------------------- [2024-11-24 00:52:04,762 INFO L112 PluginConnector]: ------------------------Witness Printer---------------------------- [2024-11-24 00:52:04,763 INFO L270 PluginConnector]: Initializing Witness Printer... [2024-11-24 00:52:04,763 INFO L274 PluginConnector]: Witness Printer initialized [2024-11-24 00:52:04,766 INFO L184 PluginConnector]: Executing the observer RCFGCatcher from plugin Witness Printer for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 24.11 12:51:54" (3/4) ... [2024-11-24 00:52:04,768 INFO L149 WitnessPrinter]: No result that supports witness generation found [2024-11-24 00:52:04,769 INFO L131 PluginConnector]: ------------------------ END Witness Printer---------------------------- [2024-11-24 00:52:04,770 INFO L158 Benchmark]: Toolchain (without parser) took 12779.79ms. Allocated memory was 83.9MB in the beginning and 218.1MB in the end (delta: 134.2MB). Free memory was 59.2MB in the beginning and 115.7MB in the end (delta: -56.5MB). Peak memory consumption was 82.2MB. Max. memory is 16.1GB. [2024-11-24 00:52:04,770 INFO L158 Benchmark]: CDTParser took 0.59ms. Allocated memory is still 83.9MB. Free memory is still 64.3MB. There was no memory consumed. Max. memory is 16.1GB. [2024-11-24 00:52:04,770 INFO L158 Benchmark]: CACSL2BoogieTranslator took 741.23ms. Allocated memory is still 83.9MB. Free memory was 58.9MB in the beginning and 35.5MB in the end (delta: 23.4MB). Peak memory consumption was 25.2MB. Max. memory is 16.1GB. [2024-11-24 00:52:04,770 INFO L158 Benchmark]: Boogie Procedure Inliner took 80.06ms. Allocated memory is still 83.9MB. Free memory was 35.5MB in the beginning and 32.9MB in the end (delta: 2.7MB). There was no memory consumed. Max. memory is 16.1GB. [2024-11-24 00:52:04,771 INFO L158 Benchmark]: Boogie Preprocessor took 98.95ms. Allocated memory is still 83.9MB. Free memory was 32.9MB in the beginning and 29.9MB in the end (delta: 2.9MB). Peak memory consumption was 8.4MB. Max. memory is 16.1GB. [2024-11-24 00:52:04,771 INFO L158 Benchmark]: RCFGBuilder took 1113.05ms. Allocated memory is still 83.9MB. Free memory was 29.9MB in the beginning and 30.0MB in the end (delta: -20.3kB). Peak memory consumption was 20.9MB. Max. memory is 16.1GB. [2024-11-24 00:52:04,771 INFO L158 Benchmark]: TraceAbstraction took 10729.19ms. Allocated memory was 83.9MB in the beginning and 218.1MB in the end (delta: 134.2MB). Free memory was 29.5MB in the beginning and 115.8MB in the end (delta: -86.3MB). Peak memory consumption was 42.5MB. Max. memory is 16.1GB. [2024-11-24 00:52:04,771 INFO L158 Benchmark]: Witness Printer took 6.75ms. Allocated memory is still 218.1MB. Free memory was 115.8MB in the beginning and 115.7MB in the end (delta: 17.8kB). Peak memory consumption was 8.4MB. Max. memory is 16.1GB. [2024-11-24 00:52:04,775 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.59ms. Allocated memory is still 83.9MB. Free memory is still 64.3MB. There was no memory consumed. Max. memory is 16.1GB. * CACSL2BoogieTranslator took 741.23ms. Allocated memory is still 83.9MB. Free memory was 58.9MB in the beginning and 35.5MB in the end (delta: 23.4MB). Peak memory consumption was 25.2MB. Max. memory is 16.1GB. * Boogie Procedure Inliner took 80.06ms. Allocated memory is still 83.9MB. Free memory was 35.5MB in the beginning and 32.9MB in the end (delta: 2.7MB). There was no memory consumed. Max. memory is 16.1GB. * Boogie Preprocessor took 98.95ms. Allocated memory is still 83.9MB. Free memory was 32.9MB in the beginning and 29.9MB in the end (delta: 2.9MB). Peak memory consumption was 8.4MB. Max. memory is 16.1GB. * RCFGBuilder took 1113.05ms. Allocated memory is still 83.9MB. Free memory was 29.9MB in the beginning and 30.0MB in the end (delta: -20.3kB). Peak memory consumption was 20.9MB. Max. memory is 16.1GB. * TraceAbstraction took 10729.19ms. Allocated memory was 83.9MB in the beginning and 218.1MB in the end (delta: 134.2MB). Free memory was 29.5MB in the beginning and 115.8MB in the end (delta: -86.3MB). Peak memory consumption was 42.5MB. Max. memory is 16.1GB. * Witness Printer took 6.75ms. Allocated memory is still 218.1MB. Free memory was 115.8MB in the beginning and 115.7MB in the end (delta: 17.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_p2_EAX = 0; [L712] 0 _Bool main$tmp_guard0; [L713] 0 _Bool main$tmp_guard1; [L715] 0 int x = 0; [L717] 0 int y = 0; [L719] 0 int z = 0; [L720] 0 _Bool z$flush_delayed; [L721] 0 int z$mem_tmp; [L722] 0 _Bool z$r_buff0_thd0; [L723] 0 _Bool z$r_buff0_thd1; [L724] 0 _Bool z$r_buff0_thd2; [L725] 0 _Bool z$r_buff0_thd3; [L726] 0 _Bool z$r_buff1_thd0; [L727] 0 _Bool z$r_buff1_thd1; [L728] 0 _Bool z$r_buff1_thd2; [L729] 0 _Bool z$r_buff1_thd3; [L730] 0 _Bool z$read_delayed; [L731] 0 int *z$read_delayed_var; [L732] 0 int z$w_buff0; [L733] 0 _Bool z$w_buff0_used; [L734] 0 int z$w_buff1; [L735] 0 _Bool z$w_buff1_used; [L736] 0 _Bool weak$$choice0; [L737] 0 _Bool weak$$choice2; [L818] 0 pthread_t t2025; [L819] FCALL, FORK 0 pthread_create(&t2025, ((void *)0), P0, ((void *)0)) VAL [__unbuffered_cnt=0, __unbuffered_p2_EAX=0, main$tmp_guard0=0, main$tmp_guard1=0, t2025=-2, weak$$choice0=0, weak$$choice2=0, x=0, y=0, z$flush_delayed=0, z$mem_tmp=0, z$r_buff0_thd0=0, z$r_buff0_thd1=0, z$r_buff0_thd2=0, z$r_buff0_thd3=0, z$r_buff1_thd0=0, z$r_buff1_thd1=0, z$r_buff1_thd2=0, z$r_buff1_thd3=0, z$read_delayed=0, z$read_delayed_var={0:0}, z$w_buff0=0, z$w_buff0_used=0, z$w_buff1=0, z$w_buff1_used=0, z=0] [L741] 1 z$w_buff1 = z$w_buff0 [L742] 1 z$w_buff0 = 2 [L743] 1 z$w_buff1_used = z$w_buff0_used [L744] 1 z$w_buff0_used = (_Bool)1 [L745] CALL 1 __VERIFIER_assert(!(z$w_buff1_used && z$w_buff0_used)) [L18] COND FALSE 1 !(!expression) [L745] RET 1 __VERIFIER_assert(!(z$w_buff1_used && z$w_buff0_used)) [L746] 1 z$r_buff1_thd0 = z$r_buff0_thd0 [L747] 1 z$r_buff1_thd1 = z$r_buff0_thd1 [L748] 1 z$r_buff1_thd2 = z$r_buff0_thd2 [L749] 1 z$r_buff1_thd3 = z$r_buff0_thd3 [L750] 1 z$r_buff0_thd1 = (_Bool)1 VAL [\old(arg)={0:0}, __unbuffered_cnt=0, __unbuffered_p2_EAX=0, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=0, x=0, y=0, z$flush_delayed=0, z$mem_tmp=0, z$r_buff0_thd0=0, z$r_buff0_thd1=1, z$r_buff0_thd2=0, z$r_buff0_thd3=0, z$r_buff1_thd0=0, z$r_buff1_thd1=0, z$r_buff1_thd2=0, z$r_buff1_thd3=0, z$read_delayed=0, z$read_delayed_var={0:0}, z$w_buff0=2, z$w_buff0_used=1, z$w_buff1=0, z$w_buff1_used=0, z=0] [L820] 0 pthread_t t2026; [L821] FCALL, FORK 0 pthread_create(&t2026, ((void *)0), P1, ((void *)0)) VAL [\old(arg)={0:0}, __unbuffered_cnt=0, __unbuffered_p2_EAX=0, main$tmp_guard0=0, main$tmp_guard1=0, t2025=-2, t2026=-1, weak$$choice0=0, weak$$choice2=0, x=0, y=0, z$flush_delayed=0, z$mem_tmp=0, z$r_buff0_thd0=0, z$r_buff0_thd1=1, z$r_buff0_thd2=0, z$r_buff0_thd3=0, z$r_buff1_thd0=0, z$r_buff1_thd1=0, z$r_buff1_thd2=0, z$r_buff1_thd3=0, z$read_delayed=0, z$read_delayed_var={0:0}, z$w_buff0=2, z$w_buff0_used=1, z$w_buff1=0, z$w_buff1_used=0, z=0] [L753] 1 x = 1 VAL [\old(arg)={0:0}, \old(arg)={0:0}, __unbuffered_cnt=0, __unbuffered_p2_EAX=0, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=0, x=1, y=0, z$flush_delayed=0, z$mem_tmp=0, z$r_buff0_thd0=0, z$r_buff0_thd1=1, z$r_buff0_thd2=0, z$r_buff0_thd3=0, z$r_buff1_thd0=0, z$r_buff1_thd1=0, z$r_buff1_thd2=0, z$r_buff1_thd3=0, z$read_delayed=0, z$read_delayed_var={0:0}, z$w_buff0=2, z$w_buff0_used=1, z$w_buff1=0, z$w_buff1_used=0, z=0] [L770] 2 x = 2 VAL [\old(arg)={0:0}, __unbuffered_cnt=0, __unbuffered_p2_EAX=0, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=0, x=2, y=0, z$flush_delayed=0, z$mem_tmp=0, z$r_buff0_thd0=0, z$r_buff0_thd1=1, z$r_buff0_thd2=0, z$r_buff0_thd3=0, z$r_buff1_thd0=0, z$r_buff1_thd1=0, z$r_buff1_thd2=0, z$r_buff1_thd3=0, z$read_delayed=0, z$read_delayed_var={0:0}, z$w_buff0=2, z$w_buff0_used=1, z$w_buff1=0, z$w_buff1_used=0, z=0] [L773] 2 y = 1 VAL [\old(arg)={0:0}, __unbuffered_cnt=0, __unbuffered_p2_EAX=0, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=0, x=2, y=1, z$flush_delayed=0, z$mem_tmp=0, z$r_buff0_thd0=0, z$r_buff0_thd1=1, z$r_buff0_thd2=0, z$r_buff0_thd3=0, z$r_buff1_thd0=0, z$r_buff1_thd1=0, z$r_buff1_thd2=0, z$r_buff1_thd3=0, z$read_delayed=0, z$read_delayed_var={0:0}, z$w_buff0=2, z$w_buff0_used=1, z$w_buff1=0, z$w_buff1_used=0, z=0] [L776] 2 z = z$w_buff0_used && z$r_buff0_thd2 ? z$w_buff0 : (z$w_buff1_used && z$r_buff1_thd2 ? z$w_buff1 : z) [L777] 2 z$w_buff0_used = z$w_buff0_used && z$r_buff0_thd2 ? (_Bool)0 : z$w_buff0_used [L778] 2 z$w_buff1_used = z$w_buff0_used && z$r_buff0_thd2 || z$w_buff1_used && z$r_buff1_thd2 ? (_Bool)0 : z$w_buff1_used [L779] 2 z$r_buff0_thd2 = z$w_buff0_used && z$r_buff0_thd2 ? (_Bool)0 : z$r_buff0_thd2 [L780] 2 z$r_buff1_thd2 = z$w_buff0_used && z$r_buff0_thd2 || z$w_buff1_used && z$r_buff1_thd2 ? (_Bool)0 : z$r_buff1_thd2 VAL [\old(arg)={0:0}, __unbuffered_cnt=0, __unbuffered_p2_EAX=0, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=0, x=2, y=1, z$flush_delayed=0, z$mem_tmp=0, z$r_buff0_thd0=0, z$r_buff0_thd1=1, z$r_buff0_thd2=0, z$r_buff0_thd3=0, z$r_buff1_thd0=0, z$r_buff1_thd1=0, z$r_buff1_thd2=0, z$r_buff1_thd3=0, z$read_delayed=0, z$read_delayed_var={0:0}, z$w_buff0=2, z$w_buff0_used=1, z$w_buff1=0, z$w_buff1_used=0, z=0] [L783] 2 __unbuffered_cnt = __unbuffered_cnt + 1 VAL [\old(arg)={0:0}, __unbuffered_cnt=1, __unbuffered_p2_EAX=0, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=0, x=2, y=1, z$flush_delayed=0, z$mem_tmp=0, z$r_buff0_thd0=0, z$r_buff0_thd1=1, z$r_buff0_thd2=0, z$r_buff0_thd3=0, z$r_buff1_thd0=0, z$r_buff1_thd1=0, z$r_buff1_thd2=0, z$r_buff1_thd3=0, z$read_delayed=0, z$read_delayed_var={0:0}, z$w_buff0=2, z$w_buff0_used=1, z$w_buff1=0, z$w_buff1_used=0, z=0] [L822] 0 pthread_t t2027; [L823] FCALL, FORK 0 pthread_create(&t2027, ((void *)0), P2, ((void *)0)) VAL [\old(arg)={0:0}, \old(arg)={0:0}, __unbuffered_cnt=1, __unbuffered_p2_EAX=0, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, t2025=-2, t2026=-1, t2027=0, weak$$choice0=0, weak$$choice2=0, x=2, y=1, z$flush_delayed=0, z$mem_tmp=0, z$r_buff0_thd0=0, z$r_buff0_thd1=1, z$r_buff0_thd2=0, z$r_buff0_thd3=0, z$r_buff1_thd0=0, z$r_buff1_thd1=0, z$r_buff1_thd2=0, z$r_buff1_thd3=0, z$read_delayed=0, z$read_delayed_var={0:0}, z$w_buff0=2, z$w_buff0_used=1, z$w_buff1=0, z$w_buff1_used=0, z=0] [L790] 3 __unbuffered_p2_EAX = y VAL [\old(arg)={0:0}, \old(arg)={0:0}, __unbuffered_cnt=1, __unbuffered_p2_EAX=1, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=0, x=2, y=1, z$flush_delayed=0, z$mem_tmp=0, z$r_buff0_thd0=0, z$r_buff0_thd1=1, z$r_buff0_thd2=0, z$r_buff0_thd3=0, z$r_buff1_thd0=0, z$r_buff1_thd1=0, z$r_buff1_thd2=0, z$r_buff1_thd3=0, z$read_delayed=0, z$read_delayed_var={0:0}, z$w_buff0=2, z$w_buff0_used=1, z$w_buff1=0, z$w_buff1_used=0, z=0] [L793] 3 z = 1 VAL [\old(arg)={0:0}, \old(arg)={0:0}, __unbuffered_cnt=1, __unbuffered_p2_EAX=1, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=0, x=2, y=1, z$flush_delayed=0, z$mem_tmp=0, z$r_buff0_thd0=0, z$r_buff0_thd1=1, z$r_buff0_thd2=0, z$r_buff0_thd3=0, z$r_buff1_thd0=0, z$r_buff1_thd1=0, z$r_buff1_thd2=0, z$r_buff1_thd3=0, z$read_delayed=0, z$read_delayed_var={0:0}, z$w_buff0=2, z$w_buff0_used=1, z$w_buff1=0, z$w_buff1_used=0, z=1] [L796] 3 z = z$w_buff0_used && z$r_buff0_thd3 ? z$w_buff0 : (z$w_buff1_used && z$r_buff1_thd3 ? z$w_buff1 : z) [L797] 3 z$w_buff0_used = z$w_buff0_used && z$r_buff0_thd3 ? (_Bool)0 : z$w_buff0_used [L798] 3 z$w_buff1_used = z$w_buff0_used && z$r_buff0_thd3 || z$w_buff1_used && z$r_buff1_thd3 ? (_Bool)0 : z$w_buff1_used [L799] 3 z$r_buff0_thd3 = z$w_buff0_used && z$r_buff0_thd3 ? (_Bool)0 : z$r_buff0_thd3 [L800] 3 z$r_buff1_thd3 = z$w_buff0_used && z$r_buff0_thd3 || z$w_buff1_used && z$r_buff1_thd3 ? (_Bool)0 : z$r_buff1_thd3 VAL [\old(arg)={0:0}, \old(arg)={0:0}, __unbuffered_cnt=1, __unbuffered_p2_EAX=1, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=0, x=2, y=1, z$flush_delayed=0, z$mem_tmp=0, z$r_buff0_thd0=0, z$r_buff0_thd1=1, z$r_buff0_thd2=0, z$r_buff0_thd3=0, z$r_buff1_thd0=0, z$r_buff1_thd1=0, z$r_buff1_thd2=0, z$r_buff1_thd3=0, z$read_delayed=0, z$read_delayed_var={0:0}, z$w_buff0=2, z$w_buff0_used=1, z$w_buff1=0, z$w_buff1_used=0, z=1] [L756] 1 z = z$w_buff0_used && z$r_buff0_thd1 ? z$w_buff0 : (z$w_buff1_used && z$r_buff1_thd1 ? z$w_buff1 : z) [L757] 1 z$w_buff0_used = z$w_buff0_used && z$r_buff0_thd1 ? (_Bool)0 : z$w_buff0_used [L758] 1 z$w_buff1_used = z$w_buff0_used && z$r_buff0_thd1 || z$w_buff1_used && z$r_buff1_thd1 ? (_Bool)0 : z$w_buff1_used [L759] 1 z$r_buff0_thd1 = z$w_buff0_used && z$r_buff0_thd1 ? (_Bool)0 : z$r_buff0_thd1 [L760] 1 z$r_buff1_thd1 = z$w_buff0_used && z$r_buff0_thd1 || z$w_buff1_used && z$r_buff1_thd1 ? (_Bool)0 : z$r_buff1_thd1 VAL [\old(arg)={0:0}, \old(arg)={0:0}, \old(arg)={0:0}, __unbuffered_cnt=1, __unbuffered_p2_EAX=1, arg={0:0}, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=0, x=2, y=1, z$flush_delayed=0, z$mem_tmp=0, z$r_buff0_thd0=0, z$r_buff0_thd1=1, z$r_buff0_thd2=0, z$r_buff0_thd3=0, z$r_buff1_thd0=0, z$r_buff1_thd1=0, z$r_buff1_thd2=0, z$r_buff1_thd3=0, z$read_delayed=0, z$read_delayed_var={0:0}, z$w_buff0=2, z$w_buff0_used=0, z$w_buff1=0, z$w_buff1_used=0, z=2] [L763] 1 __unbuffered_cnt = __unbuffered_cnt + 1 VAL [\old(arg)={0:0}, \old(arg)={0:0}, \old(arg)={0:0}, __unbuffered_cnt=2, __unbuffered_p2_EAX=1, arg={0:0}, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=0, x=2, y=1, z$flush_delayed=0, z$mem_tmp=0, z$r_buff0_thd0=0, z$r_buff0_thd1=1, z$r_buff0_thd2=0, z$r_buff0_thd3=0, z$r_buff1_thd0=0, z$r_buff1_thd1=0, z$r_buff1_thd2=0, z$r_buff1_thd3=0, z$read_delayed=0, z$read_delayed_var={0:0}, z$w_buff0=2, z$w_buff0_used=0, z$w_buff1=0, z$w_buff1_used=0, z=2] [L803] 3 __unbuffered_cnt = __unbuffered_cnt + 1 VAL [\old(arg)={0:0}, \old(arg)={0:0}, __unbuffered_cnt=3, __unbuffered_p2_EAX=1, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=0, x=2, y=1, z$flush_delayed=0, z$mem_tmp=0, z$r_buff0_thd0=0, z$r_buff0_thd1=1, z$r_buff0_thd2=0, z$r_buff0_thd3=0, z$r_buff1_thd0=0, z$r_buff1_thd1=0, z$r_buff1_thd2=0, z$r_buff1_thd3=0, z$read_delayed=0, z$read_delayed_var={0:0}, z$w_buff0=2, z$w_buff0_used=0, z$w_buff1=0, z$w_buff1_used=0, z=2] [L825] 0 main$tmp_guard0 = __unbuffered_cnt == 3 VAL [\old(arg)={0:0}, \old(arg)={0:0}, __unbuffered_cnt=3, __unbuffered_p2_EAX=1, arg={0:0}, arg={0:0}, main$tmp_guard0=1, main$tmp_guard1=0, t2025=-2, t2026=-1, t2027=0, weak$$choice0=0, weak$$choice2=0, x=2, y=1, z$flush_delayed=0, z$mem_tmp=0, z$r_buff0_thd0=0, z$r_buff0_thd1=1, z$r_buff0_thd2=0, z$r_buff0_thd3=0, z$r_buff1_thd0=0, z$r_buff1_thd1=0, z$r_buff1_thd2=0, z$r_buff1_thd3=0, z$read_delayed=0, z$read_delayed_var={0:0}, z$w_buff0=2, z$w_buff0_used=0, z$w_buff1=0, z$w_buff1_used=0, z=2] [L827] CALL 0 assume_abort_if_not(main$tmp_guard0) [L3] COND FALSE 0 !(!cond) [L827] RET 0 assume_abort_if_not(main$tmp_guard0) [L829] 0 z = z$w_buff0_used && z$r_buff0_thd0 ? z$w_buff0 : (z$w_buff1_used && z$r_buff1_thd0 ? z$w_buff1 : z) [L830] 0 z$w_buff0_used = z$w_buff0_used && z$r_buff0_thd0 ? (_Bool)0 : z$w_buff0_used [L831] 0 z$w_buff1_used = z$w_buff0_used && z$r_buff0_thd0 || z$w_buff1_used && z$r_buff1_thd0 ? (_Bool)0 : z$w_buff1_used [L832] 0 z$r_buff0_thd0 = z$w_buff0_used && z$r_buff0_thd0 ? (_Bool)0 : z$r_buff0_thd0 [L833] 0 z$r_buff1_thd0 = z$w_buff0_used && z$r_buff0_thd0 || z$w_buff1_used && z$r_buff1_thd0 ? (_Bool)0 : z$r_buff1_thd0 VAL [\old(arg)={0:0}, \old(arg)={0:0}, __unbuffered_cnt=3, __unbuffered_p2_EAX=1, arg={0:0}, arg={0:0}, main$tmp_guard0=1, main$tmp_guard1=0, t2025=-2, t2026=-1, t2027=0, weak$$choice0=0, weak$$choice2=0, x=2, y=1, z$flush_delayed=0, z$mem_tmp=0, z$r_buff0_thd0=0, z$r_buff0_thd1=1, z$r_buff0_thd2=0, z$r_buff0_thd3=0, z$r_buff1_thd0=0, z$r_buff1_thd1=0, z$r_buff1_thd2=0, z$r_buff1_thd3=0, z$read_delayed=0, z$read_delayed_var={0:0}, z$w_buff0=2, z$w_buff0_used=0, z$w_buff1=0, z$w_buff1_used=0, z=2] [L836] 0 weak$$choice0 = __VERIFIER_nondet_bool() [L837] 0 weak$$choice2 = __VERIFIER_nondet_bool() [L838] 0 z$flush_delayed = weak$$choice2 [L839] 0 z$mem_tmp = z [L840] 0 z = !z$w_buff0_used || !z$r_buff0_thd0 && !z$w_buff1_used || !z$r_buff0_thd0 && !z$r_buff1_thd0 ? z : (z$w_buff0_used && z$r_buff0_thd0 ? z$w_buff0 : z$w_buff1) [L841] 0 z$w_buff0 = weak$$choice2 ? z$w_buff0 : (!z$w_buff0_used || !z$r_buff0_thd0 && !z$w_buff1_used || !z$r_buff0_thd0 && !z$r_buff1_thd0 ? z$w_buff0 : (z$w_buff0_used && z$r_buff0_thd0 ? z$w_buff0 : z$w_buff0)) [L842] 0 z$w_buff1 = weak$$choice2 ? z$w_buff1 : (!z$w_buff0_used || !z$r_buff0_thd0 && !z$w_buff1_used || !z$r_buff0_thd0 && !z$r_buff1_thd0 ? z$w_buff1 : (z$w_buff0_used && z$r_buff0_thd0 ? z$w_buff1 : z$w_buff1)) [L843] 0 z$w_buff0_used = weak$$choice2 ? z$w_buff0_used : (!z$w_buff0_used || !z$r_buff0_thd0 && !z$w_buff1_used || !z$r_buff0_thd0 && !z$r_buff1_thd0 ? z$w_buff0_used : (z$w_buff0_used && z$r_buff0_thd0 ? (_Bool)0 : z$w_buff0_used)) [L844] 0 z$w_buff1_used = weak$$choice2 ? z$w_buff1_used : (!z$w_buff0_used || !z$r_buff0_thd0 && !z$w_buff1_used || !z$r_buff0_thd0 && !z$r_buff1_thd0 ? z$w_buff1_used : (z$w_buff0_used && z$r_buff0_thd0 ? (_Bool)0 : (_Bool)0)) [L845] 0 z$r_buff0_thd0 = weak$$choice2 ? z$r_buff0_thd0 : (!z$w_buff0_used || !z$r_buff0_thd0 && !z$w_buff1_used || !z$r_buff0_thd0 && !z$r_buff1_thd0 ? z$r_buff0_thd0 : (z$w_buff0_used && z$r_buff0_thd0 ? (_Bool)0 : z$r_buff0_thd0)) [L846] 0 z$r_buff1_thd0 = weak$$choice2 ? z$r_buff1_thd0 : (!z$w_buff0_used || !z$r_buff0_thd0 && !z$w_buff1_used || !z$r_buff0_thd0 && !z$r_buff1_thd0 ? z$r_buff1_thd0 : (z$w_buff0_used && z$r_buff0_thd0 ? (_Bool)0 : (_Bool)0)) [L847] 0 main$tmp_guard1 = !(x == 2 && z == 2 && __unbuffered_p2_EAX == 1) [L848] 0 z = z$flush_delayed ? z$mem_tmp : z [L849] 0 z$flush_delayed = (_Bool)0 VAL [\old(arg)={0:0}, \old(arg)={0:0}, __unbuffered_cnt=3, __unbuffered_p2_EAX=1, arg={0:0}, arg={0:0}, main$tmp_guard0=1, main$tmp_guard1=0, t2025=-2, t2026=-1, t2027=0, weak$$choice0=0, weak$$choice2=1, x=2, y=1, z$flush_delayed=0, z$mem_tmp=2, z$r_buff0_thd0=0, z$r_buff0_thd1=1, z$r_buff0_thd2=0, z$r_buff0_thd3=0, z$r_buff1_thd0=0, z$r_buff1_thd1=0, z$r_buff1_thd2=0, z$r_buff1_thd3=0, z$read_delayed=0, z$read_delayed_var={0:0}, z$w_buff0=2, z$w_buff0_used=0, z$w_buff1=0, z$w_buff1_used=0, z=2] [L851] CALL 0 __VERIFIER_assert(main$tmp_guard1) [L18] COND TRUE 0 !expression [L18] CALL 0 reach_error() [L17] COND FALSE 0 !(0) VAL [\old(arg)={0:0}, \old(arg)={0:0}, __unbuffered_cnt=3, __unbuffered_p2_EAX=1, arg={0:0}, arg={0:0}, main$tmp_guard0=1, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=1, x=2, y=1, z$flush_delayed=0, z$mem_tmp=2, z$r_buff0_thd0=0, z$r_buff0_thd1=1, z$r_buff0_thd2=0, z$r_buff0_thd3=0, z$r_buff1_thd0=0, z$r_buff1_thd1=0, z$r_buff1_thd2=0, z$r_buff1_thd3=0, z$read_delayed=0, z$read_delayed_var={0:0}, z$w_buff0=2, z$w_buff0_used=0, z$w_buff1=0, z$w_buff1_used=0, z=2] [L17] 0 __assert_fail ("0", "safe011_power.oepc_pso.oepc_rmo.oepc_rmo.opt.c", 8, __extension__ __PRETTY_FUNCTION__) VAL [\old(arg)={0:0}, \old(arg)={0:0}, __unbuffered_cnt=3, __unbuffered_p2_EAX=1, arg={0:0}, arg={0:0}, main$tmp_guard0=1, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=1, x=2, y=1, z$flush_delayed=0, z$mem_tmp=2, z$r_buff0_thd0=0, z$r_buff0_thd1=1, z$r_buff0_thd2=0, z$r_buff0_thd3=0, z$r_buff1_thd0=0, z$r_buff1_thd1=0, z$r_buff1_thd2=0, z$r_buff1_thd3=0, z$read_delayed=0, z$read_delayed_var={0:0}, z$w_buff0=2, z$w_buff0_used=0, z$w_buff1=0, z$w_buff1_used=0, z=2] - UnprovableResult [Line: 17]: Unable to prove that all allocated memory was freed Unable to prove that all allocated memory was freed Reason: Not analyzed. - UnprovableResult [Line: 816]: Unable to prove that all allocated memory was freed Unable to prove that all allocated memory was freed Reason: Not analyzed. - UnprovableResult [Line: 821]: Unable to prove that petrification did provide enough thread instances (tool internal message) Unable to prove that petrification did provide enough thread instances (tool internal message) Reason: Not analyzed. - UnprovableResult [Line: 823]: Unable to prove that petrification did provide enough thread instances (tool internal message) Unable to prove that petrification did provide enough thread instances (tool internal message) Reason: Not analyzed. - UnprovableResult [Line: 819]: Unable to prove that petrification did provide enough thread instances (tool internal message) Unable to prove that petrification did provide enough thread instances (tool internal message) Reason: Not analyzed. - StatisticsResult: Ultimate Automizer benchmark data with 1 thread instances CFG has 7 procedures, 68 locations, 7 error locations. Started 1 CEGAR loops. EmptinessCheckTime: 0.0s, RemoveRedundantFlowTime: 0.0s, RemoveRedundantFlowUnfoldingTime: 0.0s, BackfoldingTime: 0.0s, BackfoldingUnfoldingTime: 0.0s, FlowIncreaseByBackfolding: 0, BasicCegarLoop: OverallTime: 10.5s, OverallIterations: 10, TraceHistogramMax: 1, PathProgramHistogramMax: 5, EmptinessCheckTime: 0.0s, AutomataDifference: 4.7s, DeadEndRemovalTime: 0.0s, HoareAnnotationTime: 0.0s, InitialAbstractionConstructionTime: 0.1s, HoareTripleCheckerStatistics: 0 mSolverCounterUnknown, 398 SdHoareTripleChecker+Valid, 1.7s IncrementalHoareTripleChecker+Time, 0 mSdLazyCounter, 378 mSDsluCounter, 153 SdHoareTripleChecker+Invalid, 1.4s Time, 0 mProtectedAction, 0 SdHoareTripleChecker+Unchecked, 0 IncrementalHoareTripleChecker+Unchecked, 136 mSDsCounter, 44 IncrementalHoareTripleChecker+Valid, 0 mProtectedPredicate, 1096 IncrementalHoareTripleChecker+Invalid, 1140 SdHoareTripleChecker+Unknown, 0 mSolverCounterNotChecked, 44 mSolverCounterUnsat, 17 mSDtfsCounter, 1096 mSolverCounterSat, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Unknown, PredicateUnifierStatistics: 0 DeclaredPredicates, 208 GetRequests, 154 SyntacticMatches, 0 SemanticMatches, 54 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 47 ImplicationChecksByTransitivity, 0.7s Time, 0.0s BasicInterpolantAutomatonTime, BiggestAbstraction: size=180occurred in iteration=7, InterpolantAutomatonStates: 48, traceCheckStatistics: No data available, InterpolantConsolidationStatistics: No data available, PathInvariantsStatistics: No data available, 0/0 InterpolantCoveringCapability, TotalInterpolationStatistics: No data available, 0.0s DumpTime, AutomataMinimizationStatistics: No data available, HoareAnnotationStatistics: No data available, RefinementEngineStatistics: TRACE_CHECK: 0.2s SsaConstructionTime, 0.3s SatisfiabilityAnalysisTime, 2.1s InterpolantComputationTime, 229 NumberOfCodeBlocks, 228 NumberOfCodeBlocksAsserted, 10 NumberOfCheckSat, 190 ConstructedInterpolants, 0 QuantifiedInterpolants, 1116 SizeOfPredicates, 27 NumberOfNonLiveVariables, 943 ConjunctsInSsa, 73 ConjunctsInUnsatCore, 9 InterpolantComputations, 9 PerfectInterpolantSequences, 0/0 InterpolantCoveringCapability, INVARIANT_SYNTHESIS: No data available, INTERPOLANT_CONSOLIDATION: No data available, ABSTRACT_INTERPRETATION: No data available, PDR: No data available, ACCELERATED_INTERPOLATION: No data available, SIFA: No data available, ReuseStatistics: No data available, ConComCheckerStatistics: No data available RESULT: Ultimate could not prove your program: unable to determine feasibility of some traces [2024-11-24 00:52:04,800 INFO L552 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_6dde6ab7-fc66-4d3a-b16e-411b0308ee99/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