./Ultimate.py --spec ../../sv-benchmarks/c/properties/valid-memsafety.prp --file ../../sv-benchmarks/c/pthread-wmm/mix035.oepc.i --full-output --architecture 32bit -------------------------------------------------------------------------------- Checking for memory safety (deref-memtrack) Using default analysis Version 0e0057cc Calling Ultimate with: /usr/lib/jvm/java-1.11.0-openjdk-amd64/bin/java -Dosgi.configuration.area=/tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_04b19fd4-4e56-40ba-9f43-51779049eebd/bin/uautomizer-verify-BQ2R08f2Ya/data/config -Xmx15G -Xms4m -jar /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_04b19fd4-4e56-40ba-9f43-51779049eebd/bin/uautomizer-verify-BQ2R08f2Ya/plugins/org.eclipse.equinox.launcher_1.5.800.v20200727-1323.jar -data @noDefault -ultimatedata /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_04b19fd4-4e56-40ba-9f43-51779049eebd/bin/uautomizer-verify-BQ2R08f2Ya/data -tc /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_04b19fd4-4e56-40ba-9f43-51779049eebd/bin/uautomizer-verify-BQ2R08f2Ya/config/AutomizerMemDerefMemtrack.xml -i ../../sv-benchmarks/c/pthread-wmm/mix035.oepc.i -s /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_04b19fd4-4e56-40ba-9f43-51779049eebd/bin/uautomizer-verify-BQ2R08f2Ya/config/svcomp-DerefFreeMemtrack-32bit-Automizer_Default.epf --cacsl2boogietranslator.entry.function main --witnessprinter.witness.directory /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_04b19fd4-4e56-40ba-9f43-51779049eebd/bin/uautomizer-verify-BQ2R08f2Ya --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 65062a4b0d520b12bcf8d6a9b80d96fd04b54c0c91d2bd97d502a34cc77f9c59 --- Real Ultimate output --- This is Ultimate 0.2.4-dev-0e0057c [2023-11-29 00:11:14,121 INFO L188 SettingsManager]: Resetting all preferences to default values... [2023-11-29 00:11:14,189 INFO L114 SettingsManager]: Loading settings from /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_04b19fd4-4e56-40ba-9f43-51779049eebd/bin/uautomizer-verify-BQ2R08f2Ya/config/svcomp-DerefFreeMemtrack-32bit-Automizer_Default.epf [2023-11-29 00:11:14,195 WARN L101 SettingsManager]: Preference file contains the following unknown settings: [2023-11-29 00:11:14,196 WARN L103 SettingsManager]: * de.uni_freiburg.informatik.ultimate.core.Log level for class [2023-11-29 00:11:14,222 INFO L130 SettingsManager]: Preferences different from defaults after loading the file: [2023-11-29 00:11:14,223 INFO L151 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2023-11-29 00:11:14,223 INFO L153 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2023-11-29 00:11:14,224 INFO L151 SettingsManager]: Preferences of Boogie Preprocessor differ from their defaults: [2023-11-29 00:11:14,225 INFO L153 SettingsManager]: * Use memory slicer=true [2023-11-29 00:11:14,225 INFO L151 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2023-11-29 00:11:14,226 INFO L153 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2023-11-29 00:11:14,226 INFO L151 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2023-11-29 00:11:14,227 INFO L153 SettingsManager]: * Create parallel compositions if possible=false [2023-11-29 00:11:14,227 INFO L153 SettingsManager]: * Use SBE=true [2023-11-29 00:11:14,228 INFO L151 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2023-11-29 00:11:14,229 INFO L153 SettingsManager]: * sizeof long=4 [2023-11-29 00:11:14,229 INFO L153 SettingsManager]: * Overapproximate operations on floating types=true [2023-11-29 00:11:14,230 INFO L153 SettingsManager]: * sizeof POINTER=4 [2023-11-29 00:11:14,230 INFO L153 SettingsManager]: * Check division by zero=IGNORE [2023-11-29 00:11:14,231 INFO L153 SettingsManager]: * Check for the main procedure if all allocated memory was freed=true [2023-11-29 00:11:14,231 INFO L153 SettingsManager]: * Bitprecise bitfields=true [2023-11-29 00:11:14,232 INFO L153 SettingsManager]: * SV-COMP memtrack compatibility mode=true [2023-11-29 00:11:14,232 INFO L153 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2023-11-29 00:11:14,233 INFO L153 SettingsManager]: * Adapt memory model on pointer casts if necessary=true [2023-11-29 00:11:14,233 INFO L153 SettingsManager]: * Check unreachability of reach_error function=false [2023-11-29 00:11:14,234 INFO L153 SettingsManager]: * sizeof long double=12 [2023-11-29 00:11:14,234 INFO L153 SettingsManager]: * Use constant arrays=true [2023-11-29 00:11:14,235 INFO L151 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2023-11-29 00:11:14,235 INFO L153 SettingsManager]: * Size of a code block=SequenceOfStatements [2023-11-29 00:11:14,235 INFO L153 SettingsManager]: * Only consider context switches at boundaries of atomic blocks=true [2023-11-29 00:11:14,236 INFO L153 SettingsManager]: * SMT solver=External_DefaultMode [2023-11-29 00:11:14,236 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2023-11-29 00:11:14,236 INFO L151 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2023-11-29 00:11:14,237 INFO L153 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2023-11-29 00:11:14,237 INFO L153 SettingsManager]: * Trace refinement strategy=CAMEL [2023-11-29 00:11:14,237 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2023-11-29 00:11:14,237 INFO L153 SettingsManager]: * Apply one-shot large block encoding in concurrent analysis=false [2023-11-29 00:11:14,238 INFO L153 SettingsManager]: * Automaton type used in concurrency analysis=PETRI_NET [2023-11-29 00:11:14,238 INFO L153 SettingsManager]: * Order on configurations for Petri net unfoldings=DBO [2023-11-29 00:11:14,238 INFO L153 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2023-11-29 00:11:14,238 INFO L153 SettingsManager]: * Looper check in Petri net analysis=SEMANTIC WARNING: An illegal reflective access operation has occurred WARNING: Illegal reflective access by com.sun.xml.bind.v2.runtime.reflect.opt.Injector$1 (file:/tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_04b19fd4-4e56-40ba-9f43-51779049eebd/bin/uautomizer-verify-BQ2R08f2Ya/plugins/com.sun.xml.bind_2.2.0.v201505121915.jar) to method java.lang.ClassLoader.defineClass(java.lang.String,byte[],int,int) WARNING: Please consider reporting this to the maintainers of com.sun.xml.bind.v2.runtime.reflect.opt.Injector$1 WARNING: Use --illegal-access=warn to enable warnings of further illegal reflective access operations WARNING: All illegal access operations will be denied in a future release Applying setting for plugin de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator: Entry function -> main Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Witness directory -> /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_04b19fd4-4e56-40ba-9f43-51779049eebd/bin/uautomizer-verify-BQ2R08f2Ya 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 -> 65062a4b0d520b12bcf8d6a9b80d96fd04b54c0c91d2bd97d502a34cc77f9c59 [2023-11-29 00:11:14,457 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2023-11-29 00:11:14,478 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2023-11-29 00:11:14,481 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2023-11-29 00:11:14,482 INFO L270 PluginConnector]: Initializing CDTParser... [2023-11-29 00:11:14,482 INFO L274 PluginConnector]: CDTParser initialized [2023-11-29 00:11:14,483 INFO L431 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_04b19fd4-4e56-40ba-9f43-51779049eebd/bin/uautomizer-verify-BQ2R08f2Ya/../../sv-benchmarks/c/pthread-wmm/mix035.oepc.i [2023-11-29 00:11:17,239 INFO L533 CDTParser]: Created temporary CDT project at NULL [2023-11-29 00:11:17,481 INFO L384 CDTParser]: Found 1 translation units. [2023-11-29 00:11:17,481 INFO L180 CDTParser]: Scanning /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_04b19fd4-4e56-40ba-9f43-51779049eebd/sv-benchmarks/c/pthread-wmm/mix035.oepc.i [2023-11-29 00:11:17,498 INFO L427 CDTParser]: About to delete temporary CDT project at /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_04b19fd4-4e56-40ba-9f43-51779049eebd/bin/uautomizer-verify-BQ2R08f2Ya/data/83a795dee/407cb9bf710c4e0fa870e30619378871/FLAG02c0fe200 [2023-11-29 00:11:17,513 INFO L435 CDTParser]: Successfully deleted /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_04b19fd4-4e56-40ba-9f43-51779049eebd/bin/uautomizer-verify-BQ2R08f2Ya/data/83a795dee/407cb9bf710c4e0fa870e30619378871 [2023-11-29 00:11:17,516 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2023-11-29 00:11:17,518 INFO L133 ToolchainWalker]: Walking toolchain with 6 elements. [2023-11-29 00:11:17,519 INFO L112 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2023-11-29 00:11:17,519 INFO L270 PluginConnector]: Initializing CACSL2BoogieTranslator... [2023-11-29 00:11:17,524 INFO L274 PluginConnector]: CACSL2BoogieTranslator initialized [2023-11-29 00:11:17,525 INFO L184 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 29.11 12:11:17" (1/1) ... [2023-11-29 00:11:17,526 INFO L204 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@46023a05 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 29.11 12:11:17, skipping insertion in model container [2023-11-29 00:11:17,526 INFO L184 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 29.11 12:11:17" (1/1) ... [2023-11-29 00:11:17,583 INFO L177 MainTranslator]: Built tables and reachable declarations [2023-11-29 00:11:17,941 INFO L209 PostProcessor]: Analyzing one entry point: main [2023-11-29 00:11:17,953 INFO L202 MainTranslator]: Completed pre-run [2023-11-29 00:11:18,007 INFO L209 PostProcessor]: Analyzing one entry point: main [2023-11-29 00:11:18,041 WARN L675 CHandler]: The function __VERIFIER_atomic_begin is called, but not defined or handled by StandardFunctionHandler. [2023-11-29 00:11:18,041 WARN L675 CHandler]: The function __VERIFIER_atomic_end is called, but not defined or handled by StandardFunctionHandler. [2023-11-29 00:11:18,049 INFO L206 MainTranslator]: Completed translation [2023-11-29 00:11:18,049 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 29.11 12:11:18 WrapperNode [2023-11-29 00:11:18,049 INFO L131 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2023-11-29 00:11:18,050 INFO L112 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2023-11-29 00:11:18,051 INFO L270 PluginConnector]: Initializing Boogie Procedure Inliner... [2023-11-29 00:11:18,051 INFO L274 PluginConnector]: Boogie Procedure Inliner initialized [2023-11-29 00:11:18,058 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 29.11 12:11:18" (1/1) ... [2023-11-29 00:11:18,075 INFO L184 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 29.11 12:11:18" (1/1) ... [2023-11-29 00:11:18,103 INFO L138 Inliner]: procedures = 176, calls = 59, calls flagged for inlining = 6, calls inlined = 7, statements flattened = 136 [2023-11-29 00:11:18,103 INFO L131 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2023-11-29 00:11:18,104 INFO L112 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2023-11-29 00:11:18,104 INFO L270 PluginConnector]: Initializing Boogie Preprocessor... [2023-11-29 00:11:18,104 INFO L274 PluginConnector]: Boogie Preprocessor initialized [2023-11-29 00:11:18,116 INFO L184 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 29.11 12:11:18" (1/1) ... [2023-11-29 00:11:18,116 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 29.11 12:11:18" (1/1) ... [2023-11-29 00:11:18,120 INFO L184 PluginConnector]: Executing the observer MemorySlicer from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 29.11 12:11:18" (1/1) ... [2023-11-29 00:11:18,139 INFO L175 MemorySlicer]: Split 5 memory accesses to 4 slices as follows [2, 1, 1, 1]. 40 percent of accesses are in the largest equivalence class. The 2 initializations are split as follows [2, 0, 0, 0]. The 3 writes are split as follows [0, 1, 1, 1]. [2023-11-29 00:11:18,140 INFO L184 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 29.11 12:11:18" (1/1) ... [2023-11-29 00:11:18,140 INFO L184 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 29.11 12:11:18" (1/1) ... [2023-11-29 00:11:18,150 INFO L184 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 29.11 12:11:18" (1/1) ... [2023-11-29 00:11:18,153 INFO L184 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 29.11 12:11:18" (1/1) ... [2023-11-29 00:11:18,156 INFO L184 PluginConnector]: Executing the observer LTLStepAnnotator from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 29.11 12:11:18" (1/1) ... [2023-11-29 00:11:18,158 INFO L184 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 29.11 12:11:18" (1/1) ... [2023-11-29 00:11:18,163 INFO L131 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2023-11-29 00:11:18,164 INFO L112 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2023-11-29 00:11:18,164 INFO L270 PluginConnector]: Initializing RCFGBuilder... [2023-11-29 00:11:18,164 INFO L274 PluginConnector]: RCFGBuilder initialized [2023-11-29 00:11:18,165 INFO L184 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 29.11 12:11:18" (1/1) ... [2023-11-29 00:11:18,171 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2023-11-29 00:11:18,182 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_04b19fd4-4e56-40ba-9f43-51779049eebd/bin/uautomizer-verify-BQ2R08f2Ya/z3 [2023-11-29 00:11:18,194 INFO L229 MonitoredProcess]: Starting monitored process 1 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_04b19fd4-4e56-40ba-9f43-51779049eebd/bin/uautomizer-verify-BQ2R08f2Ya/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 (exit command is (exit), workingDir is null) [2023-11-29 00:11:18,197 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_04b19fd4-4e56-40ba-9f43-51779049eebd/bin/uautomizer-verify-BQ2R08f2Ya/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 (1)] Waiting until timeout for monitored process [2023-11-29 00:11:18,226 INFO L130 BoogieDeclarations]: Found specification of procedure write~int#0 [2023-11-29 00:11:18,226 INFO L130 BoogieDeclarations]: Found specification of procedure write~int#1 [2023-11-29 00:11:18,226 INFO L130 BoogieDeclarations]: Found specification of procedure write~int#2 [2023-11-29 00:11:18,227 INFO L130 BoogieDeclarations]: Found specification of procedure write~int#3 [2023-11-29 00:11:18,227 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_atomic_begin [2023-11-29 00:11:18,227 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2023-11-29 00:11:18,227 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnStack [2023-11-29 00:11:18,227 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.dealloc [2023-11-29 00:11:18,227 INFO L130 BoogieDeclarations]: Found specification of procedure P0 [2023-11-29 00:11:18,228 INFO L138 BoogieDeclarations]: Found implementation of procedure P0 [2023-11-29 00:11:18,228 INFO L130 BoogieDeclarations]: Found specification of procedure P1 [2023-11-29 00:11:18,228 INFO L138 BoogieDeclarations]: Found implementation of procedure P1 [2023-11-29 00:11:18,228 INFO L130 BoogieDeclarations]: Found specification of procedure P2 [2023-11-29 00:11:18,228 INFO L138 BoogieDeclarations]: Found implementation of procedure P2 [2023-11-29 00:11:18,228 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#0 [2023-11-29 00:11:18,228 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#1 [2023-11-29 00:11:18,229 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#2 [2023-11-29 00:11:18,229 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#3 [2023-11-29 00:11:18,229 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_atomic_end [2023-11-29 00:11:18,229 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2023-11-29 00:11:18,229 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2023-11-29 00:11:18,231 WARN L213 CfgBuilder]: User set CodeBlockSize to SequenceOfStatements but program contains fork statements. Overwriting the user preferences and setting CodeBlockSize to OneNontrivialStatement [2023-11-29 00:11:18,385 INFO L241 CfgBuilder]: Building ICFG [2023-11-29 00:11:18,388 INFO L267 CfgBuilder]: Building CFG for each procedure with an implementation [2023-11-29 00:11:18,717 INFO L282 CfgBuilder]: Performing block encoding [2023-11-29 00:11:18,888 INFO L304 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2023-11-29 00:11:18,888 INFO L309 CfgBuilder]: Removed 0 assume(true) statements. [2023-11-29 00:11:18,889 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 29.11 12:11:18 BoogieIcfgContainer [2023-11-29 00:11:18,889 INFO L131 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2023-11-29 00:11:18,891 INFO L112 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2023-11-29 00:11:18,891 INFO L270 PluginConnector]: Initializing TraceAbstraction... [2023-11-29 00:11:18,894 INFO L274 PluginConnector]: TraceAbstraction initialized [2023-11-29 00:11:18,894 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 29.11 12:11:17" (1/3) ... [2023-11-29 00:11:18,895 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@48a4214f and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 29.11 12:11:18, skipping insertion in model container [2023-11-29 00:11:18,895 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 29.11 12:11:18" (2/3) ... [2023-11-29 00:11:18,895 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@48a4214f and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 29.11 12:11:18, skipping insertion in model container [2023-11-29 00:11:18,895 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 29.11 12:11:18" (3/3) ... [2023-11-29 00:11:18,896 INFO L112 eAbstractionObserver]: Analyzing ICFG mix035.oepc.i [2023-11-29 00:11:18,911 INFO L203 ceAbstractionStarter]: Automizer settings: Hoare:false NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2023-11-29 00:11:18,911 INFO L162 ceAbstractionStarter]: Applying trace abstraction to program that has 9 error locations. [2023-11-29 00:11:18,911 INFO L514 ceAbstractionStarter]: Constructing petrified ICFG for 1 thread instances. [2023-11-29 00:11:18,958 INFO L144 ThreadInstanceAdder]: Constructed 0 joinOtherThreadTransitions. [2023-11-29 00:11:18,987 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 63 places, 55 transitions, 122 flow [2023-11-29 00:11:19,015 INFO L124 PetriNetUnfolderBase]: 2/52 cut-off events. [2023-11-29 00:11:19,016 INFO L125 PetriNetUnfolderBase]: For 0/0 co-relation queries the response was YES. [2023-11-29 00:11:19,020 INFO L83 FinitePrefix]: Finished finitePrefix Result has 62 conditions, 52 events. 2/52 cut-off events. For 0/0 co-relation queries the response was YES. Maximal size of possible extension queue 5. Compared 105 event pairs, 0 based on Foata normal form. 0/41 useless extension candidates. Maximal degree in co-relation 51. Up to 2 conditions per place. [2023-11-29 00:11:19,020 INFO L82 GeneralOperation]: Start removeDead. Operand has 63 places, 55 transitions, 122 flow [2023-11-29 00:11:19,024 INFO L88 GeneralOperation]: Finished RemoveDead, result has has 60 places, 52 transitions, 113 flow [2023-11-29 00:11:19,034 INFO L356 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2023-11-29 00:11:19,041 INFO L357 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, mHoare=false, mAutomataTypeConcurrency=PETRI_NET, mHoareTripleChecks=INCREMENTAL, mHoareAnnotationPositions=All, 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;@44131cdf, mLbeIndependenceSettings=[IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=false, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2023-11-29 00:11:19,041 INFO L358 AbstractCegarLoop]: Starting to check reachability of 13 error locations. [2023-11-29 00:11:19,044 INFO L185 PetriNetUnfolderBase]: Found word, exiting Unfolder. [2023-11-29 00:11:19,044 INFO L124 PetriNetUnfolderBase]: 0/2 cut-off events. [2023-11-29 00:11:19,045 INFO L125 PetriNetUnfolderBase]: For 0/0 co-relation queries the response was YES. [2023-11-29 00:11:19,045 INFO L200 CegarLoopForPetriNet]: Found error trace [2023-11-29 00:11:19,045 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1] [2023-11-29 00:11:19,046 INFO L420 AbstractCegarLoop]: === Iteration 1 === Targeting ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [P0Err0ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 10 more)] === [2023-11-29 00:11:19,051 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-11-29 00:11:19,051 INFO L85 PathProgramCache]: Analyzing trace with hash 12752, now seen corresponding path program 1 times [2023-11-29 00:11:19,061 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-11-29 00:11:19,061 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [318124969] [2023-11-29 00:11:19,061 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-11-29 00:11:19,062 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-11-29 00:11:19,162 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 00:11:19,297 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-11-29 00:11:19,298 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-11-29 00:11:19,298 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [318124969] [2023-11-29 00:11:19,299 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [318124969] provided 1 perfect and 0 imperfect interpolant sequences [2023-11-29 00:11:19,299 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-11-29 00:11:19,300 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [1] imperfect sequences [] total 1 [2023-11-29 00:11:19,301 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1198978940] [2023-11-29 00:11:19,302 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-11-29 00:11:19,311 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2023-11-29 00:11:19,316 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-11-29 00:11:19,340 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2023-11-29 00:11:19,340 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2023-11-29 00:11:19,360 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 28 out of 55 [2023-11-29 00:11:19,363 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 60 places, 52 transitions, 113 flow. Second operand has 3 states, 3 states have (on average 28.666666666666668) internal successors, (86), 3 states have internal predecessors, (86), 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) [2023-11-29 00:11:19,363 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2023-11-29 00:11:19,363 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 28 of 55 [2023-11-29 00:11:19,364 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2023-11-29 00:11:19,792 INFO L124 PetriNetUnfolderBase]: 1057/2068 cut-off events. [2023-11-29 00:11:19,792 INFO L125 PetriNetUnfolderBase]: For 20/20 co-relation queries the response was YES. [2023-11-29 00:11:19,800 INFO L83 FinitePrefix]: Finished finitePrefix Result has 3694 conditions, 2068 events. 1057/2068 cut-off events. For 20/20 co-relation queries the response was YES. Maximal size of possible extension queue 142. Compared 14096 event pairs, 791 based on Foata normal form. 120/1981 useless extension candidates. Maximal degree in co-relation 3680. Up to 1193 conditions per place. [2023-11-29 00:11:19,814 INFO L140 encePairwiseOnDemand]: 50/55 looper letters, 30 selfloop transitions, 2 changer transitions 0/57 dead transitions. [2023-11-29 00:11:19,814 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 60 places, 57 transitions, 187 flow [2023-11-29 00:11:19,815 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2023-11-29 00:11:19,817 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2023-11-29 00:11:19,823 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 119 transitions. [2023-11-29 00:11:19,824 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.7212121212121212 [2023-11-29 00:11:19,825 INFO L72 ComplementDD]: Start complementDD. Operand 3 states and 119 transitions. [2023-11-29 00:11:19,825 INFO L73 IsDeterministic]: Start isDeterministic. Operand 3 states and 119 transitions. [2023-11-29 00:11:19,826 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2023-11-29 00:11:19,828 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 3 states and 119 transitions. [2023-11-29 00:11:19,830 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 4 states, 3 states have (on average 39.666666666666664) internal successors, (119), 3 states have internal predecessors, (119), 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) [2023-11-29 00:11:19,834 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 4 states, 4 states have (on average 55.0) internal successors, (220), 4 states have internal predecessors, (220), 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) [2023-11-29 00:11:19,834 INFO L81 ComplementDD]: Finished complementDD. Result has 4 states, 4 states have (on average 55.0) internal successors, (220), 4 states have internal predecessors, (220), 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) [2023-11-29 00:11:19,836 INFO L175 Difference]: Start difference. First operand has 60 places, 52 transitions, 113 flow. Second operand 3 states and 119 transitions. [2023-11-29 00:11:19,837 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 60 places, 57 transitions, 187 flow [2023-11-29 00:11:19,840 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 57 places, 57 transitions, 184 flow, removed 0 selfloop flow, removed 3 redundant places. [2023-11-29 00:11:19,843 INFO L231 Difference]: Finished difference. Result has 57 places, 48 transitions, 106 flow [2023-11-29 00:11:19,845 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=55, PETRI_DIFFERENCE_MINUEND_FLOW=102, PETRI_DIFFERENCE_MINUEND_PLACES=55, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=48, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=2, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=46, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=106, PETRI_PLACES=57, PETRI_TRANSITIONS=48} [2023-11-29 00:11:19,848 INFO L281 CegarLoopForPetriNet]: 60 programPoint places, -3 predicate places. [2023-11-29 00:11:19,848 INFO L495 AbstractCegarLoop]: Abstraction has has 57 places, 48 transitions, 106 flow [2023-11-29 00:11:19,848 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 28.666666666666668) internal successors, (86), 3 states have internal predecessors, (86), 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) [2023-11-29 00:11:19,849 INFO L200 CegarLoopForPetriNet]: Found error trace [2023-11-29 00:11:19,849 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1] [2023-11-29 00:11:19,849 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable0 [2023-11-29 00:11:19,849 INFO L420 AbstractCegarLoop]: === Iteration 2 === Targeting ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [P0Err0ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 10 more)] === [2023-11-29 00:11:19,850 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-11-29 00:11:19,850 INFO L85 PathProgramCache]: Analyzing trace with hash 12753, now seen corresponding path program 1 times [2023-11-29 00:11:19,850 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-11-29 00:11:19,850 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1950347727] [2023-11-29 00:11:19,850 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-11-29 00:11:19,851 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-11-29 00:11:19,870 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 00:11:19,955 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-11-29 00:11:19,955 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-11-29 00:11:19,955 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1950347727] [2023-11-29 00:11:19,955 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1950347727] provided 1 perfect and 0 imperfect interpolant sequences [2023-11-29 00:11:19,956 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-11-29 00:11:19,956 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [1] imperfect sequences [] total 1 [2023-11-29 00:11:19,956 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1052450402] [2023-11-29 00:11:19,956 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-11-29 00:11:19,957 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2023-11-29 00:11:19,957 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-11-29 00:11:19,958 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2023-11-29 00:11:19,958 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2023-11-29 00:11:19,972 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 29 out of 55 [2023-11-29 00:11:19,973 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 57 places, 48 transitions, 106 flow. Second operand has 3 states, 3 states have (on average 29.666666666666668) internal successors, (89), 3 states have internal predecessors, (89), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-29 00:11:19,973 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2023-11-29 00:11:19,973 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 29 of 55 [2023-11-29 00:11:19,973 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2023-11-29 00:11:20,271 INFO L124 PetriNetUnfolderBase]: 1057/2067 cut-off events. [2023-11-29 00:11:20,271 INFO L125 PetriNetUnfolderBase]: For 60/60 co-relation queries the response was YES. [2023-11-29 00:11:20,276 INFO L83 FinitePrefix]: Finished finitePrefix Result has 3751 conditions, 2067 events. 1057/2067 cut-off events. For 60/60 co-relation queries the response was YES. Maximal size of possible extension queue 142. Compared 14165 event pairs, 791 based on Foata normal form. 1/1861 useless extension candidates. Maximal degree in co-relation 3740. Up to 1192 conditions per place. [2023-11-29 00:11:20,286 INFO L140 encePairwiseOnDemand]: 52/55 looper letters, 29 selfloop transitions, 2 changer transitions 0/56 dead transitions. [2023-11-29 00:11:20,286 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 58 places, 56 transitions, 184 flow [2023-11-29 00:11:20,287 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2023-11-29 00:11:20,287 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2023-11-29 00:11:20,288 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 119 transitions. [2023-11-29 00:11:20,289 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.7212121212121212 [2023-11-29 00:11:20,289 INFO L72 ComplementDD]: Start complementDD. Operand 3 states and 119 transitions. [2023-11-29 00:11:20,289 INFO L73 IsDeterministic]: Start isDeterministic. Operand 3 states and 119 transitions. [2023-11-29 00:11:20,290 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2023-11-29 00:11:20,290 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 3 states and 119 transitions. [2023-11-29 00:11:20,315 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 4 states, 3 states have (on average 39.666666666666664) internal successors, (119), 3 states have internal predecessors, (119), 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) [2023-11-29 00:11:20,317 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 4 states, 4 states have (on average 55.0) internal successors, (220), 4 states have internal predecessors, (220), 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) [2023-11-29 00:11:20,317 INFO L81 ComplementDD]: Finished complementDD. Result has 4 states, 4 states have (on average 55.0) internal successors, (220), 4 states have internal predecessors, (220), 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) [2023-11-29 00:11:20,317 INFO L175 Difference]: Start difference. First operand has 57 places, 48 transitions, 106 flow. Second operand 3 states and 119 transitions. [2023-11-29 00:11:20,317 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 58 places, 56 transitions, 184 flow [2023-11-29 00:11:20,320 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 56 places, 56 transitions, 180 flow, removed 0 selfloop flow, removed 2 redundant places. [2023-11-29 00:11:20,321 INFO L231 Difference]: Finished difference. Result has 56 places, 47 transitions, 104 flow [2023-11-29 00:11:20,321 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=55, PETRI_DIFFERENCE_MINUEND_FLOW=100, PETRI_DIFFERENCE_MINUEND_PLACES=54, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=47, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=2, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=45, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=104, PETRI_PLACES=56, PETRI_TRANSITIONS=47} [2023-11-29 00:11:20,322 INFO L281 CegarLoopForPetriNet]: 60 programPoint places, -4 predicate places. [2023-11-29 00:11:20,322 INFO L495 AbstractCegarLoop]: Abstraction has has 56 places, 47 transitions, 104 flow [2023-11-29 00:11:20,322 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 29.666666666666668) internal successors, (89), 3 states have internal predecessors, (89), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-29 00:11:20,323 INFO L200 CegarLoopForPetriNet]: Found error trace [2023-11-29 00:11:20,323 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1] [2023-11-29 00:11:20,323 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1 [2023-11-29 00:11:20,323 INFO L420 AbstractCegarLoop]: === Iteration 3 === Targeting ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [P0Err0ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 10 more)] === [2023-11-29 00:11:20,324 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-11-29 00:11:20,324 INFO L85 PathProgramCache]: Analyzing trace with hash 380277559, now seen corresponding path program 1 times [2023-11-29 00:11:20,324 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-11-29 00:11:20,324 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [472280273] [2023-11-29 00:11:20,324 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-11-29 00:11:20,325 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-11-29 00:11:20,340 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 00:11:20,383 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-11-29 00:11:20,383 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-11-29 00:11:20,383 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [472280273] [2023-11-29 00:11:20,384 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [472280273] provided 1 perfect and 0 imperfect interpolant sequences [2023-11-29 00:11:20,384 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-11-29 00:11:20,384 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2023-11-29 00:11:20,384 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [49715495] [2023-11-29 00:11:20,384 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-11-29 00:11:20,385 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2023-11-29 00:11:20,385 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-11-29 00:11:20,385 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2023-11-29 00:11:20,386 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2023-11-29 00:11:20,400 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 28 out of 55 [2023-11-29 00:11:20,400 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 56 places, 47 transitions, 104 flow. Second operand has 3 states, 3 states have (on average 29.333333333333332) internal successors, (88), 3 states have internal predecessors, (88), 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) [2023-11-29 00:11:20,401 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2023-11-29 00:11:20,401 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 28 of 55 [2023-11-29 00:11:20,401 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2023-11-29 00:11:20,712 INFO L124 PetriNetUnfolderBase]: 1061/2066 cut-off events. [2023-11-29 00:11:20,712 INFO L125 PetriNetUnfolderBase]: For 60/60 co-relation queries the response was YES. [2023-11-29 00:11:20,715 INFO L83 FinitePrefix]: Finished finitePrefix Result has 3759 conditions, 2066 events. 1061/2066 cut-off events. For 60/60 co-relation queries the response was YES. Maximal size of possible extension queue 142. Compared 14316 event pairs, 571 based on Foata normal form. 0/1871 useless extension candidates. Maximal degree in co-relation 3748. Up to 1195 conditions per place. [2023-11-29 00:11:20,726 INFO L140 encePairwiseOnDemand]: 52/55 looper letters, 30 selfloop transitions, 2 changer transitions 0/55 dead transitions. [2023-11-29 00:11:20,726 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 57 places, 55 transitions, 184 flow [2023-11-29 00:11:20,727 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2023-11-29 00:11:20,727 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2023-11-29 00:11:20,728 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 117 transitions. [2023-11-29 00:11:20,728 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.7090909090909091 [2023-11-29 00:11:20,728 INFO L72 ComplementDD]: Start complementDD. Operand 3 states and 117 transitions. [2023-11-29 00:11:20,729 INFO L73 IsDeterministic]: Start isDeterministic. Operand 3 states and 117 transitions. [2023-11-29 00:11:20,729 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2023-11-29 00:11:20,729 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 3 states and 117 transitions. [2023-11-29 00:11:20,730 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 4 states, 3 states have (on average 39.0) internal successors, (117), 3 states have internal predecessors, (117), 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) [2023-11-29 00:11:20,731 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 4 states, 4 states have (on average 55.0) internal successors, (220), 4 states have internal predecessors, (220), 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) [2023-11-29 00:11:20,731 INFO L81 ComplementDD]: Finished complementDD. Result has 4 states, 4 states have (on average 55.0) internal successors, (220), 4 states have internal predecessors, (220), 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) [2023-11-29 00:11:20,732 INFO L175 Difference]: Start difference. First operand has 56 places, 47 transitions, 104 flow. Second operand 3 states and 117 transitions. [2023-11-29 00:11:20,732 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 57 places, 55 transitions, 184 flow [2023-11-29 00:11:20,734 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 55 places, 55 transitions, 180 flow, removed 0 selfloop flow, removed 2 redundant places. [2023-11-29 00:11:20,735 INFO L231 Difference]: Finished difference. Result has 55 places, 46 transitions, 102 flow [2023-11-29 00:11:20,736 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=55, PETRI_DIFFERENCE_MINUEND_FLOW=98, PETRI_DIFFERENCE_MINUEND_PLACES=53, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=46, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=2, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=44, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=102, PETRI_PLACES=55, PETRI_TRANSITIONS=46} [2023-11-29 00:11:20,736 INFO L281 CegarLoopForPetriNet]: 60 programPoint places, -5 predicate places. [2023-11-29 00:11:20,737 INFO L495 AbstractCegarLoop]: Abstraction has has 55 places, 46 transitions, 102 flow [2023-11-29 00:11:20,737 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 29.333333333333332) internal successors, (88), 3 states have internal predecessors, (88), 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) [2023-11-29 00:11:20,737 INFO L200 CegarLoopForPetriNet]: Found error trace [2023-11-29 00:11:20,737 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1] [2023-11-29 00:11:20,737 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2 [2023-11-29 00:11:20,738 INFO L420 AbstractCegarLoop]: === Iteration 4 === Targeting ULTIMATE.startErr3REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [P0Err0ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 10 more)] === [2023-11-29 00:11:20,738 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-11-29 00:11:20,738 INFO L85 PathProgramCache]: Analyzing trace with hash 380277560, now seen corresponding path program 1 times [2023-11-29 00:11:20,738 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-11-29 00:11:20,739 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1350456373] [2023-11-29 00:11:20,739 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-11-29 00:11:20,739 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-11-29 00:11:20,757 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 00:11:20,816 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-11-29 00:11:20,816 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-11-29 00:11:20,816 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1350456373] [2023-11-29 00:11:20,817 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1350456373] provided 1 perfect and 0 imperfect interpolant sequences [2023-11-29 00:11:20,817 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-11-29 00:11:20,817 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2023-11-29 00:11:20,817 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [246044693] [2023-11-29 00:11:20,817 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-11-29 00:11:20,818 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2023-11-29 00:11:20,818 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-11-29 00:11:20,818 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2023-11-29 00:11:20,819 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2023-11-29 00:11:20,832 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 29 out of 55 [2023-11-29 00:11:20,833 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 55 places, 46 transitions, 102 flow. Second operand has 3 states, 3 states have (on average 30.333333333333332) internal successors, (91), 3 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) [2023-11-29 00:11:20,833 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2023-11-29 00:11:20,833 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 29 of 55 [2023-11-29 00:11:20,833 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2023-11-29 00:11:21,141 INFO L124 PetriNetUnfolderBase]: 1057/2057 cut-off events. [2023-11-29 00:11:21,142 INFO L125 PetriNetUnfolderBase]: For 64/64 co-relation queries the response was YES. [2023-11-29 00:11:21,145 INFO L83 FinitePrefix]: Finished finitePrefix Result has 3745 conditions, 2057 events. 1057/2057 cut-off events. For 64/64 co-relation queries the response was YES. Maximal size of possible extension queue 142. Compared 14218 event pairs, 571 based on Foata normal form. 5/1868 useless extension candidates. Maximal degree in co-relation 3735. Up to 1186 conditions per place. [2023-11-29 00:11:21,159 INFO L140 encePairwiseOnDemand]: 52/55 looper letters, 29 selfloop transitions, 2 changer transitions 0/54 dead transitions. [2023-11-29 00:11:21,159 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 56 places, 54 transitions, 180 flow [2023-11-29 00:11:21,160 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2023-11-29 00:11:21,160 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2023-11-29 00:11:21,161 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 119 transitions. [2023-11-29 00:11:21,161 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.7212121212121212 [2023-11-29 00:11:21,161 INFO L72 ComplementDD]: Start complementDD. Operand 3 states and 119 transitions. [2023-11-29 00:11:21,161 INFO L73 IsDeterministic]: Start isDeterministic. Operand 3 states and 119 transitions. [2023-11-29 00:11:21,162 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2023-11-29 00:11:21,162 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 3 states and 119 transitions. [2023-11-29 00:11:21,162 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 4 states, 3 states have (on average 39.666666666666664) internal successors, (119), 3 states have internal predecessors, (119), 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) [2023-11-29 00:11:21,163 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 4 states, 4 states have (on average 55.0) internal successors, (220), 4 states have internal predecessors, (220), 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) [2023-11-29 00:11:21,163 INFO L81 ComplementDD]: Finished complementDD. Result has 4 states, 4 states have (on average 55.0) internal successors, (220), 4 states have internal predecessors, (220), 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) [2023-11-29 00:11:21,164 INFO L175 Difference]: Start difference. First operand has 55 places, 46 transitions, 102 flow. Second operand 3 states and 119 transitions. [2023-11-29 00:11:21,164 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 56 places, 54 transitions, 180 flow [2023-11-29 00:11:21,165 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 54 places, 54 transitions, 176 flow, removed 0 selfloop flow, removed 2 redundant places. [2023-11-29 00:11:21,166 INFO L231 Difference]: Finished difference. Result has 54 places, 45 transitions, 100 flow [2023-11-29 00:11:21,166 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=55, PETRI_DIFFERENCE_MINUEND_FLOW=96, PETRI_DIFFERENCE_MINUEND_PLACES=52, 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=3, PETRI_FLOW=100, PETRI_PLACES=54, PETRI_TRANSITIONS=45} [2023-11-29 00:11:21,167 INFO L281 CegarLoopForPetriNet]: 60 programPoint places, -6 predicate places. [2023-11-29 00:11:21,167 INFO L495 AbstractCegarLoop]: Abstraction has has 54 places, 45 transitions, 100 flow [2023-11-29 00:11:21,167 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 30.333333333333332) internal successors, (91), 3 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) [2023-11-29 00:11:21,168 INFO L200 CegarLoopForPetriNet]: Found error trace [2023-11-29 00:11:21,168 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1] [2023-11-29 00:11:21,168 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable3 [2023-11-29 00:11:21,168 INFO L420 AbstractCegarLoop]: === Iteration 5 === Targeting P0Err0ASSERT_VIOLATIONMEMORY_LEAK === [P0Err0ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 10 more)] === [2023-11-29 00:11:21,168 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-11-29 00:11:21,168 INFO L85 PathProgramCache]: Analyzing trace with hash 380278419, now seen corresponding path program 1 times [2023-11-29 00:11:21,169 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-11-29 00:11:21,169 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [331109854] [2023-11-29 00:11:21,169 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-11-29 00:11:21,169 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-11-29 00:11:21,183 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 00:11:21,258 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-11-29 00:11:21,259 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-11-29 00:11:21,259 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [331109854] [2023-11-29 00:11:21,259 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [331109854] provided 1 perfect and 0 imperfect interpolant sequences [2023-11-29 00:11:21,259 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-11-29 00:11:21,259 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [1] imperfect sequences [] total 1 [2023-11-29 00:11:21,259 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [919189393] [2023-11-29 00:11:21,260 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-11-29 00:11:21,260 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2023-11-29 00:11:21,260 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-11-29 00:11:21,261 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2023-11-29 00:11:21,261 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2023-11-29 00:11:21,261 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 30 out of 55 [2023-11-29 00:11:21,261 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 54 places, 45 transitions, 100 flow. Second operand has 3 states, 3 states have (on average 31.0) internal successors, (93), 3 states have internal predecessors, (93), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-29 00:11:21,262 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2023-11-29 00:11:21,262 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 30 of 55 [2023-11-29 00:11:21,262 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2023-11-29 00:11:21,553 INFO L124 PetriNetUnfolderBase]: 825/1544 cut-off events. [2023-11-29 00:11:21,553 INFO L125 PetriNetUnfolderBase]: For 51/51 co-relation queries the response was YES. [2023-11-29 00:11:21,555 INFO L83 FinitePrefix]: Finished finitePrefix Result has 2875 conditions, 1544 events. 825/1544 cut-off events. For 51/51 co-relation queries the response was YES. Maximal size of possible extension queue 111. Compared 10084 event pairs, 129 based on Foata normal form. 0/1518 useless extension candidates. Maximal degree in co-relation 2865. Up to 1009 conditions per place. [2023-11-29 00:11:21,564 INFO L140 encePairwiseOnDemand]: 52/55 looper letters, 33 selfloop transitions, 2 changer transitions 2/60 dead transitions. [2023-11-29 00:11:21,564 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 55 places, 60 transitions, 212 flow [2023-11-29 00:11:21,565 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2023-11-29 00:11:21,565 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2023-11-29 00:11:21,565 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 128 transitions. [2023-11-29 00:11:21,566 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.7757575757575758 [2023-11-29 00:11:21,566 INFO L72 ComplementDD]: Start complementDD. Operand 3 states and 128 transitions. [2023-11-29 00:11:21,566 INFO L73 IsDeterministic]: Start isDeterministic. Operand 3 states and 128 transitions. [2023-11-29 00:11:21,566 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2023-11-29 00:11:21,566 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 3 states and 128 transitions. [2023-11-29 00:11:21,567 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 4 states, 3 states have (on average 42.666666666666664) internal successors, (128), 3 states have internal predecessors, (128), 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) [2023-11-29 00:11:21,568 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 4 states, 4 states have (on average 55.0) internal successors, (220), 4 states have internal predecessors, (220), 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) [2023-11-29 00:11:21,568 INFO L81 ComplementDD]: Finished complementDD. Result has 4 states, 4 states have (on average 55.0) internal successors, (220), 4 states have internal predecessors, (220), 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) [2023-11-29 00:11:21,568 INFO L175 Difference]: Start difference. First operand has 54 places, 45 transitions, 100 flow. Second operand 3 states and 128 transitions. [2023-11-29 00:11:21,568 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 55 places, 60 transitions, 212 flow [2023-11-29 00:11:21,569 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 53 places, 60 transitions, 204 flow, removed 0 selfloop flow, removed 2 redundant places. [2023-11-29 00:11:21,570 INFO L231 Difference]: Finished difference. Result has 53 places, 43 transitions, 96 flow [2023-11-29 00:11:21,571 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=55, PETRI_DIFFERENCE_MINUEND_FLOW=94, PETRI_DIFFERENCE_MINUEND_PLACES=51, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=44, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=2, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=42, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=96, PETRI_PLACES=53, PETRI_TRANSITIONS=43} [2023-11-29 00:11:21,571 INFO L281 CegarLoopForPetriNet]: 60 programPoint places, -7 predicate places. [2023-11-29 00:11:21,571 INFO L495 AbstractCegarLoop]: Abstraction has has 53 places, 43 transitions, 96 flow [2023-11-29 00:11:21,572 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 31.0) internal successors, (93), 3 states have internal predecessors, (93), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-29 00:11:21,572 INFO L200 CegarLoopForPetriNet]: Found error trace [2023-11-29 00:11:21,572 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1] [2023-11-29 00:11:21,572 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable4 [2023-11-29 00:11:21,572 INFO L420 AbstractCegarLoop]: === Iteration 6 === Targeting ULTIMATE.startErr5REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [P0Err0ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 10 more)] === [2023-11-29 00:11:21,573 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-11-29 00:11:21,573 INFO L85 PathProgramCache]: Analyzing trace with hash -1274580253, now seen corresponding path program 1 times [2023-11-29 00:11:21,573 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-11-29 00:11:21,573 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [188470660] [2023-11-29 00:11:21,573 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-11-29 00:11:21,573 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-11-29 00:11:21,590 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 00:11:21,651 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-11-29 00:11:21,651 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-11-29 00:11:21,651 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [188470660] [2023-11-29 00:11:21,651 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [188470660] provided 1 perfect and 0 imperfect interpolant sequences [2023-11-29 00:11:21,652 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-11-29 00:11:21,652 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2023-11-29 00:11:21,652 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1863660204] [2023-11-29 00:11:21,652 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-11-29 00:11:21,652 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2023-11-29 00:11:21,653 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-11-29 00:11:21,653 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2023-11-29 00:11:21,653 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2023-11-29 00:11:21,666 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 29 out of 55 [2023-11-29 00:11:21,666 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 53 places, 43 transitions, 96 flow. Second operand has 3 states, 3 states have (on average 31.0) internal successors, (93), 3 states have internal predecessors, (93), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-29 00:11:21,667 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2023-11-29 00:11:21,667 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 29 of 55 [2023-11-29 00:11:21,667 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2023-11-29 00:11:21,921 INFO L124 PetriNetUnfolderBase]: 721/1434 cut-off events. [2023-11-29 00:11:21,921 INFO L125 PetriNetUnfolderBase]: For 92/92 co-relation queries the response was YES. [2023-11-29 00:11:21,924 INFO L83 FinitePrefix]: Finished finitePrefix Result has 2654 conditions, 1434 events. 721/1434 cut-off events. For 92/92 co-relation queries the response was YES. Maximal size of possible extension queue 104. Compared 9263 event pairs, 420 based on Foata normal form. 12/1399 useless extension candidates. Maximal degree in co-relation 2643. Up to 905 conditions per place. [2023-11-29 00:11:21,934 INFO L140 encePairwiseOnDemand]: 52/55 looper letters, 26 selfloop transitions, 2 changer transitions 0/50 dead transitions. [2023-11-29 00:11:21,934 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 53 places, 50 transitions, 168 flow [2023-11-29 00:11:21,935 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2023-11-29 00:11:21,935 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2023-11-29 00:11:21,935 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 116 transitions. [2023-11-29 00:11:21,935 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.703030303030303 [2023-11-29 00:11:21,936 INFO L72 ComplementDD]: Start complementDD. Operand 3 states and 116 transitions. [2023-11-29 00:11:21,936 INFO L73 IsDeterministic]: Start isDeterministic. Operand 3 states and 116 transitions. [2023-11-29 00:11:21,936 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2023-11-29 00:11:21,936 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 3 states and 116 transitions. [2023-11-29 00:11:21,937 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 4 states, 3 states have (on average 38.666666666666664) internal successors, (116), 3 states have internal predecessors, (116), 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) [2023-11-29 00:11:21,937 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 4 states, 4 states have (on average 55.0) internal successors, (220), 4 states have internal predecessors, (220), 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) [2023-11-29 00:11:21,938 INFO L81 ComplementDD]: Finished complementDD. Result has 4 states, 4 states have (on average 55.0) internal successors, (220), 4 states have internal predecessors, (220), 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) [2023-11-29 00:11:21,938 INFO L175 Difference]: Start difference. First operand has 53 places, 43 transitions, 96 flow. Second operand 3 states and 116 transitions. [2023-11-29 00:11:21,938 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 53 places, 50 transitions, 168 flow [2023-11-29 00:11:21,939 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 51 places, 50 transitions, 162 flow, removed 0 selfloop flow, removed 2 redundant places. [2023-11-29 00:11:21,940 INFO L231 Difference]: Finished difference. Result has 51 places, 42 transitions, 94 flow [2023-11-29 00:11:21,940 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=55, PETRI_DIFFERENCE_MINUEND_FLOW=90, PETRI_DIFFERENCE_MINUEND_PLACES=49, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=42, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=2, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=40, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=94, PETRI_PLACES=51, PETRI_TRANSITIONS=42} [2023-11-29 00:11:21,941 INFO L281 CegarLoopForPetriNet]: 60 programPoint places, -9 predicate places. [2023-11-29 00:11:21,941 INFO L495 AbstractCegarLoop]: Abstraction has has 51 places, 42 transitions, 94 flow [2023-11-29 00:11:21,941 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 31.0) internal successors, (93), 3 states have internal predecessors, (93), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-29 00:11:21,941 INFO L200 CegarLoopForPetriNet]: Found error trace [2023-11-29 00:11:21,941 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1] [2023-11-29 00:11:21,942 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable5 [2023-11-29 00:11:21,942 INFO L420 AbstractCegarLoop]: === Iteration 7 === Targeting ULTIMATE.startErr4REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [P0Err0ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 10 more)] === [2023-11-29 00:11:21,942 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-11-29 00:11:21,942 INFO L85 PathProgramCache]: Analyzing trace with hash -1274580254, now seen corresponding path program 1 times [2023-11-29 00:11:21,942 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-11-29 00:11:21,943 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1253562951] [2023-11-29 00:11:21,943 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-11-29 00:11:21,943 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-11-29 00:11:21,956 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 00:11:21,989 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-11-29 00:11:21,989 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-11-29 00:11:21,989 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1253562951] [2023-11-29 00:11:21,989 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1253562951] provided 1 perfect and 0 imperfect interpolant sequences [2023-11-29 00:11:21,989 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-11-29 00:11:21,990 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2023-11-29 00:11:21,990 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [258280614] [2023-11-29 00:11:21,990 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-11-29 00:11:21,990 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2023-11-29 00:11:21,990 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-11-29 00:11:21,991 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2023-11-29 00:11:21,991 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2023-11-29 00:11:22,005 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 28 out of 55 [2023-11-29 00:11:22,005 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 51 places, 42 transitions, 94 flow. Second operand has 3 states, 3 states have (on average 30.0) internal successors, (90), 3 states have internal predecessors, (90), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-29 00:11:22,005 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2023-11-29 00:11:22,005 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 28 of 55 [2023-11-29 00:11:22,005 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2023-11-29 00:11:22,262 INFO L124 PetriNetUnfolderBase]: 738/1467 cut-off events. [2023-11-29 00:11:22,262 INFO L125 PetriNetUnfolderBase]: For 56/56 co-relation queries the response was YES. [2023-11-29 00:11:22,265 INFO L83 FinitePrefix]: Finished finitePrefix Result has 2683 conditions, 1467 events. 738/1467 cut-off events. For 56/56 co-relation queries the response was YES. Maximal size of possible extension queue 104. Compared 9554 event pairs, 260 based on Foata normal form. 0/1420 useless extension candidates. Maximal degree in co-relation 2673. Up to 934 conditions per place. [2023-11-29 00:11:22,274 INFO L140 encePairwiseOnDemand]: 52/55 looper letters, 27 selfloop transitions, 2 changer transitions 0/49 dead transitions. [2023-11-29 00:11:22,274 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 52 places, 49 transitions, 166 flow [2023-11-29 00:11:22,274 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2023-11-29 00:11:22,274 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2023-11-29 00:11:22,275 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 114 transitions. [2023-11-29 00:11:22,275 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.6909090909090909 [2023-11-29 00:11:22,275 INFO L72 ComplementDD]: Start complementDD. Operand 3 states and 114 transitions. [2023-11-29 00:11:22,275 INFO L73 IsDeterministic]: Start isDeterministic. Operand 3 states and 114 transitions. [2023-11-29 00:11:22,276 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2023-11-29 00:11:22,276 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 3 states and 114 transitions. [2023-11-29 00:11:22,276 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 4 states, 3 states have (on average 38.0) internal successors, (114), 3 states have internal predecessors, (114), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-29 00:11:22,277 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 4 states, 4 states have (on average 55.0) internal successors, (220), 4 states have internal predecessors, (220), 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) [2023-11-29 00:11:22,277 INFO L81 ComplementDD]: Finished complementDD. Result has 4 states, 4 states have (on average 55.0) internal successors, (220), 4 states have internal predecessors, (220), 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) [2023-11-29 00:11:22,278 INFO L175 Difference]: Start difference. First operand has 51 places, 42 transitions, 94 flow. Second operand 3 states and 114 transitions. [2023-11-29 00:11:22,278 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 52 places, 49 transitions, 166 flow [2023-11-29 00:11:22,279 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 50 places, 49 transitions, 162 flow, removed 0 selfloop flow, removed 2 redundant places. [2023-11-29 00:11:22,279 INFO L231 Difference]: Finished difference. Result has 50 places, 41 transitions, 92 flow [2023-11-29 00:11:22,280 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=55, PETRI_DIFFERENCE_MINUEND_FLOW=88, PETRI_DIFFERENCE_MINUEND_PLACES=48, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=41, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=2, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=39, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=92, PETRI_PLACES=50, PETRI_TRANSITIONS=41} [2023-11-29 00:11:22,280 INFO L281 CegarLoopForPetriNet]: 60 programPoint places, -10 predicate places. [2023-11-29 00:11:22,281 INFO L495 AbstractCegarLoop]: Abstraction has has 50 places, 41 transitions, 92 flow [2023-11-29 00:11:22,281 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 30.0) internal successors, (90), 3 states have internal predecessors, (90), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-29 00:11:22,281 INFO L200 CegarLoopForPetriNet]: Found error trace [2023-11-29 00:11:22,281 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-11-29 00:11:22,281 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable6 [2023-11-29 00:11:22,282 INFO L420 AbstractCegarLoop]: === Iteration 8 === Targeting ULTIMATE.startErr7ASSERT_VIOLATIONMEMORY_LEAK === [P0Err0ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 10 more)] === [2023-11-29 00:11:22,282 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-11-29 00:11:22,282 INFO L85 PathProgramCache]: Analyzing trace with hash -993821283, now seen corresponding path program 1 times [2023-11-29 00:11:22,282 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-11-29 00:11:22,283 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1129197729] [2023-11-29 00:11:22,283 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-11-29 00:11:22,283 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-11-29 00:11:22,318 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 00:11:22,798 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-11-29 00:11:22,798 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-11-29 00:11:22,798 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1129197729] [2023-11-29 00:11:22,798 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1129197729] provided 1 perfect and 0 imperfect interpolant sequences [2023-11-29 00:11:22,798 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-11-29 00:11:22,799 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2023-11-29 00:11:22,799 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1825116930] [2023-11-29 00:11:22,799 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-11-29 00:11:22,799 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 9 states [2023-11-29 00:11:22,800 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-11-29 00:11:22,800 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2023-11-29 00:11:22,800 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=17, Invalid=55, Unknown=0, NotChecked=0, Total=72 [2023-11-29 00:11:23,001 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 26 out of 55 [2023-11-29 00:11:23,002 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 50 places, 41 transitions, 92 flow. Second operand has 9 states, 9 states have (on average 27.666666666666668) internal successors, (249), 9 states have internal predecessors, (249), 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) [2023-11-29 00:11:23,002 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2023-11-29 00:11:23,002 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 26 of 55 [2023-11-29 00:11:23,002 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2023-11-29 00:11:23,420 INFO L124 PetriNetUnfolderBase]: 915/1576 cut-off events. [2023-11-29 00:11:23,420 INFO L125 PetriNetUnfolderBase]: For 68/68 co-relation queries the response was YES. [2023-11-29 00:11:23,422 INFO L83 FinitePrefix]: Finished finitePrefix Result has 3058 conditions, 1576 events. 915/1576 cut-off events. For 68/68 co-relation queries the response was YES. Maximal size of possible extension queue 110. Compared 9148 event pairs, 12 based on Foata normal form. 60/1618 useless extension candidates. Maximal degree in co-relation 3047. Up to 936 conditions per place. [2023-11-29 00:11:23,440 INFO L140 encePairwiseOnDemand]: 49/55 looper letters, 36 selfloop transitions, 4 changer transitions 11/68 dead transitions. [2023-11-29 00:11:23,440 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 55 places, 68 transitions, 250 flow [2023-11-29 00:11:23,441 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2023-11-29 00:11:23,441 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 7 states. [2023-11-29 00:11:23,442 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 7 states to 7 states and 234 transitions. [2023-11-29 00:11:23,442 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.6077922077922078 [2023-11-29 00:11:23,442 INFO L72 ComplementDD]: Start complementDD. Operand 7 states and 234 transitions. [2023-11-29 00:11:23,442 INFO L73 IsDeterministic]: Start isDeterministic. Operand 7 states and 234 transitions. [2023-11-29 00:11:23,443 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2023-11-29 00:11:23,443 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 7 states and 234 transitions. [2023-11-29 00:11:23,444 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 8 states, 7 states have (on average 33.42857142857143) internal successors, (234), 7 states have internal predecessors, (234), 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) [2023-11-29 00:11:23,445 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 8 states, 8 states have (on average 55.0) internal successors, (440), 8 states have internal predecessors, (440), 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) [2023-11-29 00:11:23,445 INFO L81 ComplementDD]: Finished complementDD. Result has 8 states, 8 states have (on average 55.0) internal successors, (440), 8 states have internal predecessors, (440), 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) [2023-11-29 00:11:23,445 INFO L175 Difference]: Start difference. First operand has 50 places, 41 transitions, 92 flow. Second operand 7 states and 234 transitions. [2023-11-29 00:11:23,445 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 55 places, 68 transitions, 250 flow [2023-11-29 00:11:23,446 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 53 places, 68 transitions, 244 flow, removed 0 selfloop flow, removed 2 redundant places. [2023-11-29 00:11:23,447 INFO L231 Difference]: Finished difference. Result has 53 places, 39 transitions, 92 flow [2023-11-29 00:11:23,448 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=55, PETRI_DIFFERENCE_MINUEND_FLOW=86, PETRI_DIFFERENCE_MINUEND_PLACES=47, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=40, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=4, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=36, PETRI_DIFFERENCE_SUBTRAHEND_STATES=7, PETRI_FLOW=92, PETRI_PLACES=53, PETRI_TRANSITIONS=39} [2023-11-29 00:11:23,448 INFO L281 CegarLoopForPetriNet]: 60 programPoint places, -7 predicate places. [2023-11-29 00:11:23,449 INFO L495 AbstractCegarLoop]: Abstraction has has 53 places, 39 transitions, 92 flow [2023-11-29 00:11:23,449 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 9 states, 9 states have (on average 27.666666666666668) internal successors, (249), 9 states have internal predecessors, (249), 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) [2023-11-29 00:11:23,449 INFO L200 CegarLoopForPetriNet]: Found error trace [2023-11-29 00:11:23,449 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-11-29 00:11:23,449 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable7 [2023-11-29 00:11:23,450 INFO L420 AbstractCegarLoop]: === Iteration 9 === Targeting ULTIMATE.startErr6ASSERT_VIOLATIONMEMORY_LEAK === [P0Err0ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 10 more)] === [2023-11-29 00:11:23,450 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-11-29 00:11:23,450 INFO L85 PathProgramCache]: Analyzing trace with hash -993819934, now seen corresponding path program 1 times [2023-11-29 00:11:23,450 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-11-29 00:11:23,450 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [661025240] [2023-11-29 00:11:23,451 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-11-29 00:11:23,451 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-11-29 00:11:23,471 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 00:11:23,620 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-11-29 00:11:23,620 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-11-29 00:11:23,620 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [661025240] [2023-11-29 00:11:23,620 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [661025240] provided 1 perfect and 0 imperfect interpolant sequences [2023-11-29 00:11:23,620 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-11-29 00:11:23,621 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2023-11-29 00:11:23,621 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [490238523] [2023-11-29 00:11:23,621 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-11-29 00:11:23,621 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2023-11-29 00:11:23,621 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-11-29 00:11:23,622 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2023-11-29 00:11:23,622 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2023-11-29 00:11:23,630 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 27 out of 55 [2023-11-29 00:11:23,630 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 53 places, 39 transitions, 92 flow. Second operand has 5 states, 5 states have (on average 29.4) internal successors, (147), 5 states have internal predecessors, (147), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-29 00:11:23,630 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2023-11-29 00:11:23,630 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 27 of 55 [2023-11-29 00:11:23,630 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2023-11-29 00:11:24,135 INFO L124 PetriNetUnfolderBase]: 1280/2189 cut-off events. [2023-11-29 00:11:24,135 INFO L125 PetriNetUnfolderBase]: For 95/95 co-relation queries the response was YES. [2023-11-29 00:11:24,139 INFO L83 FinitePrefix]: Finished finitePrefix Result has 4252 conditions, 2189 events. 1280/2189 cut-off events. For 95/95 co-relation queries the response was YES. Maximal size of possible extension queue 160. Compared 13621 event pairs, 205 based on Foata normal form. 0/2114 useless extension candidates. Maximal degree in co-relation 4241. Up to 1065 conditions per place. [2023-11-29 00:11:24,146 INFO L140 encePairwiseOnDemand]: 49/55 looper letters, 27 selfloop transitions, 2 changer transitions 42/88 dead transitions. [2023-11-29 00:11:24,146 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 58 places, 88 transitions, 336 flow [2023-11-29 00:11:24,146 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2023-11-29 00:11:24,147 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 8 states. [2023-11-29 00:11:24,148 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 8 states to 8 states and 289 transitions. [2023-11-29 00:11:24,148 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.6568181818181819 [2023-11-29 00:11:24,148 INFO L72 ComplementDD]: Start complementDD. Operand 8 states and 289 transitions. [2023-11-29 00:11:24,148 INFO L73 IsDeterministic]: Start isDeterministic. Operand 8 states and 289 transitions. [2023-11-29 00:11:24,148 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2023-11-29 00:11:24,149 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 8 states and 289 transitions. [2023-11-29 00:11:24,150 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 9 states, 8 states have (on average 36.125) internal successors, (289), 8 states have internal predecessors, (289), 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) [2023-11-29 00:11:24,151 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 9 states, 9 states have (on average 55.0) internal successors, (495), 9 states have internal predecessors, (495), 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) [2023-11-29 00:11:24,151 INFO L81 ComplementDD]: Finished complementDD. Result has 9 states, 9 states have (on average 55.0) internal successors, (495), 9 states have internal predecessors, (495), 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) [2023-11-29 00:11:24,151 INFO L175 Difference]: Start difference. First operand has 53 places, 39 transitions, 92 flow. Second operand 8 states and 289 transitions. [2023-11-29 00:11:24,151 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 58 places, 88 transitions, 336 flow [2023-11-29 00:11:24,152 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 54 places, 88 transitions, 327 flow, removed 0 selfloop flow, removed 4 redundant places. [2023-11-29 00:11:24,153 INFO L231 Difference]: Finished difference. Result has 59 places, 38 transitions, 99 flow [2023-11-29 00:11:24,154 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=55, PETRI_DIFFERENCE_MINUEND_FLOW=85, PETRI_DIFFERENCE_MINUEND_PLACES=47, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=39, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=2, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=37, PETRI_DIFFERENCE_SUBTRAHEND_STATES=8, PETRI_FLOW=99, PETRI_PLACES=59, PETRI_TRANSITIONS=38} [2023-11-29 00:11:24,154 INFO L281 CegarLoopForPetriNet]: 60 programPoint places, -1 predicate places. [2023-11-29 00:11:24,155 INFO L495 AbstractCegarLoop]: Abstraction has has 59 places, 38 transitions, 99 flow [2023-11-29 00:11:24,155 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 29.4) internal successors, (147), 5 states have internal predecessors, (147), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-29 00:11:24,155 INFO L200 CegarLoopForPetriNet]: Found error trace [2023-11-29 00:11:24,155 INFO L208 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] [2023-11-29 00:11:24,155 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable8 [2023-11-29 00:11:24,156 INFO L420 AbstractCegarLoop]: === Iteration 10 === Targeting ULTIMATE.startErr6ASSERT_VIOLATIONMEMORY_LEAK === [P0Err0ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 10 more)] === [2023-11-29 00:11:24,156 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-11-29 00:11:24,156 INFO L85 PathProgramCache]: Analyzing trace with hash 1410206752, now seen corresponding path program 1 times [2023-11-29 00:11:24,156 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-11-29 00:11:24,156 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1939447933] [2023-11-29 00:11:24,156 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-11-29 00:11:24,157 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-11-29 00:11:24,182 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 00:11:24,291 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-11-29 00:11:24,291 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-11-29 00:11:24,291 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1939447933] [2023-11-29 00:11:24,291 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1939447933] provided 1 perfect and 0 imperfect interpolant sequences [2023-11-29 00:11:24,292 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-11-29 00:11:24,292 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2023-11-29 00:11:24,292 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [14879543] [2023-11-29 00:11:24,292 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-11-29 00:11:24,293 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2023-11-29 00:11:24,293 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-11-29 00:11:24,293 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2023-11-29 00:11:24,294 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2023-11-29 00:11:24,304 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 26 out of 55 [2023-11-29 00:11:24,305 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 59 places, 38 transitions, 99 flow. Second operand has 4 states, 4 states have (on average 29.0) internal successors, (116), 4 states have internal predecessors, (116), 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) [2023-11-29 00:11:24,305 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2023-11-29 00:11:24,305 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 26 of 55 [2023-11-29 00:11:24,305 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2023-11-29 00:11:24,751 INFO L124 PetriNetUnfolderBase]: 1499/2551 cut-off events. [2023-11-29 00:11:24,752 INFO L125 PetriNetUnfolderBase]: For 328/328 co-relation queries the response was YES. [2023-11-29 00:11:24,757 INFO L83 FinitePrefix]: Finished finitePrefix Result has 5300 conditions, 2551 events. 1499/2551 cut-off events. For 328/328 co-relation queries the response was YES. Maximal size of possible extension queue 160. Compared 15413 event pairs, 188 based on Foata normal form. 100/2591 useless extension candidates. Maximal degree in co-relation 5284. Up to 1316 conditions per place. [2023-11-29 00:11:24,767 INFO L140 encePairwiseOnDemand]: 49/55 looper letters, 42 selfloop transitions, 5 changer transitions 1/63 dead transitions. [2023-11-29 00:11:24,767 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 56 places, 63 transitions, 249 flow [2023-11-29 00:11:24,768 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2023-11-29 00:11:24,768 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 4 states. [2023-11-29 00:11:24,769 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 154 transitions. [2023-11-29 00:11:24,769 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.7 [2023-11-29 00:11:24,769 INFO L72 ComplementDD]: Start complementDD. Operand 4 states and 154 transitions. [2023-11-29 00:11:24,769 INFO L73 IsDeterministic]: Start isDeterministic. Operand 4 states and 154 transitions. [2023-11-29 00:11:24,769 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2023-11-29 00:11:24,769 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 4 states and 154 transitions. [2023-11-29 00:11:24,770 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 5 states, 4 states have (on average 38.5) internal successors, (154), 4 states have internal predecessors, (154), 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) [2023-11-29 00:11:24,771 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 5 states, 5 states have (on average 55.0) internal successors, (275), 5 states have internal predecessors, (275), 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) [2023-11-29 00:11:24,771 INFO L81 ComplementDD]: Finished complementDD. Result has 5 states, 5 states have (on average 55.0) internal successors, (275), 5 states have internal predecessors, (275), 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) [2023-11-29 00:11:24,771 INFO L175 Difference]: Start difference. First operand has 59 places, 38 transitions, 99 flow. Second operand 4 states and 154 transitions. [2023-11-29 00:11:24,771 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 56 places, 63 transitions, 249 flow [2023-11-29 00:11:24,788 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 50 places, 63 transitions, 237 flow, removed 4 selfloop flow, removed 6 redundant places. [2023-11-29 00:11:24,790 INFO L231 Difference]: Finished difference. Result has 52 places, 41 transitions, 121 flow [2023-11-29 00:11:24,790 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=55, PETRI_DIFFERENCE_MINUEND_FLOW=87, PETRI_DIFFERENCE_MINUEND_PLACES=47, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=38, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=2, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=33, PETRI_DIFFERENCE_SUBTRAHEND_STATES=4, PETRI_FLOW=121, PETRI_PLACES=52, PETRI_TRANSITIONS=41} [2023-11-29 00:11:24,791 INFO L281 CegarLoopForPetriNet]: 60 programPoint places, -8 predicate places. [2023-11-29 00:11:24,791 INFO L495 AbstractCegarLoop]: Abstraction has has 52 places, 41 transitions, 121 flow [2023-11-29 00:11:24,791 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 29.0) internal successors, (116), 4 states have internal predecessors, (116), 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) [2023-11-29 00:11:24,791 INFO L200 CegarLoopForPetriNet]: Found error trace [2023-11-29 00:11:24,791 INFO L208 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] [2023-11-29 00:11:24,792 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable9 [2023-11-29 00:11:24,792 INFO L420 AbstractCegarLoop]: === Iteration 11 === Targeting ULTIMATE.startErr6ASSERT_VIOLATIONMEMORY_LEAK === [P0Err0ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 10 more)] === [2023-11-29 00:11:24,792 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-11-29 00:11:24,792 INFO L85 PathProgramCache]: Analyzing trace with hash 1394742957, now seen corresponding path program 1 times [2023-11-29 00:11:24,792 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-11-29 00:11:24,793 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1061728192] [2023-11-29 00:11:24,793 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-11-29 00:11:24,793 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-11-29 00:11:24,840 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 00:11:24,994 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-11-29 00:11:24,994 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-11-29 00:11:24,994 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1061728192] [2023-11-29 00:11:24,995 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1061728192] provided 1 perfect and 0 imperfect interpolant sequences [2023-11-29 00:11:24,995 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-11-29 00:11:24,995 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2023-11-29 00:11:24,995 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1406415935] [2023-11-29 00:11:24,995 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-11-29 00:11:24,996 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2023-11-29 00:11:24,996 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-11-29 00:11:24,996 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2023-11-29 00:11:24,997 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=8, Invalid=12, Unknown=0, NotChecked=0, Total=20 [2023-11-29 00:11:25,004 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 26 out of 55 [2023-11-29 00:11:25,004 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 52 places, 41 transitions, 121 flow. Second operand has 5 states, 5 states have (on average 29.0) internal successors, (145), 5 states have internal predecessors, (145), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-29 00:11:25,005 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2023-11-29 00:11:25,005 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 26 of 55 [2023-11-29 00:11:25,005 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2023-11-29 00:11:25,321 INFO L124 PetriNetUnfolderBase]: 962/1660 cut-off events. [2023-11-29 00:11:25,321 INFO L125 PetriNetUnfolderBase]: For 423/423 co-relation queries the response was YES. [2023-11-29 00:11:25,325 INFO L83 FinitePrefix]: Finished finitePrefix Result has 3818 conditions, 1660 events. 962/1660 cut-off events. For 423/423 co-relation queries the response was YES. Maximal size of possible extension queue 89. Compared 8880 event pairs, 100 based on Foata normal form. 82/1695 useless extension candidates. Maximal degree in co-relation 3804. Up to 581 conditions per place. [2023-11-29 00:11:25,331 INFO L140 encePairwiseOnDemand]: 49/55 looper letters, 53 selfloop transitions, 8 changer transitions 1/77 dead transitions. [2023-11-29 00:11:25,332 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 56 places, 77 transitions, 338 flow [2023-11-29 00:11:25,332 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2023-11-29 00:11:25,332 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 5 states. [2023-11-29 00:11:25,333 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 194 transitions. [2023-11-29 00:11:25,333 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.7054545454545454 [2023-11-29 00:11:25,333 INFO L72 ComplementDD]: Start complementDD. Operand 5 states and 194 transitions. [2023-11-29 00:11:25,333 INFO L73 IsDeterministic]: Start isDeterministic. Operand 5 states and 194 transitions. [2023-11-29 00:11:25,334 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2023-11-29 00:11:25,334 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 5 states and 194 transitions. [2023-11-29 00:11:25,334 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 6 states, 5 states have (on average 38.8) internal successors, (194), 5 states have internal predecessors, (194), 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) [2023-11-29 00:11:25,335 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 6 states, 6 states have (on average 55.0) internal successors, (330), 6 states have internal predecessors, (330), 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) [2023-11-29 00:11:25,336 INFO L81 ComplementDD]: Finished complementDD. Result has 6 states, 6 states have (on average 55.0) internal successors, (330), 6 states have internal predecessors, (330), 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) [2023-11-29 00:11:25,336 INFO L175 Difference]: Start difference. First operand has 52 places, 41 transitions, 121 flow. Second operand 5 states and 194 transitions. [2023-11-29 00:11:25,336 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 56 places, 77 transitions, 338 flow [2023-11-29 00:11:25,337 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 54 places, 77 transitions, 328 flow, removed 1 selfloop flow, removed 2 redundant places. [2023-11-29 00:11:25,339 INFO L231 Difference]: Finished difference. Result has 56 places, 44 transitions, 161 flow [2023-11-29 00:11:25,339 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=55, PETRI_DIFFERENCE_MINUEND_FLOW=113, PETRI_DIFFERENCE_MINUEND_PLACES=50, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=41, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=5, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=33, PETRI_DIFFERENCE_SUBTRAHEND_STATES=5, PETRI_FLOW=161, PETRI_PLACES=56, PETRI_TRANSITIONS=44} [2023-11-29 00:11:25,340 INFO L281 CegarLoopForPetriNet]: 60 programPoint places, -4 predicate places. [2023-11-29 00:11:25,340 INFO L495 AbstractCegarLoop]: Abstraction has has 56 places, 44 transitions, 161 flow [2023-11-29 00:11:25,340 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 29.0) internal successors, (145), 5 states have internal predecessors, (145), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-29 00:11:25,340 INFO L200 CegarLoopForPetriNet]: Found error trace [2023-11-29 00:11:25,340 INFO L208 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] [2023-11-29 00:11:25,340 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable10 [2023-11-29 00:11:25,340 INFO L420 AbstractCegarLoop]: === Iteration 12 === Targeting ULTIMATE.startErr6ASSERT_VIOLATIONMEMORY_LEAK === [P0Err0ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 10 more)] === [2023-11-29 00:11:25,341 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-11-29 00:11:25,341 INFO L85 PathProgramCache]: Analyzing trace with hash -2058915726, now seen corresponding path program 1 times [2023-11-29 00:11:25,341 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-11-29 00:11:25,341 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1410149130] [2023-11-29 00:11:25,341 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-11-29 00:11:25,341 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-11-29 00:11:25,379 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 00:11:25,917 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-11-29 00:11:25,917 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-11-29 00:11:25,917 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1410149130] [2023-11-29 00:11:25,918 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1410149130] provided 1 perfect and 0 imperfect interpolant sequences [2023-11-29 00:11:25,918 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-11-29 00:11:25,918 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2023-11-29 00:11:25,918 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [769884408] [2023-11-29 00:11:25,918 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-11-29 00:11:25,919 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2023-11-29 00:11:25,919 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-11-29 00:11:25,919 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2023-11-29 00:11:25,919 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=11, Invalid=31, Unknown=0, NotChecked=0, Total=42 [2023-11-29 00:11:25,927 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 28 out of 55 [2023-11-29 00:11:25,927 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 56 places, 44 transitions, 161 flow. Second operand has 7 states, 7 states have (on average 30.285714285714285) internal successors, (212), 7 states have internal predecessors, (212), 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) [2023-11-29 00:11:25,927 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2023-11-29 00:11:25,927 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 28 of 55 [2023-11-29 00:11:25,927 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2023-11-29 00:11:26,489 INFO L124 PetriNetUnfolderBase]: 1163/2197 cut-off events. [2023-11-29 00:11:26,489 INFO L125 PetriNetUnfolderBase]: For 908/1024 co-relation queries the response was YES. [2023-11-29 00:11:26,496 INFO L83 FinitePrefix]: Finished finitePrefix Result has 5069 conditions, 2197 events. 1163/2197 cut-off events. For 908/1024 co-relation queries the response was YES. Maximal size of possible extension queue 140. Compared 14072 event pairs, 375 based on Foata normal form. 43/2138 useless extension candidates. Maximal degree in co-relation 5053. Up to 883 conditions per place. [2023-11-29 00:11:26,505 INFO L140 encePairwiseOnDemand]: 46/55 looper letters, 50 selfloop transitions, 12 changer transitions 17/103 dead transitions. [2023-11-29 00:11:26,505 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 63 places, 103 transitions, 475 flow [2023-11-29 00:11:26,505 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2023-11-29 00:11:26,506 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 8 states. [2023-11-29 00:11:26,507 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 8 states to 8 states and 304 transitions. [2023-11-29 00:11:26,507 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.6909090909090909 [2023-11-29 00:11:26,507 INFO L72 ComplementDD]: Start complementDD. Operand 8 states and 304 transitions. [2023-11-29 00:11:26,507 INFO L73 IsDeterministic]: Start isDeterministic. Operand 8 states and 304 transitions. [2023-11-29 00:11:26,508 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2023-11-29 00:11:26,508 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 8 states and 304 transitions. [2023-11-29 00:11:26,509 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 9 states, 8 states have (on average 38.0) internal successors, (304), 8 states have internal predecessors, (304), 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) [2023-11-29 00:11:26,510 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 9 states, 9 states have (on average 55.0) internal successors, (495), 9 states have internal predecessors, (495), 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) [2023-11-29 00:11:26,511 INFO L81 ComplementDD]: Finished complementDD. Result has 9 states, 9 states have (on average 55.0) internal successors, (495), 9 states have internal predecessors, (495), 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) [2023-11-29 00:11:26,511 INFO L175 Difference]: Start difference. First operand has 56 places, 44 transitions, 161 flow. Second operand 8 states and 304 transitions. [2023-11-29 00:11:26,511 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 63 places, 103 transitions, 475 flow [2023-11-29 00:11:26,516 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 59 places, 103 transitions, 445 flow, removed 8 selfloop flow, removed 4 redundant places. [2023-11-29 00:11:26,517 INFO L231 Difference]: Finished difference. Result has 63 places, 57 transitions, 217 flow [2023-11-29 00:11:26,518 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=55, PETRI_DIFFERENCE_MINUEND_FLOW=139, PETRI_DIFFERENCE_MINUEND_PLACES=52, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=44, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=5, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=38, PETRI_DIFFERENCE_SUBTRAHEND_STATES=8, PETRI_FLOW=217, PETRI_PLACES=63, PETRI_TRANSITIONS=57} [2023-11-29 00:11:26,518 INFO L281 CegarLoopForPetriNet]: 60 programPoint places, 3 predicate places. [2023-11-29 00:11:26,519 INFO L495 AbstractCegarLoop]: Abstraction has has 63 places, 57 transitions, 217 flow [2023-11-29 00:11:26,519 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 7 states, 7 states have (on average 30.285714285714285) internal successors, (212), 7 states have internal predecessors, (212), 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) [2023-11-29 00:11:26,519 INFO L200 CegarLoopForPetriNet]: Found error trace [2023-11-29 00:11:26,519 INFO L208 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] [2023-11-29 00:11:26,519 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable11 [2023-11-29 00:11:26,520 INFO L420 AbstractCegarLoop]: === Iteration 13 === Targeting ULTIMATE.startErr6ASSERT_VIOLATIONMEMORY_LEAK === [P0Err0ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 10 more)] === [2023-11-29 00:11:26,520 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-11-29 00:11:26,520 INFO L85 PathProgramCache]: Analyzing trace with hash 2001260120, now seen corresponding path program 2 times [2023-11-29 00:11:26,520 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-11-29 00:11:26,520 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1087160893] [2023-11-29 00:11:26,520 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-11-29 00:11:26,520 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-11-29 00:11:26,582 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 00:11:26,761 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-11-29 00:11:26,761 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-11-29 00:11:26,761 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1087160893] [2023-11-29 00:11:26,761 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1087160893] provided 1 perfect and 0 imperfect interpolant sequences [2023-11-29 00:11:26,761 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-11-29 00:11:26,762 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2023-11-29 00:11:26,762 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1907928840] [2023-11-29 00:11:26,762 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-11-29 00:11:26,762 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2023-11-29 00:11:26,763 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-11-29 00:11:26,763 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2023-11-29 00:11:26,763 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=12, Invalid=18, Unknown=0, NotChecked=0, Total=30 [2023-11-29 00:11:26,773 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 26 out of 55 [2023-11-29 00:11:26,773 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 63 places, 57 transitions, 217 flow. Second operand has 6 states, 6 states have (on average 29.0) internal successors, (174), 6 states have internal predecessors, (174), 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) [2023-11-29 00:11:26,773 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2023-11-29 00:11:26,774 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 26 of 55 [2023-11-29 00:11:26,774 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2023-11-29 00:11:27,101 INFO L124 PetriNetUnfolderBase]: 1234/2041 cut-off events. [2023-11-29 00:11:27,101 INFO L125 PetriNetUnfolderBase]: For 1446/1446 co-relation queries the response was YES. [2023-11-29 00:11:27,105 INFO L83 FinitePrefix]: Finished finitePrefix Result has 5567 conditions, 2041 events. 1234/2041 cut-off events. For 1446/1446 co-relation queries the response was YES. Maximal size of possible extension queue 123. Compared 10617 event pairs, 124 based on Foata normal form. 108/2101 useless extension candidates. Maximal degree in co-relation 5549. Up to 780 conditions per place. [2023-11-29 00:11:27,110 INFO L140 encePairwiseOnDemand]: 49/55 looper letters, 62 selfloop transitions, 11 changer transitions 15/103 dead transitions. [2023-11-29 00:11:27,110 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 66 places, 103 transitions, 555 flow [2023-11-29 00:11:27,110 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2023-11-29 00:11:27,111 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 6 states. [2023-11-29 00:11:27,111 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6 states to 6 states and 216 transitions. [2023-11-29 00:11:27,112 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.6545454545454545 [2023-11-29 00:11:27,112 INFO L72 ComplementDD]: Start complementDD. Operand 6 states and 216 transitions. [2023-11-29 00:11:27,112 INFO L73 IsDeterministic]: Start isDeterministic. Operand 6 states and 216 transitions. [2023-11-29 00:11:27,112 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2023-11-29 00:11:27,112 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 6 states and 216 transitions. [2023-11-29 00:11:27,113 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 7 states, 6 states have (on average 36.0) internal successors, (216), 6 states have internal predecessors, (216), 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) [2023-11-29 00:11:27,114 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 7 states, 7 states have (on average 55.0) internal successors, (385), 7 states have internal predecessors, (385), 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) [2023-11-29 00:11:27,115 INFO L81 ComplementDD]: Finished complementDD. Result has 7 states, 7 states have (on average 55.0) internal successors, (385), 7 states have internal predecessors, (385), 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) [2023-11-29 00:11:27,115 INFO L175 Difference]: Start difference. First operand has 63 places, 57 transitions, 217 flow. Second operand 6 states and 216 transitions. [2023-11-29 00:11:27,115 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 66 places, 103 transitions, 555 flow [2023-11-29 00:11:27,117 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 62 places, 103 transitions, 540 flow, removed 4 selfloop flow, removed 4 redundant places. [2023-11-29 00:11:27,118 INFO L231 Difference]: Finished difference. Result has 64 places, 51 transitions, 216 flow [2023-11-29 00:11:27,118 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=55, PETRI_DIFFERENCE_MINUEND_FLOW=200, PETRI_DIFFERENCE_MINUEND_PLACES=57, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=56, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=11, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=45, PETRI_DIFFERENCE_SUBTRAHEND_STATES=6, PETRI_FLOW=216, PETRI_PLACES=64, PETRI_TRANSITIONS=51} [2023-11-29 00:11:27,119 INFO L281 CegarLoopForPetriNet]: 60 programPoint places, 4 predicate places. [2023-11-29 00:11:27,119 INFO L495 AbstractCegarLoop]: Abstraction has has 64 places, 51 transitions, 216 flow [2023-11-29 00:11:27,120 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 29.0) internal successors, (174), 6 states have internal predecessors, (174), 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) [2023-11-29 00:11:27,120 INFO L200 CegarLoopForPetriNet]: Found error trace [2023-11-29 00:11:27,120 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-11-29 00:11:27,120 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable12 [2023-11-29 00:11:27,120 INFO L420 AbstractCegarLoop]: === Iteration 14 === Targeting ULTIMATE.startErr6ASSERT_VIOLATIONMEMORY_LEAK === [P0Err0ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 10 more)] === [2023-11-29 00:11:27,121 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-11-29 00:11:27,121 INFO L85 PathProgramCache]: Analyzing trace with hash 1740899106, now seen corresponding path program 1 times [2023-11-29 00:11:27,121 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-11-29 00:11:27,121 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [663659599] [2023-11-29 00:11:27,121 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-11-29 00:11:27,122 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-11-29 00:11:27,150 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 00:11:27,399 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-11-29 00:11:27,400 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-11-29 00:11:27,400 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [663659599] [2023-11-29 00:11:27,400 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [663659599] provided 1 perfect and 0 imperfect interpolant sequences [2023-11-29 00:11:27,400 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-11-29 00:11:27,400 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2023-11-29 00:11:27,400 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [592716066] [2023-11-29 00:11:27,400 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-11-29 00:11:27,401 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2023-11-29 00:11:27,401 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-11-29 00:11:27,401 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2023-11-29 00:11:27,402 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2023-11-29 00:11:27,421 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 24 out of 55 [2023-11-29 00:11:27,422 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 64 places, 51 transitions, 216 flow. Second operand has 6 states, 6 states have (on average 27.5) internal successors, (165), 6 states have internal predecessors, (165), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-29 00:11:27,422 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2023-11-29 00:11:27,422 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 24 of 55 [2023-11-29 00:11:27,422 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2023-11-29 00:11:27,864 INFO L124 PetriNetUnfolderBase]: 1504/2606 cut-off events. [2023-11-29 00:11:27,864 INFO L125 PetriNetUnfolderBase]: For 1571/1601 co-relation queries the response was YES. [2023-11-29 00:11:27,869 INFO L83 FinitePrefix]: Finished finitePrefix Result has 7017 conditions, 2606 events. 1504/2606 cut-off events. For 1571/1601 co-relation queries the response was YES. Maximal size of possible extension queue 167. Compared 15367 event pairs, 279 based on Foata normal form. 8/2522 useless extension candidates. Maximal degree in co-relation 6999. Up to 1180 conditions per place. [2023-11-29 00:11:27,876 INFO L140 encePairwiseOnDemand]: 46/55 looper letters, 63 selfloop transitions, 10 changer transitions 12/105 dead transitions. [2023-11-29 00:11:27,876 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 68 places, 105 transitions, 565 flow [2023-11-29 00:11:27,876 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2023-11-29 00:11:27,876 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 7 states. [2023-11-29 00:11:27,877 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 7 states to 7 states and 237 transitions. [2023-11-29 00:11:27,878 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.6155844155844156 [2023-11-29 00:11:27,878 INFO L72 ComplementDD]: Start complementDD. Operand 7 states and 237 transitions. [2023-11-29 00:11:27,878 INFO L73 IsDeterministic]: Start isDeterministic. Operand 7 states and 237 transitions. [2023-11-29 00:11:27,878 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2023-11-29 00:11:27,878 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 7 states and 237 transitions. [2023-11-29 00:11:27,879 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 8 states, 7 states have (on average 33.857142857142854) internal successors, (237), 7 states have internal predecessors, (237), 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) [2023-11-29 00:11:27,881 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 8 states, 8 states have (on average 55.0) internal successors, (440), 8 states have internal predecessors, (440), 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) [2023-11-29 00:11:27,881 INFO L81 ComplementDD]: Finished complementDD. Result has 8 states, 8 states have (on average 55.0) internal successors, (440), 8 states have internal predecessors, (440), 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) [2023-11-29 00:11:27,881 INFO L175 Difference]: Start difference. First operand has 64 places, 51 transitions, 216 flow. Second operand 7 states and 237 transitions. [2023-11-29 00:11:27,881 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 68 places, 105 transitions, 565 flow [2023-11-29 00:11:27,894 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 60 places, 105 transitions, 501 flow, removed 14 selfloop flow, removed 8 redundant places. [2023-11-29 00:11:27,895 INFO L231 Difference]: Finished difference. Result has 65 places, 58 transitions, 235 flow [2023-11-29 00:11:27,896 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=55, PETRI_DIFFERENCE_MINUEND_FLOW=160, PETRI_DIFFERENCE_MINUEND_PLACES=54, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=51, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=2, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=44, PETRI_DIFFERENCE_SUBTRAHEND_STATES=7, PETRI_FLOW=235, PETRI_PLACES=65, PETRI_TRANSITIONS=58} [2023-11-29 00:11:27,896 INFO L281 CegarLoopForPetriNet]: 60 programPoint places, 5 predicate places. [2023-11-29 00:11:27,896 INFO L495 AbstractCegarLoop]: Abstraction has has 65 places, 58 transitions, 235 flow [2023-11-29 00:11:27,897 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 27.5) internal successors, (165), 6 states have internal predecessors, (165), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-29 00:11:27,897 INFO L200 CegarLoopForPetriNet]: Found error trace [2023-11-29 00:11:27,897 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-11-29 00:11:27,897 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable13 [2023-11-29 00:11:27,897 INFO L420 AbstractCegarLoop]: === Iteration 15 === Targeting ULTIMATE.startErr6ASSERT_VIOLATIONMEMORY_LEAK === [P0Err0ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 10 more)] === [2023-11-29 00:11:27,897 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-11-29 00:11:27,898 INFO L85 PathProgramCache]: Analyzing trace with hash -623137056, now seen corresponding path program 2 times [2023-11-29 00:11:27,898 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-11-29 00:11:27,898 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1275175915] [2023-11-29 00:11:27,898 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-11-29 00:11:27,898 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-11-29 00:11:27,927 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 00:11:28,125 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-11-29 00:11:28,126 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-11-29 00:11:28,126 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1275175915] [2023-11-29 00:11:28,126 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1275175915] provided 1 perfect and 0 imperfect interpolant sequences [2023-11-29 00:11:28,126 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-11-29 00:11:28,126 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2023-11-29 00:11:28,126 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [509013751] [2023-11-29 00:11:28,126 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-11-29 00:11:28,127 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2023-11-29 00:11:28,127 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-11-29 00:11:28,127 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2023-11-29 00:11:28,127 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=12, Invalid=30, Unknown=0, NotChecked=0, Total=42 [2023-11-29 00:11:28,143 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 24 out of 55 [2023-11-29 00:11:28,143 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 65 places, 58 transitions, 235 flow. Second operand has 7 states, 7 states have (on average 27.0) internal successors, (189), 7 states have internal predecessors, (189), 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) [2023-11-29 00:11:28,143 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2023-11-29 00:11:28,143 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 24 of 55 [2023-11-29 00:11:28,143 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2023-11-29 00:11:28,668 INFO L124 PetriNetUnfolderBase]: 2393/4258 cut-off events. [2023-11-29 00:11:28,668 INFO L125 PetriNetUnfolderBase]: For 1889/1901 co-relation queries the response was YES. [2023-11-29 00:11:28,677 INFO L83 FinitePrefix]: Finished finitePrefix Result has 11110 conditions, 4258 events. 2393/4258 cut-off events. For 1889/1901 co-relation queries the response was YES. Maximal size of possible extension queue 294. Compared 28673 event pairs, 579 based on Foata normal form. 20/4132 useless extension candidates. Maximal degree in co-relation 11091. Up to 1690 conditions per place. [2023-11-29 00:11:28,682 INFO L140 encePairwiseOnDemand]: 47/55 looper letters, 46 selfloop transitions, 5 changer transitions 43/115 dead transitions. [2023-11-29 00:11:28,682 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 70 places, 115 transitions, 660 flow [2023-11-29 00:11:28,682 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2023-11-29 00:11:28,682 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 8 states. [2023-11-29 00:11:28,683 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 8 states to 8 states and 260 transitions. [2023-11-29 00:11:28,684 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.5909090909090909 [2023-11-29 00:11:28,684 INFO L72 ComplementDD]: Start complementDD. Operand 8 states and 260 transitions. [2023-11-29 00:11:28,684 INFO L73 IsDeterministic]: Start isDeterministic. Operand 8 states and 260 transitions. [2023-11-29 00:11:28,684 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2023-11-29 00:11:28,684 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 8 states and 260 transitions. [2023-11-29 00:11:28,685 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 9 states, 8 states have (on average 32.5) internal successors, (260), 8 states have internal predecessors, (260), 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) [2023-11-29 00:11:28,687 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 9 states, 9 states have (on average 55.0) internal successors, (495), 9 states have internal predecessors, (495), 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) [2023-11-29 00:11:28,687 INFO L81 ComplementDD]: Finished complementDD. Result has 9 states, 9 states have (on average 55.0) internal successors, (495), 9 states have internal predecessors, (495), 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) [2023-11-29 00:11:28,687 INFO L175 Difference]: Start difference. First operand has 65 places, 58 transitions, 235 flow. Second operand 8 states and 260 transitions. [2023-11-29 00:11:28,687 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 70 places, 115 transitions, 660 flow [2023-11-29 00:11:28,691 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 68 places, 115 transitions, 654 flow, removed 3 selfloop flow, removed 2 redundant places. [2023-11-29 00:11:28,692 INFO L231 Difference]: Finished difference. Result has 74 places, 56 transitions, 253 flow [2023-11-29 00:11:28,693 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=55, PETRI_DIFFERENCE_MINUEND_FLOW=231, PETRI_DIFFERENCE_MINUEND_PLACES=61, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=58, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=4, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=53, PETRI_DIFFERENCE_SUBTRAHEND_STATES=8, PETRI_FLOW=253, PETRI_PLACES=74, PETRI_TRANSITIONS=56} [2023-11-29 00:11:28,693 INFO L281 CegarLoopForPetriNet]: 60 programPoint places, 14 predicate places. [2023-11-29 00:11:28,693 INFO L495 AbstractCegarLoop]: Abstraction has has 74 places, 56 transitions, 253 flow [2023-11-29 00:11:28,693 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 7 states, 7 states have (on average 27.0) internal successors, (189), 7 states have internal predecessors, (189), 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) [2023-11-29 00:11:28,693 INFO L200 CegarLoopForPetriNet]: Found error trace [2023-11-29 00:11:28,694 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-11-29 00:11:28,694 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable14 [2023-11-29 00:11:28,694 INFO L420 AbstractCegarLoop]: === Iteration 16 === Targeting ULTIMATE.startErr6ASSERT_VIOLATIONMEMORY_LEAK === [P0Err0ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 10 more)] === [2023-11-29 00:11:28,694 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-11-29 00:11:28,694 INFO L85 PathProgramCache]: Analyzing trace with hash -226371676, now seen corresponding path program 3 times [2023-11-29 00:11:28,694 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-11-29 00:11:28,694 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [512291088] [2023-11-29 00:11:28,694 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-11-29 00:11:28,695 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-11-29 00:11:28,733 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 00:11:29,465 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-11-29 00:11:29,465 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-11-29 00:11:29,465 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [512291088] [2023-11-29 00:11:29,465 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [512291088] provided 1 perfect and 0 imperfect interpolant sequences [2023-11-29 00:11:29,465 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-11-29 00:11:29,466 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2023-11-29 00:11:29,466 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1452227158] [2023-11-29 00:11:29,466 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-11-29 00:11:29,466 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 9 states [2023-11-29 00:11:29,467 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-11-29 00:11:29,467 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2023-11-29 00:11:29,467 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=16, Invalid=56, Unknown=0, NotChecked=0, Total=72 [2023-11-29 00:11:29,471 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 28 out of 55 [2023-11-29 00:11:29,472 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 74 places, 56 transitions, 253 flow. Second operand has 9 states, 9 states have (on average 29.88888888888889) internal successors, (269), 9 states have internal predecessors, (269), 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) [2023-11-29 00:11:29,472 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2023-11-29 00:11:29,472 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 28 of 55 [2023-11-29 00:11:29,472 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2023-11-29 00:11:29,980 INFO L124 PetriNetUnfolderBase]: 873/1756 cut-off events. [2023-11-29 00:11:29,980 INFO L125 PetriNetUnfolderBase]: For 603/751 co-relation queries the response was YES. [2023-11-29 00:11:29,984 INFO L83 FinitePrefix]: Finished finitePrefix Result has 4309 conditions, 1756 events. 873/1756 cut-off events. For 603/751 co-relation queries the response was YES. Maximal size of possible extension queue 125. Compared 10966 event pairs, 176 based on Foata normal form. 35/1685 useless extension candidates. Maximal degree in co-relation 4284. Up to 775 conditions per place. [2023-11-29 00:11:29,987 INFO L140 encePairwiseOnDemand]: 47/55 looper letters, 37 selfloop transitions, 5 changer transitions 24/96 dead transitions. [2023-11-29 00:11:29,987 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 78 places, 96 transitions, 505 flow [2023-11-29 00:11:29,988 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2023-11-29 00:11:29,988 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 9 states. [2023-11-29 00:11:29,989 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 9 states to 9 states and 312 transitions. [2023-11-29 00:11:29,989 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.6303030303030303 [2023-11-29 00:11:29,989 INFO L72 ComplementDD]: Start complementDD. Operand 9 states and 312 transitions. [2023-11-29 00:11:29,989 INFO L73 IsDeterministic]: Start isDeterministic. Operand 9 states and 312 transitions. [2023-11-29 00:11:29,990 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2023-11-29 00:11:29,990 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 9 states and 312 transitions. [2023-11-29 00:11:29,991 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 10 states, 9 states have (on average 34.666666666666664) internal successors, (312), 9 states have internal predecessors, (312), 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) [2023-11-29 00:11:29,992 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 10 states, 10 states have (on average 55.0) internal successors, (550), 10 states have internal predecessors, (550), 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) [2023-11-29 00:11:29,992 INFO L81 ComplementDD]: Finished complementDD. Result has 10 states, 10 states have (on average 55.0) internal successors, (550), 10 states have internal predecessors, (550), 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) [2023-11-29 00:11:29,992 INFO L175 Difference]: Start difference. First operand has 74 places, 56 transitions, 253 flow. Second operand 9 states and 312 transitions. [2023-11-29 00:11:29,992 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 78 places, 96 transitions, 505 flow [2023-11-29 00:11:29,995 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 74 places, 96 transitions, 487 flow, removed 9 selfloop flow, removed 4 redundant places. [2023-11-29 00:11:29,997 INFO L231 Difference]: Finished difference. Result has 78 places, 56 transitions, 262 flow [2023-11-29 00:11:29,997 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=55, PETRI_DIFFERENCE_MINUEND_FLOW=239, PETRI_DIFFERENCE_MINUEND_PLACES=66, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=56, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=5, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=51, PETRI_DIFFERENCE_SUBTRAHEND_STATES=9, PETRI_FLOW=262, PETRI_PLACES=78, PETRI_TRANSITIONS=56} [2023-11-29 00:11:29,997 INFO L281 CegarLoopForPetriNet]: 60 programPoint places, 18 predicate places. [2023-11-29 00:11:29,997 INFO L495 AbstractCegarLoop]: Abstraction has has 78 places, 56 transitions, 262 flow [2023-11-29 00:11:29,998 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 9 states, 9 states have (on average 29.88888888888889) internal successors, (269), 9 states have internal predecessors, (269), 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) [2023-11-29 00:11:29,998 INFO L200 CegarLoopForPetriNet]: Found error trace [2023-11-29 00:11:29,998 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-11-29 00:11:29,998 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable15 [2023-11-29 00:11:29,998 INFO L420 AbstractCegarLoop]: === Iteration 17 === Targeting ULTIMATE.startErr6ASSERT_VIOLATIONMEMORY_LEAK === [P0Err0ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 10 more)] === [2023-11-29 00:11:29,998 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-11-29 00:11:29,998 INFO L85 PathProgramCache]: Analyzing trace with hash 1422181710, now seen corresponding path program 4 times [2023-11-29 00:11:29,998 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-11-29 00:11:29,999 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1439070850] [2023-11-29 00:11:29,999 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-11-29 00:11:29,999 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-11-29 00:11:30,049 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2023-11-29 00:11:30,050 INFO L356 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2023-11-29 00:11:30,092 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2023-11-29 00:11:30,121 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2023-11-29 00:11:30,122 INFO L360 BasicCegarLoop]: Counterexample is feasible [2023-11-29 00:11:30,122 INFO L805 garLoopResultBuilder]: Registering result UNSAFE for location ULTIMATE.startErr6ASSERT_VIOLATIONMEMORY_LEAK (12 of 13 remaining) [2023-11-29 00:11:30,124 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location P0Err0ASSERT_VIOLATIONMEMORY_LEAK (11 of 13 remaining) [2023-11-29 00:11:30,124 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE (10 of 13 remaining) [2023-11-29 00:11:30,124 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE (9 of 13 remaining) [2023-11-29 00:11:30,124 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (8 of 13 remaining) [2023-11-29 00:11:30,124 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr3REQUIRES_VIOLATIONMEMORY_DEREFERENCE (7 of 13 remaining) [2023-11-29 00:11:30,124 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr4REQUIRES_VIOLATIONMEMORY_DEREFERENCE (6 of 13 remaining) [2023-11-29 00:11:30,124 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr5REQUIRES_VIOLATIONMEMORY_DEREFERENCE (5 of 13 remaining) [2023-11-29 00:11:30,125 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr7ASSERT_VIOLATIONMEMORY_LEAK (4 of 13 remaining) [2023-11-29 00:11:30,125 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (3 of 13 remaining) [2023-11-29 00:11:30,125 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (2 of 13 remaining) [2023-11-29 00:11:30,125 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr2INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (1 of 13 remaining) [2023-11-29 00:11:30,125 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location P0Err0ASSERT_VIOLATIONMEMORY_LEAK (0 of 13 remaining) [2023-11-29 00:11:30,125 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable16 [2023-11-29 00:11:30,125 INFO L445 BasicCegarLoop]: Path program histogram: [4, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-11-29 00:11:30,131 INFO L228 ceAbstractionStarter]: Analysis of concurrent program completed with 1 thread instances [2023-11-29 00:11:30,131 INFO L178 ceAbstractionStarter]: Computing trace abstraction results [2023-11-29 00:11:30,178 WARN L1572 BoogieBacktranslator]: Unfinished Backtranslation: IdentifierExpression #t~pre5 could not be translated [2023-11-29 00:11:30,180 WARN L1572 BoogieBacktranslator]: Unfinished Backtranslation: IdentifierExpression #t~pre7 could not be translated [2023-11-29 00:11:30,181 WARN L1572 BoogieBacktranslator]: Unfinished Backtranslation: IdentifierExpression #t~pre9 could not be translated [2023-11-29 00:11:30,194 WARN L1572 BoogieBacktranslator]: Unfinished Backtranslation: unknown boogie variable #t~nondet0 [2023-11-29 00:11:30,194 WARN L1572 BoogieBacktranslator]: Unfinished Backtranslation: unknown boogie variable #t~nondet0 [2023-11-29 00:11:30,207 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 29.11 12:11:30 BasicIcfg [2023-11-29 00:11:30,207 INFO L131 PluginConnector]: ------------------------ END TraceAbstraction---------------------------- [2023-11-29 00:11:30,207 INFO L112 PluginConnector]: ------------------------Witness Printer---------------------------- [2023-11-29 00:11:30,207 INFO L270 PluginConnector]: Initializing Witness Printer... [2023-11-29 00:11:30,208 INFO L274 PluginConnector]: Witness Printer initialized [2023-11-29 00:11:30,208 INFO L184 PluginConnector]: Executing the observer RCFGCatcher from plugin Witness Printer for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 29.11 12:11:18" (3/4) ... [2023-11-29 00:11:30,209 INFO L140 WitnessPrinter]: No result that supports witness generation found [2023-11-29 00:11:30,210 INFO L131 PluginConnector]: ------------------------ END Witness Printer---------------------------- [2023-11-29 00:11:30,210 INFO L158 Benchmark]: Toolchain (without parser) took 12693.07ms. Allocated memory was 146.8MB in the beginning and 371.2MB in the end (delta: 224.4MB). Free memory was 105.9MB in the beginning and 213.7MB in the end (delta: -107.8MB). Peak memory consumption was 118.4MB. Max. memory is 16.1GB. [2023-11-29 00:11:30,211 INFO L158 Benchmark]: CDTParser took 0.19ms. Allocated memory is still 146.8MB. Free memory is still 89.8MB. There was no memory consumed. Max. memory is 16.1GB. [2023-11-29 00:11:30,211 INFO L158 Benchmark]: CACSL2BoogieTranslator took 530.65ms. Allocated memory is still 146.8MB. Free memory was 105.5MB in the beginning and 82.1MB in the end (delta: 23.4MB). Peak memory consumption was 23.1MB. Max. memory is 16.1GB. [2023-11-29 00:11:30,211 INFO L158 Benchmark]: Boogie Procedure Inliner took 53.09ms. Allocated memory is still 146.8MB. Free memory was 82.1MB in the beginning and 79.7MB in the end (delta: 2.5MB). Peak memory consumption was 2.1MB. Max. memory is 16.1GB. [2023-11-29 00:11:30,211 INFO L158 Benchmark]: Boogie Preprocessor took 58.67ms. Allocated memory is still 146.8MB. Free memory was 79.4MB in the beginning and 75.8MB in the end (delta: 3.5MB). Peak memory consumption was 4.2MB. Max. memory is 16.1GB. [2023-11-29 00:11:30,212 INFO L158 Benchmark]: RCFGBuilder took 725.39ms. Allocated memory was 146.8MB in the beginning and 211.8MB in the end (delta: 65.0MB). Free memory was 75.8MB in the beginning and 144.1MB in the end (delta: -68.3MB). Peak memory consumption was 21.2MB. Max. memory is 16.1GB. [2023-11-29 00:11:30,212 INFO L158 Benchmark]: TraceAbstraction took 11315.68ms. Allocated memory was 211.8MB in the beginning and 371.2MB in the end (delta: 159.4MB). Free memory was 144.1MB in the beginning and 213.7MB in the end (delta: -69.5MB). Peak memory consumption was 90.9MB. Max. memory is 16.1GB. [2023-11-29 00:11:30,212 INFO L158 Benchmark]: Witness Printer took 2.75ms. Allocated memory is still 371.2MB. Free memory is still 213.7MB. There was no memory consumed. Max. memory is 16.1GB. [2023-11-29 00:11:30,214 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.19ms. Allocated memory is still 146.8MB. Free memory is still 89.8MB. There was no memory consumed. Max. memory is 16.1GB. * CACSL2BoogieTranslator took 530.65ms. Allocated memory is still 146.8MB. Free memory was 105.5MB in the beginning and 82.1MB in the end (delta: 23.4MB). Peak memory consumption was 23.1MB. Max. memory is 16.1GB. * Boogie Procedure Inliner took 53.09ms. Allocated memory is still 146.8MB. Free memory was 82.1MB in the beginning and 79.7MB in the end (delta: 2.5MB). Peak memory consumption was 2.1MB. Max. memory is 16.1GB. * Boogie Preprocessor took 58.67ms. Allocated memory is still 146.8MB. Free memory was 79.4MB in the beginning and 75.8MB in the end (delta: 3.5MB). Peak memory consumption was 4.2MB. Max. memory is 16.1GB. * RCFGBuilder took 725.39ms. Allocated memory was 146.8MB in the beginning and 211.8MB in the end (delta: 65.0MB). Free memory was 75.8MB in the beginning and 144.1MB in the end (delta: -68.3MB). Peak memory consumption was 21.2MB. Max. memory is 16.1GB. * TraceAbstraction took 11315.68ms. Allocated memory was 211.8MB in the beginning and 371.2MB in the end (delta: 159.4MB). Free memory was 144.1MB in the beginning and 213.7MB in the end (delta: -69.5MB). Peak memory consumption was 90.9MB. Max. memory is 16.1GB. * Witness Printer took 2.75ms. Allocated memory is still 371.2MB. Free memory is still 213.7MB. There was no memory consumed. Max. memory is 16.1GB. * Results from de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator: - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: IdentifierExpression #t~pre5 could not be translated - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: IdentifierExpression #t~pre7 could not be translated - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: IdentifierExpression #t~pre9 could not be translated - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: unknown boogie variable #t~nondet0 - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: unknown boogie variable #t~nondet0 - GenericResult: Unfinished Backtranslation The program execution was not completely translated back. * Results from de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: - UnprovableResult [Line: 17]: Unable to prove that all allocated memory was freed Unable to prove that all allocated memory was freed Reason: overapproximation of memtrack at line 17. Possible FailurePath: [L709] 0 int __unbuffered_cnt = 0; [L711] 0 int __unbuffered_p0_EAX = 0; [L713] 0 int __unbuffered_p1_EAX = 0; [L715] 0 int __unbuffered_p2_EAX = 0; [L717] 0 int __unbuffered_p2_EBX = 0; [L719] 0 int a = 0; [L720] 0 _Bool a$flush_delayed; [L721] 0 int a$mem_tmp; [L722] 0 _Bool a$r_buff0_thd0; [L723] 0 _Bool a$r_buff0_thd1; [L724] 0 _Bool a$r_buff0_thd2; [L725] 0 _Bool a$r_buff0_thd3; [L726] 0 _Bool a$r_buff1_thd0; [L727] 0 _Bool a$r_buff1_thd1; [L728] 0 _Bool a$r_buff1_thd2; [L729] 0 _Bool a$r_buff1_thd3; [L730] 0 _Bool a$read_delayed; [L731] 0 int *a$read_delayed_var; [L732] 0 int a$w_buff0; [L733] 0 _Bool a$w_buff0_used; [L734] 0 int a$w_buff1; [L735] 0 _Bool a$w_buff1_used; [L736] 0 _Bool main$tmp_guard0; [L737] 0 _Bool main$tmp_guard1; [L739] 0 int x = 0; [L741] 0 int y = 0; [L743] 0 int z = 0; [L744] 0 _Bool weak$$choice0; [L745] 0 _Bool weak$$choice2; [L845] 0 pthread_t t913; [L846] FCALL, FORK 0 pthread_create(&t913, ((void *)0), P0, ((void *)0)) VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=0, __unbuffered_p1_EAX=0, __unbuffered_p2_EAX=0, __unbuffered_p2_EBX=0, a$flush_delayed=0, a$mem_tmp=0, a$r_buff0_thd0=0, a$r_buff0_thd1=0, a$r_buff0_thd2=0, a$r_buff0_thd3=0, a$r_buff1_thd0=0, a$r_buff1_thd1=0, a$r_buff1_thd2=0, a$r_buff1_thd3=0, a$read_delayed=0, a$read_delayed_var={0:0}, a$w_buff0=0, a$w_buff0_used=0, a$w_buff1=0, a$w_buff1_used=0, a=0, main$tmp_guard0=0, main$tmp_guard1=0, t913={5:0}, weak$$choice0=0, weak$$choice2=0, x=0, y=0, z=0] [L847] 0 pthread_t t914; [L848] FCALL, FORK 0 pthread_create(&t914, ((void *)0), P1, ((void *)0)) VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=0, __unbuffered_p1_EAX=0, __unbuffered_p2_EAX=0, __unbuffered_p2_EBX=0, a$flush_delayed=0, a$mem_tmp=0, a$r_buff0_thd0=0, a$r_buff0_thd1=0, a$r_buff0_thd2=0, a$r_buff0_thd3=0, a$r_buff1_thd0=0, a$r_buff1_thd1=0, a$r_buff1_thd2=0, a$r_buff1_thd3=0, a$read_delayed=0, a$read_delayed_var={0:0}, a$w_buff0=0, a$w_buff0_used=0, a$w_buff1=0, a$w_buff1_used=0, a=0, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, t913={5:0}, t914={6:0}, weak$$choice0=0, weak$$choice2=0, x=0, y=0, z=0] [L849] 0 pthread_t t915; [L850] FCALL, FORK 0 pthread_create(&t915, ((void *)0), P2, ((void *)0)) VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=0, __unbuffered_p1_EAX=0, __unbuffered_p2_EAX=0, __unbuffered_p2_EBX=0, a$flush_delayed=0, a$mem_tmp=0, a$r_buff0_thd0=0, a$r_buff0_thd1=0, a$r_buff0_thd2=0, a$r_buff0_thd3=0, a$r_buff1_thd0=0, a$r_buff1_thd1=0, a$r_buff1_thd2=0, a$r_buff1_thd3=0, a$read_delayed=0, a$read_delayed_var={0:0}, a$w_buff0=0, a$w_buff0_used=0, a$w_buff1=0, a$w_buff1_used=0, a=0, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, t913={5:0}, t914={6:0}, t915={3:0}, weak$$choice0=0, weak$$choice2=0, x=0, y=0, z=0] [L749] 1 a$w_buff1 = a$w_buff0 [L750] 1 a$w_buff0 = 1 [L751] 1 a$w_buff1_used = a$w_buff0_used [L752] 1 a$w_buff0_used = (_Bool)1 [L753] CALL 1 __VERIFIER_assert(!(a$w_buff1_used && a$w_buff0_used)) [L18] COND FALSE 1 !(!expression) [L753] RET 1 __VERIFIER_assert(!(a$w_buff1_used && a$w_buff0_used)) [L754] 1 a$r_buff1_thd0 = a$r_buff0_thd0 [L755] 1 a$r_buff1_thd1 = a$r_buff0_thd1 [L756] 1 a$r_buff1_thd2 = a$r_buff0_thd2 [L757] 1 a$r_buff1_thd3 = a$r_buff0_thd3 [L758] 1 a$r_buff0_thd1 = (_Bool)1 VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=0, __unbuffered_p1_EAX=0, __unbuffered_p2_EAX=0, __unbuffered_p2_EBX=0, a$flush_delayed=0, a$mem_tmp=0, a$r_buff0_thd0=0, a$r_buff0_thd1=1, a$r_buff0_thd2=0, a$r_buff0_thd3=0, a$r_buff1_thd0=0, a$r_buff1_thd1=0, a$r_buff1_thd2=0, a$r_buff1_thd3=0, a$read_delayed=0, a$read_delayed_var={0:0}, a$w_buff0=1, a$w_buff0_used=1, a$w_buff1=0, a$w_buff1_used=0, a=0, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=0, x=0, y=0, z=0] [L761] 1 __unbuffered_p0_EAX = x VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=0, __unbuffered_p1_EAX=0, __unbuffered_p2_EAX=0, __unbuffered_p2_EBX=0, a$flush_delayed=0, a$mem_tmp=0, a$r_buff0_thd0=0, a$r_buff0_thd1=1, a$r_buff0_thd2=0, a$r_buff0_thd3=0, a$r_buff1_thd0=0, a$r_buff1_thd1=0, a$r_buff1_thd2=0, a$r_buff1_thd3=0, a$read_delayed=0, a$read_delayed_var={0:0}, a$w_buff0=1, a$w_buff0_used=1, a$w_buff1=0, a$w_buff1_used=0, a=0, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=0, x=0, y=0, z=0] [L778] 2 x = 1 VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=0, __unbuffered_p1_EAX=0, __unbuffered_p2_EAX=0, __unbuffered_p2_EBX=0, a$flush_delayed=0, a$mem_tmp=0, a$r_buff0_thd0=0, a$r_buff0_thd1=1, a$r_buff0_thd2=0, a$r_buff0_thd3=0, a$r_buff1_thd0=0, a$r_buff1_thd1=0, a$r_buff1_thd2=0, a$r_buff1_thd3=0, a$read_delayed=0, a$read_delayed_var={0:0}, a$w_buff0=1, a$w_buff0_used=1, a$w_buff1=0, a$w_buff1_used=0, a=0, arg={0:0}, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=0, x=1, y=0, z=0] [L781] 2 __unbuffered_p1_EAX = y VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=0, __unbuffered_p1_EAX=0, __unbuffered_p2_EAX=0, __unbuffered_p2_EBX=0, a$flush_delayed=0, a$mem_tmp=0, a$r_buff0_thd0=0, a$r_buff0_thd1=1, a$r_buff0_thd2=0, a$r_buff0_thd3=0, a$r_buff1_thd0=0, a$r_buff1_thd1=0, a$r_buff1_thd2=0, a$r_buff1_thd3=0, a$read_delayed=0, a$read_delayed_var={0:0}, a$w_buff0=1, a$w_buff0_used=1, a$w_buff1=0, a$w_buff1_used=0, a=0, arg={0:0}, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=0, x=1, y=0, z=0] [L784] 2 a = a$w_buff0_used && a$r_buff0_thd2 ? a$w_buff0 : (a$w_buff1_used && a$r_buff1_thd2 ? a$w_buff1 : a) [L785] 2 a$w_buff0_used = a$w_buff0_used && a$r_buff0_thd2 ? (_Bool)0 : a$w_buff0_used [L786] 2 a$w_buff1_used = a$w_buff0_used && a$r_buff0_thd2 || a$w_buff1_used && a$r_buff1_thd2 ? (_Bool)0 : a$w_buff1_used [L787] 2 a$r_buff0_thd2 = a$w_buff0_used && a$r_buff0_thd2 ? (_Bool)0 : a$r_buff0_thd2 [L788] 2 a$r_buff1_thd2 = a$w_buff0_used && a$r_buff0_thd2 || a$w_buff1_used && a$r_buff1_thd2 ? (_Bool)0 : a$r_buff1_thd2 VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=0, __unbuffered_p1_EAX=0, __unbuffered_p2_EAX=0, __unbuffered_p2_EBX=0, a$flush_delayed=0, a$mem_tmp=0, a$r_buff0_thd0=0, a$r_buff0_thd1=1, a$r_buff0_thd2=0, a$r_buff0_thd3=0, a$r_buff1_thd0=0, a$r_buff1_thd1=0, a$r_buff1_thd2=0, a$r_buff1_thd3=0, a$read_delayed=0, a$read_delayed_var={0:0}, a$w_buff0=1, a$w_buff0_used=1, a$w_buff1=0, a$w_buff1_used=0, a=0, arg={0:0}, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=0, x=1, y=0, z=0] [L798] 3 y = 1 VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=0, __unbuffered_p1_EAX=0, __unbuffered_p2_EAX=0, __unbuffered_p2_EBX=0, a$flush_delayed=0, a$mem_tmp=0, a$r_buff0_thd0=0, a$r_buff0_thd1=1, a$r_buff0_thd2=0, a$r_buff0_thd3=0, a$r_buff1_thd0=0, a$r_buff1_thd1=0, a$r_buff1_thd2=0, a$r_buff1_thd3=0, a$read_delayed=0, a$read_delayed_var={0:0}, a$w_buff0=1, a$w_buff0_used=1, a$w_buff1=0, a$w_buff1_used=0, a=0, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=0, x=1, y=1, z=0] [L801] 3 z = 1 VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=0, __unbuffered_p1_EAX=0, __unbuffered_p2_EAX=0, __unbuffered_p2_EBX=0, a$flush_delayed=0, a$mem_tmp=0, a$r_buff0_thd0=0, a$r_buff0_thd1=1, a$r_buff0_thd2=0, a$r_buff0_thd3=0, a$r_buff1_thd0=0, a$r_buff1_thd1=0, a$r_buff1_thd2=0, a$r_buff1_thd3=0, a$read_delayed=0, a$read_delayed_var={0:0}, a$w_buff0=1, a$w_buff0_used=1, a$w_buff1=0, a$w_buff1_used=0, a=0, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=0, x=1, y=1, z=1] [L804] 3 __unbuffered_p2_EAX = z VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=0, __unbuffered_p1_EAX=0, __unbuffered_p2_EAX=1, __unbuffered_p2_EBX=0, a$flush_delayed=0, a$mem_tmp=0, a$r_buff0_thd0=0, a$r_buff0_thd1=1, a$r_buff0_thd2=0, a$r_buff0_thd3=0, a$r_buff1_thd0=0, a$r_buff1_thd1=0, a$r_buff1_thd2=0, a$r_buff1_thd3=0, a$read_delayed=0, a$read_delayed_var={0:0}, a$w_buff0=1, a$w_buff0_used=1, a$w_buff1=0, a$w_buff1_used=0, a=0, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=0, x=1, y=1, z=1] [L807] 3 weak$$choice0 = __VERIFIER_nondet_bool() [L808] 3 weak$$choice2 = __VERIFIER_nondet_bool() [L809] 3 a$flush_delayed = weak$$choice2 [L810] 3 a$mem_tmp = a [L811] 3 a = !a$w_buff0_used || !a$r_buff0_thd3 && !a$w_buff1_used || !a$r_buff0_thd3 && !a$r_buff1_thd3 ? a : (a$w_buff0_used && a$r_buff0_thd3 ? a$w_buff0 : a$w_buff1) [L812] 3 a$w_buff0 = weak$$choice2 ? a$w_buff0 : (!a$w_buff0_used || !a$r_buff0_thd3 && !a$w_buff1_used || !a$r_buff0_thd3 && !a$r_buff1_thd3 ? a$w_buff0 : (a$w_buff0_used && a$r_buff0_thd3 ? a$w_buff0 : a$w_buff0)) [L813] 3 a$w_buff1 = weak$$choice2 ? a$w_buff1 : (!a$w_buff0_used || !a$r_buff0_thd3 && !a$w_buff1_used || !a$r_buff0_thd3 && !a$r_buff1_thd3 ? a$w_buff1 : (a$w_buff0_used && a$r_buff0_thd3 ? a$w_buff1 : a$w_buff1)) [L814] 3 a$w_buff0_used = weak$$choice2 ? a$w_buff0_used : (!a$w_buff0_used || !a$r_buff0_thd3 && !a$w_buff1_used || !a$r_buff0_thd3 && !a$r_buff1_thd3 ? a$w_buff0_used : (a$w_buff0_used && a$r_buff0_thd3 ? (_Bool)0 : a$w_buff0_used)) [L815] 3 a$w_buff1_used = weak$$choice2 ? a$w_buff1_used : (!a$w_buff0_used || !a$r_buff0_thd3 && !a$w_buff1_used || !a$r_buff0_thd3 && !a$r_buff1_thd3 ? a$w_buff1_used : (a$w_buff0_used && a$r_buff0_thd3 ? (_Bool)0 : (_Bool)0)) [L816] 3 a$r_buff0_thd3 = weak$$choice2 ? a$r_buff0_thd3 : (!a$w_buff0_used || !a$r_buff0_thd3 && !a$w_buff1_used || !a$r_buff0_thd3 && !a$r_buff1_thd3 ? a$r_buff0_thd3 : (a$w_buff0_used && a$r_buff0_thd3 ? (_Bool)0 : a$r_buff0_thd3)) [L817] 3 a$r_buff1_thd3 = weak$$choice2 ? a$r_buff1_thd3 : (!a$w_buff0_used || !a$r_buff0_thd3 && !a$w_buff1_used || !a$r_buff0_thd3 && !a$r_buff1_thd3 ? a$r_buff1_thd3 : (a$w_buff0_used && a$r_buff0_thd3 ? (_Bool)0 : (_Bool)0)) [L818] 3 __unbuffered_p2_EBX = a [L819] 3 a = a$flush_delayed ? a$mem_tmp : a [L820] 3 a$flush_delayed = (_Bool)0 VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=0, __unbuffered_p1_EAX=0, __unbuffered_p2_EAX=1, __unbuffered_p2_EBX=0, a$flush_delayed=0, a$mem_tmp=0, a$r_buff0_thd0=0, a$r_buff0_thd1=1, a$r_buff0_thd2=0, a$r_buff0_thd3=0, a$r_buff1_thd0=0, a$r_buff1_thd1=0, a$r_buff1_thd2=0, a$r_buff1_thd3=0, a$read_delayed=0, a$read_delayed_var={0:0}, a$w_buff0=1, a$w_buff0_used=1, a$w_buff1=0, a$w_buff1_used=0, a=0, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice2=1, x=1, y=1, z=1] [L823] 3 a = a$w_buff0_used && a$r_buff0_thd3 ? a$w_buff0 : (a$w_buff1_used && a$r_buff1_thd3 ? a$w_buff1 : a) [L824] 3 a$w_buff0_used = a$w_buff0_used && a$r_buff0_thd3 ? (_Bool)0 : a$w_buff0_used [L825] 3 a$w_buff1_used = a$w_buff0_used && a$r_buff0_thd3 || a$w_buff1_used && a$r_buff1_thd3 ? (_Bool)0 : a$w_buff1_used [L826] 3 a$r_buff0_thd3 = a$w_buff0_used && a$r_buff0_thd3 ? (_Bool)0 : a$r_buff0_thd3 [L827] 3 a$r_buff1_thd3 = a$w_buff0_used && a$r_buff0_thd3 || a$w_buff1_used && a$r_buff1_thd3 ? (_Bool)0 : a$r_buff1_thd3 VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=0, __unbuffered_p1_EAX=0, __unbuffered_p2_EAX=1, __unbuffered_p2_EBX=0, a$flush_delayed=0, a$mem_tmp=0, a$r_buff0_thd0=0, a$r_buff0_thd1=1, a$r_buff0_thd2=0, a$r_buff0_thd3=0, a$r_buff1_thd0=0, a$r_buff1_thd1=0, a$r_buff1_thd2=0, a$r_buff1_thd3=0, a$read_delayed=0, a$read_delayed_var={0:0}, a$w_buff0=1, a$w_buff0_used=1, a$w_buff1=0, a$w_buff1_used=0, a=0, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice2=1, x=1, y=1, z=1] [L764] 1 a = a$w_buff0_used && a$r_buff0_thd1 ? a$w_buff0 : (a$w_buff1_used && a$r_buff1_thd1 ? a$w_buff1 : a) [L765] 1 a$w_buff0_used = a$w_buff0_used && a$r_buff0_thd1 ? (_Bool)0 : a$w_buff0_used [L766] 1 a$w_buff1_used = a$w_buff0_used && a$r_buff0_thd1 || a$w_buff1_used && a$r_buff1_thd1 ? (_Bool)0 : a$w_buff1_used [L767] 1 a$r_buff0_thd1 = a$w_buff0_used && a$r_buff0_thd1 ? (_Bool)0 : a$r_buff0_thd1 [L768] 1 a$r_buff1_thd1 = a$w_buff0_used && a$r_buff0_thd1 || a$w_buff1_used && a$r_buff1_thd1 ? (_Bool)0 : a$r_buff1_thd1 VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=0, __unbuffered_p1_EAX=0, __unbuffered_p2_EAX=1, __unbuffered_p2_EBX=0, a$flush_delayed=0, a$mem_tmp=0, a$r_buff0_thd0=0, a$r_buff0_thd1=1, a$r_buff0_thd2=0, a$r_buff0_thd3=0, a$r_buff1_thd0=0, a$r_buff1_thd1=0, a$r_buff1_thd2=0, a$r_buff1_thd3=0, a$read_delayed=0, a$read_delayed_var={0:0}, a$w_buff0=1, a$w_buff0_used=0, a$w_buff1=0, a$w_buff1_used=0, a=1, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice2=1, x=1, y=1, z=1] [L771] 1 __unbuffered_cnt = __unbuffered_cnt + 1 VAL [__unbuffered_cnt=1, __unbuffered_p0_EAX=0, __unbuffered_p1_EAX=0, __unbuffered_p2_EAX=1, __unbuffered_p2_EBX=0, a$flush_delayed=0, a$mem_tmp=0, a$r_buff0_thd0=0, a$r_buff0_thd1=1, a$r_buff0_thd2=0, a$r_buff0_thd3=0, a$r_buff1_thd0=0, a$r_buff1_thd1=0, a$r_buff1_thd2=0, a$r_buff1_thd3=0, a$read_delayed=0, a$read_delayed_var={0:0}, a$w_buff0=1, a$w_buff0_used=0, a$w_buff1=0, a$w_buff1_used=0, a=1, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice2=1, x=1, y=1, z=1] [L791] 2 __unbuffered_cnt = __unbuffered_cnt + 1 VAL [__unbuffered_cnt=2, __unbuffered_p0_EAX=0, __unbuffered_p1_EAX=0, __unbuffered_p2_EAX=1, __unbuffered_p2_EBX=0, a$flush_delayed=0, a$mem_tmp=0, a$r_buff0_thd0=0, a$r_buff0_thd1=1, a$r_buff0_thd2=0, a$r_buff0_thd3=0, a$r_buff1_thd0=0, a$r_buff1_thd1=0, a$r_buff1_thd2=0, a$r_buff1_thd3=0, a$read_delayed=0, a$read_delayed_var={0:0}, a$w_buff0=1, a$w_buff0_used=0, a$w_buff1=0, a$w_buff1_used=0, a=1, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice2=1, x=1, y=1, z=1] [L830] 3 __unbuffered_cnt = __unbuffered_cnt + 1 VAL [__unbuffered_cnt=3, __unbuffered_p0_EAX=0, __unbuffered_p1_EAX=0, __unbuffered_p2_EAX=1, __unbuffered_p2_EBX=0, a$flush_delayed=0, a$mem_tmp=0, a$r_buff0_thd0=0, a$r_buff0_thd1=1, a$r_buff0_thd2=0, a$r_buff0_thd3=0, a$r_buff1_thd0=0, a$r_buff1_thd1=0, a$r_buff1_thd2=0, a$r_buff1_thd3=0, a$read_delayed=0, a$read_delayed_var={0:0}, a$w_buff0=1, a$w_buff0_used=0, a$w_buff1=0, a$w_buff1_used=0, a=1, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice2=1, x=1, y=1, z=1] [L852] 0 main$tmp_guard0 = __unbuffered_cnt == 3 VAL [__unbuffered_cnt=3, __unbuffered_p0_EAX=0, __unbuffered_p1_EAX=0, __unbuffered_p2_EAX=1, __unbuffered_p2_EBX=0, a$flush_delayed=0, a$mem_tmp=0, a$r_buff0_thd0=0, a$r_buff0_thd1=1, a$r_buff0_thd2=0, a$r_buff0_thd3=0, a$r_buff1_thd0=0, a$r_buff1_thd1=0, a$r_buff1_thd2=0, a$r_buff1_thd3=0, a$read_delayed=0, a$read_delayed_var={0:0}, a$w_buff0=1, a$w_buff0_used=0, a$w_buff1=0, a$w_buff1_used=0, a=1, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, main$tmp_guard0=1, main$tmp_guard1=0, t913={5:0}, t914={6:0}, t915={3:0}, weak$$choice2=1, x=1, y=1, z=1] [L854] CALL 0 assume_abort_if_not(main$tmp_guard0) [L3] COND FALSE 0 !(!cond) [L854] RET 0 assume_abort_if_not(main$tmp_guard0) [L856] 0 a = a$w_buff0_used && a$r_buff0_thd0 ? a$w_buff0 : (a$w_buff1_used && a$r_buff1_thd0 ? a$w_buff1 : a) [L857] 0 a$w_buff0_used = a$w_buff0_used && a$r_buff0_thd0 ? (_Bool)0 : a$w_buff0_used [L858] 0 a$w_buff1_used = a$w_buff0_used && a$r_buff0_thd0 || a$w_buff1_used && a$r_buff1_thd0 ? (_Bool)0 : a$w_buff1_used [L859] 0 a$r_buff0_thd0 = a$w_buff0_used && a$r_buff0_thd0 ? (_Bool)0 : a$r_buff0_thd0 [L860] 0 a$r_buff1_thd0 = a$w_buff0_used && a$r_buff0_thd0 || a$w_buff1_used && a$r_buff1_thd0 ? (_Bool)0 : a$r_buff1_thd0 VAL [__unbuffered_cnt=3, __unbuffered_p0_EAX=0, __unbuffered_p1_EAX=0, __unbuffered_p2_EAX=1, __unbuffered_p2_EBX=0, a$flush_delayed=0, a$mem_tmp=0, a$r_buff0_thd0=0, a$r_buff0_thd1=1, a$r_buff0_thd2=0, a$r_buff0_thd3=0, a$r_buff1_thd0=0, a$r_buff1_thd1=0, a$r_buff1_thd2=0, a$r_buff1_thd3=0, a$read_delayed=0, a$read_delayed_var={0:0}, a$w_buff0=1, a$w_buff0_used=0, a$w_buff1=0, a$w_buff1_used=0, a=1, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, main$tmp_guard0=1, main$tmp_guard1=0, t913={5:0}, t914={6:0}, t915={3:0}, weak$$choice2=1, x=1, y=1, z=1] [L863] 0 main$tmp_guard1 = !(__unbuffered_p0_EAX == 0 && __unbuffered_p1_EAX == 0 && __unbuffered_p2_EAX == 1 && __unbuffered_p2_EBX == 0) VAL [__unbuffered_cnt=3, __unbuffered_p0_EAX=0, __unbuffered_p1_EAX=0, __unbuffered_p2_EAX=1, __unbuffered_p2_EBX=0, a$flush_delayed=0, a$mem_tmp=0, a$r_buff0_thd0=0, a$r_buff0_thd1=1, a$r_buff0_thd2=0, a$r_buff0_thd3=0, a$r_buff1_thd0=0, a$r_buff1_thd1=0, a$r_buff1_thd2=0, a$r_buff1_thd3=0, a$read_delayed=0, a$read_delayed_var={0:0}, a$w_buff0=1, a$w_buff0_used=0, a$w_buff1=0, a$w_buff1_used=0, a=1, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, main$tmp_guard0=1, main$tmp_guard1=0, t913={5:0}, t914={6:0}, t915={3:0}, weak$$choice2=1, x=1, y=1, z=1] [L865] CALL 0 __VERIFIER_assert(main$tmp_guard1) [L18] COND TRUE 0 !expression [L18] CALL 0 reach_error() [L17] COND FALSE 0 !(0) VAL [__unbuffered_cnt=3, __unbuffered_p0_EAX=0, __unbuffered_p1_EAX=0, __unbuffered_p2_EAX=1, __unbuffered_p2_EBX=0, a$flush_delayed=0, a$mem_tmp=0, a$r_buff0_thd0=0, a$r_buff0_thd1=1, a$r_buff0_thd2=0, a$r_buff0_thd3=0, a$r_buff1_thd0=0, a$r_buff1_thd1=0, a$r_buff1_thd2=0, a$r_buff1_thd3=0, a$read_delayed=0, a$read_delayed_var={0:0}, a$w_buff0=1, a$w_buff0_used=0, a$w_buff1=0, a$w_buff1_used=0, a=1, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, main$tmp_guard0=1, main$tmp_guard1=0, weak$$choice2=1, x=1, y=1, z=1] [L17] 0 __assert_fail ("0", "mix035.oepc.c", 8, __extension__ __PRETTY_FUNCTION__) VAL [__unbuffered_cnt=3, __unbuffered_p0_EAX=0, __unbuffered_p1_EAX=0, __unbuffered_p2_EAX=1, __unbuffered_p2_EBX=0, a$flush_delayed=0, a$mem_tmp=0, a$r_buff0_thd0=0, a$r_buff0_thd1=1, a$r_buff0_thd2=0, a$r_buff0_thd3=0, a$r_buff1_thd0=0, a$r_buff1_thd1=0, a$r_buff1_thd2=0, a$r_buff1_thd3=0, a$read_delayed=0, a$read_delayed_var={0:0}, a$w_buff0=1, a$w_buff0_used=0, a$w_buff1=0, a$w_buff1_used=0, a=1, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, main$tmp_guard0=1, main$tmp_guard1=0, weak$$choice2=1, x=1, y=1, z=1] - UnprovableResult [Line: 17]: Unable to prove that all allocated memory was freed Unable to prove that all allocated memory was freed Reason: Not analyzed. - UnprovableResult [Line: -1]: Unable to prove that pointer dereference always succeeds Unable to prove that pointer dereference always succeeds Reason: Not analyzed. - UnprovableResult [Line: -1]: Unable to prove that pointer dereference always succeeds Unable to prove that pointer dereference always succeeds Reason: Not analyzed. - UnprovableResult [Line: -1]: Unable to prove that pointer dereference always succeeds Unable to prove that pointer dereference always succeeds Reason: Not analyzed. - UnprovableResult [Line: -1]: Unable to prove that pointer dereference always succeeds Unable to prove that pointer dereference always succeeds Reason: Not analyzed. - UnprovableResult [Line: -1]: Unable to prove that pointer dereference always succeeds Unable to prove that pointer dereference always succeeds Reason: Not analyzed. - UnprovableResult [Line: -1]: Unable to prove that pointer dereference always succeeds Unable to prove that pointer dereference always succeeds Reason: Not analyzed. - UnprovableResult [Line: 843]: Unable to prove that all allocated memory was freed Unable to prove that all allocated memory was freed Reason: Not analyzed. - UnprovableResult [Line: 848]: 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: 850]: 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: 846]: 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, 81 locations, 13 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: 11.1s, OverallIterations: 17, TraceHistogramMax: 1, PathProgramHistogramMax: 4, EmptinessCheckTime: 0.0s, AutomataDifference: 7.0s, DeadEndRemovalTime: 0.0s, HoareAnnotationTime: 0.0s, InitialAbstractionConstructionTime: 0.0s, HoareTripleCheckerStatistics: 0 mSolverCounterUnknown, 799 SdHoareTripleChecker+Valid, 2.3s IncrementalHoareTripleChecker+Time, 0 mSdLazyCounter, 680 mSDsluCounter, 166 SdHoareTripleChecker+Invalid, 1.9s Time, 0 mProtectedAction, 0 SdHoareTripleChecker+Unchecked, 0 IncrementalHoareTripleChecker+Unchecked, 118 mSDsCounter, 46 IncrementalHoareTripleChecker+Valid, 0 mProtectedPredicate, 2134 IncrementalHoareTripleChecker+Invalid, 2180 SdHoareTripleChecker+Unknown, 0 mSolverCounterNotChecked, 46 mSolverCounterUnsat, 48 mSDtfsCounter, 2134 mSolverCounterSat, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Unknown, PredicateUnifierStatistics: 0 DeclaredPredicates, 90 GetRequests, 17 SyntacticMatches, 0 SemanticMatches, 73 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 34 ImplicationChecksByTransitivity, 0.6s Time, 0.0s BasicInterpolantAutomatonTime, BiggestAbstraction: size=262occurred in iteration=16, InterpolantAutomatonStates: 83, 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.3s SatisfiabilityAnalysisTime, 3.3s InterpolantComputationTime, 318 NumberOfCodeBlocks, 318 NumberOfCodeBlocksAsserted, 17 NumberOfCheckSat, 267 ConstructedInterpolants, 0 QuantifiedInterpolants, 1766 SizeOfPredicates, 0 NumberOfNonLiveVariables, 0 ConjunctsInSsa, 0 ConjunctsInUnsatCore, 16 InterpolantComputations, 16 PerfectInterpolantSequences, 0/0 InterpolantCoveringCapability, INVARIANT_SYNTHESIS: No data available, INTERPOLANT_CONSOLIDATION: No data available, ABSTRACT_INTERPRETATION: No data available, PDR: No data available, ACCELERATED_INTERPOLATION: No data available, SIFA: No data available, ReuseStatistics: No data available RESULT: Ultimate could not prove your program: unable to determine feasibility of some traces [2023-11-29 00:11:30,234 INFO L540 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_04b19fd4-4e56-40ba-9f43-51779049eebd/bin/uautomizer-verify-BQ2R08f2Ya/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 (1)] Forceful destruction successful, exit code 0 Received shutdown request... --- End real Ultimate output --- Execution finished normally Using bit-precise analysis Retrying with bit-precise analysis ### Bit-precise run ### Calling Ultimate with: /usr/lib/jvm/java-1.11.0-openjdk-amd64/bin/java -Dosgi.configuration.area=/tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_04b19fd4-4e56-40ba-9f43-51779049eebd/bin/uautomizer-verify-BQ2R08f2Ya/data/config -Xmx15G -Xms4m -jar /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_04b19fd4-4e56-40ba-9f43-51779049eebd/bin/uautomizer-verify-BQ2R08f2Ya/plugins/org.eclipse.equinox.launcher_1.5.800.v20200727-1323.jar -data @noDefault -ultimatedata /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_04b19fd4-4e56-40ba-9f43-51779049eebd/bin/uautomizer-verify-BQ2R08f2Ya/data -tc /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_04b19fd4-4e56-40ba-9f43-51779049eebd/bin/uautomizer-verify-BQ2R08f2Ya/config/AutomizerMemDerefMemtrack.xml -i ../../sv-benchmarks/c/pthread-wmm/mix035.oepc.i -s /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_04b19fd4-4e56-40ba-9f43-51779049eebd/bin/uautomizer-verify-BQ2R08f2Ya/config/svcomp-DerefFreeMemtrack-32bit-Automizer_Bitvector.epf --cacsl2boogietranslator.entry.function main --witnessprinter.witness.directory /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_04b19fd4-4e56-40ba-9f43-51779049eebd/bin/uautomizer-verify-BQ2R08f2Ya --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 65062a4b0d520b12bcf8d6a9b80d96fd04b54c0c91d2bd97d502a34cc77f9c59 --- Real Ultimate output --- This is Ultimate 0.2.4-dev-0e0057c [2023-11-29 00:11:32,207 INFO L188 SettingsManager]: Resetting all preferences to default values... [2023-11-29 00:11:32,277 INFO L114 SettingsManager]: Loading settings from /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_04b19fd4-4e56-40ba-9f43-51779049eebd/bin/uautomizer-verify-BQ2R08f2Ya/config/svcomp-DerefFreeMemtrack-32bit-Automizer_Bitvector.epf [2023-11-29 00:11:32,288 WARN L101 SettingsManager]: Preference file contains the following unknown settings: [2023-11-29 00:11:32,289 WARN L103 SettingsManager]: * de.uni_freiburg.informatik.ultimate.core.Log level for class [2023-11-29 00:11:32,318 INFO L130 SettingsManager]: Preferences different from defaults after loading the file: [2023-11-29 00:11:32,319 INFO L151 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2023-11-29 00:11:32,320 INFO L153 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2023-11-29 00:11:32,320 INFO L151 SettingsManager]: Preferences of Boogie Preprocessor differ from their defaults: [2023-11-29 00:11:32,321 INFO L153 SettingsManager]: * Use memory slicer=true [2023-11-29 00:11:32,322 INFO L151 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2023-11-29 00:11:32,322 INFO L153 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2023-11-29 00:11:32,323 INFO L151 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2023-11-29 00:11:32,324 INFO L153 SettingsManager]: * Create parallel compositions if possible=false [2023-11-29 00:11:32,324 INFO L153 SettingsManager]: * Use SBE=true [2023-11-29 00:11:32,325 INFO L151 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2023-11-29 00:11:32,326 INFO L153 SettingsManager]: * sizeof long=4 [2023-11-29 00:11:32,326 INFO L153 SettingsManager]: * Overapproximate operations on floating types=true [2023-11-29 00:11:32,327 INFO L153 SettingsManager]: * sizeof POINTER=4 [2023-11-29 00:11:32,327 INFO L153 SettingsManager]: * Check division by zero=IGNORE [2023-11-29 00:11:32,328 INFO L153 SettingsManager]: * Check for the main procedure if all allocated memory was freed=true [2023-11-29 00:11:32,329 INFO L153 SettingsManager]: * Bitprecise bitfields=true [2023-11-29 00:11:32,329 INFO L153 SettingsManager]: * SV-COMP memtrack compatibility mode=true [2023-11-29 00:11:32,330 INFO L153 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2023-11-29 00:11:32,330 INFO L153 SettingsManager]: * Adapt memory model on pointer casts if necessary=true [2023-11-29 00:11:32,331 INFO L153 SettingsManager]: * Use bitvectors instead of ints=true [2023-11-29 00:11:32,331 INFO L153 SettingsManager]: * Memory model=HoenickeLindenmann_4ByteResolution [2023-11-29 00:11:32,331 INFO L153 SettingsManager]: * Check unreachability of reach_error function=false [2023-11-29 00:11:32,332 INFO L153 SettingsManager]: * sizeof long double=12 [2023-11-29 00:11:32,332 INFO L153 SettingsManager]: * Use constant arrays=true [2023-11-29 00:11:32,333 INFO L151 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2023-11-29 00:11:32,333 INFO L153 SettingsManager]: * Size of a code block=SequenceOfStatements [2023-11-29 00:11:32,333 INFO L153 SettingsManager]: * Only consider context switches at boundaries of atomic blocks=true [2023-11-29 00:11:32,334 INFO L153 SettingsManager]: * SMT solver=External_DefaultMode [2023-11-29 00:11:32,334 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2023-11-29 00:11:32,334 INFO L151 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2023-11-29 00:11:32,335 INFO L153 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2023-11-29 00:11:32,335 INFO L153 SettingsManager]: * Trace refinement strategy=WOLF [2023-11-29 00:11:32,335 INFO L153 SettingsManager]: * Command for external solver=cvc4 --incremental --print-success --lang smt [2023-11-29 00:11:32,335 INFO L153 SettingsManager]: * Apply one-shot large block encoding in concurrent analysis=false [2023-11-29 00:11:32,335 INFO L153 SettingsManager]: * Automaton type used in concurrency analysis=PETRI_NET [2023-11-29 00:11:32,336 INFO L153 SettingsManager]: * Order on configurations for Petri net unfoldings=DBO [2023-11-29 00:11:32,336 INFO L153 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2023-11-29 00:11:32,336 INFO L153 SettingsManager]: * Logic for external solver=AUFBV [2023-11-29 00:11:32,336 INFO L153 SettingsManager]: * Looper check in Petri net analysis=SEMANTIC WARNING: An illegal reflective access operation has occurred WARNING: Illegal reflective access by com.sun.xml.bind.v2.runtime.reflect.opt.Injector$1 (file:/tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_04b19fd4-4e56-40ba-9f43-51779049eebd/bin/uautomizer-verify-BQ2R08f2Ya/plugins/com.sun.xml.bind_2.2.0.v201505121915.jar) to method java.lang.ClassLoader.defineClass(java.lang.String,byte[],int,int) WARNING: Please consider reporting this to the maintainers of com.sun.xml.bind.v2.runtime.reflect.opt.Injector$1 WARNING: Use --illegal-access=warn to enable warnings of further illegal reflective access operations WARNING: All illegal access operations will be denied in a future release Applying setting for plugin de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator: Entry function -> main Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Witness directory -> /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_04b19fd4-4e56-40ba-9f43-51779049eebd/bin/uautomizer-verify-BQ2R08f2Ya 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 -> 65062a4b0d520b12bcf8d6a9b80d96fd04b54c0c91d2bd97d502a34cc77f9c59 [2023-11-29 00:11:32,626 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2023-11-29 00:11:32,646 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2023-11-29 00:11:32,649 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2023-11-29 00:11:32,650 INFO L270 PluginConnector]: Initializing CDTParser... [2023-11-29 00:11:32,651 INFO L274 PluginConnector]: CDTParser initialized [2023-11-29 00:11:32,652 INFO L431 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_04b19fd4-4e56-40ba-9f43-51779049eebd/bin/uautomizer-verify-BQ2R08f2Ya/../../sv-benchmarks/c/pthread-wmm/mix035.oepc.i [2023-11-29 00:11:35,400 INFO L533 CDTParser]: Created temporary CDT project at NULL [2023-11-29 00:11:35,640 INFO L384 CDTParser]: Found 1 translation units. [2023-11-29 00:11:35,641 INFO L180 CDTParser]: Scanning /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_04b19fd4-4e56-40ba-9f43-51779049eebd/sv-benchmarks/c/pthread-wmm/mix035.oepc.i [2023-11-29 00:11:35,658 INFO L427 CDTParser]: About to delete temporary CDT project at /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_04b19fd4-4e56-40ba-9f43-51779049eebd/bin/uautomizer-verify-BQ2R08f2Ya/data/52203cdb7/4da9cf64f6bb43259af6a9e082a92a6b/FLAG66bece258 [2023-11-29 00:11:35,673 INFO L435 CDTParser]: Successfully deleted /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_04b19fd4-4e56-40ba-9f43-51779049eebd/bin/uautomizer-verify-BQ2R08f2Ya/data/52203cdb7/4da9cf64f6bb43259af6a9e082a92a6b [2023-11-29 00:11:35,676 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2023-11-29 00:11:35,678 INFO L133 ToolchainWalker]: Walking toolchain with 6 elements. [2023-11-29 00:11:35,679 INFO L112 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2023-11-29 00:11:35,679 INFO L270 PluginConnector]: Initializing CACSL2BoogieTranslator... [2023-11-29 00:11:35,685 INFO L274 PluginConnector]: CACSL2BoogieTranslator initialized [2023-11-29 00:11:35,685 INFO L184 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 29.11 12:11:35" (1/1) ... [2023-11-29 00:11:35,687 INFO L204 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@76bac193 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 29.11 12:11:35, skipping insertion in model container [2023-11-29 00:11:35,687 INFO L184 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 29.11 12:11:35" (1/1) ... [2023-11-29 00:11:35,744 INFO L177 MainTranslator]: Built tables and reachable declarations [2023-11-29 00:11:36,109 INFO L209 PostProcessor]: Analyzing one entry point: main [2023-11-29 00:11:36,124 INFO L202 MainTranslator]: Completed pre-run [2023-11-29 00:11:36,178 INFO L209 PostProcessor]: Analyzing one entry point: main [2023-11-29 00:11:36,226 WARN L675 CHandler]: The function __VERIFIER_atomic_begin is called, but not defined or handled by StandardFunctionHandler. [2023-11-29 00:11:36,227 WARN L675 CHandler]: The function __VERIFIER_atomic_end is called, but not defined or handled by StandardFunctionHandler. [2023-11-29 00:11:36,234 INFO L206 MainTranslator]: Completed translation [2023-11-29 00:11:36,235 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 29.11 12:11:36 WrapperNode [2023-11-29 00:11:36,235 INFO L131 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2023-11-29 00:11:36,236 INFO L112 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2023-11-29 00:11:36,237 INFO L270 PluginConnector]: Initializing Boogie Procedure Inliner... [2023-11-29 00:11:36,237 INFO L274 PluginConnector]: Boogie Procedure Inliner initialized [2023-11-29 00:11:36,244 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 29.11 12:11:36" (1/1) ... [2023-11-29 00:11:36,284 INFO L184 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 29.11 12:11:36" (1/1) ... [2023-11-29 00:11:36,311 INFO L138 Inliner]: procedures = 179, calls = 59, calls flagged for inlining = 6, calls inlined = 7, statements flattened = 137 [2023-11-29 00:11:36,312 INFO L131 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2023-11-29 00:11:36,313 INFO L112 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2023-11-29 00:11:36,313 INFO L270 PluginConnector]: Initializing Boogie Preprocessor... [2023-11-29 00:11:36,313 INFO L274 PluginConnector]: Boogie Preprocessor initialized [2023-11-29 00:11:36,325 INFO L184 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 29.11 12:11:36" (1/1) ... [2023-11-29 00:11:36,325 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 29.11 12:11:36" (1/1) ... [2023-11-29 00:11:36,330 INFO L184 PluginConnector]: Executing the observer MemorySlicer from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 29.11 12:11:36" (1/1) ... [2023-11-29 00:11:36,349 INFO L175 MemorySlicer]: Split 5 memory accesses to 4 slices as follows [2, 1, 1, 1]. 40 percent of accesses are in the largest equivalence class. The 2 initializations are split as follows [2, 0, 0, 0]. The 3 writes are split as follows [0, 1, 1, 1]. [2023-11-29 00:11:36,349 INFO L184 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 29.11 12:11:36" (1/1) ... [2023-11-29 00:11:36,350 INFO L184 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 29.11 12:11:36" (1/1) ... [2023-11-29 00:11:36,362 INFO L184 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 29.11 12:11:36" (1/1) ... [2023-11-29 00:11:36,364 INFO L184 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 29.11 12:11:36" (1/1) ... [2023-11-29 00:11:36,368 INFO L184 PluginConnector]: Executing the observer LTLStepAnnotator from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 29.11 12:11:36" (1/1) ... [2023-11-29 00:11:36,370 INFO L184 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 29.11 12:11:36" (1/1) ... [2023-11-29 00:11:36,375 INFO L131 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2023-11-29 00:11:36,376 INFO L112 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2023-11-29 00:11:36,376 INFO L270 PluginConnector]: Initializing RCFGBuilder... [2023-11-29 00:11:36,376 INFO L274 PluginConnector]: RCFGBuilder initialized [2023-11-29 00:11:36,377 INFO L184 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 29.11 12:11:36" (1/1) ... [2023-11-29 00:11:36,383 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2023-11-29 00:11:36,399 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_04b19fd4-4e56-40ba-9f43-51779049eebd/bin/uautomizer-verify-BQ2R08f2Ya/z3 [2023-11-29 00:11:36,411 INFO L229 MonitoredProcess]: Starting monitored process 1 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_04b19fd4-4e56-40ba-9f43-51779049eebd/bin/uautomizer-verify-BQ2R08f2Ya/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 (exit command is (exit), workingDir is null) [2023-11-29 00:11:36,425 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_04b19fd4-4e56-40ba-9f43-51779049eebd/bin/uautomizer-verify-BQ2R08f2Ya/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 (1)] Waiting until timeout for monitored process [2023-11-29 00:11:36,451 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_atomic_begin [2023-11-29 00:11:36,451 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2023-11-29 00:11:36,452 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnStack [2023-11-29 00:11:36,452 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.dealloc [2023-11-29 00:11:36,452 INFO L130 BoogieDeclarations]: Found specification of procedure write~intINTTYPE4#0 [2023-11-29 00:11:36,452 INFO L130 BoogieDeclarations]: Found specification of procedure write~intINTTYPE4#1 [2023-11-29 00:11:36,452 INFO L130 BoogieDeclarations]: Found specification of procedure write~intINTTYPE4#2 [2023-11-29 00:11:36,452 INFO L130 BoogieDeclarations]: Found specification of procedure write~intINTTYPE4#3 [2023-11-29 00:11:36,453 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~intINTTYPE1#0 [2023-11-29 00:11:36,453 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~intINTTYPE1#1 [2023-11-29 00:11:36,453 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~intINTTYPE1#2 [2023-11-29 00:11:36,453 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~intINTTYPE1#3 [2023-11-29 00:11:36,453 INFO L130 BoogieDeclarations]: Found specification of procedure P0 [2023-11-29 00:11:36,454 INFO L138 BoogieDeclarations]: Found implementation of procedure P0 [2023-11-29 00:11:36,454 INFO L130 BoogieDeclarations]: Found specification of procedure P1 [2023-11-29 00:11:36,454 INFO L138 BoogieDeclarations]: Found implementation of procedure P1 [2023-11-29 00:11:36,454 INFO L130 BoogieDeclarations]: Found specification of procedure P2 [2023-11-29 00:11:36,454 INFO L138 BoogieDeclarations]: Found implementation of procedure P2 [2023-11-29 00:11:36,455 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_atomic_end [2023-11-29 00:11:36,455 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2023-11-29 00:11:36,455 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2023-11-29 00:11:36,457 WARN L213 CfgBuilder]: User set CodeBlockSize to SequenceOfStatements but program contains fork statements. Overwriting the user preferences and setting CodeBlockSize to OneNontrivialStatement [2023-11-29 00:11:36,620 INFO L241 CfgBuilder]: Building ICFG [2023-11-29 00:11:36,623 INFO L267 CfgBuilder]: Building CFG for each procedure with an implementation [2023-11-29 00:11:36,977 INFO L282 CfgBuilder]: Performing block encoding [2023-11-29 00:11:37,203 INFO L304 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2023-11-29 00:11:37,204 INFO L309 CfgBuilder]: Removed 0 assume(true) statements. [2023-11-29 00:11:37,204 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 29.11 12:11:37 BoogieIcfgContainer [2023-11-29 00:11:37,204 INFO L131 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2023-11-29 00:11:37,207 INFO L112 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2023-11-29 00:11:37,207 INFO L270 PluginConnector]: Initializing TraceAbstraction... [2023-11-29 00:11:37,210 INFO L274 PluginConnector]: TraceAbstraction initialized [2023-11-29 00:11:37,210 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 29.11 12:11:35" (1/3) ... [2023-11-29 00:11:37,211 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@5cc3c183 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 29.11 12:11:37, skipping insertion in model container [2023-11-29 00:11:37,211 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 29.11 12:11:36" (2/3) ... [2023-11-29 00:11:37,211 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@5cc3c183 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 29.11 12:11:37, skipping insertion in model container [2023-11-29 00:11:37,212 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 29.11 12:11:37" (3/3) ... [2023-11-29 00:11:37,213 INFO L112 eAbstractionObserver]: Analyzing ICFG mix035.oepc.i [2023-11-29 00:11:37,232 INFO L203 ceAbstractionStarter]: Automizer settings: Hoare:false NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2023-11-29 00:11:37,232 INFO L162 ceAbstractionStarter]: Applying trace abstraction to program that has 9 error locations. [2023-11-29 00:11:37,232 INFO L514 ceAbstractionStarter]: Constructing petrified ICFG for 1 thread instances. [2023-11-29 00:11:37,299 INFO L144 ThreadInstanceAdder]: Constructed 0 joinOtherThreadTransitions. [2023-11-29 00:11:37,334 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 63 places, 55 transitions, 122 flow [2023-11-29 00:11:37,365 INFO L124 PetriNetUnfolderBase]: 2/52 cut-off events. [2023-11-29 00:11:37,365 INFO L125 PetriNetUnfolderBase]: For 0/0 co-relation queries the response was YES. [2023-11-29 00:11:37,369 INFO L83 FinitePrefix]: Finished finitePrefix Result has 62 conditions, 52 events. 2/52 cut-off events. For 0/0 co-relation queries the response was YES. Maximal size of possible extension queue 5. Compared 105 event pairs, 0 based on Foata normal form. 0/41 useless extension candidates. Maximal degree in co-relation 51. Up to 2 conditions per place. [2023-11-29 00:11:37,369 INFO L82 GeneralOperation]: Start removeDead. Operand has 63 places, 55 transitions, 122 flow [2023-11-29 00:11:37,373 INFO L88 GeneralOperation]: Finished RemoveDead, result has has 60 places, 52 transitions, 113 flow [2023-11-29 00:11:37,384 INFO L356 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2023-11-29 00:11:37,391 INFO L357 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, mHoare=false, mAutomataTypeConcurrency=PETRI_NET, mHoareTripleChecks=INCREMENTAL, mHoareAnnotationPositions=All, 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;@df5c413, mLbeIndependenceSettings=[IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=false, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2023-11-29 00:11:37,391 INFO L358 AbstractCegarLoop]: Starting to check reachability of 13 error locations. [2023-11-29 00:11:37,394 INFO L185 PetriNetUnfolderBase]: Found word, exiting Unfolder. [2023-11-29 00:11:37,394 INFO L124 PetriNetUnfolderBase]: 0/2 cut-off events. [2023-11-29 00:11:37,394 INFO L125 PetriNetUnfolderBase]: For 0/0 co-relation queries the response was YES. [2023-11-29 00:11:37,394 INFO L200 CegarLoopForPetriNet]: Found error trace [2023-11-29 00:11:37,395 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1] [2023-11-29 00:11:37,396 INFO L420 AbstractCegarLoop]: === Iteration 1 === Targeting ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [P0Err0ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 10 more)] === [2023-11-29 00:11:37,400 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-11-29 00:11:37,401 INFO L85 PathProgramCache]: Analyzing trace with hash 12816, now seen corresponding path program 1 times [2023-11-29 00:11:37,413 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2023-11-29 00:11:37,413 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [831944767] [2023-11-29 00:11:37,413 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-11-29 00:11:37,414 INFO L173 SolverBuilder]: Constructing external solver with command: mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2023-11-29 00:11:37,414 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_04b19fd4-4e56-40ba-9f43-51779049eebd/bin/uautomizer-verify-BQ2R08f2Ya/mathsat [2023-11-29 00:11:37,417 INFO L229 MonitoredProcess]: Starting monitored process 2 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_04b19fd4-4e56-40ba-9f43-51779049eebd/bin/uautomizer-verify-BQ2R08f2Ya/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (exit command is (exit), workingDir is null) [2023-11-29 00:11:37,425 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_04b19fd4-4e56-40ba-9f43-51779049eebd/bin/uautomizer-verify-BQ2R08f2Ya/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (2)] Waiting until timeout for monitored process [2023-11-29 00:11:37,521 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 00:11:37,523 INFO L262 TraceCheckSpWp]: Trace formula consists of 53 conjuncts, 3 conjunts are in the unsatisfiable core [2023-11-29 00:11:37,527 INFO L285 TraceCheckSpWp]: Computing forward predicates... [2023-11-29 00:11:37,577 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 6 treesize of output 7 [2023-11-29 00:11:37,588 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-11-29 00:11:37,589 INFO L323 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2023-11-29 00:11:37,589 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2023-11-29 00:11:37,589 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [831944767] [2023-11-29 00:11:37,590 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [831944767] provided 1 perfect and 0 imperfect interpolant sequences [2023-11-29 00:11:37,590 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-11-29 00:11:37,590 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [1] imperfect sequences [] total 1 [2023-11-29 00:11:37,592 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [711617033] [2023-11-29 00:11:37,592 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-11-29 00:11:37,598 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2023-11-29 00:11:37,603 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2023-11-29 00:11:37,625 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2023-11-29 00:11:37,626 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2023-11-29 00:11:37,655 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 28 out of 55 [2023-11-29 00:11:37,657 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 60 places, 52 transitions, 113 flow. Second operand has 3 states, 3 states have (on average 28.666666666666668) internal successors, (86), 3 states have internal predecessors, (86), 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) [2023-11-29 00:11:37,658 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2023-11-29 00:11:37,658 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 28 of 55 [2023-11-29 00:11:37,659 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2023-11-29 00:11:38,209 INFO L124 PetriNetUnfolderBase]: 1057/2068 cut-off events. [2023-11-29 00:11:38,209 INFO L125 PetriNetUnfolderBase]: For 20/20 co-relation queries the response was YES. [2023-11-29 00:11:38,217 INFO L83 FinitePrefix]: Finished finitePrefix Result has 3694 conditions, 2068 events. 1057/2068 cut-off events. For 20/20 co-relation queries the response was YES. Maximal size of possible extension queue 142. Compared 14096 event pairs, 791 based on Foata normal form. 120/1981 useless extension candidates. Maximal degree in co-relation 3680. Up to 1193 conditions per place. [2023-11-29 00:11:38,233 INFO L140 encePairwiseOnDemand]: 50/55 looper letters, 30 selfloop transitions, 2 changer transitions 0/57 dead transitions. [2023-11-29 00:11:38,234 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 60 places, 57 transitions, 187 flow [2023-11-29 00:11:38,235 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2023-11-29 00:11:38,237 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2023-11-29 00:11:38,244 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 119 transitions. [2023-11-29 00:11:38,246 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.7212121212121212 [2023-11-29 00:11:38,247 INFO L72 ComplementDD]: Start complementDD. Operand 3 states and 119 transitions. [2023-11-29 00:11:38,248 INFO L73 IsDeterministic]: Start isDeterministic. Operand 3 states and 119 transitions. [2023-11-29 00:11:38,249 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2023-11-29 00:11:38,251 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 3 states and 119 transitions. [2023-11-29 00:11:38,254 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 4 states, 3 states have (on average 39.666666666666664) internal successors, (119), 3 states have internal predecessors, (119), 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) [2023-11-29 00:11:38,257 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 4 states, 4 states have (on average 55.0) internal successors, (220), 4 states have internal predecessors, (220), 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) [2023-11-29 00:11:38,258 INFO L81 ComplementDD]: Finished complementDD. Result has 4 states, 4 states have (on average 55.0) internal successors, (220), 4 states have internal predecessors, (220), 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) [2023-11-29 00:11:38,260 INFO L175 Difference]: Start difference. First operand has 60 places, 52 transitions, 113 flow. Second operand 3 states and 119 transitions. [2023-11-29 00:11:38,261 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 60 places, 57 transitions, 187 flow [2023-11-29 00:11:38,265 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 57 places, 57 transitions, 184 flow, removed 0 selfloop flow, removed 3 redundant places. [2023-11-29 00:11:38,268 INFO L231 Difference]: Finished difference. Result has 57 places, 48 transitions, 106 flow [2023-11-29 00:11:38,270 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=55, PETRI_DIFFERENCE_MINUEND_FLOW=102, PETRI_DIFFERENCE_MINUEND_PLACES=55, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=48, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=2, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=46, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=106, PETRI_PLACES=57, PETRI_TRANSITIONS=48} [2023-11-29 00:11:38,273 INFO L281 CegarLoopForPetriNet]: 60 programPoint places, -3 predicate places. [2023-11-29 00:11:38,274 INFO L495 AbstractCegarLoop]: Abstraction has has 57 places, 48 transitions, 106 flow [2023-11-29 00:11:38,274 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 28.666666666666668) internal successors, (86), 3 states have internal predecessors, (86), 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) [2023-11-29 00:11:38,274 INFO L200 CegarLoopForPetriNet]: Found error trace [2023-11-29 00:11:38,274 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1] [2023-11-29 00:11:38,281 INFO L540 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_04b19fd4-4e56-40ba-9f43-51779049eebd/bin/uautomizer-verify-BQ2R08f2Ya/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (2)] Forceful destruction successful, exit code 0 [2023-11-29 00:11:38,475 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 2 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_04b19fd4-4e56-40ba-9f43-51779049eebd/bin/uautomizer-verify-BQ2R08f2Ya/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2023-11-29 00:11:38,475 INFO L420 AbstractCegarLoop]: === Iteration 2 === Targeting ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [P0Err0ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 10 more)] === [2023-11-29 00:11:38,476 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-11-29 00:11:38,476 INFO L85 PathProgramCache]: Analyzing trace with hash 12817, now seen corresponding path program 1 times [2023-11-29 00:11:38,477 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2023-11-29 00:11:38,477 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [1366865984] [2023-11-29 00:11:38,477 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-11-29 00:11:38,477 INFO L173 SolverBuilder]: Constructing external solver with command: mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2023-11-29 00:11:38,477 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_04b19fd4-4e56-40ba-9f43-51779049eebd/bin/uautomizer-verify-BQ2R08f2Ya/mathsat [2023-11-29 00:11:38,479 INFO L229 MonitoredProcess]: Starting monitored process 3 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_04b19fd4-4e56-40ba-9f43-51779049eebd/bin/uautomizer-verify-BQ2R08f2Ya/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (exit command is (exit), workingDir is null) [2023-11-29 00:11:38,501 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_04b19fd4-4e56-40ba-9f43-51779049eebd/bin/uautomizer-verify-BQ2R08f2Ya/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (3)] Waiting until timeout for monitored process [2023-11-29 00:11:38,573 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 00:11:38,575 INFO L262 TraceCheckSpWp]: Trace formula consists of 53 conjuncts, 4 conjunts are in the unsatisfiable core [2023-11-29 00:11:38,576 INFO L285 TraceCheckSpWp]: Computing forward predicates... [2023-11-29 00:11:38,586 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 6 treesize of output 5 [2023-11-29 00:11:38,598 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-11-29 00:11:38,599 INFO L323 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2023-11-29 00:11:38,599 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2023-11-29 00:11:38,599 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [1366865984] [2023-11-29 00:11:38,599 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [1366865984] provided 1 perfect and 0 imperfect interpolant sequences [2023-11-29 00:11:38,600 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-11-29 00:11:38,600 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [1] imperfect sequences [] total 1 [2023-11-29 00:11:38,600 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [371498250] [2023-11-29 00:11:38,600 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-11-29 00:11:38,602 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2023-11-29 00:11:38,602 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2023-11-29 00:11:38,602 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2023-11-29 00:11:38,602 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2023-11-29 00:11:38,640 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 29 out of 55 [2023-11-29 00:11:38,640 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 57 places, 48 transitions, 106 flow. Second operand has 3 states, 3 states have (on average 29.666666666666668) internal successors, (89), 3 states have internal predecessors, (89), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-29 00:11:38,641 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2023-11-29 00:11:38,641 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 29 of 55 [2023-11-29 00:11:38,641 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2023-11-29 00:11:39,077 INFO L124 PetriNetUnfolderBase]: 1057/2067 cut-off events. [2023-11-29 00:11:39,077 INFO L125 PetriNetUnfolderBase]: For 60/60 co-relation queries the response was YES. [2023-11-29 00:11:39,083 INFO L83 FinitePrefix]: Finished finitePrefix Result has 3751 conditions, 2067 events. 1057/2067 cut-off events. For 60/60 co-relation queries the response was YES. Maximal size of possible extension queue 142. Compared 14165 event pairs, 791 based on Foata normal form. 1/1861 useless extension candidates. Maximal degree in co-relation 3740. Up to 1192 conditions per place. [2023-11-29 00:11:39,097 INFO L140 encePairwiseOnDemand]: 52/55 looper letters, 29 selfloop transitions, 2 changer transitions 0/56 dead transitions. [2023-11-29 00:11:39,098 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 58 places, 56 transitions, 184 flow [2023-11-29 00:11:39,098 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2023-11-29 00:11:39,098 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2023-11-29 00:11:39,099 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 119 transitions. [2023-11-29 00:11:39,100 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.7212121212121212 [2023-11-29 00:11:39,100 INFO L72 ComplementDD]: Start complementDD. Operand 3 states and 119 transitions. [2023-11-29 00:11:39,100 INFO L73 IsDeterministic]: Start isDeterministic. Operand 3 states and 119 transitions. [2023-11-29 00:11:39,101 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2023-11-29 00:11:39,101 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 3 states and 119 transitions. [2023-11-29 00:11:39,102 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 4 states, 3 states have (on average 39.666666666666664) internal successors, (119), 3 states have internal predecessors, (119), 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) [2023-11-29 00:11:39,103 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 4 states, 4 states have (on average 55.0) internal successors, (220), 4 states have internal predecessors, (220), 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) [2023-11-29 00:11:39,104 INFO L81 ComplementDD]: Finished complementDD. Result has 4 states, 4 states have (on average 55.0) internal successors, (220), 4 states have internal predecessors, (220), 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) [2023-11-29 00:11:39,104 INFO L175 Difference]: Start difference. First operand has 57 places, 48 transitions, 106 flow. Second operand 3 states and 119 transitions. [2023-11-29 00:11:39,104 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 58 places, 56 transitions, 184 flow [2023-11-29 00:11:39,106 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 56 places, 56 transitions, 180 flow, removed 0 selfloop flow, removed 2 redundant places. [2023-11-29 00:11:39,108 INFO L231 Difference]: Finished difference. Result has 56 places, 47 transitions, 104 flow [2023-11-29 00:11:39,108 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=55, PETRI_DIFFERENCE_MINUEND_FLOW=100, PETRI_DIFFERENCE_MINUEND_PLACES=54, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=47, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=2, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=45, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=104, PETRI_PLACES=56, PETRI_TRANSITIONS=47} [2023-11-29 00:11:39,109 INFO L281 CegarLoopForPetriNet]: 60 programPoint places, -4 predicate places. [2023-11-29 00:11:39,109 INFO L495 AbstractCegarLoop]: Abstraction has has 56 places, 47 transitions, 104 flow [2023-11-29 00:11:39,110 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 29.666666666666668) internal successors, (89), 3 states have internal predecessors, (89), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-29 00:11:39,110 INFO L200 CegarLoopForPetriNet]: Found error trace [2023-11-29 00:11:39,110 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1] [2023-11-29 00:11:39,112 INFO L540 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_04b19fd4-4e56-40ba-9f43-51779049eebd/bin/uautomizer-verify-BQ2R08f2Ya/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (3)] Forceful destruction successful, exit code 0 [2023-11-29 00:11:39,310 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 3 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_04b19fd4-4e56-40ba-9f43-51779049eebd/bin/uautomizer-verify-BQ2R08f2Ya/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2023-11-29 00:11:39,311 INFO L420 AbstractCegarLoop]: === Iteration 3 === Targeting ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [P0Err0ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 10 more)] === [2023-11-29 00:11:39,311 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-11-29 00:11:39,311 INFO L85 PathProgramCache]: Analyzing trace with hash 382186169, now seen corresponding path program 1 times [2023-11-29 00:11:39,312 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2023-11-29 00:11:39,312 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [970267414] [2023-11-29 00:11:39,312 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-11-29 00:11:39,312 INFO L173 SolverBuilder]: Constructing external solver with command: mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2023-11-29 00:11:39,313 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_04b19fd4-4e56-40ba-9f43-51779049eebd/bin/uautomizer-verify-BQ2R08f2Ya/mathsat [2023-11-29 00:11:39,314 INFO L229 MonitoredProcess]: Starting monitored process 4 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_04b19fd4-4e56-40ba-9f43-51779049eebd/bin/uautomizer-verify-BQ2R08f2Ya/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (exit command is (exit), workingDir is null) [2023-11-29 00:11:39,314 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_04b19fd4-4e56-40ba-9f43-51779049eebd/bin/uautomizer-verify-BQ2R08f2Ya/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (4)] Waiting until timeout for monitored process [2023-11-29 00:11:39,396 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 00:11:39,398 INFO L262 TraceCheckSpWp]: Trace formula consists of 74 conjuncts, 3 conjunts are in the unsatisfiable core [2023-11-29 00:11:39,399 INFO L285 TraceCheckSpWp]: Computing forward predicates... [2023-11-29 00:11:39,405 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 6 treesize of output 7 [2023-11-29 00:11:39,419 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-11-29 00:11:39,419 INFO L323 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2023-11-29 00:11:39,419 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2023-11-29 00:11:39,419 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [970267414] [2023-11-29 00:11:39,420 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [970267414] provided 1 perfect and 0 imperfect interpolant sequences [2023-11-29 00:11:39,420 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-11-29 00:11:39,420 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2023-11-29 00:11:39,420 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [137952225] [2023-11-29 00:11:39,420 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-11-29 00:11:39,421 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2023-11-29 00:11:39,421 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2023-11-29 00:11:39,422 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2023-11-29 00:11:39,422 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2023-11-29 00:11:39,449 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 28 out of 55 [2023-11-29 00:11:39,449 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 56 places, 47 transitions, 104 flow. Second operand has 3 states, 3 states have (on average 29.333333333333332) internal successors, (88), 3 states have internal predecessors, (88), 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) [2023-11-29 00:11:39,449 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2023-11-29 00:11:39,449 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 28 of 55 [2023-11-29 00:11:39,449 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2023-11-29 00:11:39,826 INFO L124 PetriNetUnfolderBase]: 1061/2066 cut-off events. [2023-11-29 00:11:39,826 INFO L125 PetriNetUnfolderBase]: For 60/60 co-relation queries the response was YES. [2023-11-29 00:11:39,831 INFO L83 FinitePrefix]: Finished finitePrefix Result has 3759 conditions, 2066 events. 1061/2066 cut-off events. For 60/60 co-relation queries the response was YES. Maximal size of possible extension queue 142. Compared 14316 event pairs, 571 based on Foata normal form. 0/1871 useless extension candidates. Maximal degree in co-relation 3748. Up to 1195 conditions per place. [2023-11-29 00:11:39,844 INFO L140 encePairwiseOnDemand]: 52/55 looper letters, 30 selfloop transitions, 2 changer transitions 0/55 dead transitions. [2023-11-29 00:11:39,845 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 57 places, 55 transitions, 184 flow [2023-11-29 00:11:39,845 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2023-11-29 00:11:39,845 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2023-11-29 00:11:39,846 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 117 transitions. [2023-11-29 00:11:39,847 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.7090909090909091 [2023-11-29 00:11:39,847 INFO L72 ComplementDD]: Start complementDD. Operand 3 states and 117 transitions. [2023-11-29 00:11:39,847 INFO L73 IsDeterministic]: Start isDeterministic. Operand 3 states and 117 transitions. [2023-11-29 00:11:39,847 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2023-11-29 00:11:39,848 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 3 states and 117 transitions. [2023-11-29 00:11:39,849 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 4 states, 3 states have (on average 39.0) internal successors, (117), 3 states have internal predecessors, (117), 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) [2023-11-29 00:11:39,850 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 4 states, 4 states have (on average 55.0) internal successors, (220), 4 states have internal predecessors, (220), 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) [2023-11-29 00:11:39,850 INFO L81 ComplementDD]: Finished complementDD. Result has 4 states, 4 states have (on average 55.0) internal successors, (220), 4 states have internal predecessors, (220), 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) [2023-11-29 00:11:39,850 INFO L175 Difference]: Start difference. First operand has 56 places, 47 transitions, 104 flow. Second operand 3 states and 117 transitions. [2023-11-29 00:11:39,850 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 57 places, 55 transitions, 184 flow [2023-11-29 00:11:39,852 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 55 places, 55 transitions, 180 flow, removed 0 selfloop flow, removed 2 redundant places. [2023-11-29 00:11:39,854 INFO L231 Difference]: Finished difference. Result has 55 places, 46 transitions, 102 flow [2023-11-29 00:11:39,854 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=55, PETRI_DIFFERENCE_MINUEND_FLOW=98, PETRI_DIFFERENCE_MINUEND_PLACES=53, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=46, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=2, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=44, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=102, PETRI_PLACES=55, PETRI_TRANSITIONS=46} [2023-11-29 00:11:39,855 INFO L281 CegarLoopForPetriNet]: 60 programPoint places, -5 predicate places. [2023-11-29 00:11:39,855 INFO L495 AbstractCegarLoop]: Abstraction has has 55 places, 46 transitions, 102 flow [2023-11-29 00:11:39,856 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 29.333333333333332) internal successors, (88), 3 states have internal predecessors, (88), 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) [2023-11-29 00:11:39,856 INFO L200 CegarLoopForPetriNet]: Found error trace [2023-11-29 00:11:39,856 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1] [2023-11-29 00:11:39,858 INFO L552 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_04b19fd4-4e56-40ba-9f43-51779049eebd/bin/uautomizer-verify-BQ2R08f2Ya/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (4)] Ended with exit code 0 [2023-11-29 00:11:40,056 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 4 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_04b19fd4-4e56-40ba-9f43-51779049eebd/bin/uautomizer-verify-BQ2R08f2Ya/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2023-11-29 00:11:40,057 INFO L420 AbstractCegarLoop]: === Iteration 4 === Targeting ULTIMATE.startErr3REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [P0Err0ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 10 more)] === [2023-11-29 00:11:40,057 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-11-29 00:11:40,057 INFO L85 PathProgramCache]: Analyzing trace with hash 382186170, now seen corresponding path program 1 times [2023-11-29 00:11:40,058 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2023-11-29 00:11:40,058 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [1364129566] [2023-11-29 00:11:40,058 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-11-29 00:11:40,058 INFO L173 SolverBuilder]: Constructing external solver with command: mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2023-11-29 00:11:40,058 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_04b19fd4-4e56-40ba-9f43-51779049eebd/bin/uautomizer-verify-BQ2R08f2Ya/mathsat [2023-11-29 00:11:40,059 INFO L229 MonitoredProcess]: Starting monitored process 5 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_04b19fd4-4e56-40ba-9f43-51779049eebd/bin/uautomizer-verify-BQ2R08f2Ya/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (exit command is (exit), workingDir is null) [2023-11-29 00:11:40,060 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_04b19fd4-4e56-40ba-9f43-51779049eebd/bin/uautomizer-verify-BQ2R08f2Ya/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (5)] Waiting until timeout for monitored process [2023-11-29 00:11:40,139 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 00:11:40,141 INFO L262 TraceCheckSpWp]: Trace formula consists of 74 conjuncts, 4 conjunts are in the unsatisfiable core [2023-11-29 00:11:40,142 INFO L285 TraceCheckSpWp]: Computing forward predicates... [2023-11-29 00:11:40,150 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 6 treesize of output 5 [2023-11-29 00:11:40,162 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-11-29 00:11:40,162 INFO L323 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2023-11-29 00:11:40,162 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2023-11-29 00:11:40,163 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [1364129566] [2023-11-29 00:11:40,163 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [1364129566] provided 1 perfect and 0 imperfect interpolant sequences [2023-11-29 00:11:40,163 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-11-29 00:11:40,163 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2023-11-29 00:11:40,163 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1053028623] [2023-11-29 00:11:40,163 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-11-29 00:11:40,163 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2023-11-29 00:11:40,164 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2023-11-29 00:11:40,164 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2023-11-29 00:11:40,164 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2023-11-29 00:11:40,192 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 29 out of 55 [2023-11-29 00:11:40,193 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 55 places, 46 transitions, 102 flow. Second operand has 3 states, 3 states have (on average 30.333333333333332) internal successors, (91), 3 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) [2023-11-29 00:11:40,193 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2023-11-29 00:11:40,193 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 29 of 55 [2023-11-29 00:11:40,193 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2023-11-29 00:11:40,545 INFO L124 PetriNetUnfolderBase]: 1057/2033 cut-off events. [2023-11-29 00:11:40,545 INFO L125 PetriNetUnfolderBase]: For 64/64 co-relation queries the response was YES. [2023-11-29 00:11:40,549 INFO L83 FinitePrefix]: Finished finitePrefix Result has 3721 conditions, 2033 events. 1057/2033 cut-off events. For 64/64 co-relation queries the response was YES. Maximal size of possible extension queue 141. Compared 14137 event pairs, 811 based on Foata normal form. 5/1849 useless extension candidates. Maximal degree in co-relation 3711. Up to 1186 conditions per place. [2023-11-29 00:11:40,563 INFO L140 encePairwiseOnDemand]: 52/55 looper letters, 29 selfloop transitions, 2 changer transitions 0/54 dead transitions. [2023-11-29 00:11:40,563 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 56 places, 54 transitions, 180 flow [2023-11-29 00:11:40,564 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2023-11-29 00:11:40,564 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2023-11-29 00:11:40,565 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 119 transitions. [2023-11-29 00:11:40,565 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.7212121212121212 [2023-11-29 00:11:40,565 INFO L72 ComplementDD]: Start complementDD. Operand 3 states and 119 transitions. [2023-11-29 00:11:40,565 INFO L73 IsDeterministic]: Start isDeterministic. Operand 3 states and 119 transitions. [2023-11-29 00:11:40,566 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2023-11-29 00:11:40,566 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 3 states and 119 transitions. [2023-11-29 00:11:40,567 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 4 states, 3 states have (on average 39.666666666666664) internal successors, (119), 3 states have internal predecessors, (119), 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) [2023-11-29 00:11:40,568 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 4 states, 4 states have (on average 55.0) internal successors, (220), 4 states have internal predecessors, (220), 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) [2023-11-29 00:11:40,568 INFO L81 ComplementDD]: Finished complementDD. Result has 4 states, 4 states have (on average 55.0) internal successors, (220), 4 states have internal predecessors, (220), 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) [2023-11-29 00:11:40,568 INFO L175 Difference]: Start difference. First operand has 55 places, 46 transitions, 102 flow. Second operand 3 states and 119 transitions. [2023-11-29 00:11:40,568 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 56 places, 54 transitions, 180 flow [2023-11-29 00:11:40,570 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 54 places, 54 transitions, 176 flow, removed 0 selfloop flow, removed 2 redundant places. [2023-11-29 00:11:40,572 INFO L231 Difference]: Finished difference. Result has 54 places, 45 transitions, 100 flow [2023-11-29 00:11:40,572 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=55, PETRI_DIFFERENCE_MINUEND_FLOW=96, PETRI_DIFFERENCE_MINUEND_PLACES=52, 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=3, PETRI_FLOW=100, PETRI_PLACES=54, PETRI_TRANSITIONS=45} [2023-11-29 00:11:40,573 INFO L281 CegarLoopForPetriNet]: 60 programPoint places, -6 predicate places. [2023-11-29 00:11:40,573 INFO L495 AbstractCegarLoop]: Abstraction has has 54 places, 45 transitions, 100 flow [2023-11-29 00:11:40,573 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 30.333333333333332) internal successors, (91), 3 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) [2023-11-29 00:11:40,573 INFO L200 CegarLoopForPetriNet]: Found error trace [2023-11-29 00:11:40,573 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1] [2023-11-29 00:11:40,576 INFO L552 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_04b19fd4-4e56-40ba-9f43-51779049eebd/bin/uautomizer-verify-BQ2R08f2Ya/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (5)] Ended with exit code 0 [2023-11-29 00:11:40,774 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 5 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_04b19fd4-4e56-40ba-9f43-51779049eebd/bin/uautomizer-verify-BQ2R08f2Ya/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2023-11-29 00:11:40,774 INFO L420 AbstractCegarLoop]: === Iteration 5 === Targeting P0Err0ASSERT_VIOLATIONMEMORY_LEAK === [P0Err0ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 10 more)] === [2023-11-29 00:11:40,774 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-11-29 00:11:40,775 INFO L85 PathProgramCache]: Analyzing trace with hash 382187029, now seen corresponding path program 1 times [2023-11-29 00:11:40,775 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2023-11-29 00:11:40,775 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [1135166219] [2023-11-29 00:11:40,775 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-11-29 00:11:40,775 INFO L173 SolverBuilder]: Constructing external solver with command: mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2023-11-29 00:11:40,775 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_04b19fd4-4e56-40ba-9f43-51779049eebd/bin/uautomizer-verify-BQ2R08f2Ya/mathsat [2023-11-29 00:11:40,776 INFO L229 MonitoredProcess]: Starting monitored process 6 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_04b19fd4-4e56-40ba-9f43-51779049eebd/bin/uautomizer-verify-BQ2R08f2Ya/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (exit command is (exit), workingDir is null) [2023-11-29 00:11:40,777 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_04b19fd4-4e56-40ba-9f43-51779049eebd/bin/uautomizer-verify-BQ2R08f2Ya/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (6)] Waiting until timeout for monitored process [2023-11-29 00:11:40,846 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 00:11:40,848 INFO L262 TraceCheckSpWp]: Trace formula consists of 72 conjuncts, 5 conjunts are in the unsatisfiable core [2023-11-29 00:11:40,849 INFO L285 TraceCheckSpWp]: Computing forward predicates... [2023-11-29 00:11:40,859 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-11-29 00:11:40,859 INFO L323 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2023-11-29 00:11:40,860 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2023-11-29 00:11:40,860 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [1135166219] [2023-11-29 00:11:40,860 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [1135166219] provided 1 perfect and 0 imperfect interpolant sequences [2023-11-29 00:11:40,860 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-11-29 00:11:40,860 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [1] imperfect sequences [] total 1 [2023-11-29 00:11:40,860 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1527801722] [2023-11-29 00:11:40,861 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-11-29 00:11:40,861 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2023-11-29 00:11:40,861 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2023-11-29 00:11:40,861 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2023-11-29 00:11:40,861 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2023-11-29 00:11:40,862 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 30 out of 55 [2023-11-29 00:11:40,862 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 54 places, 45 transitions, 100 flow. Second operand has 3 states, 3 states have (on average 31.0) internal successors, (93), 3 states have internal predecessors, (93), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-29 00:11:40,862 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2023-11-29 00:11:40,862 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 30 of 55 [2023-11-29 00:11:40,863 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2023-11-29 00:11:41,119 INFO L124 PetriNetUnfolderBase]: 825/1470 cut-off events. [2023-11-29 00:11:41,119 INFO L125 PetriNetUnfolderBase]: For 51/51 co-relation queries the response was YES. [2023-11-29 00:11:41,122 INFO L83 FinitePrefix]: Finished finitePrefix Result has 2801 conditions, 1470 events. 825/1470 cut-off events. For 51/51 co-relation queries the response was YES. Maximal size of possible extension queue 106. Compared 8733 event pairs, 457 based on Foata normal form. 0/1448 useless extension candidates. Maximal degree in co-relation 2791. Up to 1009 conditions per place. [2023-11-29 00:11:41,128 INFO L140 encePairwiseOnDemand]: 52/55 looper letters, 33 selfloop transitions, 2 changer transitions 2/60 dead transitions. [2023-11-29 00:11:41,129 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 55 places, 60 transitions, 212 flow [2023-11-29 00:11:41,129 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2023-11-29 00:11:41,129 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2023-11-29 00:11:41,130 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 128 transitions. [2023-11-29 00:11:41,130 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.7757575757575758 [2023-11-29 00:11:41,130 INFO L72 ComplementDD]: Start complementDD. Operand 3 states and 128 transitions. [2023-11-29 00:11:41,131 INFO L73 IsDeterministic]: Start isDeterministic. Operand 3 states and 128 transitions. [2023-11-29 00:11:41,131 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2023-11-29 00:11:41,131 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 3 states and 128 transitions. [2023-11-29 00:11:41,132 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 4 states, 3 states have (on average 42.666666666666664) internal successors, (128), 3 states have internal predecessors, (128), 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) [2023-11-29 00:11:41,133 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 4 states, 4 states have (on average 55.0) internal successors, (220), 4 states have internal predecessors, (220), 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) [2023-11-29 00:11:41,133 INFO L81 ComplementDD]: Finished complementDD. Result has 4 states, 4 states have (on average 55.0) internal successors, (220), 4 states have internal predecessors, (220), 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) [2023-11-29 00:11:41,133 INFO L175 Difference]: Start difference. First operand has 54 places, 45 transitions, 100 flow. Second operand 3 states and 128 transitions. [2023-11-29 00:11:41,133 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 55 places, 60 transitions, 212 flow [2023-11-29 00:11:41,135 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 53 places, 60 transitions, 204 flow, removed 0 selfloop flow, removed 2 redundant places. [2023-11-29 00:11:41,136 INFO L231 Difference]: Finished difference. Result has 53 places, 43 transitions, 96 flow [2023-11-29 00:11:41,136 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=55, PETRI_DIFFERENCE_MINUEND_FLOW=94, PETRI_DIFFERENCE_MINUEND_PLACES=51, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=44, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=2, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=42, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=96, PETRI_PLACES=53, PETRI_TRANSITIONS=43} [2023-11-29 00:11:41,137 INFO L281 CegarLoopForPetriNet]: 60 programPoint places, -7 predicate places. [2023-11-29 00:11:41,137 INFO L495 AbstractCegarLoop]: Abstraction has has 53 places, 43 transitions, 96 flow [2023-11-29 00:11:41,138 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 31.0) internal successors, (93), 3 states have internal predecessors, (93), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-29 00:11:41,138 INFO L200 CegarLoopForPetriNet]: Found error trace [2023-11-29 00:11:41,138 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1] [2023-11-29 00:11:41,141 INFO L540 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_04b19fd4-4e56-40ba-9f43-51779049eebd/bin/uautomizer-verify-BQ2R08f2Ya/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (6)] Forceful destruction successful, exit code 0 [2023-11-29 00:11:41,340 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 6 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_04b19fd4-4e56-40ba-9f43-51779049eebd/bin/uautomizer-verify-BQ2R08f2Ya/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2023-11-29 00:11:41,340 INFO L420 AbstractCegarLoop]: === Iteration 6 === Targeting ULTIMATE.startErr4REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [P0Err0ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 10 more)] === [2023-11-29 00:11:41,341 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-11-29 00:11:41,341 INFO L85 PathProgramCache]: Analyzing trace with hash -249752606, now seen corresponding path program 1 times [2023-11-29 00:11:41,341 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2023-11-29 00:11:41,341 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [979603125] [2023-11-29 00:11:41,341 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-11-29 00:11:41,342 INFO L173 SolverBuilder]: Constructing external solver with command: mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2023-11-29 00:11:41,342 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_04b19fd4-4e56-40ba-9f43-51779049eebd/bin/uautomizer-verify-BQ2R08f2Ya/mathsat [2023-11-29 00:11:41,343 INFO L229 MonitoredProcess]: Starting monitored process 7 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_04b19fd4-4e56-40ba-9f43-51779049eebd/bin/uautomizer-verify-BQ2R08f2Ya/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (exit command is (exit), workingDir is null) [2023-11-29 00:11:41,343 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_04b19fd4-4e56-40ba-9f43-51779049eebd/bin/uautomizer-verify-BQ2R08f2Ya/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (7)] Waiting until timeout for monitored process [2023-11-29 00:11:41,426 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 00:11:41,428 INFO L262 TraceCheckSpWp]: Trace formula consists of 96 conjuncts, 3 conjunts are in the unsatisfiable core [2023-11-29 00:11:41,430 INFO L285 TraceCheckSpWp]: Computing forward predicates... [2023-11-29 00:11:41,437 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 6 treesize of output 7 [2023-11-29 00:11:41,443 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-11-29 00:11:41,443 INFO L323 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2023-11-29 00:11:41,443 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2023-11-29 00:11:41,443 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [979603125] [2023-11-29 00:11:41,444 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [979603125] provided 1 perfect and 0 imperfect interpolant sequences [2023-11-29 00:11:41,444 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-11-29 00:11:41,444 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2023-11-29 00:11:41,444 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1121266357] [2023-11-29 00:11:41,444 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-11-29 00:11:41,444 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2023-11-29 00:11:41,445 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2023-11-29 00:11:41,445 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2023-11-29 00:11:41,445 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2023-11-29 00:11:41,474 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 28 out of 55 [2023-11-29 00:11:41,474 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 53 places, 43 transitions, 96 flow. Second operand has 3 states, 3 states have (on average 30.0) internal successors, (90), 3 states have internal predecessors, (90), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-29 00:11:41,474 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2023-11-29 00:11:41,474 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 28 of 55 [2023-11-29 00:11:41,474 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2023-11-29 00:11:41,719 INFO L124 PetriNetUnfolderBase]: 738/1479 cut-off events. [2023-11-29 00:11:41,719 INFO L125 PetriNetUnfolderBase]: For 95/95 co-relation queries the response was YES. [2023-11-29 00:11:41,721 INFO L83 FinitePrefix]: Finished finitePrefix Result has 2731 conditions, 1479 events. 738/1479 cut-off events. For 95/95 co-relation queries the response was YES. Maximal size of possible extension queue 104. Compared 9667 event pairs, 260 based on Foata normal form. 0/1432 useless extension candidates. Maximal degree in co-relation 2720. Up to 934 conditions per place. [2023-11-29 00:11:41,728 INFO L140 encePairwiseOnDemand]: 52/55 looper letters, 27 selfloop transitions, 2 changer transitions 0/50 dead transitions. [2023-11-29 00:11:41,728 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 53 places, 50 transitions, 170 flow [2023-11-29 00:11:41,729 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2023-11-29 00:11:41,729 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2023-11-29 00:11:41,729 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 114 transitions. [2023-11-29 00:11:41,730 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.6909090909090909 [2023-11-29 00:11:41,730 INFO L72 ComplementDD]: Start complementDD. Operand 3 states and 114 transitions. [2023-11-29 00:11:41,730 INFO L73 IsDeterministic]: Start isDeterministic. Operand 3 states and 114 transitions. [2023-11-29 00:11:41,730 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2023-11-29 00:11:41,730 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 3 states and 114 transitions. [2023-11-29 00:11:41,730 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 4 states, 3 states have (on average 38.0) internal successors, (114), 3 states have internal predecessors, (114), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-29 00:11:41,731 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 4 states, 4 states have (on average 55.0) internal successors, (220), 4 states have internal predecessors, (220), 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) [2023-11-29 00:11:41,732 INFO L81 ComplementDD]: Finished complementDD. Result has 4 states, 4 states have (on average 55.0) internal successors, (220), 4 states have internal predecessors, (220), 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) [2023-11-29 00:11:41,732 INFO L175 Difference]: Start difference. First operand has 53 places, 43 transitions, 96 flow. Second operand 3 states and 114 transitions. [2023-11-29 00:11:41,732 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 53 places, 50 transitions, 170 flow [2023-11-29 00:11:41,733 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 51 places, 50 transitions, 164 flow, removed 0 selfloop flow, removed 2 redundant places. [2023-11-29 00:11:41,734 INFO L231 Difference]: Finished difference. Result has 51 places, 42 transitions, 94 flow [2023-11-29 00:11:41,734 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=55, PETRI_DIFFERENCE_MINUEND_FLOW=90, PETRI_DIFFERENCE_MINUEND_PLACES=49, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=42, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=2, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=40, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=94, PETRI_PLACES=51, PETRI_TRANSITIONS=42} [2023-11-29 00:11:41,735 INFO L281 CegarLoopForPetriNet]: 60 programPoint places, -9 predicate places. [2023-11-29 00:11:41,735 INFO L495 AbstractCegarLoop]: Abstraction has has 51 places, 42 transitions, 94 flow [2023-11-29 00:11:41,736 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 30.0) internal successors, (90), 3 states have internal predecessors, (90), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-29 00:11:41,736 INFO L200 CegarLoopForPetriNet]: Found error trace [2023-11-29 00:11:41,736 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1] [2023-11-29 00:11:41,738 INFO L552 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_04b19fd4-4e56-40ba-9f43-51779049eebd/bin/uautomizer-verify-BQ2R08f2Ya/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (7)] Ended with exit code 0 [2023-11-29 00:11:41,938 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 7 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_04b19fd4-4e56-40ba-9f43-51779049eebd/bin/uautomizer-verify-BQ2R08f2Ya/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2023-11-29 00:11:41,939 INFO L420 AbstractCegarLoop]: === Iteration 7 === Targeting ULTIMATE.startErr5REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [P0Err0ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 10 more)] === [2023-11-29 00:11:41,939 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-11-29 00:11:41,939 INFO L85 PathProgramCache]: Analyzing trace with hash -249752605, now seen corresponding path program 1 times [2023-11-29 00:11:41,939 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2023-11-29 00:11:41,940 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [48040602] [2023-11-29 00:11:41,940 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-11-29 00:11:41,940 INFO L173 SolverBuilder]: Constructing external solver with command: mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2023-11-29 00:11:41,940 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_04b19fd4-4e56-40ba-9f43-51779049eebd/bin/uautomizer-verify-BQ2R08f2Ya/mathsat [2023-11-29 00:11:41,941 INFO L229 MonitoredProcess]: Starting monitored process 8 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_04b19fd4-4e56-40ba-9f43-51779049eebd/bin/uautomizer-verify-BQ2R08f2Ya/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (exit command is (exit), workingDir is null) [2023-11-29 00:11:41,941 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_04b19fd4-4e56-40ba-9f43-51779049eebd/bin/uautomizer-verify-BQ2R08f2Ya/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (8)] Waiting until timeout for monitored process [2023-11-29 00:11:42,020 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 00:11:42,023 INFO L262 TraceCheckSpWp]: Trace formula consists of 96 conjuncts, 4 conjunts are in the unsatisfiable core [2023-11-29 00:11:42,025 INFO L285 TraceCheckSpWp]: Computing forward predicates... [2023-11-29 00:11:42,033 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 6 treesize of output 5 [2023-11-29 00:11:42,046 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-11-29 00:11:42,046 INFO L323 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2023-11-29 00:11:42,046 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2023-11-29 00:11:42,046 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [48040602] [2023-11-29 00:11:42,046 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [48040602] provided 1 perfect and 0 imperfect interpolant sequences [2023-11-29 00:11:42,047 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-11-29 00:11:42,047 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2023-11-29 00:11:42,047 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1233167682] [2023-11-29 00:11:42,047 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-11-29 00:11:42,047 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2023-11-29 00:11:42,047 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2023-11-29 00:11:42,048 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2023-11-29 00:11:42,048 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2023-11-29 00:11:42,085 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 29 out of 55 [2023-11-29 00:11:42,086 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 51 places, 42 transitions, 94 flow. Second operand has 3 states, 3 states have (on average 31.0) internal successors, (93), 3 states have internal predecessors, (93), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-29 00:11:42,086 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2023-11-29 00:11:42,086 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 29 of 55 [2023-11-29 00:11:42,086 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2023-11-29 00:11:42,340 INFO L124 PetriNetUnfolderBase]: 721/1422 cut-off events. [2023-11-29 00:11:42,340 INFO L125 PetriNetUnfolderBase]: For 56/56 co-relation queries the response was YES. [2023-11-29 00:11:42,343 INFO L83 FinitePrefix]: Finished finitePrefix Result has 2609 conditions, 1422 events. 721/1422 cut-off events. For 56/56 co-relation queries the response was YES. Maximal size of possible extension queue 104. Compared 9140 event pairs, 340 based on Foata normal form. 12/1391 useless extension candidates. Maximal degree in co-relation 2599. Up to 905 conditions per place. [2023-11-29 00:11:42,349 INFO L140 encePairwiseOnDemand]: 52/55 looper letters, 26 selfloop transitions, 2 changer transitions 0/49 dead transitions. [2023-11-29 00:11:42,349 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 52 places, 49 transitions, 164 flow [2023-11-29 00:11:42,350 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2023-11-29 00:11:42,350 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2023-11-29 00:11:42,350 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 116 transitions. [2023-11-29 00:11:42,351 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.703030303030303 [2023-11-29 00:11:42,351 INFO L72 ComplementDD]: Start complementDD. Operand 3 states and 116 transitions. [2023-11-29 00:11:42,351 INFO L73 IsDeterministic]: Start isDeterministic. Operand 3 states and 116 transitions. [2023-11-29 00:11:42,351 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2023-11-29 00:11:42,351 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 3 states and 116 transitions. [2023-11-29 00:11:42,352 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 4 states, 3 states have (on average 38.666666666666664) internal successors, (116), 3 states have internal predecessors, (116), 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) [2023-11-29 00:11:42,352 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 4 states, 4 states have (on average 55.0) internal successors, (220), 4 states have internal predecessors, (220), 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) [2023-11-29 00:11:42,353 INFO L81 ComplementDD]: Finished complementDD. Result has 4 states, 4 states have (on average 55.0) internal successors, (220), 4 states have internal predecessors, (220), 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) [2023-11-29 00:11:42,353 INFO L175 Difference]: Start difference. First operand has 51 places, 42 transitions, 94 flow. Second operand 3 states and 116 transitions. [2023-11-29 00:11:42,353 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 52 places, 49 transitions, 164 flow [2023-11-29 00:11:42,354 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 50 places, 49 transitions, 160 flow, removed 0 selfloop flow, removed 2 redundant places. [2023-11-29 00:11:42,355 INFO L231 Difference]: Finished difference. Result has 50 places, 41 transitions, 92 flow [2023-11-29 00:11:42,355 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=55, PETRI_DIFFERENCE_MINUEND_FLOW=88, PETRI_DIFFERENCE_MINUEND_PLACES=48, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=41, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=2, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=39, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=92, PETRI_PLACES=50, PETRI_TRANSITIONS=41} [2023-11-29 00:11:42,356 INFO L281 CegarLoopForPetriNet]: 60 programPoint places, -10 predicate places. [2023-11-29 00:11:42,356 INFO L495 AbstractCegarLoop]: Abstraction has has 50 places, 41 transitions, 92 flow [2023-11-29 00:11:42,356 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 31.0) internal successors, (93), 3 states have internal predecessors, (93), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-29 00:11:42,356 INFO L200 CegarLoopForPetriNet]: Found error trace [2023-11-29 00:11:42,356 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-11-29 00:11:42,359 INFO L552 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_04b19fd4-4e56-40ba-9f43-51779049eebd/bin/uautomizer-verify-BQ2R08f2Ya/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (8)] Ended with exit code 0 [2023-11-29 00:11:42,557 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 8 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_04b19fd4-4e56-40ba-9f43-51779049eebd/bin/uautomizer-verify-BQ2R08f2Ya/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2023-11-29 00:11:42,557 INFO L420 AbstractCegarLoop]: === Iteration 8 === Targeting ULTIMATE.startErr7ASSERT_VIOLATIONMEMORY_LEAK === [P0Err0ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 10 more)] === [2023-11-29 00:11:42,557 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-11-29 00:11:42,557 INFO L85 PathProgramCache]: Analyzing trace with hash -1909112867, now seen corresponding path program 1 times [2023-11-29 00:11:42,558 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2023-11-29 00:11:42,558 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [2096789353] [2023-11-29 00:11:42,558 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-11-29 00:11:42,558 INFO L173 SolverBuilder]: Constructing external solver with command: mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2023-11-29 00:11:42,558 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_04b19fd4-4e56-40ba-9f43-51779049eebd/bin/uautomizer-verify-BQ2R08f2Ya/mathsat [2023-11-29 00:11:42,559 INFO L229 MonitoredProcess]: Starting monitored process 9 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_04b19fd4-4e56-40ba-9f43-51779049eebd/bin/uautomizer-verify-BQ2R08f2Ya/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (exit command is (exit), workingDir is null) [2023-11-29 00:11:42,560 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_04b19fd4-4e56-40ba-9f43-51779049eebd/bin/uautomizer-verify-BQ2R08f2Ya/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (9)] Waiting until timeout for monitored process [2023-11-29 00:11:42,637 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 00:11:42,640 INFO L262 TraceCheckSpWp]: Trace formula consists of 126 conjuncts, 3 conjunts are in the unsatisfiable core [2023-11-29 00:11:42,641 INFO L285 TraceCheckSpWp]: Computing forward predicates... [2023-11-29 00:11:42,674 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-11-29 00:11:42,674 INFO L323 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2023-11-29 00:11:42,675 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2023-11-29 00:11:42,675 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [2096789353] [2023-11-29 00:11:42,675 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [2096789353] provided 1 perfect and 0 imperfect interpolant sequences [2023-11-29 00:11:42,675 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-11-29 00:11:42,675 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2023-11-29 00:11:42,676 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1435932013] [2023-11-29 00:11:42,676 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-11-29 00:11:42,676 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2023-11-29 00:11:42,676 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2023-11-29 00:11:42,677 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2023-11-29 00:11:42,677 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2023-11-29 00:11:42,687 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 26 out of 55 [2023-11-29 00:11:42,687 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 50 places, 41 transitions, 92 flow. Second operand has 4 states, 4 states have (on average 29.0) internal successors, (116), 4 states have internal predecessors, (116), 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) [2023-11-29 00:11:42,687 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2023-11-29 00:11:42,687 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 26 of 55 [2023-11-29 00:11:42,688 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2023-11-29 00:11:43,046 INFO L124 PetriNetUnfolderBase]: 1680/2978 cut-off events. [2023-11-29 00:11:43,047 INFO L125 PetriNetUnfolderBase]: For 99/99 co-relation queries the response was YES. [2023-11-29 00:11:43,051 INFO L83 FinitePrefix]: Finished finitePrefix Result has 5658 conditions, 2978 events. 1680/2978 cut-off events. For 99/99 co-relation queries the response was YES. Maximal size of possible extension queue 185. Compared 19595 event pairs, 188 based on Foata normal form. 100/3022 useless extension candidates. Maximal degree in co-relation 5648. Up to 1579 conditions per place. [2023-11-29 00:11:43,063 INFO L140 encePairwiseOnDemand]: 49/55 looper letters, 43 selfloop transitions, 5 changer transitions 1/66 dead transitions. [2023-11-29 00:11:43,063 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 53 places, 66 transitions, 246 flow [2023-11-29 00:11:43,064 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2023-11-29 00:11:43,064 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 4 states. [2023-11-29 00:11:43,065 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 155 transitions. [2023-11-29 00:11:43,065 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.7045454545454546 [2023-11-29 00:11:43,065 INFO L72 ComplementDD]: Start complementDD. Operand 4 states and 155 transitions. [2023-11-29 00:11:43,065 INFO L73 IsDeterministic]: Start isDeterministic. Operand 4 states and 155 transitions. [2023-11-29 00:11:43,065 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2023-11-29 00:11:43,065 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 4 states and 155 transitions. [2023-11-29 00:11:43,066 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 5 states, 4 states have (on average 38.75) internal successors, (155), 4 states have internal predecessors, (155), 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) [2023-11-29 00:11:43,066 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 5 states, 5 states have (on average 55.0) internal successors, (275), 5 states have internal predecessors, (275), 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) [2023-11-29 00:11:43,067 INFO L81 ComplementDD]: Finished complementDD. Result has 5 states, 5 states have (on average 55.0) internal successors, (275), 5 states have internal predecessors, (275), 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) [2023-11-29 00:11:43,067 INFO L175 Difference]: Start difference. First operand has 50 places, 41 transitions, 92 flow. Second operand 4 states and 155 transitions. [2023-11-29 00:11:43,067 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 53 places, 66 transitions, 246 flow [2023-11-29 00:11:43,069 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 51 places, 66 transitions, 240 flow, removed 0 selfloop flow, removed 2 redundant places. [2023-11-29 00:11:43,070 INFO L231 Difference]: Finished difference. Result has 53 places, 44 transitions, 122 flow [2023-11-29 00:11:43,071 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=55, PETRI_DIFFERENCE_MINUEND_FLOW=88, PETRI_DIFFERENCE_MINUEND_PLACES=48, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=41, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=2, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=36, PETRI_DIFFERENCE_SUBTRAHEND_STATES=4, PETRI_FLOW=122, PETRI_PLACES=53, PETRI_TRANSITIONS=44} [2023-11-29 00:11:43,071 INFO L281 CegarLoopForPetriNet]: 60 programPoint places, -7 predicate places. [2023-11-29 00:11:43,071 INFO L495 AbstractCegarLoop]: Abstraction has has 53 places, 44 transitions, 122 flow [2023-11-29 00:11:43,072 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 29.0) internal successors, (116), 4 states have internal predecessors, (116), 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) [2023-11-29 00:11:43,072 INFO L200 CegarLoopForPetriNet]: Found error trace [2023-11-29 00:11:43,072 INFO L208 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] [2023-11-29 00:11:43,075 INFO L552 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_04b19fd4-4e56-40ba-9f43-51779049eebd/bin/uautomizer-verify-BQ2R08f2Ya/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (9)] Ended with exit code 0 [2023-11-29 00:11:43,274 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 9 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_04b19fd4-4e56-40ba-9f43-51779049eebd/bin/uautomizer-verify-BQ2R08f2Ya/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2023-11-29 00:11:43,275 INFO L420 AbstractCegarLoop]: === Iteration 9 === Targeting ULTIMATE.startErr7ASSERT_VIOLATIONMEMORY_LEAK === [P0Err0ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 10 more)] === [2023-11-29 00:11:43,275 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-11-29 00:11:43,275 INFO L85 PathProgramCache]: Analyzing trace with hash -717898460, now seen corresponding path program 1 times [2023-11-29 00:11:43,275 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2023-11-29 00:11:43,276 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [685259512] [2023-11-29 00:11:43,276 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-11-29 00:11:43,276 INFO L173 SolverBuilder]: Constructing external solver with command: mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2023-11-29 00:11:43,276 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_04b19fd4-4e56-40ba-9f43-51779049eebd/bin/uautomizer-verify-BQ2R08f2Ya/mathsat [2023-11-29 00:11:43,277 INFO L229 MonitoredProcess]: Starting monitored process 10 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_04b19fd4-4e56-40ba-9f43-51779049eebd/bin/uautomizer-verify-BQ2R08f2Ya/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (exit command is (exit), workingDir is null) [2023-11-29 00:11:43,278 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_04b19fd4-4e56-40ba-9f43-51779049eebd/bin/uautomizer-verify-BQ2R08f2Ya/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (10)] Waiting until timeout for monitored process [2023-11-29 00:11:43,383 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 00:11:43,387 INFO L262 TraceCheckSpWp]: Trace formula consists of 147 conjuncts, 4 conjunts are in the unsatisfiable core [2023-11-29 00:11:43,389 INFO L285 TraceCheckSpWp]: Computing forward predicates... [2023-11-29 00:11:43,441 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-11-29 00:11:43,441 INFO L323 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2023-11-29 00:11:43,441 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2023-11-29 00:11:43,441 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [685259512] [2023-11-29 00:11:43,441 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [685259512] provided 1 perfect and 0 imperfect interpolant sequences [2023-11-29 00:11:43,442 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-11-29 00:11:43,442 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2023-11-29 00:11:43,442 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1553948705] [2023-11-29 00:11:43,442 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-11-29 00:11:43,442 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2023-11-29 00:11:43,443 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2023-11-29 00:11:43,443 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2023-11-29 00:11:43,443 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2023-11-29 00:11:43,450 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 26 out of 55 [2023-11-29 00:11:43,451 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 53 places, 44 transitions, 122 flow. Second operand has 5 states, 5 states have (on average 29.0) internal successors, (145), 5 states have internal predecessors, (145), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-29 00:11:43,451 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2023-11-29 00:11:43,451 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 26 of 55 [2023-11-29 00:11:43,451 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2023-11-29 00:11:43,780 INFO L124 PetriNetUnfolderBase]: 1038/1856 cut-off events. [2023-11-29 00:11:43,780 INFO L125 PetriNetUnfolderBase]: For 435/435 co-relation queries the response was YES. [2023-11-29 00:11:43,783 INFO L83 FinitePrefix]: Finished finitePrefix Result has 4089 conditions, 1856 events. 1038/1856 cut-off events. For 435/435 co-relation queries the response was YES. Maximal size of possible extension queue 89. Compared 10625 event pairs, 100 based on Foata normal form. 82/1891 useless extension candidates. Maximal degree in co-relation 4076. Up to 697 conditions per place. [2023-11-29 00:11:43,790 INFO L140 encePairwiseOnDemand]: 49/55 looper letters, 54 selfloop transitions, 8 changer transitions 1/80 dead transitions. [2023-11-29 00:11:43,790 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 57 places, 80 transitions, 341 flow [2023-11-29 00:11:43,791 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2023-11-29 00:11:43,791 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 5 states. [2023-11-29 00:11:43,792 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 195 transitions. [2023-11-29 00:11:43,792 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.7090909090909091 [2023-11-29 00:11:43,792 INFO L72 ComplementDD]: Start complementDD. Operand 5 states and 195 transitions. [2023-11-29 00:11:43,792 INFO L73 IsDeterministic]: Start isDeterministic. Operand 5 states and 195 transitions. [2023-11-29 00:11:43,793 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2023-11-29 00:11:43,793 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 5 states and 195 transitions. [2023-11-29 00:11:43,794 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 6 states, 5 states have (on average 39.0) internal successors, (195), 5 states have internal predecessors, (195), 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) [2023-11-29 00:11:43,795 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 6 states, 6 states have (on average 55.0) internal successors, (330), 6 states have internal predecessors, (330), 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) [2023-11-29 00:11:43,795 INFO L81 ComplementDD]: Finished complementDD. Result has 6 states, 6 states have (on average 55.0) internal successors, (330), 6 states have internal predecessors, (330), 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) [2023-11-29 00:11:43,795 INFO L175 Difference]: Start difference. First operand has 53 places, 44 transitions, 122 flow. Second operand 5 states and 195 transitions. [2023-11-29 00:11:43,795 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 57 places, 80 transitions, 341 flow [2023-11-29 00:11:43,797 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 55 places, 80 transitions, 331 flow, removed 1 selfloop flow, removed 2 redundant places. [2023-11-29 00:11:43,799 INFO L231 Difference]: Finished difference. Result has 57 places, 47 transitions, 162 flow [2023-11-29 00:11:43,799 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=55, PETRI_DIFFERENCE_MINUEND_FLOW=114, PETRI_DIFFERENCE_MINUEND_PLACES=51, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=44, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=5, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=36, PETRI_DIFFERENCE_SUBTRAHEND_STATES=5, PETRI_FLOW=162, PETRI_PLACES=57, PETRI_TRANSITIONS=47} [2023-11-29 00:11:43,800 INFO L281 CegarLoopForPetriNet]: 60 programPoint places, -3 predicate places. [2023-11-29 00:11:43,800 INFO L495 AbstractCegarLoop]: Abstraction has has 57 places, 47 transitions, 162 flow [2023-11-29 00:11:43,800 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 29.0) internal successors, (145), 5 states have internal predecessors, (145), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-29 00:11:43,800 INFO L200 CegarLoopForPetriNet]: Found error trace [2023-11-29 00:11:43,800 INFO L208 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] [2023-11-29 00:11:43,803 INFO L552 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_04b19fd4-4e56-40ba-9f43-51779049eebd/bin/uautomizer-verify-BQ2R08f2Ya/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (10)] Ended with exit code 0 [2023-11-29 00:11:44,001 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 10 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_04b19fd4-4e56-40ba-9f43-51779049eebd/bin/uautomizer-verify-BQ2R08f2Ya/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2023-11-29 00:11:44,001 INFO L420 AbstractCegarLoop]: === Iteration 10 === Targeting ULTIMATE.startErr7ASSERT_VIOLATIONMEMORY_LEAK === [P0Err0ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 10 more)] === [2023-11-29 00:11:44,002 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-11-29 00:11:44,002 INFO L85 PathProgramCache]: Analyzing trace with hash -292681950, now seen corresponding path program 1 times [2023-11-29 00:11:44,002 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2023-11-29 00:11:44,002 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [671781277] [2023-11-29 00:11:44,002 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-11-29 00:11:44,002 INFO L173 SolverBuilder]: Constructing external solver with command: mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2023-11-29 00:11:44,003 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_04b19fd4-4e56-40ba-9f43-51779049eebd/bin/uautomizer-verify-BQ2R08f2Ya/mathsat [2023-11-29 00:11:44,004 INFO L229 MonitoredProcess]: Starting monitored process 11 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_04b19fd4-4e56-40ba-9f43-51779049eebd/bin/uautomizer-verify-BQ2R08f2Ya/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (exit command is (exit), workingDir is null) [2023-11-29 00:11:44,005 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_04b19fd4-4e56-40ba-9f43-51779049eebd/bin/uautomizer-verify-BQ2R08f2Ya/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (11)] Waiting until timeout for monitored process [2023-11-29 00:11:44,112 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 00:11:44,115 INFO L262 TraceCheckSpWp]: Trace formula consists of 157 conjuncts, 5 conjunts are in the unsatisfiable core [2023-11-29 00:11:44,117 INFO L285 TraceCheckSpWp]: Computing forward predicates... [2023-11-29 00:11:44,178 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-11-29 00:11:44,178 INFO L323 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2023-11-29 00:11:44,178 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2023-11-29 00:11:44,178 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [671781277] [2023-11-29 00:11:44,179 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [671781277] provided 1 perfect and 0 imperfect interpolant sequences [2023-11-29 00:11:44,179 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-11-29 00:11:44,179 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2023-11-29 00:11:44,179 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1950240198] [2023-11-29 00:11:44,179 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-11-29 00:11:44,179 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2023-11-29 00:11:44,180 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2023-11-29 00:11:44,180 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2023-11-29 00:11:44,180 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2023-11-29 00:11:44,196 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 26 out of 55 [2023-11-29 00:11:44,196 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 57 places, 47 transitions, 162 flow. Second operand has 6 states, 6 states have (on average 28.833333333333332) internal successors, (173), 6 states have internal predecessors, (173), 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) [2023-11-29 00:11:44,196 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2023-11-29 00:11:44,196 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 26 of 55 [2023-11-29 00:11:44,196 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2023-11-29 00:11:44,498 INFO L124 PetriNetUnfolderBase]: 581/1005 cut-off events. [2023-11-29 00:11:44,498 INFO L125 PetriNetUnfolderBase]: For 806/806 co-relation queries the response was YES. [2023-11-29 00:11:44,500 INFO L83 FinitePrefix]: Finished finitePrefix Result has 2539 conditions, 1005 events. 581/1005 cut-off events. For 806/806 co-relation queries the response was YES. Maximal size of possible extension queue 56. Compared 4614 event pairs, 83 based on Foata normal form. 40/1005 useless extension candidates. Maximal degree in co-relation 2524. Up to 308 conditions per place. [2023-11-29 00:11:44,504 INFO L140 encePairwiseOnDemand]: 49/55 looper letters, 47 selfloop transitions, 11 changer transitions 1/76 dead transitions. [2023-11-29 00:11:44,504 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 62 places, 76 transitions, 348 flow [2023-11-29 00:11:44,504 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2023-11-29 00:11:44,504 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 6 states. [2023-11-29 00:11:44,505 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6 states to 6 states and 217 transitions. [2023-11-29 00:11:44,506 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.6575757575757576 [2023-11-29 00:11:44,506 INFO L72 ComplementDD]: Start complementDD. Operand 6 states and 217 transitions. [2023-11-29 00:11:44,506 INFO L73 IsDeterministic]: Start isDeterministic. Operand 6 states and 217 transitions. [2023-11-29 00:11:44,506 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2023-11-29 00:11:44,506 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 6 states and 217 transitions. [2023-11-29 00:11:44,507 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 7 states, 6 states have (on average 36.166666666666664) internal successors, (217), 6 states have internal predecessors, (217), 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) [2023-11-29 00:11:44,508 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 7 states, 7 states have (on average 55.0) internal successors, (385), 7 states have internal predecessors, (385), 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) [2023-11-29 00:11:44,508 INFO L81 ComplementDD]: Finished complementDD. Result has 7 states, 7 states have (on average 55.0) internal successors, (385), 7 states have internal predecessors, (385), 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) [2023-11-29 00:11:44,508 INFO L175 Difference]: Start difference. First operand has 57 places, 47 transitions, 162 flow. Second operand 6 states and 217 transitions. [2023-11-29 00:11:44,508 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 62 places, 76 transitions, 348 flow [2023-11-29 00:11:44,511 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 58 places, 76 transitions, 323 flow, removed 4 selfloop flow, removed 4 redundant places. [2023-11-29 00:11:44,513 INFO L231 Difference]: Finished difference. Result has 60 places, 47 transitions, 176 flow [2023-11-29 00:11:44,513 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=55, PETRI_DIFFERENCE_MINUEND_FLOW=140, PETRI_DIFFERENCE_MINUEND_PLACES=53, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=47, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=11, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=36, PETRI_DIFFERENCE_SUBTRAHEND_STATES=6, PETRI_FLOW=176, PETRI_PLACES=60, PETRI_TRANSITIONS=47} [2023-11-29 00:11:44,514 INFO L281 CegarLoopForPetriNet]: 60 programPoint places, 0 predicate places. [2023-11-29 00:11:44,514 INFO L495 AbstractCegarLoop]: Abstraction has has 60 places, 47 transitions, 176 flow [2023-11-29 00:11:44,514 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 28.833333333333332) internal successors, (173), 6 states have internal predecessors, (173), 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) [2023-11-29 00:11:44,515 INFO L200 CegarLoopForPetriNet]: Found error trace [2023-11-29 00:11:44,515 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-11-29 00:11:44,518 INFO L552 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_04b19fd4-4e56-40ba-9f43-51779049eebd/bin/uautomizer-verify-BQ2R08f2Ya/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (11)] Ended with exit code 0 [2023-11-29 00:11:44,718 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 11 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_04b19fd4-4e56-40ba-9f43-51779049eebd/bin/uautomizer-verify-BQ2R08f2Ya/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2023-11-29 00:11:44,718 INFO L420 AbstractCegarLoop]: === Iteration 11 === Targeting ULTIMATE.startErr7ASSERT_VIOLATIONMEMORY_LEAK === [P0Err0ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 10 more)] === [2023-11-29 00:11:44,718 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-11-29 00:11:44,718 INFO L85 PathProgramCache]: Analyzing trace with hash 534243397, now seen corresponding path program 1 times [2023-11-29 00:11:44,718 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2023-11-29 00:11:44,719 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [285976762] [2023-11-29 00:11:44,719 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-11-29 00:11:44,719 INFO L173 SolverBuilder]: Constructing external solver with command: mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2023-11-29 00:11:44,719 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_04b19fd4-4e56-40ba-9f43-51779049eebd/bin/uautomizer-verify-BQ2R08f2Ya/mathsat [2023-11-29 00:11:44,720 INFO L229 MonitoredProcess]: Starting monitored process 12 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_04b19fd4-4e56-40ba-9f43-51779049eebd/bin/uautomizer-verify-BQ2R08f2Ya/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (exit command is (exit), workingDir is null) [2023-11-29 00:11:44,720 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_04b19fd4-4e56-40ba-9f43-51779049eebd/bin/uautomizer-verify-BQ2R08f2Ya/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (12)] Waiting until timeout for monitored process [2023-11-29 00:11:44,865 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 00:11:44,869 INFO L262 TraceCheckSpWp]: Trace formula consists of 178 conjuncts, 14 conjunts are in the unsatisfiable core [2023-11-29 00:11:44,873 INFO L285 TraceCheckSpWp]: Computing forward predicates... [2023-11-29 00:11:45,394 WARN L876 $PredicateComparison]: unable to prove that (exists ((|v_ULTIMATE.start_main_~#t914~0#1.base_49| (_ BitVec 32)) (|v_ULTIMATE.start_main_~#t915~0#1.base_41| (_ BitVec 32)) (|v_ULTIMATE.start_main_~#t913~0#1.base_53| (_ BitVec 32))) (let ((.cse0 (store |c_ULTIMATE.start_main_old_#valid#1| |v_ULTIMATE.start_main_~#t913~0#1.base_53| (_ bv1 1)))) (and (= (_ bv0 1) (select |c_ULTIMATE.start_main_old_#valid#1| |v_ULTIMATE.start_main_~#t913~0#1.base_53|)) (= (store (store (store |c_ULTIMATE.start_main_old_#valid#1| |v_ULTIMATE.start_main_~#t913~0#1.base_53| (_ bv0 1)) |v_ULTIMATE.start_main_~#t914~0#1.base_49| (_ bv0 1)) |v_ULTIMATE.start_main_~#t915~0#1.base_41| (_ bv0 1)) |c_#valid|) (= (select (store .cse0 |v_ULTIMATE.start_main_~#t914~0#1.base_49| (_ bv1 1)) |v_ULTIMATE.start_main_~#t915~0#1.base_41|) (_ bv0 1)) (= (_ bv0 1) (select .cse0 |v_ULTIMATE.start_main_~#t914~0#1.base_49|))))) is different from true [2023-11-29 00:11:45,396 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-11-29 00:11:45,396 INFO L323 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2023-11-29 00:11:45,396 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2023-11-29 00:11:45,396 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [285976762] [2023-11-29 00:11:45,397 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [285976762] provided 1 perfect and 0 imperfect interpolant sequences [2023-11-29 00:11:45,397 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-11-29 00:11:45,397 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2023-11-29 00:11:45,397 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1479626118] [2023-11-29 00:11:45,397 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-11-29 00:11:45,398 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2023-11-29 00:11:45,398 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2023-11-29 00:11:45,398 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2023-11-29 00:11:45,399 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=14, Unknown=1, NotChecked=6, Total=30 [2023-11-29 00:11:45,445 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 20 out of 55 [2023-11-29 00:11:45,446 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 60 places, 47 transitions, 176 flow. Second operand has 6 states, 6 states have (on average 23.333333333333332) internal successors, (140), 6 states have internal predecessors, (140), 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) [2023-11-29 00:11:45,446 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2023-11-29 00:11:45,446 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 20 of 55 [2023-11-29 00:11:45,446 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2023-11-29 00:11:45,721 INFO L124 PetriNetUnfolderBase]: 340/718 cut-off events. [2023-11-29 00:11:45,721 INFO L125 PetriNetUnfolderBase]: For 271/283 co-relation queries the response was YES. [2023-11-29 00:11:45,724 INFO L83 FinitePrefix]: Finished finitePrefix Result has 1577 conditions, 718 events. 340/718 cut-off events. For 271/283 co-relation queries the response was YES. Maximal size of possible extension queue 37. Compared 3588 event pairs, 161 based on Foata normal form. 8/688 useless extension candidates. Maximal degree in co-relation 1560. Up to 458 conditions per place. [2023-11-29 00:11:45,727 INFO L140 encePairwiseOnDemand]: 47/55 looper letters, 31 selfloop transitions, 7 changer transitions 0/61 dead transitions. [2023-11-29 00:11:45,727 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 65 places, 61 transitions, 280 flow [2023-11-29 00:11:45,727 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2023-11-29 00:11:45,728 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 6 states. [2023-11-29 00:11:45,728 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6 states to 6 states and 159 transitions. [2023-11-29 00:11:45,729 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.4818181818181818 [2023-11-29 00:11:45,729 INFO L72 ComplementDD]: Start complementDD. Operand 6 states and 159 transitions. [2023-11-29 00:11:45,729 INFO L73 IsDeterministic]: Start isDeterministic. Operand 6 states and 159 transitions. [2023-11-29 00:11:45,729 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2023-11-29 00:11:45,729 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 6 states and 159 transitions. [2023-11-29 00:11:45,730 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 7 states, 6 states have (on average 26.5) internal successors, (159), 6 states have internal predecessors, (159), 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) [2023-11-29 00:11:45,731 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 7 states, 7 states have (on average 55.0) internal successors, (385), 7 states have internal predecessors, (385), 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) [2023-11-29 00:11:45,731 INFO L81 ComplementDD]: Finished complementDD. Result has 7 states, 7 states have (on average 55.0) internal successors, (385), 7 states have internal predecessors, (385), 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) [2023-11-29 00:11:45,731 INFO L175 Difference]: Start difference. First operand has 60 places, 47 transitions, 176 flow. Second operand 6 states and 159 transitions. [2023-11-29 00:11:45,731 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 65 places, 61 transitions, 280 flow [2023-11-29 00:11:45,733 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 57 places, 61 transitions, 224 flow, removed 10 selfloop flow, removed 8 redundant places. [2023-11-29 00:11:45,734 INFO L231 Difference]: Finished difference. Result has 58 places, 50 transitions, 152 flow [2023-11-29 00:11:45,735 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=55, PETRI_DIFFERENCE_MINUEND_FLOW=120, PETRI_DIFFERENCE_MINUEND_PLACES=52, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=47, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=4, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=40, PETRI_DIFFERENCE_SUBTRAHEND_STATES=6, PETRI_FLOW=152, PETRI_PLACES=58, PETRI_TRANSITIONS=50} [2023-11-29 00:11:45,735 INFO L281 CegarLoopForPetriNet]: 60 programPoint places, -2 predicate places. [2023-11-29 00:11:45,735 INFO L495 AbstractCegarLoop]: Abstraction has has 58 places, 50 transitions, 152 flow [2023-11-29 00:11:45,735 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 23.333333333333332) internal successors, (140), 6 states have internal predecessors, (140), 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) [2023-11-29 00:11:45,735 INFO L200 CegarLoopForPetriNet]: Found error trace [2023-11-29 00:11:45,736 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-11-29 00:11:45,739 INFO L552 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_04b19fd4-4e56-40ba-9f43-51779049eebd/bin/uautomizer-verify-BQ2R08f2Ya/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (12)] Ended with exit code 0 [2023-11-29 00:11:45,936 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 12 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_04b19fd4-4e56-40ba-9f43-51779049eebd/bin/uautomizer-verify-BQ2R08f2Ya/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2023-11-29 00:11:45,936 INFO L420 AbstractCegarLoop]: === Iteration 12 === Targeting ULTIMATE.startErr6ASSERT_VIOLATIONMEMORY_LEAK === [P0Err0ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 10 more)] === [2023-11-29 00:11:45,936 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-11-29 00:11:45,937 INFO L85 PathProgramCache]: Analyzing trace with hash -1977140070, now seen corresponding path program 1 times [2023-11-29 00:11:45,937 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2023-11-29 00:11:45,937 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [967660914] [2023-11-29 00:11:45,937 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-11-29 00:11:45,937 INFO L173 SolverBuilder]: Constructing external solver with command: mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2023-11-29 00:11:45,938 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_04b19fd4-4e56-40ba-9f43-51779049eebd/bin/uautomizer-verify-BQ2R08f2Ya/mathsat [2023-11-29 00:11:45,938 INFO L229 MonitoredProcess]: Starting monitored process 13 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_04b19fd4-4e56-40ba-9f43-51779049eebd/bin/uautomizer-verify-BQ2R08f2Ya/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (exit command is (exit), workingDir is null) [2023-11-29 00:11:45,939 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_04b19fd4-4e56-40ba-9f43-51779049eebd/bin/uautomizer-verify-BQ2R08f2Ya/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (13)] Waiting until timeout for monitored process [2023-11-29 00:11:46,073 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 00:11:46,078 INFO L262 TraceCheckSpWp]: Trace formula consists of 174 conjuncts, 14 conjunts are in the unsatisfiable core [2023-11-29 00:11:46,080 INFO L285 TraceCheckSpWp]: Computing forward predicates... [2023-11-29 00:11:46,488 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-11-29 00:11:46,488 INFO L323 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2023-11-29 00:11:46,488 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2023-11-29 00:11:46,489 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [967660914] [2023-11-29 00:11:46,489 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [967660914] provided 1 perfect and 0 imperfect interpolant sequences [2023-11-29 00:11:46,489 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-11-29 00:11:46,489 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2023-11-29 00:11:46,489 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [958540204] [2023-11-29 00:11:46,489 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-11-29 00:11:46,489 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 9 states [2023-11-29 00:11:46,490 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2023-11-29 00:11:46,490 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2023-11-29 00:11:46,490 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=18, Invalid=54, Unknown=0, NotChecked=0, Total=72 [2023-11-29 00:11:46,509 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 29 out of 55 [2023-11-29 00:11:46,510 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 58 places, 50 transitions, 152 flow. Second operand has 9 states, 9 states have (on average 30.88888888888889) internal successors, (278), 9 states have internal predecessors, (278), 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) [2023-11-29 00:11:46,510 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2023-11-29 00:11:46,510 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 29 of 55 [2023-11-29 00:11:46,510 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2023-11-29 00:11:46,944 INFO L124 PetriNetUnfolderBase]: 501/970 cut-off events. [2023-11-29 00:11:46,944 INFO L125 PetriNetUnfolderBase]: For 317/353 co-relation queries the response was YES. [2023-11-29 00:11:46,946 INFO L83 FinitePrefix]: Finished finitePrefix Result has 2332 conditions, 970 events. 501/970 cut-off events. For 317/353 co-relation queries the response was YES. Maximal size of possible extension queue 58. Compared 4923 event pairs, 106 based on Foata normal form. 8/936 useless extension candidates. Maximal degree in co-relation 2319. Up to 373 conditions per place. [2023-11-29 00:11:46,949 INFO L140 encePairwiseOnDemand]: 46/55 looper letters, 59 selfloop transitions, 9 changer transitions 0/94 dead transitions. [2023-11-29 00:11:46,949 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 66 places, 94 transitions, 438 flow [2023-11-29 00:11:46,949 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2023-11-29 00:11:46,949 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 9 states. [2023-11-29 00:11:46,951 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 9 states to 9 states and 324 transitions. [2023-11-29 00:11:46,951 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.6545454545454545 [2023-11-29 00:11:46,951 INFO L72 ComplementDD]: Start complementDD. Operand 9 states and 324 transitions. [2023-11-29 00:11:46,951 INFO L73 IsDeterministic]: Start isDeterministic. Operand 9 states and 324 transitions. [2023-11-29 00:11:46,952 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2023-11-29 00:11:46,952 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 9 states and 324 transitions. [2023-11-29 00:11:46,953 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 10 states, 9 states have (on average 36.0) internal successors, (324), 9 states have internal predecessors, (324), 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) [2023-11-29 00:11:46,954 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 10 states, 10 states have (on average 55.0) internal successors, (550), 10 states have internal predecessors, (550), 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) [2023-11-29 00:11:46,955 INFO L81 ComplementDD]: Finished complementDD. Result has 10 states, 10 states have (on average 55.0) internal successors, (550), 10 states have internal predecessors, (550), 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) [2023-11-29 00:11:46,955 INFO L175 Difference]: Start difference. First operand has 58 places, 50 transitions, 152 flow. Second operand 9 states and 324 transitions. [2023-11-29 00:11:46,955 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 66 places, 94 transitions, 438 flow [2023-11-29 00:11:46,957 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 62 places, 94 transitions, 416 flow, removed 0 selfloop flow, removed 4 redundant places. [2023-11-29 00:11:46,958 INFO L231 Difference]: Finished difference. Result has 66 places, 55 transitions, 192 flow [2023-11-29 00:11:46,958 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=55, PETRI_DIFFERENCE_MINUEND_FLOW=142, PETRI_DIFFERENCE_MINUEND_PLACES=54, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=50, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=4, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=42, PETRI_DIFFERENCE_SUBTRAHEND_STATES=9, PETRI_FLOW=192, PETRI_PLACES=66, PETRI_TRANSITIONS=55} [2023-11-29 00:11:46,959 INFO L281 CegarLoopForPetriNet]: 60 programPoint places, 6 predicate places. [2023-11-29 00:11:46,959 INFO L495 AbstractCegarLoop]: Abstraction has has 66 places, 55 transitions, 192 flow [2023-11-29 00:11:46,960 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 9 states, 9 states have (on average 30.88888888888889) internal successors, (278), 9 states have internal predecessors, (278), 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) [2023-11-29 00:11:46,960 INFO L200 CegarLoopForPetriNet]: Found error trace [2023-11-29 00:11:46,960 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-11-29 00:11:46,963 INFO L552 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_04b19fd4-4e56-40ba-9f43-51779049eebd/bin/uautomizer-verify-BQ2R08f2Ya/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (13)] Ended with exit code 0 [2023-11-29 00:11:47,161 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 13 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_04b19fd4-4e56-40ba-9f43-51779049eebd/bin/uautomizer-verify-BQ2R08f2Ya/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2023-11-29 00:11:47,161 INFO L420 AbstractCegarLoop]: === Iteration 13 === Targeting ULTIMATE.startErr6ASSERT_VIOLATIONMEMORY_LEAK === [P0Err0ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 10 more)] === [2023-11-29 00:11:47,161 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-11-29 00:11:47,161 INFO L85 PathProgramCache]: Analyzing trace with hash 1310962438, now seen corresponding path program 2 times [2023-11-29 00:11:47,162 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2023-11-29 00:11:47,162 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [1995365662] [2023-11-29 00:11:47,162 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2023-11-29 00:11:47,162 INFO L173 SolverBuilder]: Constructing external solver with command: mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2023-11-29 00:11:47,162 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_04b19fd4-4e56-40ba-9f43-51779049eebd/bin/uautomizer-verify-BQ2R08f2Ya/mathsat [2023-11-29 00:11:47,163 INFO L229 MonitoredProcess]: Starting monitored process 14 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_04b19fd4-4e56-40ba-9f43-51779049eebd/bin/uautomizer-verify-BQ2R08f2Ya/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (exit command is (exit), workingDir is null) [2023-11-29 00:11:47,164 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_04b19fd4-4e56-40ba-9f43-51779049eebd/bin/uautomizer-verify-BQ2R08f2Ya/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (14)] Waiting until timeout for monitored process [2023-11-29 00:11:47,289 INFO L228 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 1 check-sat command(s) [2023-11-29 00:11:47,289 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2023-11-29 00:11:47,293 INFO L262 TraceCheckSpWp]: Trace formula consists of 174 conjuncts, 6 conjunts are in the unsatisfiable core [2023-11-29 00:11:47,295 INFO L285 TraceCheckSpWp]: Computing forward predicates... [2023-11-29 00:11:47,339 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-11-29 00:11:47,339 INFO L323 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2023-11-29 00:11:47,339 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2023-11-29 00:11:47,339 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [1995365662] [2023-11-29 00:11:47,339 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [1995365662] provided 1 perfect and 0 imperfect interpolant sequences [2023-11-29 00:11:47,339 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-11-29 00:11:47,339 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2023-11-29 00:11:47,339 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [952744717] [2023-11-29 00:11:47,340 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-11-29 00:11:47,340 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2023-11-29 00:11:47,340 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2023-11-29 00:11:47,341 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2023-11-29 00:11:47,341 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2023-11-29 00:11:47,348 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 27 out of 55 [2023-11-29 00:11:47,349 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 66 places, 55 transitions, 192 flow. Second operand has 6 states, 6 states have (on average 30.166666666666668) internal successors, (181), 6 states have internal predecessors, (181), 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) [2023-11-29 00:11:47,349 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2023-11-29 00:11:47,349 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 27 of 55 [2023-11-29 00:11:47,349 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2023-11-29 00:11:47,719 INFO L124 PetriNetUnfolderBase]: 1098/2110 cut-off events. [2023-11-29 00:11:47,719 INFO L125 PetriNetUnfolderBase]: For 1090/1126 co-relation queries the response was YES. [2023-11-29 00:11:47,724 INFO L83 FinitePrefix]: Finished finitePrefix Result has 5324 conditions, 2110 events. 1098/2110 cut-off events. For 1090/1126 co-relation queries the response was YES. Maximal size of possible extension queue 125. Compared 12459 event pairs, 270 based on Foata normal form. 8/2053 useless extension candidates. Maximal degree in co-relation 5307. Up to 799 conditions per place. [2023-11-29 00:11:47,729 INFO L140 encePairwiseOnDemand]: 49/55 looper letters, 58 selfloop transitions, 8 changer transitions 0/90 dead transitions. [2023-11-29 00:11:47,729 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 71 places, 90 transitions, 465 flow [2023-11-29 00:11:47,730 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2023-11-29 00:11:47,730 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 6 states. [2023-11-29 00:11:47,731 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6 states to 6 states and 213 transitions. [2023-11-29 00:11:47,731 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.6454545454545455 [2023-11-29 00:11:47,731 INFO L72 ComplementDD]: Start complementDD. Operand 6 states and 213 transitions. [2023-11-29 00:11:47,732 INFO L73 IsDeterministic]: Start isDeterministic. Operand 6 states and 213 transitions. [2023-11-29 00:11:47,732 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2023-11-29 00:11:47,732 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 6 states and 213 transitions. [2023-11-29 00:11:47,733 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 7 states, 6 states have (on average 35.5) internal successors, (213), 6 states have internal predecessors, (213), 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) [2023-11-29 00:11:47,734 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 7 states, 7 states have (on average 55.0) internal successors, (385), 7 states have internal predecessors, (385), 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) [2023-11-29 00:11:47,734 INFO L81 ComplementDD]: Finished complementDD. Result has 7 states, 7 states have (on average 55.0) internal successors, (385), 7 states have internal predecessors, (385), 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) [2023-11-29 00:11:47,734 INFO L175 Difference]: Start difference. First operand has 66 places, 55 transitions, 192 flow. Second operand 6 states and 213 transitions. [2023-11-29 00:11:47,734 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 71 places, 90 transitions, 465 flow [2023-11-29 00:11:47,737 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 68 places, 90 transitions, 452 flow, removed 0 selfloop flow, removed 3 redundant places. [2023-11-29 00:11:47,738 INFO L231 Difference]: Finished difference. Result has 72 places, 62 transitions, 269 flow [2023-11-29 00:11:47,739 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=55, PETRI_DIFFERENCE_MINUEND_FLOW=186, PETRI_DIFFERENCE_MINUEND_PLACES=63, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=55, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=1, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=47, PETRI_DIFFERENCE_SUBTRAHEND_STATES=6, PETRI_FLOW=269, PETRI_PLACES=72, PETRI_TRANSITIONS=62} [2023-11-29 00:11:47,739 INFO L281 CegarLoopForPetriNet]: 60 programPoint places, 12 predicate places. [2023-11-29 00:11:47,739 INFO L495 AbstractCegarLoop]: Abstraction has has 72 places, 62 transitions, 269 flow [2023-11-29 00:11:47,740 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 30.166666666666668) internal successors, (181), 6 states have internal predecessors, (181), 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) [2023-11-29 00:11:47,740 INFO L200 CegarLoopForPetriNet]: Found error trace [2023-11-29 00:11:47,740 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-11-29 00:11:47,743 INFO L552 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_04b19fd4-4e56-40ba-9f43-51779049eebd/bin/uautomizer-verify-BQ2R08f2Ya/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (14)] Ended with exit code 0 [2023-11-29 00:11:47,943 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 14 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_04b19fd4-4e56-40ba-9f43-51779049eebd/bin/uautomizer-verify-BQ2R08f2Ya/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2023-11-29 00:11:47,943 INFO L420 AbstractCegarLoop]: === Iteration 14 === Targeting ULTIMATE.startErr6ASSERT_VIOLATIONMEMORY_LEAK === [P0Err0ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 10 more)] === [2023-11-29 00:11:47,943 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-11-29 00:11:47,944 INFO L85 PathProgramCache]: Analyzing trace with hash 711248200, now seen corresponding path program 3 times [2023-11-29 00:11:47,944 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2023-11-29 00:11:47,944 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [1161955667] [2023-11-29 00:11:47,944 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST2 [2023-11-29 00:11:47,944 INFO L173 SolverBuilder]: Constructing external solver with command: mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2023-11-29 00:11:47,944 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_04b19fd4-4e56-40ba-9f43-51779049eebd/bin/uautomizer-verify-BQ2R08f2Ya/mathsat [2023-11-29 00:11:47,945 INFO L229 MonitoredProcess]: Starting monitored process 15 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_04b19fd4-4e56-40ba-9f43-51779049eebd/bin/uautomizer-verify-BQ2R08f2Ya/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (exit command is (exit), workingDir is null) [2023-11-29 00:11:47,946 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_04b19fd4-4e56-40ba-9f43-51779049eebd/bin/uautomizer-verify-BQ2R08f2Ya/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (15)] Waiting until timeout for monitored process [2023-11-29 00:11:48,056 INFO L228 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued 1 check-sat command(s) [2023-11-29 00:11:48,056 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2023-11-29 00:11:48,060 INFO L262 TraceCheckSpWp]: Trace formula consists of 174 conjuncts, 6 conjunts are in the unsatisfiable core [2023-11-29 00:11:48,061 INFO L285 TraceCheckSpWp]: Computing forward predicates... [2023-11-29 00:11:48,107 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-11-29 00:11:48,107 INFO L323 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2023-11-29 00:11:48,107 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2023-11-29 00:11:48,107 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [1161955667] [2023-11-29 00:11:48,108 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [1161955667] provided 1 perfect and 0 imperfect interpolant sequences [2023-11-29 00:11:48,108 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-11-29 00:11:48,108 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2023-11-29 00:11:48,108 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [79613143] [2023-11-29 00:11:48,108 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-11-29 00:11:48,108 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2023-11-29 00:11:48,108 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2023-11-29 00:11:48,109 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2023-11-29 00:11:48,109 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2023-11-29 00:11:48,118 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 27 out of 55 [2023-11-29 00:11:48,118 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 72 places, 62 transitions, 269 flow. Second operand has 6 states, 6 states have (on average 30.166666666666668) internal successors, (181), 6 states have internal predecessors, (181), 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) [2023-11-29 00:11:48,118 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2023-11-29 00:11:48,118 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 27 of 55 [2023-11-29 00:11:48,118 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2023-11-29 00:11:48,619 INFO L124 PetriNetUnfolderBase]: 1975/3751 cut-off events. [2023-11-29 00:11:48,620 INFO L125 PetriNetUnfolderBase]: For 2202/2365 co-relation queries the response was YES. [2023-11-29 00:11:48,629 INFO L83 FinitePrefix]: Finished finitePrefix Result has 9901 conditions, 3751 events. 1975/3751 cut-off events. For 2202/2365 co-relation queries the response was YES. Maximal size of possible extension queue 234. Compared 25195 event pairs, 589 based on Foata normal form. 12/3595 useless extension candidates. Maximal degree in co-relation 9881. Up to 1555 conditions per place. [2023-11-29 00:11:48,640 INFO L140 encePairwiseOnDemand]: 49/55 looper letters, 69 selfloop transitions, 14 changer transitions 0/108 dead transitions. [2023-11-29 00:11:48,640 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 77 places, 108 transitions, 658 flow [2023-11-29 00:11:48,640 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2023-11-29 00:11:48,641 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 6 states. [2023-11-29 00:11:48,641 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6 states to 6 states and 217 transitions. [2023-11-29 00:11:48,642 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.6575757575757576 [2023-11-29 00:11:48,642 INFO L72 ComplementDD]: Start complementDD. Operand 6 states and 217 transitions. [2023-11-29 00:11:48,642 INFO L73 IsDeterministic]: Start isDeterministic. Operand 6 states and 217 transitions. [2023-11-29 00:11:48,642 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2023-11-29 00:11:48,642 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 6 states and 217 transitions. [2023-11-29 00:11:48,643 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 7 states, 6 states have (on average 36.166666666666664) internal successors, (217), 6 states have internal predecessors, (217), 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) [2023-11-29 00:11:48,644 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 7 states, 7 states have (on average 55.0) internal successors, (385), 7 states have internal predecessors, (385), 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) [2023-11-29 00:11:48,645 INFO L81 ComplementDD]: Finished complementDD. Result has 7 states, 7 states have (on average 55.0) internal successors, (385), 7 states have internal predecessors, (385), 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) [2023-11-29 00:11:48,645 INFO L175 Difference]: Start difference. First operand has 72 places, 62 transitions, 269 flow. Second operand 6 states and 217 transitions. [2023-11-29 00:11:48,645 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 77 places, 108 transitions, 658 flow [2023-11-29 00:11:48,661 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 76 places, 108 transitions, 657 flow, removed 0 selfloop flow, removed 1 redundant places. [2023-11-29 00:11:48,663 INFO L231 Difference]: Finished difference. Result has 80 places, 75 transitions, 457 flow [2023-11-29 00:11:48,663 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=55, PETRI_DIFFERENCE_MINUEND_FLOW=268, PETRI_DIFFERENCE_MINUEND_PLACES=71, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=62, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=1, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=48, PETRI_DIFFERENCE_SUBTRAHEND_STATES=6, PETRI_FLOW=457, PETRI_PLACES=80, PETRI_TRANSITIONS=75} [2023-11-29 00:11:48,664 INFO L281 CegarLoopForPetriNet]: 60 programPoint places, 20 predicate places. [2023-11-29 00:11:48,664 INFO L495 AbstractCegarLoop]: Abstraction has has 80 places, 75 transitions, 457 flow [2023-11-29 00:11:48,664 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 30.166666666666668) internal successors, (181), 6 states have internal predecessors, (181), 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) [2023-11-29 00:11:48,664 INFO L200 CegarLoopForPetriNet]: Found error trace [2023-11-29 00:11:48,664 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-11-29 00:11:48,667 INFO L552 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_04b19fd4-4e56-40ba-9f43-51779049eebd/bin/uautomizer-verify-BQ2R08f2Ya/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (15)] Ended with exit code 0 [2023-11-29 00:11:48,867 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 15 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_04b19fd4-4e56-40ba-9f43-51779049eebd/bin/uautomizer-verify-BQ2R08f2Ya/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2023-11-29 00:11:48,868 INFO L420 AbstractCegarLoop]: === Iteration 15 === Targeting ULTIMATE.startErr6ASSERT_VIOLATIONMEMORY_LEAK === [P0Err0ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 10 more)] === [2023-11-29 00:11:48,868 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-11-29 00:11:48,868 INFO L85 PathProgramCache]: Analyzing trace with hash -1028846830, now seen corresponding path program 4 times [2023-11-29 00:11:48,868 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2023-11-29 00:11:48,868 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [622993449] [2023-11-29 00:11:48,869 INFO L93 rtionOrderModulation]: Changing assertion order to TERMS_WITH_SMALL_CONSTANTS_FIRST [2023-11-29 00:11:48,869 INFO L173 SolverBuilder]: Constructing external solver with command: mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2023-11-29 00:11:48,869 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_04b19fd4-4e56-40ba-9f43-51779049eebd/bin/uautomizer-verify-BQ2R08f2Ya/mathsat [2023-11-29 00:11:48,869 INFO L229 MonitoredProcess]: Starting monitored process 16 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_04b19fd4-4e56-40ba-9f43-51779049eebd/bin/uautomizer-verify-BQ2R08f2Ya/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (exit command is (exit), workingDir is null) [2023-11-29 00:11:48,870 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_04b19fd4-4e56-40ba-9f43-51779049eebd/bin/uautomizer-verify-BQ2R08f2Ya/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (16)] Waiting until timeout for monitored process [2023-11-29 00:11:48,997 INFO L228 tOrderPrioritization]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 0 check-sat command(s) [2023-11-29 00:11:48,997 INFO L229 tOrderPrioritization]: Conjunction of SSA is sat [2023-11-29 00:11:48,998 INFO L356 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2023-11-29 00:11:49,064 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2023-11-29 00:11:49,130 INFO L130 FreeRefinementEngine]: Strategy WOLF found a feasible trace [2023-11-29 00:11:49,130 INFO L360 BasicCegarLoop]: Counterexample is feasible [2023-11-29 00:11:49,131 INFO L805 garLoopResultBuilder]: Registering result UNSAFE for location ULTIMATE.startErr6ASSERT_VIOLATIONMEMORY_LEAK (12 of 13 remaining) [2023-11-29 00:11:49,132 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location P0Err0ASSERT_VIOLATIONMEMORY_LEAK (11 of 13 remaining) [2023-11-29 00:11:49,132 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE (10 of 13 remaining) [2023-11-29 00:11:49,133 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE (9 of 13 remaining) [2023-11-29 00:11:49,133 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (8 of 13 remaining) [2023-11-29 00:11:49,133 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr3REQUIRES_VIOLATIONMEMORY_DEREFERENCE (7 of 13 remaining) [2023-11-29 00:11:49,133 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr4REQUIRES_VIOLATIONMEMORY_DEREFERENCE (6 of 13 remaining) [2023-11-29 00:11:49,133 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr5REQUIRES_VIOLATIONMEMORY_DEREFERENCE (5 of 13 remaining) [2023-11-29 00:11:49,133 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr7ASSERT_VIOLATIONMEMORY_LEAK (4 of 13 remaining) [2023-11-29 00:11:49,133 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (3 of 13 remaining) [2023-11-29 00:11:49,134 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (2 of 13 remaining) [2023-11-29 00:11:49,134 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr2INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (1 of 13 remaining) [2023-11-29 00:11:49,134 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location P0Err0ASSERT_VIOLATIONMEMORY_LEAK (0 of 13 remaining) [2023-11-29 00:11:49,137 INFO L552 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_04b19fd4-4e56-40ba-9f43-51779049eebd/bin/uautomizer-verify-BQ2R08f2Ya/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (16)] Ended with exit code 0 [2023-11-29 00:11:49,334 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 16 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_04b19fd4-4e56-40ba-9f43-51779049eebd/bin/uautomizer-verify-BQ2R08f2Ya/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2023-11-29 00:11:49,335 INFO L445 BasicCegarLoop]: Path program histogram: [4, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-11-29 00:11:49,340 INFO L228 ceAbstractionStarter]: Analysis of concurrent program completed with 1 thread instances [2023-11-29 00:11:49,340 INFO L178 ceAbstractionStarter]: Computing trace abstraction results [2023-11-29 00:11:49,398 WARN L1572 BoogieBacktranslator]: Unfinished Backtranslation: IdentifierExpression #t~pre5 could not be translated [2023-11-29 00:11:49,401 WARN L1572 BoogieBacktranslator]: Unfinished Backtranslation: IdentifierExpression #t~pre7 could not be translated [2023-11-29 00:11:49,403 WARN L1572 BoogieBacktranslator]: Unfinished Backtranslation: IdentifierExpression #t~pre9 could not be translated [2023-11-29 00:11:49,417 WARN L1572 BoogieBacktranslator]: Unfinished Backtranslation: unknown boogie variable #t~nondet0 [2023-11-29 00:11:49,418 WARN L1572 BoogieBacktranslator]: Unfinished Backtranslation: unknown boogie variable #t~nondet0 [2023-11-29 00:11:49,431 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 29.11 12:11:49 BasicIcfg [2023-11-29 00:11:49,432 INFO L131 PluginConnector]: ------------------------ END TraceAbstraction---------------------------- [2023-11-29 00:11:49,432 INFO L112 PluginConnector]: ------------------------Witness Printer---------------------------- [2023-11-29 00:11:49,432 INFO L270 PluginConnector]: Initializing Witness Printer... [2023-11-29 00:11:49,432 INFO L274 PluginConnector]: Witness Printer initialized [2023-11-29 00:11:49,433 INFO L184 PluginConnector]: Executing the observer RCFGCatcher from plugin Witness Printer for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 29.11 12:11:37" (3/4) ... [2023-11-29 00:11:49,434 INFO L140 WitnessPrinter]: No result that supports witness generation found [2023-11-29 00:11:49,435 INFO L131 PluginConnector]: ------------------------ END Witness Printer---------------------------- [2023-11-29 00:11:49,435 INFO L158 Benchmark]: Toolchain (without parser) took 13757.82ms. Allocated memory was 104.9MB in the beginning and 293.6MB in the end (delta: 188.7MB). Free memory was 80.8MB in the beginning and 231.4MB in the end (delta: -150.6MB). Peak memory consumption was 40.2MB. Max. memory is 16.1GB. [2023-11-29 00:11:49,436 INFO L158 Benchmark]: CDTParser took 0.30ms. Allocated memory is still 60.8MB. Free memory is still 37.5MB. There was no memory consumed. Max. memory is 16.1GB. [2023-11-29 00:11:49,436 INFO L158 Benchmark]: CACSL2BoogieTranslator took 556.14ms. Allocated memory is still 104.9MB. Free memory was 80.5MB in the beginning and 81.7MB in the end (delta: -1.2MB). Peak memory consumption was 29.0MB. Max. memory is 16.1GB. [2023-11-29 00:11:49,436 INFO L158 Benchmark]: Boogie Procedure Inliner took 76.06ms. Allocated memory is still 104.9MB. Free memory was 81.7MB in the beginning and 79.1MB in the end (delta: 2.6MB). Peak memory consumption was 2.1MB. Max. memory is 16.1GB. [2023-11-29 00:11:49,437 INFO L158 Benchmark]: Boogie Preprocessor took 62.29ms. Allocated memory is still 104.9MB. Free memory was 79.1MB in the beginning and 75.3MB in the end (delta: 3.8MB). Peak memory consumption was 4.2MB. Max. memory is 16.1GB. [2023-11-29 00:11:49,437 INFO L158 Benchmark]: RCFGBuilder took 828.45ms. Allocated memory is still 104.9MB. Free memory was 75.3MB in the beginning and 49.5MB in the end (delta: 25.7MB). Peak memory consumption was 37.2MB. Max. memory is 16.1GB. [2023-11-29 00:11:49,438 INFO L158 Benchmark]: TraceAbstraction took 12224.79ms. Allocated memory was 104.9MB in the beginning and 293.6MB in the end (delta: 188.7MB). Free memory was 48.9MB in the beginning and 231.4MB in the end (delta: -182.4MB). Peak memory consumption was 5.4MB. Max. memory is 16.1GB. [2023-11-29 00:11:49,438 INFO L158 Benchmark]: Witness Printer took 2.91ms. Allocated memory is still 293.6MB. Free memory is still 231.4MB. There was no memory consumed. Max. memory is 16.1GB. [2023-11-29 00:11:49,439 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.30ms. Allocated memory is still 60.8MB. Free memory is still 37.5MB. There was no memory consumed. Max. memory is 16.1GB. * CACSL2BoogieTranslator took 556.14ms. Allocated memory is still 104.9MB. Free memory was 80.5MB in the beginning and 81.7MB in the end (delta: -1.2MB). Peak memory consumption was 29.0MB. Max. memory is 16.1GB. * Boogie Procedure Inliner took 76.06ms. Allocated memory is still 104.9MB. Free memory was 81.7MB in the beginning and 79.1MB in the end (delta: 2.6MB). Peak memory consumption was 2.1MB. Max. memory is 16.1GB. * Boogie Preprocessor took 62.29ms. Allocated memory is still 104.9MB. Free memory was 79.1MB in the beginning and 75.3MB in the end (delta: 3.8MB). Peak memory consumption was 4.2MB. Max. memory is 16.1GB. * RCFGBuilder took 828.45ms. Allocated memory is still 104.9MB. Free memory was 75.3MB in the beginning and 49.5MB in the end (delta: 25.7MB). Peak memory consumption was 37.2MB. Max. memory is 16.1GB. * TraceAbstraction took 12224.79ms. Allocated memory was 104.9MB in the beginning and 293.6MB in the end (delta: 188.7MB). Free memory was 48.9MB in the beginning and 231.4MB in the end (delta: -182.4MB). Peak memory consumption was 5.4MB. Max. memory is 16.1GB. * Witness Printer took 2.91ms. Allocated memory is still 293.6MB. Free memory is still 231.4MB. There was no memory consumed. Max. memory is 16.1GB. * Results from de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator: - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: IdentifierExpression #t~pre5 could not be translated - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: IdentifierExpression #t~pre7 could not be translated - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: IdentifierExpression #t~pre9 could not be translated - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: unknown boogie variable #t~nondet0 - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: unknown boogie variable #t~nondet0 - GenericResult: Unfinished Backtranslation The program execution was not completely translated back. * Results from de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: - UnprovableResult [Line: 17]: Unable to prove that all allocated memory was freed Unable to prove that all allocated memory was freed Reason: overapproximation of memtrack at line 17. Possible FailurePath: [L709] 0 int __unbuffered_cnt = 0; [L711] 0 int __unbuffered_p0_EAX = 0; [L713] 0 int __unbuffered_p1_EAX = 0; [L715] 0 int __unbuffered_p2_EAX = 0; [L717] 0 int __unbuffered_p2_EBX = 0; [L719] 0 int a = 0; [L720] 0 _Bool a$flush_delayed; [L721] 0 int a$mem_tmp; [L722] 0 _Bool a$r_buff0_thd0; [L723] 0 _Bool a$r_buff0_thd1; [L724] 0 _Bool a$r_buff0_thd2; [L725] 0 _Bool a$r_buff0_thd3; [L726] 0 _Bool a$r_buff1_thd0; [L727] 0 _Bool a$r_buff1_thd1; [L728] 0 _Bool a$r_buff1_thd2; [L729] 0 _Bool a$r_buff1_thd3; [L730] 0 _Bool a$read_delayed; [L731] 0 int *a$read_delayed_var; [L732] 0 int a$w_buff0; [L733] 0 _Bool a$w_buff0_used; [L734] 0 int a$w_buff1; [L735] 0 _Bool a$w_buff1_used; [L736] 0 _Bool main$tmp_guard0; [L737] 0 _Bool main$tmp_guard1; [L739] 0 int x = 0; [L741] 0 int y = 0; [L743] 0 int z = 0; [L744] 0 _Bool weak$$choice0; [L745] 0 _Bool weak$$choice2; [L845] 0 pthread_t t913; [L846] FCALL, FORK 0 pthread_create(&t913, ((void *)0), P0, ((void *)0)) VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=0, __unbuffered_p1_EAX=0, __unbuffered_p2_EAX=0, __unbuffered_p2_EBX=0, a$flush_delayed=0, a$mem_tmp=0, a$r_buff0_thd0=0, a$r_buff0_thd1=0, a$r_buff0_thd2=0, a$r_buff0_thd3=0, a$r_buff1_thd0=0, a$r_buff1_thd1=0, a$r_buff1_thd2=0, a$r_buff1_thd3=0, a$read_delayed=0, a$read_delayed_var={0:0}, a$w_buff0=0, a$w_buff0_used=0, a$w_buff1=0, a$w_buff1_used=0, a=0, main$tmp_guard0=0, main$tmp_guard1=0, t913={3:0}, weak$$choice0=0, weak$$choice2=0, x=0, y=0, z=0] [L749] 1 a$w_buff1 = a$w_buff0 [L750] 1 a$w_buff0 = 1 [L751] 1 a$w_buff1_used = a$w_buff0_used [L752] 1 a$w_buff0_used = (_Bool)1 [L753] CALL 1 __VERIFIER_assert(!(a$w_buff1_used && a$w_buff0_used)) [L18] COND FALSE 1 !(!expression) [L753] RET 1 __VERIFIER_assert(!(a$w_buff1_used && a$w_buff0_used)) [L754] 1 a$r_buff1_thd0 = a$r_buff0_thd0 [L755] 1 a$r_buff1_thd1 = a$r_buff0_thd1 [L756] 1 a$r_buff1_thd2 = a$r_buff0_thd2 [L757] 1 a$r_buff1_thd3 = a$r_buff0_thd3 [L758] 1 a$r_buff0_thd1 = (_Bool)1 VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=0, __unbuffered_p1_EAX=0, __unbuffered_p2_EAX=0, __unbuffered_p2_EBX=0, a$flush_delayed=0, a$mem_tmp=0, a$r_buff0_thd0=0, a$r_buff0_thd1=1, a$r_buff0_thd2=0, a$r_buff0_thd3=0, a$r_buff1_thd0=0, a$r_buff1_thd1=0, a$r_buff1_thd2=0, a$r_buff1_thd3=0, a$read_delayed=0, a$read_delayed_var={0:0}, a$w_buff0=1, a$w_buff0_used=1, a$w_buff1=0, a$w_buff1_used=0, a=0, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=0, x=0, y=0, z=0] [L847] 0 pthread_t t914; [L848] FCALL, FORK 0 pthread_create(&t914, ((void *)0), P1, ((void *)0)) VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=0, __unbuffered_p1_EAX=0, __unbuffered_p2_EAX=0, __unbuffered_p2_EBX=0, a$flush_delayed=0, a$mem_tmp=0, a$r_buff0_thd0=0, a$r_buff0_thd1=1, a$r_buff0_thd2=0, a$r_buff0_thd3=0, a$r_buff1_thd0=0, a$r_buff1_thd1=0, a$r_buff1_thd2=0, a$r_buff1_thd3=0, a$read_delayed=0, a$read_delayed_var={0:0}, a$w_buff0=1, a$w_buff0_used=1, a$w_buff1=0, a$w_buff1_used=0, a=0, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, t913={3:0}, t914={7:0}, weak$$choice0=0, weak$$choice2=0, x=0, y=0, z=0] [L761] 1 __unbuffered_p0_EAX = x VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=0, __unbuffered_p1_EAX=0, __unbuffered_p2_EAX=0, __unbuffered_p2_EBX=0, a$flush_delayed=0, a$mem_tmp=0, a$r_buff0_thd0=0, a$r_buff0_thd1=1, a$r_buff0_thd2=0, a$r_buff0_thd3=0, a$r_buff1_thd0=0, a$r_buff1_thd1=0, a$r_buff1_thd2=0, a$r_buff1_thd3=0, a$read_delayed=0, a$read_delayed_var={0:0}, a$w_buff0=1, a$w_buff0_used=1, a$w_buff1=0, a$w_buff1_used=0, a=0, arg={0:0}, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=0, x=0, y=0, z=0] [L849] 0 pthread_t t915; [L850] FCALL, FORK 0 pthread_create(&t915, ((void *)0), P2, ((void *)0)) VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=0, __unbuffered_p1_EAX=0, __unbuffered_p2_EAX=0, __unbuffered_p2_EBX=0, a$flush_delayed=0, a$mem_tmp=0, a$r_buff0_thd0=0, a$r_buff0_thd1=1, a$r_buff0_thd2=0, a$r_buff0_thd3=0, a$r_buff1_thd0=0, a$r_buff1_thd1=0, a$r_buff1_thd2=0, a$r_buff1_thd3=0, a$read_delayed=0, a$read_delayed_var={0:0}, a$w_buff0=1, a$w_buff0_used=1, a$w_buff1=0, a$w_buff1_used=0, a=0, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, t913={3:0}, t914={7:0}, t915={15:0}, weak$$choice0=0, weak$$choice2=0, x=0, y=0, z=0] [L778] 2 x = 1 VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=0, __unbuffered_p1_EAX=0, __unbuffered_p2_EAX=0, __unbuffered_p2_EBX=0, a$flush_delayed=0, a$mem_tmp=0, a$r_buff0_thd0=0, a$r_buff0_thd1=1, a$r_buff0_thd2=0, a$r_buff0_thd3=0, a$r_buff1_thd0=0, a$r_buff1_thd1=0, a$r_buff1_thd2=0, a$r_buff1_thd3=0, a$read_delayed=0, a$read_delayed_var={0:0}, a$w_buff0=1, a$w_buff0_used=1, a$w_buff1=0, a$w_buff1_used=0, a=0, arg={0:0}, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=0, x=1, y=0, z=0] [L781] 2 __unbuffered_p1_EAX = y VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=0, __unbuffered_p1_EAX=0, __unbuffered_p2_EAX=0, __unbuffered_p2_EBX=0, a$flush_delayed=0, a$mem_tmp=0, a$r_buff0_thd0=0, a$r_buff0_thd1=1, a$r_buff0_thd2=0, a$r_buff0_thd3=0, a$r_buff1_thd0=0, a$r_buff1_thd1=0, a$r_buff1_thd2=0, a$r_buff1_thd3=0, a$read_delayed=0, a$read_delayed_var={0:0}, a$w_buff0=1, a$w_buff0_used=1, a$w_buff1=0, a$w_buff1_used=0, a=0, arg={0:0}, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=0, x=1, y=0, z=0] [L798] 3 y = 1 VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=0, __unbuffered_p1_EAX=0, __unbuffered_p2_EAX=0, __unbuffered_p2_EBX=0, a$flush_delayed=0, a$mem_tmp=0, a$r_buff0_thd0=0, a$r_buff0_thd1=1, a$r_buff0_thd2=0, a$r_buff0_thd3=0, a$r_buff1_thd0=0, a$r_buff1_thd1=0, a$r_buff1_thd2=0, a$r_buff1_thd3=0, a$read_delayed=0, a$read_delayed_var={0:0}, a$w_buff0=1, a$w_buff0_used=1, a$w_buff1=0, a$w_buff1_used=0, a=0, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=0, x=1, y=1, z=0] [L801] 3 z = 1 VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=0, __unbuffered_p1_EAX=0, __unbuffered_p2_EAX=0, __unbuffered_p2_EBX=0, a$flush_delayed=0, a$mem_tmp=0, a$r_buff0_thd0=0, a$r_buff0_thd1=1, a$r_buff0_thd2=0, a$r_buff0_thd3=0, a$r_buff1_thd0=0, a$r_buff1_thd1=0, a$r_buff1_thd2=0, a$r_buff1_thd3=0, a$read_delayed=0, a$read_delayed_var={0:0}, a$w_buff0=1, a$w_buff0_used=1, a$w_buff1=0, a$w_buff1_used=0, a=0, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=0, x=1, y=1, z=1] [L804] 3 __unbuffered_p2_EAX = z VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=0, __unbuffered_p1_EAX=0, __unbuffered_p2_EAX=1, __unbuffered_p2_EBX=0, a$flush_delayed=0, a$mem_tmp=0, a$r_buff0_thd0=0, a$r_buff0_thd1=1, a$r_buff0_thd2=0, a$r_buff0_thd3=0, a$r_buff1_thd0=0, a$r_buff1_thd1=0, a$r_buff1_thd2=0, a$r_buff1_thd3=0, a$read_delayed=0, a$read_delayed_var={0:0}, a$w_buff0=1, a$w_buff0_used=1, a$w_buff1=0, a$w_buff1_used=0, a=0, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=0, x=1, y=1, z=1] [L807] 3 weak$$choice0 = __VERIFIER_nondet_bool() [L808] 3 weak$$choice2 = __VERIFIER_nondet_bool() [L809] 3 a$flush_delayed = weak$$choice2 [L810] 3 a$mem_tmp = a [L811] 3 a = !a$w_buff0_used || !a$r_buff0_thd3 && !a$w_buff1_used || !a$r_buff0_thd3 && !a$r_buff1_thd3 ? a : (a$w_buff0_used && a$r_buff0_thd3 ? a$w_buff0 : a$w_buff1) [L812] 3 a$w_buff0 = weak$$choice2 ? a$w_buff0 : (!a$w_buff0_used || !a$r_buff0_thd3 && !a$w_buff1_used || !a$r_buff0_thd3 && !a$r_buff1_thd3 ? a$w_buff0 : (a$w_buff0_used && a$r_buff0_thd3 ? a$w_buff0 : a$w_buff0)) [L813] 3 a$w_buff1 = weak$$choice2 ? a$w_buff1 : (!a$w_buff0_used || !a$r_buff0_thd3 && !a$w_buff1_used || !a$r_buff0_thd3 && !a$r_buff1_thd3 ? a$w_buff1 : (a$w_buff0_used && a$r_buff0_thd3 ? a$w_buff1 : a$w_buff1)) [L814] 3 a$w_buff0_used = weak$$choice2 ? a$w_buff0_used : (!a$w_buff0_used || !a$r_buff0_thd3 && !a$w_buff1_used || !a$r_buff0_thd3 && !a$r_buff1_thd3 ? a$w_buff0_used : (a$w_buff0_used && a$r_buff0_thd3 ? (_Bool)0 : a$w_buff0_used)) [L815] 3 a$w_buff1_used = weak$$choice2 ? a$w_buff1_used : (!a$w_buff0_used || !a$r_buff0_thd3 && !a$w_buff1_used || !a$r_buff0_thd3 && !a$r_buff1_thd3 ? a$w_buff1_used : (a$w_buff0_used && a$r_buff0_thd3 ? (_Bool)0 : (_Bool)0)) [L816] 3 a$r_buff0_thd3 = weak$$choice2 ? a$r_buff0_thd3 : (!a$w_buff0_used || !a$r_buff0_thd3 && !a$w_buff1_used || !a$r_buff0_thd3 && !a$r_buff1_thd3 ? a$r_buff0_thd3 : (a$w_buff0_used && a$r_buff0_thd3 ? (_Bool)0 : a$r_buff0_thd3)) [L817] 3 a$r_buff1_thd3 = weak$$choice2 ? a$r_buff1_thd3 : (!a$w_buff0_used || !a$r_buff0_thd3 && !a$w_buff1_used || !a$r_buff0_thd3 && !a$r_buff1_thd3 ? a$r_buff1_thd3 : (a$w_buff0_used && a$r_buff0_thd3 ? (_Bool)0 : (_Bool)0)) [L818] 3 __unbuffered_p2_EBX = a [L819] 3 a = a$flush_delayed ? a$mem_tmp : a [L820] 3 a$flush_delayed = (_Bool)0 VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=0, __unbuffered_p1_EAX=0, __unbuffered_p2_EAX=1, __unbuffered_p2_EBX=0, a$flush_delayed=0, a$mem_tmp=0, a$r_buff0_thd0=0, a$r_buff0_thd1=1, a$r_buff0_thd2=0, a$r_buff0_thd3=0, a$r_buff1_thd0=0, a$r_buff1_thd1=0, a$r_buff1_thd2=0, a$r_buff1_thd3=0, a$read_delayed=0, a$read_delayed_var={0:0}, a$w_buff0=1, a$w_buff0_used=1, a$w_buff1=0, a$w_buff1_used=0, a=0, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice2=0, x=1, y=1, z=1] [L784] 2 a = a$w_buff0_used && a$r_buff0_thd2 ? a$w_buff0 : (a$w_buff1_used && a$r_buff1_thd2 ? a$w_buff1 : a) [L785] 2 a$w_buff0_used = a$w_buff0_used && a$r_buff0_thd2 ? (_Bool)0 : a$w_buff0_used [L786] 2 a$w_buff1_used = a$w_buff0_used && a$r_buff0_thd2 || a$w_buff1_used && a$r_buff1_thd2 ? (_Bool)0 : a$w_buff1_used [L787] 2 a$r_buff0_thd2 = a$w_buff0_used && a$r_buff0_thd2 ? (_Bool)0 : a$r_buff0_thd2 [L788] 2 a$r_buff1_thd2 = a$w_buff0_used && a$r_buff0_thd2 || a$w_buff1_used && a$r_buff1_thd2 ? (_Bool)0 : a$r_buff1_thd2 VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=0, __unbuffered_p1_EAX=0, __unbuffered_p2_EAX=1, __unbuffered_p2_EBX=0, a$flush_delayed=0, a$mem_tmp=0, a$r_buff0_thd0=0, a$r_buff0_thd1=1, a$r_buff0_thd2=0, a$r_buff0_thd3=0, a$r_buff1_thd0=0, a$r_buff1_thd1=0, a$r_buff1_thd2=0, a$r_buff1_thd3=0, a$read_delayed=0, a$read_delayed_var={0:0}, a$w_buff0=1, a$w_buff0_used=1, a$w_buff1=0, a$w_buff1_used=0, a=0, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice2=0, x=1, y=1, z=1] [L764] 1 a = a$w_buff0_used && a$r_buff0_thd1 ? a$w_buff0 : (a$w_buff1_used && a$r_buff1_thd1 ? a$w_buff1 : a) [L765] 1 a$w_buff0_used = a$w_buff0_used && a$r_buff0_thd1 ? (_Bool)0 : a$w_buff0_used [L766] 1 a$w_buff1_used = a$w_buff0_used && a$r_buff0_thd1 || a$w_buff1_used && a$r_buff1_thd1 ? (_Bool)0 : a$w_buff1_used [L767] 1 a$r_buff0_thd1 = a$w_buff0_used && a$r_buff0_thd1 ? (_Bool)0 : a$r_buff0_thd1 [L768] 1 a$r_buff1_thd1 = a$w_buff0_used && a$r_buff0_thd1 || a$w_buff1_used && a$r_buff1_thd1 ? (_Bool)0 : a$r_buff1_thd1 VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=0, __unbuffered_p1_EAX=0, __unbuffered_p2_EAX=1, __unbuffered_p2_EBX=0, a$flush_delayed=0, a$mem_tmp=0, a$r_buff0_thd0=0, a$r_buff0_thd1=1, a$r_buff0_thd2=0, a$r_buff0_thd3=0, a$r_buff1_thd0=0, a$r_buff1_thd1=0, a$r_buff1_thd2=0, a$r_buff1_thd3=0, a$read_delayed=0, a$read_delayed_var={0:0}, a$w_buff0=1, a$w_buff0_used=0, a$w_buff1=0, a$w_buff1_used=0, a=1, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice2=0, x=1, y=1, z=1] [L823] 3 a = a$w_buff0_used && a$r_buff0_thd3 ? a$w_buff0 : (a$w_buff1_used && a$r_buff1_thd3 ? a$w_buff1 : a) [L824] 3 a$w_buff0_used = a$w_buff0_used && a$r_buff0_thd3 ? (_Bool)0 : a$w_buff0_used [L825] 3 a$w_buff1_used = a$w_buff0_used && a$r_buff0_thd3 || a$w_buff1_used && a$r_buff1_thd3 ? (_Bool)0 : a$w_buff1_used [L826] 3 a$r_buff0_thd3 = a$w_buff0_used && a$r_buff0_thd3 ? (_Bool)0 : a$r_buff0_thd3 [L827] 3 a$r_buff1_thd3 = a$w_buff0_used && a$r_buff0_thd3 || a$w_buff1_used && a$r_buff1_thd3 ? (_Bool)0 : a$r_buff1_thd3 VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=0, __unbuffered_p1_EAX=0, __unbuffered_p2_EAX=1, __unbuffered_p2_EBX=0, a$flush_delayed=0, a$mem_tmp=0, a$r_buff0_thd0=0, a$r_buff0_thd1=1, a$r_buff0_thd2=0, a$r_buff0_thd3=0, a$r_buff1_thd0=0, a$r_buff1_thd1=0, a$r_buff1_thd2=0, a$r_buff1_thd3=0, a$read_delayed=0, a$read_delayed_var={0:0}, a$w_buff0=1, a$w_buff0_used=0, a$w_buff1=0, a$w_buff1_used=0, a=1, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice2=0, x=1, y=1, z=1] [L771] 1 __unbuffered_cnt = __unbuffered_cnt + 1 VAL [__unbuffered_cnt=1, __unbuffered_p0_EAX=0, __unbuffered_p1_EAX=0, __unbuffered_p2_EAX=1, __unbuffered_p2_EBX=0, a$flush_delayed=0, a$mem_tmp=0, a$r_buff0_thd0=0, a$r_buff0_thd1=1, a$r_buff0_thd2=0, a$r_buff0_thd3=0, a$r_buff1_thd0=0, a$r_buff1_thd1=0, a$r_buff1_thd2=0, a$r_buff1_thd3=0, a$read_delayed=0, a$read_delayed_var={0:0}, a$w_buff0=1, a$w_buff0_used=0, a$w_buff1=0, a$w_buff1_used=0, a=1, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice2=0, x=1, y=1, z=1] [L791] 2 __unbuffered_cnt = __unbuffered_cnt + 1 VAL [__unbuffered_cnt=2, __unbuffered_p0_EAX=0, __unbuffered_p1_EAX=0, __unbuffered_p2_EAX=1, __unbuffered_p2_EBX=0, a$flush_delayed=0, a$mem_tmp=0, a$r_buff0_thd0=0, a$r_buff0_thd1=1, a$r_buff0_thd2=0, a$r_buff0_thd3=0, a$r_buff1_thd0=0, a$r_buff1_thd1=0, a$r_buff1_thd2=0, a$r_buff1_thd3=0, a$read_delayed=0, a$read_delayed_var={0:0}, a$w_buff0=1, a$w_buff0_used=0, a$w_buff1=0, a$w_buff1_used=0, a=1, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice2=0, x=1, y=1, z=1] [L830] 3 __unbuffered_cnt = __unbuffered_cnt + 1 VAL [__unbuffered_cnt=3, __unbuffered_p0_EAX=0, __unbuffered_p1_EAX=0, __unbuffered_p2_EAX=1, __unbuffered_p2_EBX=0, a$flush_delayed=0, a$mem_tmp=0, a$r_buff0_thd0=0, a$r_buff0_thd1=1, a$r_buff0_thd2=0, a$r_buff0_thd3=0, a$r_buff1_thd0=0, a$r_buff1_thd1=0, a$r_buff1_thd2=0, a$r_buff1_thd3=0, a$read_delayed=0, a$read_delayed_var={0:0}, a$w_buff0=1, a$w_buff0_used=0, a$w_buff1=0, a$w_buff1_used=0, a=1, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice2=0, x=1, y=1, z=1] [L852] 0 main$tmp_guard0 = __unbuffered_cnt == 3 VAL [__unbuffered_cnt=3, __unbuffered_p0_EAX=0, __unbuffered_p1_EAX=0, __unbuffered_p2_EAX=1, __unbuffered_p2_EBX=0, a$flush_delayed=0, a$mem_tmp=0, a$r_buff0_thd0=0, a$r_buff0_thd1=1, a$r_buff0_thd2=0, a$r_buff0_thd3=0, a$r_buff1_thd0=0, a$r_buff1_thd1=0, a$r_buff1_thd2=0, a$r_buff1_thd3=0, a$read_delayed=0, a$read_delayed_var={0:0}, a$w_buff0=1, a$w_buff0_used=0, a$w_buff1=0, a$w_buff1_used=0, a=1, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, main$tmp_guard0=1, main$tmp_guard1=0, t913={3:0}, t914={7:0}, t915={15:0}, weak$$choice2=0, x=1, y=1, z=1] [L854] CALL 0 assume_abort_if_not(main$tmp_guard0) [L3] COND FALSE 0 !(!cond) [L854] RET 0 assume_abort_if_not(main$tmp_guard0) [L856] 0 a = a$w_buff0_used && a$r_buff0_thd0 ? a$w_buff0 : (a$w_buff1_used && a$r_buff1_thd0 ? a$w_buff1 : a) [L857] 0 a$w_buff0_used = a$w_buff0_used && a$r_buff0_thd0 ? (_Bool)0 : a$w_buff0_used [L858] 0 a$w_buff1_used = a$w_buff0_used && a$r_buff0_thd0 || a$w_buff1_used && a$r_buff1_thd0 ? (_Bool)0 : a$w_buff1_used [L859] 0 a$r_buff0_thd0 = a$w_buff0_used && a$r_buff0_thd0 ? (_Bool)0 : a$r_buff0_thd0 [L860] 0 a$r_buff1_thd0 = a$w_buff0_used && a$r_buff0_thd0 || a$w_buff1_used && a$r_buff1_thd0 ? (_Bool)0 : a$r_buff1_thd0 VAL [__unbuffered_cnt=3, __unbuffered_p0_EAX=0, __unbuffered_p1_EAX=0, __unbuffered_p2_EAX=1, __unbuffered_p2_EBX=0, a$flush_delayed=0, a$mem_tmp=0, a$r_buff0_thd0=0, a$r_buff0_thd1=1, a$r_buff0_thd2=0, a$r_buff0_thd3=0, a$r_buff1_thd0=0, a$r_buff1_thd1=0, a$r_buff1_thd2=0, a$r_buff1_thd3=0, a$read_delayed=0, a$read_delayed_var={0:0}, a$w_buff0=1, a$w_buff0_used=0, a$w_buff1=0, a$w_buff1_used=0, a=1, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, main$tmp_guard0=1, main$tmp_guard1=0, t913={3:0}, t914={7:0}, t915={15:0}, weak$$choice2=0, x=1, y=1, z=1] [L863] 0 main$tmp_guard1 = !(__unbuffered_p0_EAX == 0 && __unbuffered_p1_EAX == 0 && __unbuffered_p2_EAX == 1 && __unbuffered_p2_EBX == 0) VAL [__unbuffered_cnt=3, __unbuffered_p0_EAX=0, __unbuffered_p1_EAX=0, __unbuffered_p2_EAX=1, __unbuffered_p2_EBX=0, a$flush_delayed=0, a$mem_tmp=0, a$r_buff0_thd0=0, a$r_buff0_thd1=1, a$r_buff0_thd2=0, a$r_buff0_thd3=0, a$r_buff1_thd0=0, a$r_buff1_thd1=0, a$r_buff1_thd2=0, a$r_buff1_thd3=0, a$read_delayed=0, a$read_delayed_var={0:0}, a$w_buff0=1, a$w_buff0_used=0, a$w_buff1=0, a$w_buff1_used=0, a=1, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, main$tmp_guard0=1, main$tmp_guard1=0, t913={3:0}, t914={7:0}, t915={15:0}, weak$$choice2=0, x=1, y=1, z=1] [L865] CALL 0 __VERIFIER_assert(main$tmp_guard1) [L18] COND TRUE 0 !expression [L18] CALL 0 reach_error() [L17] COND FALSE 0 !(0) VAL [__unbuffered_cnt=3, __unbuffered_p0_EAX=0, __unbuffered_p1_EAX=0, __unbuffered_p2_EAX=1, __unbuffered_p2_EBX=0, a$flush_delayed=0, a$mem_tmp=0, a$r_buff0_thd0=0, a$r_buff0_thd1=1, a$r_buff0_thd2=0, a$r_buff0_thd3=0, a$r_buff1_thd0=0, a$r_buff1_thd1=0, a$r_buff1_thd2=0, a$r_buff1_thd3=0, a$read_delayed=0, a$read_delayed_var={0:0}, a$w_buff0=1, a$w_buff0_used=0, a$w_buff1=0, a$w_buff1_used=0, a=1, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, main$tmp_guard0=1, main$tmp_guard1=0, weak$$choice2=0, x=1, y=1, z=1] [L17] 0 __assert_fail ("0", "mix035.oepc.c", 8, __extension__ __PRETTY_FUNCTION__) VAL [__unbuffered_cnt=3, __unbuffered_p0_EAX=0, __unbuffered_p1_EAX=0, __unbuffered_p2_EAX=1, __unbuffered_p2_EBX=0, a$flush_delayed=0, a$mem_tmp=0, a$r_buff0_thd0=0, a$r_buff0_thd1=1, a$r_buff0_thd2=0, a$r_buff0_thd3=0, a$r_buff1_thd0=0, a$r_buff1_thd1=0, a$r_buff1_thd2=0, a$r_buff1_thd3=0, a$read_delayed=0, a$read_delayed_var={0:0}, a$w_buff0=1, a$w_buff0_used=0, a$w_buff1=0, a$w_buff1_used=0, a=1, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, main$tmp_guard0=1, main$tmp_guard1=0, weak$$choice2=0, x=1, y=1, z=1] - UnprovableResult [Line: 17]: Unable to prove that all allocated memory was freed Unable to prove that all allocated memory was freed Reason: Not analyzed. - UnprovableResult [Line: -1]: Unable to prove that pointer dereference always succeeds Unable to prove that pointer dereference always succeeds Reason: Not analyzed. - UnprovableResult [Line: -1]: Unable to prove that pointer dereference always succeeds Unable to prove that pointer dereference always succeeds Reason: Not analyzed. - UnprovableResult [Line: -1]: Unable to prove that pointer dereference always succeeds Unable to prove that pointer dereference always succeeds Reason: Not analyzed. - UnprovableResult [Line: -1]: Unable to prove that pointer dereference always succeeds Unable to prove that pointer dereference always succeeds Reason: Not analyzed. - UnprovableResult [Line: -1]: Unable to prove that pointer dereference always succeeds Unable to prove that pointer dereference always succeeds Reason: Not analyzed. - UnprovableResult [Line: -1]: Unable to prove that pointer dereference always succeeds Unable to prove that pointer dereference always succeeds Reason: Not analyzed. - UnprovableResult [Line: 843]: Unable to prove that all allocated memory was freed Unable to prove that all allocated memory was freed Reason: Not analyzed. - UnprovableResult [Line: 848]: 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: 850]: 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: 846]: 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, 81 locations, 13 error locations. Started 1 CEGAR loops. EmptinessCheckTime: 0.0s, RemoveRedundantFlowTime: 0.0s, RemoveRedundantFlowUnfoldingTime: 0.0s, BackfoldingTime: 0.0s, BackfoldingUnfoldingTime: 0.0s, FlowIncreaseByBackfolding: 0, BasicCegarLoop: OverallTime: 12.0s, OverallIterations: 15, TraceHistogramMax: 1, PathProgramHistogramMax: 4, EmptinessCheckTime: 0.0s, AutomataDifference: 5.7s, DeadEndRemovalTime: 0.0s, HoareAnnotationTime: 0.0s, InitialAbstractionConstructionTime: 0.0s, HoareTripleCheckerStatistics: 0 mSolverCounterUnknown, 564 SdHoareTripleChecker+Valid, 2.0s IncrementalHoareTripleChecker+Time, 0 mSdLazyCounter, 472 mSDsluCounter, 106 SdHoareTripleChecker+Invalid, 1.6s Time, 0 mProtectedAction, 0 SdHoareTripleChecker+Unchecked, 57 IncrementalHoareTripleChecker+Unchecked, 65 mSDsCounter, 36 IncrementalHoareTripleChecker+Valid, 0 mProtectedPredicate, 1468 IncrementalHoareTripleChecker+Invalid, 1561 SdHoareTripleChecker+Unknown, 0 mSolverCounterNotChecked, 36 mSolverCounterUnsat, 41 mSDtfsCounter, 1468 mSolverCounterSat, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Unknown, PredicateUnifierStatistics: 0 DeclaredPredicates, 247 GetRequests, 196 SyntacticMatches, 0 SemanticMatches, 51 ConstructedPredicates, 1 IntricatePredicates, 0 DeprecatedPredicates, 18 ImplicationChecksByTransitivity, 0.4s Time, 0.0s BasicInterpolantAutomatonTime, BiggestAbstraction: size=457occurred in iteration=14, InterpolantAutomatonStates: 63, traceCheckStatistics: No data available, InterpolantConsolidationStatistics: No data available, PathInvariantsStatistics: No data available, 0/0 InterpolantCoveringCapability, TotalInterpolationStatistics: No data available, 0.0s DumpTime, AutomataMinimizationStatistics: No data available, HoareAnnotationStatistics: No data available, RefinementEngineStatistics: TRACE_CHECK: 0.2s SsaConstructionTime, 0.7s SatisfiabilityAnalysisTime, 1.4s InterpolantComputationTime, 279 NumberOfCodeBlocks, 279 NumberOfCodeBlocksAsserted, 16 NumberOfCheckSat, 230 ConstructedInterpolants, 1 QuantifiedInterpolants, 1786 SizeOfPredicates, 14 NumberOfNonLiveVariables, 1648 ConjunctsInSsa, 78 ConjunctsInUnsatCore, 14 InterpolantComputations, 14 PerfectInterpolantSequences, 0/0 InterpolantCoveringCapability, INVARIANT_SYNTHESIS: No data available, INTERPOLANT_CONSOLIDATION: No data available, ABSTRACT_INTERPRETATION: No data available, PDR: No data available, ACCELERATED_INTERPOLATION: No data available, SIFA: No data available, ReuseStatistics: No data available RESULT: Ultimate could not prove your program: unable to determine feasibility of some traces [2023-11-29 00:11:49,457 INFO L552 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_04b19fd4-4e56-40ba-9f43-51779049eebd/bin/uautomizer-verify-BQ2R08f2Ya/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